Complex-field coding for OFDM over fading wireless channels

Zhengdao Wang; Georgios B. Giannakis

doi:10.1109/TIT.2002.808101

Complex-field coding for OFDM over fading wireless channels

Zhengdao Wang, Georgios B. Giannakis

Electrical and Computer Engineering

Research output: Contribution to journal › Article › peer-review

161 Scopus citations

Abstract

Orthogonal frequency-division multiplexing (OFDM) converts a time-dispersive channel into parallel sub-channels, and thus facilitates equalization and (de)coding. But when the channel has nulls close to or on the fast Fourier transform (FFT) grid, uncoded OFDM faces serious symbol recovery problems. As an alternative to various error-control coding techniques that have been proposed to ameliorate the problem, we perform complex-field coding (CFC) before the symbols are multiplexed. We quantify the maximum achievable diversity order for independent and identically distributed (i.i.d.) or correlated Rayleigh-fading channels, and also provide design rules for achieving the maximum diversity order. The maximum coding gain is given, and the encoder enabling the maximum coding gain is also found. Simulated performance comparisons of CFC-OFDM with existing block and convolutionally coded OFDM alternatives favor CFC-OFDM for the code rates used in a HiperLAN2 experiment.

Original language	English (US)
Pages (from-to)	707-720
Number of pages	14
Journal	IEEE Transactions on Information Theory
Volume	49
Issue number	3
DOIs	https://doi.org/10.1109/TIT.2002.808101
State	Published - Mar 2003

Bibliographical note

Funding Information:
Manuscript received April 20, 2001; revised November 1, 2002. This work was supported by the NSF under Grant CCR-9805350 and by the NSF under the Wireless Initiative Grant 9979443. The material in this paper was presented in part at the the Workshop on Signal Processing Advances in Wireless Communication, Taoyuan, Taiwan, ROC, March 2001. Z. Wang is with the Department of Electrical and Computer Engineering, Iowa State University, Ames, IA 50011 USA (e-mail: [email protected]). G. B. Giannakis is with the Department of Electrical and Computer Engineering, University of Minnesota, Minneapolis, MN 55455 USA (e-mail: [email protected]). Communicated by T. Fuja, Associate Editor At Large. Digital Object Identifier 10.1109/TIT.2002.808101

Keywords

Analog codes
Coding gain
Complex-field coding (CFC)
Diversity order
Fading
Maximum-distance separable (MDS)
Orthogonal frequency-division multiplexing (OFDM)
Real-number codes

Publisher link

10.1109/TIT.2002.808101

Find It

Find It at U of M Libraries

Cite this

@article{0ab2f25ef5f54768a51fa7226e96a784,

title = "Complex-field coding for OFDM over fading wireless channels",

abstract = "Orthogonal frequency-division multiplexing (OFDM) converts a time-dispersive channel into parallel sub-channels, and thus facilitates equalization and (de)coding. But when the channel has nulls close to or on the fast Fourier transform (FFT) grid, uncoded OFDM faces serious symbol recovery problems. As an alternative to various error-control coding techniques that have been proposed to ameliorate the problem, we perform complex-field coding (CFC) before the symbols are multiplexed. We quantify the maximum achievable diversity order for independent and identically distributed (i.i.d.) or correlated Rayleigh-fading channels, and also provide design rules for achieving the maximum diversity order. The maximum coding gain is given, and the encoder enabling the maximum coding gain is also found. Simulated performance comparisons of CFC-OFDM with existing block and convolutionally coded OFDM alternatives favor CFC-OFDM for the code rates used in a HiperLAN2 experiment.",

keywords = "Analog codes, Coding gain, Complex-field coding (CFC), Diversity order, Fading, Maximum-distance separable (MDS), Orthogonal frequency-division multiplexing (OFDM), Real-number codes",

author = "Zhengdao Wang and Giannakis, {Georgios B.}",

note = "Funding Information: Manuscript received April 20, 2001; revised November 1, 2002. This work was supported by the NSF under Grant CCR-9805350 and by the NSF under the Wireless Initiative Grant 9979443. The material in this paper was presented in part at the the Workshop on Signal Processing Advances in Wireless Communication, Taoyuan, Taiwan, ROC, March 2001. Z. Wang is with the Department of Electrical and Computer Engineering, Iowa State University, Ames, IA 50011 USA (e-mail: [email protected]). G. B. Giannakis is with the Department of Electrical and Computer Engineering, University of Minnesota, Minneapolis, MN 55455 USA (e-mail: [email protected]). Communicated by T. Fuja, Associate Editor At Large. Digital Object Identifier 10.1109/TIT.2002.808101",

year = "2003",

month = mar,

doi = "10.1109/TIT.2002.808101",

language = "English (US)",

volume = "49",

pages = "707--720",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "IEEE",

number = "3",

}

