Showing papers in "IEEE Journal on Selected Areas in Communications in 2001"
TL;DR: The results show that with a limited number of ARSs and some increase in the signaling overhead (as well as hardware complexity), the call blocking/dropping probability in a congested cell and the overall system can be reduced.
Abstract: Integrated cellular and ad hoc relaying systems (iCAR) is a new wireless system architecture based on the integration of cellular and modern ad hoc relaying technologies. It addresses the congestion problem due to unbalanced traffic in a cellular system and provides interoperability for heterogeneous networks. The iCAR system can efficiently balance traffic loads between cells by using ad hoc relaying stations (ARS) to relay traffic from one cell to another dynamically. This not only increases the system's capacity cost effectively, but also reduces the transmission power for mobile hosts and extends system coverage. We compare the performance of the iCAR system with conventional cellular systems in terms of the call blocking/dropping probability, throughput, and signaling overhead via analysis and simulation. Our results show that with a limited number of ARSs and some increase in the signaling overhead (as well as hardware complexity), the call blocking/dropping probability in a congested cell and the overall system can be reduced.
781 citations
TL;DR: It is demonstrated via simulation results that the opportunistic transmission scheduling scheme is robust to estimation errors and also works well for nonstationary scenarios, resulting in performance improvements of 20%-150% compared with a scheduling scheme that does not take into account channel conditions.
Abstract: We present an "opportunistic" transmission scheduling policy that exploits time-varying channel conditions and maximizes the system performance stochastically under a certain resource allocation constraint. We establish the optimality of the scheduling scheme and also that every user experiences a performance improvement over any nonopportunistic scheduling policy when users have independent performance values. We demonstrate via simulation results that the scheme is robust to estimation errors and also works well for nonstationary scenarios, resulting in performance improvements of 20%-150% compared with a scheduling scheme that does not take into account channel conditions. Last, we discuss an extension of our opportunistic scheduling scheme to improve "short-term" performance.
652 citations
TL;DR: This work proposes an approach where a thin layer between Internet protocol and standard TCP is implemented that corrects problems and maintains high end-to-end TCP throughput and implemented in FreeBSD.
Abstract: Transport connections set up in wireless ad hoc networks are plagued by problems such as high bit error rates, frequent route changes, and partitions. If we run the transmission control protocol (TCP) over such connections, the throughput of the connection is observed to be extremely poor because TCP treats lost or delayed acknowledgments as congestion. We present an approach where we implement a thin layer between Internet protocol and standard TCP that corrects these problems and maintains high end-to-end TCP throughput. We have implemented our protocol in FreeBSD, and we present results from extensive experimentation done in an ad hoc network. We show that our solution improves the TCP's throughput by a factor of 2-3.
554 citations
TL;DR: The technique, called space-time spreading (STS), improves the downlink performance by using a small number of antenna elements at the base and one or more antennas at the handset, in conjunction with a novel spreading scheme that is inspired by space- time codes.
Abstract: We present a transmit diversity technique for the downlink of (wideband) direct-sequence (DS) code division multiple access (CDMA) systems. The technique, called space-time spreading (STS), improves the downlink performance by using a small number of antenna elements at the base and one or more antennas at the handset, in conjunction with a novel spreading scheme that is inspired by space-time codes. It spreads each signal in a balanced way over the transmitter antenna elements to provide maximal path diversity at the receiver. In doing so, no extra spreading codes, transmit power or channel information are required at the transmitter and only minimal extra hardware complexity at both sides of the link. Both our analysis and simulation results show significant performance gains over conventional single-antenna systems and other open-loop transmit diversity techniques. Our approach is a practical way to increase the bit rate and/or improve the quality and range in the downlink of either mobile or fixed CDMA systems. A STS-based proposal for the case of two transmitter and single-receiver antennas has been accepted and will be included as an optional diversity mode in release A of the IS-2000 wideband CDMA standard.
446 citations
TL;DR: The results show that the distributed power control based on maximizing the net utility (utility minus the price) results in improving the Pareto efficiency of the resulting operating point.
Abstract: We consider distributed power control in a multicell wireless data system and study the effect of pricing transmit power. Drawing on the earlier work of Goodman and Mandayam (see IEEE Personal Commun. Mag., vol.7, p.48-54, 2000), we formulate the QoS of a data user via a utility function measured in bits per Joule. We consider distributed power control, modeled as a noncooperative game, where users maximize their utilities in a multicell system. Base station assignment based on received signal strength as well as received signal-to-interference ratio (SIR) are considered jointly with power control. Our results indicate that for both assignment schemes, such a procedure results in an inefficient operating point (Nash equilibrium) for the entire system. We introduce pricing of transmit power as a mechanism for influencing data user behavior and our results show that the distributed power control based on maximizing the net utility (utility minus the price) results in improving the Pareto efficiency of the resulting operating point. Variations of pricing based on global and local loading in cells are considered as a means of improving the efficiency of wireless data networks. Finally, we discuss the improvement in utilities through a centralized scheme where each base station (BS) calculates the best SIR to be targeted by the terminals it is assigned.
412 citations
TL;DR: This work proposes the design criteria that utilize a large Hamming distance inherited in a low-rate code and a new labeling technique designed specifically for fading channels that results in a large coding gain over noniterative coded modulation and performance close to that of "turbo" coded modulation with less complexity.
Abstract: We consider bit-interleaved coded modulation with iterative decoding (BICM-ID) for bandwidth-efficient transmission over Rayleigh fading channels. We propose the design criteria that utilize a large Hamming distance inherited in a low-rate code and a new labeling technique designed specifically for fading channels. This results in a large coding gain over noniterative coded modulation and performance close to that of "turbo" coded modulation with less complexity. We also show that BICM-ID designed for fading channels usually has a very good performance over the additive white Gaussian noise (AWGN) channel while the converse is difficult to achieve. When combined with signal space diversity, diversity order can be improved to twice the diversity order of conventional BICM-ID; therefore, the code complexity can further be reduced while maintaining the same level of performance. Specifically, with the bandwidth efficiency of 2 bits/s/Hz over Rayleigh fading channels, a bit error rate (BER) of 10/sup -6/ can be achieved with 16-QAM, a four-state rate 1/2 code at E/sub b//N/sub 0/ of about seven dB. We also derive performance bounds for BICM-ID with and without signal space diversity over Rayleigh fading channels, which can be easily extended for other types of fading channels.
406 citations
TL;DR: Simulated performance of the optimized irregular LDPC codes and turbo codes on a land mobile channel and the results indicate that at a block size of 3072, irregularLDPC codes can outperform turbo codes over a wide range of mobile speeds.
Abstract: A numerical method has been presented to determine the noise thresholds of low density parity-check (LDPC) codes that employ the message passing decoding algorithm on the additive white Gaussian noise (AWGN) channel. In this paper, we apply the technique to the uncorrelated flat Rayleigh fading channel. Using a nonlinear code optimization technique, we optimize irregular LDPC codes for such a channel. The thresholds of the optimized irregular LDPC codes are very close to the Shannon limit for this channel. For example, at rate one-half, the optimized irregular LDPC code has a threshold only 0.07 dB away from the capacity of the channel. Furthermore, we compare simulated performance of the optimized irregular LDPC codes and turbo codes on a land mobile channel, and the results indicate that at a block size of 3072, irregular LDPC codes can outperform turbo codes over a wide range of mobile speeds.
379 citations
TL;DR: It is demonstrated through simulation that when these distributed victual algorithms are applied to the admission control of the radio channel then a globally stable state can be maintained without the need for complex centralized radio resource management.
Abstract: This paper investigates differentiated services in wireless packet networks using a fully distributed approach that supports service differentiation, radio monitoring, and admission control. While our proposal is generally applicable to distributed wireless access schemes, we design, implement, and evaluate our framework within the context of existing wireless technology. Service differentiation is based on the IEEE 802.11 distributed coordination function (DCF) originally designed to support best-effort data services. We analyze the delay experienced by a mobile host implementing the IEEE 802.11 DCF and derive a closed-form formula. We then extend the DCF to provide service differentiation for delay-sensitive and best-effort traffic based on the results from the analysis. Two distributed estimation algorithms are proposed. These algorithms are evaluated using simulation, analysis, and experimentation. A virtual MAC (VMAC) algorithm passively monitors the radio channel and estimates locally achievable service levels. The VMAC estimates key MAC level statistics related to service quality such as delay, delay variation, packet collision, and packet loss. We show the efficiency of the VMAC algorithm through simulation and consider significantly overlapping cells and highly bursty traffic mixes. In addition, we implement and evaluate the VMAC in an experimental differentiated services wireless testbed. A virtual source (VS) algorithm utilizes the VMAC to estimate application-level service quality. The VS allows application parameters to be tuned in response to dynamic channel conditions based on "virtual delay curves." We demonstrate through simulation that when these distributed victual algorithms are applied to the admission control of the radio channel then a globally stable state can be maintained without the need for complex centralized radio resource management.
369 citations
TL;DR: This paper deals with a receiver scheme where adaptive equalization and channel decoding are jointly optimized in an iterative process and results over a time-varying frequency-selective channel proves the excellent behavior of the turbo equalizer.
Abstract: This paper deals with a receiver scheme where adaptive equalization and channel decoding are jointly optimized in an iterative process. This receiver scheme is well suited for transmissions over a frequency-selective channel with large delay spread and for high spectral efficiency modulations. A low-complexity soft-input soft-output M-ary channel decoder is proposed. Turbo equalization allows intersymbol interference to be reduced drastically. For most time-invariant discrete channels, the turbo-equalizer performance is close to the coded Gaussian channel performance, even for low signal-to-noise ratios. Finally, results over a time-varying frequency-selective channel proves the excellent behavior of the turbo equalizer.
326 citations
TL;DR: In this paper, the authors track the density of extrinsic information in iterative turbo decoders by actual density evolution, and also approximate it by symmetric Gaussian density functions.
Abstract: We track the density of extrinsic information in iterative turbo decoders by actual density evolution, and also approximate it by symmetric Gaussian density functions. The approximate model is verified by experimental measurements. We view the evolution of these density functions through an iterative decoder as a nonlinear dynamical system with feedback. Iterative decoding of turbo codes and of serially concatenated codes is analyzed by examining whether a signal-to-noise ratio (SNR) for the extrinsic information keeps growing with iterations. We define a "noise figure" for the iterative decoder, such that the turbo decoder will converge to the correct codeword if the noise figure is bounded by a number below zero dB. By decomposing the code's noise figure into individual curves of output SNR versus input SNR corresponding to the individual constituent codes, we gain many new insights into the performance of the iterative decoder for different constituents. Many mysteries of turbo codes are explained based on this analysis. For example, we show why certain codes converge better with iterative decoding than more powerful codes which are only suitable for maximum likelihood decoding. The roles of systematic bits and of recursive convolutional codes as constituents of turbo codes are crystallized. The analysis is generalized to serial concatenations of mixtures of complementary outer and inner constituent codes. Design examples are given to optimize mixture codes to achieve low iterative decoding thresholds on the signal-to-noise ratio of the channel.
322 citations
TL;DR: A method for coherently detecting and decoding turbo-coded binary phase shift keying signals transmitted over frequency-flat fading channels is discussed and results show the influence of pilot symbol spacing, estimation filter size and type, and fade rate.
Abstract: A method for coherently detecting and decoding turbo-coded binary phase shift keying (BPSK) signals transmitted over frequency-flat fading channels is discussed. Estimates of the complex channel gain and variance of the additive noise are derived first from known pilot symbols and an estimation filter. After each iteration of turbo decoding, the channel estimates are refined using information fed back from the decoder. Both hard-decision and soft-decision feedback are considered and compared with three baseline turbo-coded systems: (1) a BPSK system that has perfect channel estimates; (2) a system that uses differential phase shift keying and hence needs no estimates; and (3) a system that performs channel estimation using pilot symbols but has no feedback path from decoder to estimator. Performance can be further improved by borrowing channel estimates from the previously decoded frame. Simulation results show the influence of pilot symbol spacing, estimation filter size and type, and fade rate. Performance within 0.49 and 1.16 dB of turbo-coded BPSK with perfect coherent detection is observed at a bit-error rate of 10/sup -4/ for normalized fade rates of f/sub d/T/sub s/=0.005 and f/sub d/T/sub s/=0.02, respectively.
TL;DR: An effective way of applying turbo-coded modulation as an alternative to the current space- time codes with appropriate interleaving is described and significant performance gains over the appropriately interleaved space-time trellis codes are observed.
Abstract: We study the use of turbo-coded modulation for wireless communication systems with multiple transmit and receive antennas over block Rayleigh fading channels. We describe an effective way of applying turbo-coded modulation as an alternative to the current space-time codes with appropriate interleaving. We study the performance with the standard iterative turbo decoding algorithm, as well as the iterative demodulation-decoding algorithm. In addition to the introduction of the turbo-coded modulation scheme, we consider a variety of practical issues including the case of large number of antennas, the effects of estimated channel state information, and correlation among subchannels between different transmit-receive antenna pairs. We present examples to illustrate the performance of the turbo-coded modulation scheme and observe significant performance gains over the appropriately interleaved space-time trellis codes.
TL;DR: Identifiability issues involving high-resolution techniques that have been proposed for blind CFO estimation based on null subcarriers are investigated and new approaches that do not suffer from the lack of identifiability and adopt adaptive algorithms that are computationally feasible are proposed.
Abstract: The ability of orthogonal frequency-division multiplexing systems to mitigate frequency-selective channels is impaired by the presence of carrier frequency offsets (CFOs). In this paper, we investigate identifiability issues involving high-resolution techniques that have been proposed for blind CFO estimation based on null subcarriers. We propose new approaches that do not suffer from the lack of identifiability and adopt adaptive algorithms that are computationally feasible. The performance of these techniques in relation to the location of the null subcarriers is also investigated via computer simulations and compared with the modified Cramer-Rao bound.
TL;DR: A detailed electrochemical battery model and a simple stochastic model that captures the fundamental behavior of the battery are presented and results indicate that the proposed battery management techniques improve system performance no matter which parameters values are chosen to characterize the cells' behavior.
Abstract: A challenging aspect of mobile communications consists in exploring ways in which the available run time of terminals can be maximized. We present a detailed electrochemical battery model and a simple stochastic model that captures the fundamental behavior of the battery. The stochastic model is then matched to the electrochemical model and used to investigate battery management techniques that may improve the energy efficiency of radio communication devices. We consider an array of electrochemical cells. Through simple scheduling algorithms, the discharge from each cell is properly shaped to optimize the charge recovery mechanism, without introducing any additional delay in supplying the required power. Then, a battery management scheme, which exploits knowledge of the cells' state of charge, is implemented to achieve a further improvement in the battery performance. In this case, the discharge demand may be delayed. Results indicate that the proposed battery management techniques improve system performance no matter which parameters values are chosen to characterize the cells' behavior.
TL;DR: It is shown that when medium noise dominates, a reasonably low complexity detector that incorporates pattern-dependent noise prediction achieves a significant signal-to-noise ratio gain relative to the extended class 4 partial response maximum likelihood detector.
Abstract: Maximum and near-maximum likelihood sequence detectors in signal-dependent noise are discussed. It is shown that the linear prediction viewpoint allows a very simple derivation of the branch metric expression that has previously been shown as optimum for signal-dependent Markov noise. The resulting detector architecture is viewed as a noise predictive maximum likelihood detector that operates on an expanded trellis and relies on computation of branch-specific, pattern-dependent noise predictor taps and predictor error variances. Comparison is made on the performance of various low-complexity structures using the positional-jitter/width-variation model for transition noise. It is shown that when medium noise dominates, a reasonably low complexity detector that incorporates pattern-dependent noise prediction achieves a significant signal-to-noise ratio gain relative to the extended class 4 partial response maximum likelihood detector. Soft-output detectors as well as the use of soft decision feedback are discussed in the context of signal-dependent noise.
TL;DR: A multiple access scheme for the broadcast of control messages is designed, and a new access-based clustering protocol (ABCP) whose cluster formation is heavily influenced by the outcome of the multiple access is proposed, providing a generic, flexible, rapidly deployed and stable cluster architecture for the upper layer protocols.
Abstract: The ad hoc network is a temporary wireless system without a fixed (wired or wireless) infrastructure. Many clustering algorithms have been proposed to partition mobile users into clusters to support routing and network management. Most previous studies, however, focus on algorithm design, lacking an overall evaluation of clustering overheads. We design a multiple access scheme for the broadcast of control messages, and propose a new access-based clustering protocol (ABCP) whose cluster formation is heavily influenced by the outcome of the multiple access. By taking into account many delicate aspects in the clustering process, the ABCP provides a generic, flexible, rapidly deployed and stable cluster architecture for the upper layer protocols. Simulation is used to compare ABCP with the other clustering strategy in terms of cluster stability and overheads. Since ABCP makes clustering decision directly based on the result of channel access, it requires fewer control overheads and has shorter convergence time than the other clustering criteria. We also demonstrate that the resulting cluster structure by ABCP behaves stable in face of topology changes.
TL;DR: The conclusion is reached that the proposed synchronization techniques result in virtually unimpaired BERs over the range of wideband channels investigated in comparison to a perfectly synchronized system.
Abstract: The effect of time-domain and frequency-domain synchronization errors is quantified in the context of various coherently and noncoherently detected 1, 2, and 4 bits/symbol OFDM constellations, in order to demonstrate the wide applicability of the techniques proposed for mitigating the bit error rate (BER) performance degradations inflicted. A reference symbol is proposed and a range of correlation techniques are suggested for coarse and fine synchronization. Their performance is studied over time-dispersive Rayleigh fading channels, with the conclusion that the proposed synchronization techniques result in virtually unimpaired BERs over the range of wideband channels investigated in comparison to a perfectly synchronized system.
TL;DR: A numerical example is given that shows that impulse radio modulation is theoretically able to provide multiple-access communications with a combined transmission capacity of hundreds of megabits per second at bit error rates in the range 10/sup -4/ to 10/Sup -7/ using receivers of moderate complexity.
Abstract: Wireless spread spectrum multiple access (SSMA) using time hopping and block waveform encoded (M-ary) pulse position modulated (PPM) signals is analyzed. For different M-ary PPM signal designs, the multiple-access performance in free-space propagation renditions is analyzed in terms of the number of users supported by the system for a given bit error rate, signal-to-noise ratio, bit transmission rate, and number of signals in the M-ary set. The processing gain and number of simultaneous users are described in terms of system parameters. Tradeoffs between performance and receiver complexity are discussed. Upper bounds on both the maximum number of users and the total combined bit transmission rate are investigated. This analysis is applied to ultrawideband impulse radio modulation. In this modulation, the communications waveforms are practically realized using subnanosecond impulse technology. A numerical example is given that shows that impulse radio modulation is theoretically able to provide multiple-access communications with a combined transmission capacity of hundreds of megabits per second at bit error rates in the range 10/sup -4/ to 10/sup -7/ using receivers of moderate complexity.
TL;DR: A new algorithm is presented for computing the free distance d/sub free/ of parallel and serially concatenated codes with interleavers, the parameter that dominates the code performance at very high signal-to-noise ratios (SNRs).
Abstract: We present a new algorithm for computing the free distance d/sub free/ of parallel and serially concatenated codes with interleavers, the parameter that dominates the code performance at very high signal-to-noise ratios (SNRs). The knowledge of d/sub free/ allows one to analytically estimate the error floor, which may prevent the use of concatenated codes in applications requiring very low error rates. The algorithm is based on the new notion of constrained subcodes, and permits the computation of large distances for large interleavers without a constraint on the input sequence weight (e.g., up to d/sub free/=40 for a rate-1/3 turbo code with interleaver length N=3568). Applications to practical cases of relevant interest, i.e., (1) the new Consultative Committee for Space Data Systems (CCSDS) standard for deep-space telemetry and (2) the new UMTS/3GPP standard for third-generation personal communications, are presented for the first time. Other related aspects, like a study on the free distance distribution of turbo codes with small/medium interleaver length, and a comparison between parallel and serial concatenation behavior, are also discussed.
TL;DR: The analysis shows that the error of channel estimation significantly degrades system performance and can be effectively suppressed by low pass filters (LPFs), which illustrates that the complex spread signal has a more stable envelope than the dual-channel spread signal.
Abstract: The coherent RAKE reception of wideband code division multiple access (W-CDMA) signals with complex spreading is considered. A general multipath-fading channel model is assumed. A dedicated pilot channel, which is separate from the data channels, is used for the purpose of channel estimation. Based on a digital implementation, the coherent demodulation scheme is presented. Pilot channel estimation error, due to multiple access and multipath interference, is studied. The system performance is evaluated by means of the bit error rate (BER). The analysis shows that the error of channel estimation significantly degrades system performance and can be effectively suppressed by low pass filters (LPFs). A discussion on the envelope variation of complex spread signals is also included, which illustrates that the complex spread signal has a more stable envelope than the dual-channel spread signal. The power ratio of pilot to data channels should be chosen in the range of 0.2 to 0.4 (or -7 to -4 dB), in order to achieve maximum system capacity.
TL;DR: A low-complexity receiver scheme for joint multiuser decoding and parameter estimation of code division multiple access signals and outperforms conventional schemes with similar complexity is derived.
Abstract: We derive a low-complexity receiver scheme for joint multiuser decoding and parameter estimation of code division multiple access signals. The resulting receiver processes the users serially and iteratively and makes use of soft-in soft-out single-user decoders, of soft interference cancellation and of expectation-maximization parameter estimation as the main building blocks. Computer simulations show that the proposed receiver achieves near single-user performance at very high channel load (number of users per chip) and outperforms conventional schemes with similar complexity.
TL;DR: In this article, a generalized space-time coded multicarrier transceiver for wireless propagation over frequency-selective multipath channels was proposed, and the Cramer-Rao bound of the channel estimates was derived.
Abstract: Transmit antenna diversity has been exploited to develop high-performance space-time coders and simple maximum-likelihood decoders for transmissions over flat fading channels. Relying on block precoding, this paper develops generalized space-time coded multicarrier transceivers appropriate for wireless propagation over frequency-selective multipath channels. Multicarrier precoding maps the frequency-selective channel into a set of flat fading subchannels, whereas space-time encoding/decoding facilitates equalization and achieves performance gains by exploiting the diversity available with multiple transmit antennas. When channel state information is unknown at the receiver, it is acquired blindly based on a deterministic variant of the constant-modulus algorithm that exploits the structure of space-time block codes. To benchmark performance, the Cramer-Rao bound of the channel estimates is also derived. System performance is evaluated both analytically and with simulations.
TL;DR: Algorithms are described for packet detection and for synchronization using maximum likelihood estimation of channel frequency offset, phase offset for coherent detection, and subsample timing offset.
Abstract: The design of a pilot symbol for orthogonal frequency-division multiplexing packet detection and synchronization is presented. Algorithms are described for packet detection and for synchronization using maximum likelihood estimation of channel frequency offset, phase offset for coherent detection, and subsample timing offset. The efficacy of the detection and synchronization algorithms is demonstrated experimentally.
TL;DR: A new interleaver design for turbo codes with short block length based on the distance spectrum of the code and the correlation between the information input data and the soft output of each decoder corresponding to its parity bits is described.
Abstract: The performance of a turbo code with short block length depends critically on the interleaver design. There are two major criteria in the design of an interleaver: the distance spectrum of the code and the correlation between the information input data and the soft output of each decoder corresponding to its parity bits. This paper describes a new interleaver design for turbo codes with short block length based on these two criteria. A deterministic interleaver suitable for turbo codes is also described. Simulation results compare the new interleaver design to different existing interleavers.
TL;DR: A stopping criterion which reduces the average number of iterations at the expense of very little performance degradation is proposed for this combined decoding approach to bridge the error performance gap between belief propagation decoding which remains suboptimum, and maximum likelihood decoding which is too complex to be implemented for the codes considered.
Abstract: In this paper, reliability based decoding is combined with belief propagation (BP) decoding for low-density parity check (LDPC) codes. At each iteration, the soft output values delivered by the BP algorithm are used as reliability values to perform reduced complexity soft decision decoding of the code considered. This approach allows to bridge the error performance gap between belief propagation decoding which remains suboptimum, and maximum likelihood decoding which is too complex to be implemented for the codes considered. Trade-offs between decoding complexity and error performance are also investigated. In particular, a stopping criterion which reduces the average number of iterations at the expense of very little performance degradation is proposed for this combined decoding approach. Simulation results for several Gallager (1963, 1968) LDPC codes and different set cyclic codes of hundreds of information bits are given and elaborated.
TL;DR: This paper presents and compares several techniques that reduce the computational complexity of the joint-detection task even further by exploiting this block-Sylvester structure and by incorporating different approximations.
Abstract: Third-generation mobile radio systems use time division-code division multiple access (TD-CDMA) in their time division duplex (TDD) mode. Due to the time division multiple access (TDMA) component of TD-CDMA, joint (or multi-user) detection techniques can be implemented with a reasonable complexity. Therefore, joint-detection will already be implemented in the first phase of the system deployment to eliminate the intracell interference. In a TD-CDMA mobile radio system, joint-detection is performed by solving a least squares problem, where the system matrix has a block-Sylvester structure. We present and compare several techniques that reduce the computational complexity of the joint-detection task even further by exploiting this block-Sylvester structure and by incorporating different approximations. These techniques are based on the Cholesky factorization, the Levinson algorithm, the Schur algorithm, and on Fourier techniques, respectively. The focus of this paper is on Fourier techniques since they have the smallest computational complexity and achieve the same performance as the joint-detection algorithm that does not use any approximations. Similar to the well-known implementation of fast convolutions, the resulting Fourier-based joint-detection scheme also uses a sequence of fast Fourier transforms (FFTs) and overlapping. It is well suited for the implementation on parallel hardware architectures.
TL;DR: A predictive and adaptive scheme to support timed-QoS guarantees in pico- and micro-cellular environments to achieve efficient network resource utilization and avoid severe network congestion is presented.
Abstract: With the proliferation of wireless network technologies, mobile users are expected to demand the same quality of service (QoS) available to fixed users. This paper presents a predictive and adaptive scheme to support timed-QoS guarantees in pico- and micro-cellular environments. The proposed scheme integrates the mobility model into the service model to achieve efficient network resource utilization and avoid severe network congestion. The mobility model uses a probabilistic approach to determine the most likely cluster to be visited by the mobile unit. The admission control is invoked when a new call arrives or an existing call performs a handoff to verify the feasibility of supporting the call. The performance of the proposed schemes is compared to the shadow cluster scheme. The performance of the proposed scheme under different traffic patterns is also presented.
TL;DR: A detection strategy based on a semidefinite relaxation of the CDMA maximum-likelihood (ML) problem is investigated and it is demonstrated that this approach provides a good approximation to the ML performance.
Abstract: A detection strategy based on a semidefinite relaxation of the CDMA maximum-likelihood (ML) problem is investigated. Cutting planes are introduced to strengthen the approximation. The semidefinite program arising from the relaxation can be solved efficiently using interior point methods. These interior point methods have polynomial computational complexity in the number of users. The simulated bit error rate performance demonstrates that this approach provides a good approximation to the ML performance.
TL;DR: A novel technique is proposed for estimating DCCM using uplink channel responses only, which does not need direction-of-arrival (DOA) estimation and its association and it is shown that this new beamforming technique can provide larger system capacity than traditional DOA-based approaches.
Abstract: The downlink channel covariance matrix (DCCM) is of vital importance in determining downlink beamforming weights for base station (BS) antenna array systems. For the frequency-division-duplex (FDD) mode, DCCM is difficult to obtain due to a lack of direct measurement of downlink channel responses. In this paper, a novel technique is proposed for estimating DCCM using uplink channel responses only, which does not need direction-of-arrival (DOA) estimation and its association. The downlink beamforming scheme is then proposed for wireless DS-CDMA systems, using the obtained DCCM information together with the so-called virtual uplink beamforming and power control technique. Computer simulations show that using the BS antenna array together with this new beamforming technique can provide larger system capacity than traditional DOA-based approaches, which just direct the main beam toward the desired user.
TL;DR: It is shown that linear minimum mean square error channel estimation directly follows from the derivation and links average mutual information to the channel dynamics.
Abstract: The achievable rate of a coherent coded modulation digital communication system with data-aided channel estimation and a discrete equiprobable symbol alphabet is derived under the assumption that the system operates on a flat fading multiple-input/multiple-output channel and uses a perfect interleaver to combat the bursty nature of the channel. It is shown that linear minimum mean square error channel estimation directly follows from the derivation and links average mutual information to the channel dynamics. Based on the assumption that known training symbols are transmitted, the achievable rate of the system is optimized with respect to the amount of training information needed.