On Improving 4 � 4 Space-Time Codes
Frédérique Oggier, Grégory Berhuy
Abstract
Frédérique Oggier, Grégory Berhuy
Abstract
In this work, we discuss the construction of 4 times 4 space-time codes for coherent MIMO channels. Recently, the so-called perfect space-time codes have been introduced. These are algebraic codes, which satisfy a plethora of properties, that makes them particularly efficient. They are available for 2,3,4 and 6 antennas, and the optimal perfect code for 2 antennas is known. In an attempt to find the optimal perfect code for 4 antennas, we found and present here a (non perfect) code construction that exhibits better performance than 4 times 4 known codes.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this work, we discuss the construction of 4 times 4 space-time codes for coherent MIMO channels. Recently, the so-called perfect space-time codes have been introduced. These are algebraic codes, which satisfy a plethora of properties, that makes them particularly efficient. They are available for 2,3,4 and 6 antennas, and the optimal perfect code for 2 antennas is known. In an attempt to find the optimal perfect code for 4 antennas, we found and present here a (non perfect) code construction that exhibits better performance than 4 times 4 known codes.
Key concepts: Computer science, Code (set theory), Block code, Space time, MIMO, Linear code, Theoretical computer science, Algorithm