Search

Evaluates high-resolution algorithms for the direction of arrival estimation for a cellular mobile radio environment whose cluster size is varied. Signals and scattering scenarios; Computational aspects for the different signal processing detection and estimation; Cellular cluster grouping; Antenna array data model.

Describes a two-phase adaptive local-search algorithm for the channel-assignment problem for cellular radio networks. Graphical representations; Initial call list; Heuristic for escaping local minima; Deterministic-probabilistic neighbor generation; Minimum bandwidth obtained.

Details the development of a near-far resistant sliding window decorrelating algorithm that overcomes the near-far problem pertaining to the conventional linear correlation receiver for mobile radio networks. Terminology; Linear time invariant decorrelator; Performance in AWGN channel with strong interferer; Multiuser detection in fading and mobile radio channels.

Presents a distributed power-control algorithm based on the concept of using a small amount of control information among the base stations. System model; Control-data flow structure; Distributed power-control algorithm; Convergence properties of the cooperative algorithm.

Describes the design of handoff algorithms for cellular communication systems based on mobile signal-strength measurements. Information on handoff in cellular communication; Criteria for determining the efficacy of a handoff algorithm; Disadvantage of signal-strength hysteresis algorithms.

Proposes a algorithm called pointer forwarding for location tracking operations in a personal communication service (PCS) network. Objective of the proposed algorithm; Key observation behind forwarding; Information on the use on home-location register to determine visitor-location register; Detailed information on the proposed algorithm.

Provides information on the analysis of the performance of a soft-handed algorithm of the type that has been proposed in IS-95 for a code-division multiple-access (CDMA) system. Indepth look at the description of the soft-handoff algorithm; Conclusion reached on the analysis.

Investigates how the performance of a constant modulus algorithm (CMA) adaptive array is affected by mutual coupling and diffraction effects. Details on the mutual coupling and diffraction effects; Difference in the performance of the CMA adaptive array during mutual coupling and diffraction effects; Description of the CMA adaptive array.

Evaluates the Viterbi algorithm's performance for interleaved convolutional codes. What the Viterbi algorithm is; Details on a maximum-likelihood decoder; Information on the multitrellis Viterbi algorithm.

Presents information on a study which focused on an adaptive H-infinity filtering algorithm for a decision feedback equalizer (DFE) in a wireless personal communication system. Adaptive filtering algorithms for the DFE; Simulation results and discussion; Conclusions.

Proposes a cooperative signal reception and down-link beam forming algorithm for mobile communication systems employing phase-shift-keying (PSK) modulation. System model used; Problem of down-link beam forming; Optimal down-link beam to which the proposed algorithm should converge; Results of computer simulations on the performance of the algorithm.

Presents information on a study which analyzed a class of linear handpick algorithms for performance measures such as the average number of outages and handovers for a given trip of the mobile station. Algorithms based on the least squares (LS) estimate of path-loss parameters of the radio links; Performance measures derived; Conclusions and perspectives for further research.

Presents information on a study which proposed a distributed fixed-step power control algorithm with quantization and active link protection. Convergence properties of the algorithm; System-level performances; Numerical studies; Conclusion.

Proposes a version of the cooperative algorithm for transmitter power control in mobile cellular systems. Convergence under asynchronous operation; Numerical simulation studies on the algorithm; Evaluation of the algorithm's performance.

Proposes an algorithm for joint carrier phase and timing estimation with offset quadriphase modulation (OQPSK) signaling. Estimator for the unknown synchronization parameters; Methods used; Comparisons made with other methods; Results.

Studies the performance of the maximum packing channel assignment algorithm (MPA) in channelized cellular networks. Performance of the MPA; Methods used; Results.

Studies the performance of a reverse link code-division multiple access (CDMA) system with fast close-loop power control algorithms. System description; Power control algorithms; Results and conclusion.

Proposes a parametric finite impulse response (FIR) channel identification algorithm and application of the algorithm to a multichannel maximum likelihood sequential estimation (MLSE) equalizer. Description of the channel model; Performance analysis of the bit error rate of the multichannel MLSE equalizer; Discussion of the simulation results.

Presents information on a study which investigated the design and performance of soft-output adaptive equalization algorithms derived from trellis-based sub-optimal soft-output decoding algorithms for time-division multiple access cellular system. Methodology; System and channel model; Soft-output adaptive equalization techniques; Simulation results; Discussion; Conclusions.

Provides information on a study which proposed a three-stage algorithm of combining sequential heuristic methods into a parallel neural network for the channel assignment problem (CAP) in cellular mobile communication systems. Problem formulation of CAP; Neural-network assignment stage; Simulation and discussion.

Part I. Provides information on a study which proposed a map matching algorithm for train positioning system. Proposed algorithm concept; Map database and segment candidate selection; Dead-reckoning system; Conclusion.

Provides information on a study which proposed two phase models for the wide-band indoor radio propagation channel. Modeling of phase; Comparative evaluations; Simulation algorithms used.

Provides information on a study which applied dynamic reservation protocol on DECT systems for prioritized multirate mobile data services. Assignment algorithm used; Performance evaluation; Conclusion.

Proposes a median-rate speech coder, the controlled adaptive prediction delta modulation (CAPDM) coder which operates at 16 kb/s with good speech quality and low algorithm complexity. How the coder operates; Structure of a CAPDM coder; CAPDM performance evaluation in a noisy channel.

Proposes a blind algorithm for estimating the code timing of a desired user in an asynchronous direct-sequence code-division multiple-access (DS/CDMA) system over frequency-nonselective-fading channels. Demodulation of a DS/CDMA signal; Theoretical background; Projection degree measurement algorithm; Numerical results.

