Topic
Time diversity
About: Time diversity is a research topic. Over the lifetime, 834 publications have been published within this topic receiving 17122 citations.
Papers published on a yearly basis
Papers
1 Jun 2002
TL;DR: This work shows that true beamforming gains can be achieved when there are sufficient users, even though very limited channel feedback is needed, and proposes the use of multiple transmit antennas to induce large and fast channel fluctuations so that multiuser diversity can still be exploited.
Abstract: Multiuser diversity is a form of diversity inherent in a wireless network, provided by independent time-varying channels across the different users. The diversity benefit is exploited by tracking the channel fluctuations of the users and scheduling transmissions to users when their instantaneous channel quality is near the peak. The diversity gain increases with the dynamic range of the fluctuations and is thus limited in environments with little scattering and/or slow fading. In such environments, we propose the use of multiple transmit antennas to induce large and fast channel fluctuations so that multiuser diversity can still be exploited. The scheme can be interpreted as opportunistic beamforming and we show that true beamforming gains can be achieved when there are sufficient users, even though very limited channel feedback is needed. Furthermore, in a cellular system, the scheme plays an additional role of opportunistic nulling of the interference created on users of adjacent cells. We discuss the design implications of implementing. this scheme in a complete wireless system.
3,103 citations
TL;DR: Trellis and lattice codes designed for additive white Gaussian noise channels can be superimposed on adaptive modulation for fading channels, with the same approximate coding gains, to obtain trellis-coded adaptive MQAM.
Abstract: We apply coset codes to adaptive modulation in fading channels. Adaptive modulation is a powerful technique to improve the energy efficiency and increase the data rate over a fading channel. Coset codes are a natural choice to use with adaptive modulation since the channel coding and modulation designs are separable. Therefore, trellis and lattice codes designed for additive white Gaussian noise (AWGN) channels can be superimposed on adaptive modulation for fading channels, with the same approximate coding gains. We first describe the methodology for combining coset codes with a general class of adaptive modulation techniques. We then apply this methodology to a spectrally efficient adaptive M-ary quadrature amplitude modulation (MQAM) to obtain trellis-coded adaptive MQAM. We present analytical and simulation results for this design which show an effective coding gain of 3 dB relative to uncoded adaptive MQAM for a simple four-state trellis code, and an effective 3.6-dB coding gain for an eight-state trellis code. More complex trellis codes are shown to achieve higher gains. We also compare the performance of trellis-coded adaptive MQAM to that of coded modulation with built-in time diversity and fixed-rate modulation. The adaptive method exhibits a power savings of up to 20 dB.
1,026 citations
TL;DR: Time-domain channel estimation and detection techniques are presented for multicarrier signals in a fast and frequency-selective Rayleigh fading channel and the theory of optimal low rank approximation is applied to a minimum mean squared error channel estimator and a theoretical calculation ofmean squared error is presented to confirm that the estimator is robust to changes in channel characteristics.
Abstract: Time-domain channel estimation and detection techniques are presented for multicarrier signals in a fast and frequency-selective Rayleigh fading channel. As a consequence of the time-varying channel, the orthogonality between subcarriers is destroyed in conventional frequency-domain approaches, resulting in interchannel interference, which increases an irreducible error floor in proportion to the normalized Doppler frequency. An important feature of the proposed technique is the ability to exploit the time-selective channel as a provider of time diversity. This enables us to achieve performance superior to any other structure without increasing bandwidth or incorporating redundancy, in order to reduce the complexity of the estimator, we apply the theory of optimal low rank approximation to a minimum mean squared error channel estimator and present a theoretical calculation of mean squared error and simulations to confirm that the estimator is robust to changes in channel characteristics.
611 citations
28 Nov 1994
TL;DR: It is shown that the DS-CDMA multi-carrier system over-performs the RAKE receiver when the system parameters are selected properly and the spread spectrum processing gain is increased, the effect of multipath interference is removed, and frequency/time diversity is achieved.
Abstract: A DS-CDMA multi-carrier system is proposed. The transmitted data bits are serial to parallel converted to a number of parallel branches. Each bit on each branch is DS-SS modulated and transmitted with a number of orthogonal and overlapping carriers. Given that sufficient interleaving is provided, this procedure provides many advantages. The system performance is compared to that of the conventional RAKE receiver. It is shown that the multi-carrier system over-performs the RAKE receiver when the system parameters are selected properly. The system utilizes a small number of carriers to solve the intersymbol interference (ISI). The data on each carrier is spread by a lower rate PN code. This reduces the effect of inter-chip interference (ICI). This technique is shown to provide the following advantages: the spread spectrum processing gain is increased, the effect of multipath interference is removed, and frequency/time diversity is achieved.
573 citations
TL;DR: A list Viterbi decoding algorithm (LVA) that produces a rank ordered list of the L globally best candidates after a trellis search and a serial LVA that iteratively produces the k/sup th/ best candidate based on knowledge of the previously found k-1 best paths is presented.
Abstract: A list Viterbi decoding algorithm (LVA) produces a rank ordered list of the L globally best candidates after a trellis search. The authors present two such algorithms, (i) a parallel LVA that simultaneously produces the L best candidates and (ii) a serial LVA that iteratively produces the k/sup th/ best candidate based on knowledge of the previously found k-1 best paths. The application of LVA to a concatenated communication system consisting of an inner convolutional code and an outer error detecting code is considered in detail. Analysis as well as simulation results show that significant improvement in error performance is obtained when the inner decoder, which is conventionally based on the Viterbi algorithm (VA), is replaced by the LVA. An improvement of up to 3 dB is obtained for the additive white Gaussian noise (AWGN) channel due to an increase in the minimum Euclidean distance. Ever larger gains are obtained for the Rayleigh fading channel due to an increase in the time diversity. It is also shown that a 10% improvement in throughput is obtained along with significantly reduced probability of a decoding failure for a hybrid FEC/ARQ scheme with the inner code being a rate compatible punctured convolutional (RCPC) code. >
445 citations
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2025 | 1 |
| 2024 | 5 |
| 2023 | 4 |
| 2022 | 6 |
| 2021 | 12 |
| 2020 | 17 |