Title :
A low-complexity superorthogonal turbo-code for CDMA applications
Author :
Komulainen, Petri ; Pehkonen, Kari
Author_Institution :
Nokia Mobile Phones R&D, Oulu
Abstract :
Turbo-codes are parallel concatenated convolutional codes (PCCC) whose performance in an AWGN channel has been shown to be near the Shannon limit. We describe a low rate superorthogonal turbo-code that outperforms the ordinary turbo-code at the expense of bandwidth expansion both in AWGN and especially in fading channels. Thus superorthogonal turbo-codes are suited mainly for e.g. CDMA applications. We concisely describe the soft output Viterbi (1995) algorithm using a priori inputs (APRI-SOVA) with connection to optimal maximum a posteriori (MAP) symbol estimation. Simulation results in AWGN and fading channels are also presented
Keywords :
Gaussian channels; channel capacity; code division multiple access; concatenated codes; convolutional codes; decoding; fading; maximum likelihood estimation; pseudonoise codes; spread spectrum communication; AWGN channel; CDMA; CDMA applications; DS-SS; MAP symbol estimation; Shannon limit; bandwidth expansion; channel coding; code performance; decoding; fading channels; flat fading; low rate superorthogonal turbo code; low-complexity superorthogonal turbo-code; optimal maximum a posteriori symbol estimation; parallel concatenated convolutional codes; priori inputs; simulation results; soft output Viterbi algorithm; AWGN channels; Bandwidth; Concatenated codes; Convolution; Convolutional codes; Fading; Iterative decoding; Multiaccess communication; Turbo codes; Viterbi algorithm;
Conference_Titel :
Personal, Indoor and Mobile Radio Communications, 1996. PIMRC'96., Seventh IEEE International Symposium on
Conference_Location :
Taipei
Print_ISBN :
0-7803-3692-5
DOI :
10.1109/PIMRC.1996.567418
