By Topic

Concatenated coding performance for FSK modulation on time-correlated Rician fading channels

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)
Pimentel, C. ; Commun. Res. Group, Fed. Univ. of Pernambuco, Recife, Brazil ; Blake, I.F.

We present an analytical method for evaluating the performance of noninterleaved concatenated codes over channels modeled as a nonfrequency selective correlated Rician fading channel with a known power spectral density. The main idea is to model the communication system from the modulator input to the demodulator output as a finite state channel (FSC) model, and apply powerful enumeration techniques to such a discrete channel in order to gain useful information on the system performance. The concatenated scheme makes use of two codes; Reed-Solomon codes are employed for the outer code, and binary block codes are used as the inner code. Next, the method is extended to study the effect on the performance when an interleaving with finite depth is incorporated into the communication system. A comparison between symbol and bit interleaving is made. Finally, we study the potential gain produced when channel information is passed on to the outer decoder in the form of an erasure symbol. In all cases, analytical expressions for the probability of the number of error symbols produced by the FSC model were obtained in terms of a coefficient in a formal power series. This is an interesting alternative approach with respect to computer simulations

Published in:

Communications, IEEE Transactions on  (Volume:46 ,  Issue: 12 )