By Topic

Constructions of Asymptotically Optimal Space–Frequency Codes for MIMO-OFDM Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hsiao-Feng Lu ; Dept. of Commun. Eng., Nat. Chung-Cheng Univ., Chia-Yi ; Mao-Ching Chiu

Constructions of space-frequency (SF) codes for multiple-input multiple-output (MIMO)-orthogonal frequency-division multiplexing (OFDM) systems with nt transmit antennas and Q subcarriers are considered in this paper. Following the pairwise-error-probability analysis, it is known that in addition to the conventional rank distance criterion, the minimum column distance of (nttimesQ) SF codes serves as another benchmark in code design. SF codes with larger minimum column distance are expected to have better performance. Following this principle, the rate-diversity tradeoff for the MIMO-OFDM channels as well as two SF code constructions are presented. The first construction is obtained by right-multiplying the code matrices in a maximal rank-distance (MRD) code by a fixed (QtimesQ) nonsingular matrix. Codes obtained from this construction are called linearly transformed MRD (LT-MRD) codes. Minimum column distance of the LT-MRD codes, when averaged over all code ensembles, is shown to meet the Gilbert-Varshamov bound. For the case of constructing the (2times256) quadrature phase-shift keying (QPSK)-modulated SF codes, it is shown that the LT-MRD codes can provide a much larger minimum column distance at the value of ges50, compared to the values of 3,5, or 6 obtained by other available constructions. The second code construction, termed cyclotomic construction, is reminiscent of the construction of the Reed-Solomon codes except that the code polynomials are now selected according to the cyclotomic cosets of the underlying field. Exact minimum rank distances of the resultant codes are presented. It is shown that this newly constructed code is asymptotically optimal in terms of rate-diversity tradeoff. Bounds on the minimum column distance of these codes are also given

Published in:

Information Theory, IEEE Transactions on  (Volume:53 ,  Issue: 5 )