TY - JOUR

T1 - Complex-field coding for OFDM over fading wireless channels

AU - Wang, Zhengdao

AU - Giannakis, Georgios B.

N1 - Funding Information: Manuscript received April 20, 2001; revised November 1, 2002. This work was supported by the NSF under Grant CCR-9805350 and by the NSF under the Wireless Initiative Grant 9979443. The material in this paper was presented in part at the the Workshop on Signal Processing Advances in Wireless Communication, Taoyuan, Taiwan, ROC, March 2001. Z. Wang is with the Department of Electrical and Computer Engineering, Iowa State University, Ames, IA 50011 USA (e-mail: [email protected]). G. B. Giannakis is with the Department of Electrical and Computer Engineering, University of Minnesota, Minneapolis, MN 55455 USA (e-mail: [email protected]). Communicated by T. Fuja, Associate Editor At Large. Digital Object Identifier 10.1109/TIT.2002.808101

PY - 2003/3

Y1 - 2003/3

N2 - Orthogonal frequency-division multiplexing (OFDM) converts a time-dispersive channel into parallel sub-channels, and thus facilitates equalization and (de)coding. But when the channel has nulls close to or on the fast Fourier transform (FFT) grid, uncoded OFDM faces serious symbol recovery problems. As an alternative to various error-control coding techniques that have been proposed to ameliorate the problem, we perform complex-field coding (CFC) before the symbols are multiplexed. We quantify the maximum achievable diversity order for independent and identically distributed (i.i.d.) or correlated Rayleigh-fading channels, and also provide design rules for achieving the maximum diversity order. The maximum coding gain is given, and the encoder enabling the maximum coding gain is also found. Simulated performance comparisons of CFC-OFDM with existing block and convolutionally coded OFDM alternatives favor CFC-OFDM for the code rates used in a HiperLAN2 experiment.

AB - Orthogonal frequency-division multiplexing (OFDM) converts a time-dispersive channel into parallel sub-channels, and thus facilitates equalization and (de)coding. But when the channel has nulls close to or on the fast Fourier transform (FFT) grid, uncoded OFDM faces serious symbol recovery problems. As an alternative to various error-control coding techniques that have been proposed to ameliorate the problem, we perform complex-field coding (CFC) before the symbols are multiplexed. We quantify the maximum achievable diversity order for independent and identically distributed (i.i.d.) or correlated Rayleigh-fading channels, and also provide design rules for achieving the maximum diversity order. The maximum coding gain is given, and the encoder enabling the maximum coding gain is also found. Simulated performance comparisons of CFC-OFDM with existing block and convolutionally coded OFDM alternatives favor CFC-OFDM for the code rates used in a HiperLAN2 experiment.

KW - Analog codes

KW - Coding gain

KW - Complex-field coding (CFC)

KW - Diversity order

KW - Fading

KW - Maximum-distance separable (MDS)

KW - Orthogonal frequency-division multiplexing (OFDM)

KW - Real-number codes

UR - http://www.scopus.com/inward/record.url?scp=0037355949&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0037355949&partnerID=8YFLogxK

U2 - 10.1109/TIT.2002.808101

DO - 10.1109/TIT.2002.808101

M3 - Article

AN - SCOPUS:0037355949

SN - 0018-9448

VL - 49

SP - 707

EP - 720

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 3

ER -

Complex-field coding for OFDM over fading wireless channels

Abstract

Bibliographical note

Keywords

Publisher link

Find It

Other files and links

Fingerprint

Cite this