New spreading codes and detection algorithms for low complexity post-coded OFDM systems

Author

Shah, S.F.A. ; Tewfik, A.H.

Author_Institution

Dept. of Electr. & Comput. Eng., Univ. of Minnesota, Minneapolis, MN, USA

fYear

2007

fDate

3-7 Sept. 2007

Firstpage

454

Lastpage

458

Abstract

Coded OFDM systems are generally employed to overcome the symbol recovery problem in uncoded OFDM systems that is caused due to loss of diversity in uncoded OFDM systems. In this paper, we extend our recent research work on low complexity post-coded OFDM (PC-OFDM) systems. We consider new spreading codes and detection algorithms for PC-OFDM in this paper. PC-OFDM systems introduce frequency diversity in an efficient manner so that the overall computation cost of the system can be significantly reduced. We discuss the design principles of spreading codes for PC-OFDM systems and obtain code construction criterion for minimum error performance. We propose two spreading codes based on these principles. We also investigate different choices for receiver structures suitable for PC-OFDM and compare their performance through simulations on IEEE UWB channels.

Keywords

IEEE standards; OFDM modulation; diversity reception; radio receivers; ultra wideband communication; IEEE UWB channels; PC-OFDM systems; code construction criterion; error performance; frequency diversity; low complexity OFDM systems; post-coded OFDM systems; receiver structures; spreading codes; spreading detection; symbol recovery problem; uncoded OFDM systems; Bit error rate; Complexity theory; Detectors; Diversity reception; Encoding; OFDM; Receivers;

fLanguage

English

Publisher

ieee

Conference_Titel

Signal Processing Conference, 2007 15th European

Conference_Location

Poznan

Print_ISBN

978-839-2134-04-6

Type

conf

Filename

7098844