Peak to average power ratio reduction of space-time codes that achieve diversity-multiplexing gain tradeoff

  title={Peak to average power ratio reduction of space-time codes that achieve diversity-multiplexing gain tradeoff},
  author={Chung-Pi Lee and Hsuan-Jung Su},
  journal={2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications},
  • Chung-Pi Lee, Hsuan-Jung Su
  • Published 8 December 2008
  • Computer Science
  • 2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications
A result of Zheng and Tse states that over a quasi-static channel, there exists a fundamental tradeoff, known as the diversity-multiplexing gain (D-MG) tradeoff. The quest for space-time codes that achieve D-MG tradeoff has generated numerous works. However, these space-time codes generally result in a pretty high peak to average power ratio (PAR) value on each antenna. In this paper, we propose two general ways to reduce PAR without affecting code structures and without any side information… 
1 Citations

Figures and Tables from this paper

Iterative decoding of precoded multichannel system with PAPR reduction
The simulation results show that list sphere decoding can provide effective soft output for the decoding of the precode with PAPR reduction using a list sphere decoder and imply that the precodes together with the outer channel code, can provide concatenation gain.


Explicit Space-Time Codes Achieving the Diversity-Multiplexing Gain Tradeoff
Two general techniques for building D-MG-optimal rectangular ST codes from their square counterparts are presented and establishes that the D- MG tradeoff for all Tgesnt is the same as that previously known to hold for TgesNT+n r-1.
Lattice coding and decoding achieve the optimal diversity-multiplexing tradeoff of MIMO channels
The class of LAttice Space-Time (LAST) codes are introduced and it is shown that these codes achieve the optimal diversity-multiplexing tradeoff defined by Zheng and Tse under generalized minimum Euclidean distance lattice decoding.
Maximal diversity algebraic space-time codes with low peak-to-mean power ratio
This paper introduces a further constraint on space-time code design in that the code should also lead to low values of the peak-to-mean envelope power ratio (PMEPR) for each antenna, which results in significant performance improvement over the full diversity TAST schemes of comparable complexity.
An optimal two transmit antenna space-time code and its stacked extensions
A space-time code is proposed that exhibits the highest coding gain among competing full-rate full transmit diversity space- time codes for the two transmit and receive antenna coherent quasi-static fading channel, implying that the proposed code achieves the optimal diversity-multiplexing tradeoff curve for theTwo transmit antenna system.
Approximately universal codes over slow-fading channels
Performance of reliable communication over a coherent slow-fading multiple-input multiple-output (MIMO) channel at high signal-to-noise ratio (SNR) is succinctly captured as a fundamental tradeoff
Integer-based constellation-shaping method for PAPR reduction in OFDM systems
This new technique offers a PAPR that is significantly lower than those of the best-known techniques without any loss in terms of energy and/or spectral efficiency, and without any side information being transmitted, and has a low computational complexity.
Perfect space-time codes with minimum and non-minimum delay for any number of antennas
Both minimum and non-minimum delay perfect codes are shown to be D-MG optimal.
On optimal shaping of multidimensional constellations
A scheme for the optimal shaping of multidimensional constellations is proposed. This scheme is motivated by a type of structured vector quantizer for memoryless sources, and results in N-sphere
Multidimensional constellations. I. Introduction, figures of merit, and generalized cross constellations
The authors discuss the major attributes desired in signal constellations, such as signal-to-noise ratio (SNR) efficiency, simplicity of mapping bits to points and vice versa, compatibility with
Shaping Multidimensional Signal Spaces-Part I : Optimum Shaping , Shell Mapping
This work introduces an addressing scheme with low complexity to achieve a point on the optimum tradeoff curves, and applies a change of variable denoted as shell mapping, the optimum shaping region is mapped to a hypercube truncated within a simplex.