Proposes efficient interactive algorithms that improve the admission speed of power-controlled cellular/personal communication services (PCS) systems as well as curtail the network coordination cost. Types of errors the admission control has to tradeoff; Details on the power-controlled mobile systems; Information on the coordinated and distributed interactive call admission control (CICAC & DICAC).

Describes a study which presented a three-dimensional ray-tracing propagation algorithm for single floor scenarios that allows the rapid generation of complex channel impulse response characteristics. Basic theory for the propagation model; Measurement site and the representation of the area in the model; Investigation into the accuracy of the narrow-band predictions; Conclusion.

Presents an iterative multiuser decoding algorithm for co-channel BPSK/QPSK users in a multibeam system. Discussion of the multiuser detection model; Description of the return-link multibeam satellite and sectored antenna scenarios; Characterization of the algorithm for multiuser decoding.

Presents information on a study which proposed an adaptive fixed-step power control algorithm for mobile cellular systems. Basic goal of power control in mobile communication systems; Discussion of the proposed system model; Details on power control algorithm; Quantization of power level; Numerical results.

Presents information on a study which evaluated the performance of fully distributed power control algorithms for cellular mobile radio systems based on frequency-time division multiple access. Reference cellular scenario; Implementation of the handover and call set up algorithms; Conclusion.

Presents a multiagent algorithm for the frequency assignment problem in cellular radio networks. Analysis on the frequency assignment problem; Description of the ANTS model; Conclusion.

Compares several paging and location update algorithms for cellular systems. Description of existing paging strategies; Analysis on the paging and location update algorithm; Conclusion.

Describes a geometric control algorithm for quantifying automobile crash severity, distinguishing crash configurations, and activating air bags during collision. Formulation of the algorithm; Its implementation; Conclusion.

Presents a frequency offset estimation algorithm that uses an indicator of the channel status called the uncertainty factor in mobile radio. Description on the system and channel used; Analysis on the computer simulation and its results; Conclusions.

Discusses a study which considered a mobile radio random-access algorithm equipped with a choice of three distinct antenna diversity plans to improve performance. System model; Mobile radio window random-access algorithm; Maximum throughput and optimal window size; Simulation results.

Discusses a study which described an efficient ray-path search algorithm for radio propagation modeling. Visibility algorithm; Polar sweep algorithm; Extension of the visibility studies to the three-dimensional case; Implementation of a propagation prediction tool.

Presents information on a study which described a ray-tracing technique to predict the radio propagation channel parameters for the design of personal communication systems in indoor scenarios. Propagation model; Geometrical model; Use of the angular Z-buffer algorithm.

Provides an overview of the novel class of channel codes referred to as turbo codes, which have been shown to be capable of performing close to the Shannon Limit. Iterative decoder structure; Maximum A-posteriori algorithm; Iterative turbo decoding principles.

Proposes fuzzy classifier schemes in order to select the base stations that will best serve mobiles in a typical cellular system. Pattern-recognition algorithms; Background on fuzzy-set theory; Handoff algorithms.

Introduces some novel methods to recognize automobile license plates. Problems in license-plate recognition; Sensing system; Algorithm to recognize license plates.

Describes a mean squared error analysis of two classes of frequency acquisition and tracking algorithms. Frequency acquisition and tracking algorithms; Mean squared frequency error analysis; Numerical examples.

Focuses on a study which proposed a contention-free location update (LU) algorithm for distributing the LU load to a larger number of small cells. Other strategies for distributing the LU load; Description of a cellular system; Information on the hybrid bloom filter (HBF) algorithm; Performance of the HBF algorithm in the fixed backbone network; Discussion on findings.

Provides information on a study which presented an algorithm to estimate the residual range of an electric vehicle. Residual range estimation of a lead-acid battery of an electric vehicle; Details on the model used to estimate the residual charge of the vehicle battery; Description of a prototype device for on-line used to estimate the effectiveness of the proposed algorithms; Conclusion.

Provides information on a study which presented a data-reduction algorithm that can be applied to all data classes found in automotive multiplexing, including body- and engine-related data. List of data reduction algorithms for automotive multiplexing; Information on the SAE J1939 protocol; Details on the proposed data reduction algorithm; Conclusion.

Provides information on a study which presented an algorithm for detecting roads and obstacles in radar data taken from a millimeter-wage imaging platform mounted on a stationary automobile. Components of the algorithm; Information on the millimeter-wave imaging process; Experimental results; Conclusion and discussion.

Provides information on a study which presented an intuitive definition of stability for RYNSORD, a decentralized algorithm for railway networks. Formal definition of stability of RYNSORD; Brief overview of RYNSORD; Stability analysis of RYNSORD; Conclusion.

Focuses on a study which proposed a novel decisive algorithm based on signal-to-interference power estimation for controlling the power transmission of the mobiles in a code-division multiple-access mobile radio system under multipath environment. Details on power-control algorithms; Information on the simulation model; Results and discussion; Conclusion.

Investigates the problem of assigning channels or codes to the cells of a cellular radio network to avoid interference and minimize the number of channels used. Adaptation of the randomized saturation degree heuristic to the channel assignment problem (CAP); Components of a cellular network; How CAP is solved by local search algorithms.

Presents a comparative study of dynamic channel allocation algorithms, namely, distributed control and locally distributed control assisted dynamic channel allocation (DCA) arrangements for mobile communication systems. Description of the DCA algorithms; Simulation conditions; Comparison of the locally optimized least inference algorithm with the fixed channel allocation algorithm.

Discusses the minimization of the total power transmitted over given discrete sets of available power levels subject to maintaining an acceptable signal quality for each mobile in a wireless system. Integer programming generalization; Iterative algorithm for solving integer programming problem; Variations of the iterative algorithms involving the addition and deletion of constraints.