Results 1 -
4 of
4
Error Floor Removal for Bit-Interleaved Coded Modulation with Iterative Detection
, 2006
"... This publication has been included here just to facilitate downloads to those people asking for personal use copies. This material may be published at copyrighted journals or conference proceedings, so personal use of the download is required. In particular, publications from IEEE have to be downloa ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
This publication has been included here just to facilitate downloads to those people asking for personal use copies. This material may be published at copyrighted journals or conference proceedings, so personal use of the download is required. In particular, publications from IEEE have to be downloaded according to the following IEEE note: c○2007 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Some Unitary Space–Time Codes From Sphere Packing Theory With Optimal Diversity Product of Code Size
"... Abstract—In this correspondence, we propose some new designs of P P unitary space–time codes of sizes 6, 32, 48, 64 with best-known diversity products (or product distances) by partially using sphere packing theory. In particular, we present an optimal P P unitary space–time code of size T in the se ..."
Abstract
- Add to MetaCart
Abstract—In this correspondence, we propose some new designs of P P unitary space–time codes of sizes 6, 32, 48, 64 with best-known diversity products (or product distances) by partially using sphere packing theory. In particular, we present an optimal P P unitary space–time code of size T in the sense that it reaches the maximal possible diversity product for P P unitary space–time codes of size T. The construction and the optimality of the code of size T provide the precise value of the maximal diversity product of a P P unitary space–time code of size T. Index Terms—Differential space–time modulation, optimal diversity product, packing theory, unitary space–time codes. I.
Recursive Space–Time Trellis Codes Using Differential Encoding
, 2009
"... Differential space–time modulation (DSTM) has been recently proposed by Hughes, and Hochwald and Sweldens when the channel information is not known at the receiver, where the demodulation is in fact the same as the coherent demodulation of space–time block coding by replacing the channel matrix with ..."
Abstract
- Add to MetaCart
Differential space–time modulation (DSTM) has been recently proposed by Hughes, and Hochwald and Sweldens when the channel information is not known at the receiver, where the demodulation is in fact the same as the coherent demodulation of space–time block coding by replacing the channel matrix with the previously received signal matrix. On the other hand, the DSTM also needs a recursive memory of a matrix block at the encoder and therefore provides a trellis structure when the channel information is known at the receiver, which is the interest of this paper. This recursive structure of the DSTM has been adopted lately by Schlegel and Grant in joint with a conventional binary code and joint iterative decoding/demodulation with a superior performance. The number of states of the trellis from the recursive structure depends on both the memory size, which is fixed in this case, and the unitary space–time code (USTC). When a USTC for the DSTM forms a

