Proceedings Article10.1109/VETECS.2009.5073623
Iterative Decision Feedback Equalization and Decoding for Rotated Multidimensional Constellations in Block Fading Channels
Gokhan M. Guvensen,A. Ozgur Yilmaz +1 more
- 26 Apr 2009
- pp 1-6
TL;DR: A reduced-complexity iterative receiver structure operating on a block basis for coded modulation schemes with rotated constellations that achieves full diversity and performance close to outage probability for rotated inputs even with simple Discrete Fourier Transform (DFT) rotations.
read more
Abstract: It is known that rotated multidimensional constellations can be used effectively to achieve full-rate and full-diversity transmission in block fading channels. However, optimal decoding complexity is exponential with the number of fading blocks (or degrees of freedom). In this paper, we propose a reduced-complexity iterative receiver structure operating on a block basis for coded modulation schemes with rotated constellations. The proposed detector is based on iterative forward and backward filtering followed by a channel decoder that uses a priori log- likelihood ratios (LLR) of coded symbols. Forward and feedback filters are jointly optimized according to the minimum mean square error (MMSE) criterion to minimize the spatial interference induced by rotation. It is observed that the proposed structure achieves full diversity and performance close to outage probability for rotated inputs even with simple Discrete Fourier Transform (DFT) rotations.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Bandwidth-efficient Cooperative Diversity with Rotated Constellations and Its Performance Analysis
Abstract: Cooperative diversity is a technique with which a virtual multiple antenna array is established among the single antenna users of the wireless network to realize space diversity. Signal space diversity (SSD) is a bandwidth-efficient diversity technique, which uses constellation rotation and interleaving techniques to achieve diversity gain. A new cooperative diversity scheme with rotated constellations (RCCD) is proposed in this paper. In this scheme, data are modulated by using a rotated constellation, and the source and the relays transmit different components of the modulated symbols. Since any one of the components contains full information of the symbols, the destination can obtain multiple signals conveying the same information from different users. In this way, space diversity is achieved. The RCCD scheme inherits the advantage of SSD – being bandwidth-efficient but without the delay problem of SSD brought by interleaving. The symbol error rate of the RCCD scheme is analyzed and simulated. The analysis and simulation results show that the RCCD scheme can achieve full diversity order of two when the inter-user channel is good enough, and, with the same bandwidth efficiency, has a better performance than amplify-and-forward and detect-and-forward methods.
3
Design and Software Validation of Coded Communication Schemes using Multidimensional Signal Sets without Constellation Expansion Penalty in Band-Limited Gaussian and Fading Channels
Milton I. Quinteros
- 01 Jan 2014
TL;DR: A multidimensional signal set construction paradigm that completely eliminates the constellation expansion penalty is used in standard AWGN band-limited channels and in fading channels to approach the ultimate capacity limit predicted by Shannon’s theory.
Iterative frequency domain equalization for single-carrier wideband MIMO channels
Gokhan M. Giivensen,A. Ozgiir Yilmaz +1 more
- 01 Sep 2009
TL;DR: It has been observed that the proposed structure exploits the multi-path diversity sources of the channel effectively and a performance very close to MIMO-OFDM outage probability can be achieved, so the proposed iterative SC-FDE technique can be viewed as a strong alternative to M IMO- OFDM schemes with similar complexity.
Detecção de Baixa Complexidade para Constelações Multidimensionais com Diversidade Completa Baseadas na Abordagem Combinatorial
Juliana Camilo Inacio,Bruno Fontana da Silva,Bartolomeu F. Uchoa-Filho,Didier Le Ruyet +3 more
- 01 Jan 2020
TL;DR: This work proposes two low complexity detection algorithms, a sub-optimal one, based on lists, and an optimal one,based on a simplification of ML, which have a good trade-off between performance and complexity.
1
Probability of full-diversity for simple coded and rotated multidimensional constellation systems
Gokhan M. Guvensen,Tugcan Aktas,Ali Ozgur Yilmaz +2 more
- 01 Sep 2009
TL;DR: The results shown summarize the benefits of utilizing rotation together with coding, even in the cases of very simple non-full-diversity rotations like DFT rotations.
References
•Book
Fundamentals of Wireless Communication
David Tse,Pramod Viswanath +1 more
- 01 Jan 2005
TL;DR: In this paper, the authors propose a multiuser communication architecture for point-to-point wireless networks with additive Gaussian noise detection and estimation in the context of MIMO networks.
12.4K
•Proceedings Article
Wireless communications
A. Jamalipour,N. Ansari,M. Howlader,Chengshan Xiao +3 more
- 01 Jan 2005
TL;DR: This book aims to provide a chronology of key events and individuals involved in the development of microelectronics technology over the past 50 years and some of the individuals involved have been identified and named.
11.2K
Wireless Communications: List of Abbreviations
Andrea Goldsmith
- 01 Jan 2005
TL;DR: The field of wireless communications has been in existence since the first humans learned to communicate.
9.2K
Iterative (turbo) soft interference cancellation and decoding for coded CDMA
Xiaodong Wang,H.V. Poor +1 more
TL;DR: Simulation results demonstrate that the proposed low complexity iterative receivers structure for interference suppression and decoding offers significant performance gain over the traditional noniterative receiver structure.
A universal lattice code decoder for fading channels
TL;DR: By judicious choice of the decoding radius, it is shown that this maximum-likelihood decoding algorithm can be practically used to decode lattice codes of dimension up to 32 in a fading environment.
1.8K