TY - GEN
T1 - 4 × 4 Perfect space-time code partition
AU - Sarkiss, Mireille
AU - Othman, Ghaya Rekaya Ben
AU - Belfiore, Jean Claude
PY - 2008/12/1
Y1 - 2008/12/1
N2 - In this paper, we partition the 4×4 Perfect Code in order to increase the minimum determinant between codewords, and hence improve the performance in slow fading channels. Using Construction A at the encoder, we construct the lattices corresponding to Perfect Code subcodes at different levels of the partition chain, and we find the convenient binary codes. This partition is made in the same manner as [3] for Golden Code. We propose also a new decoder, based on Stack decoder, which is valid for partitioning schemes. It achieves ML performance with significantly reduced complexity. Suboptimal versions are presented to reduce furthermore the complexity.
AB - In this paper, we partition the 4×4 Perfect Code in order to increase the minimum determinant between codewords, and hence improve the performance in slow fading channels. Using Construction A at the encoder, we construct the lattices corresponding to Perfect Code subcodes at different levels of the partition chain, and we find the convenient binary codes. This partition is made in the same manner as [3] for Golden Code. We propose also a new decoder, based on Stack decoder, which is valid for partitioning schemes. It achieves ML performance with significantly reduced complexity. Suboptimal versions are presented to reduce furthermore the complexity.
U2 - 10.1109/ACSSC.2008.5074729
DO - 10.1109/ACSSC.2008.5074729
M3 - Conference contribution
AN - SCOPUS:70349675489
SN - 9781424429417
T3 - Conference Record - Asilomar Conference on Signals, Systems and Computers
SP - 1763
EP - 1767
BT - 2008 42nd Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2008
T2 - 2008 42nd Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2008
Y2 - 26 October 2008 through 29 October 2008
ER -