On Duobinary Turbo Codes for Block Fading Channels

Diversity coding for fading channels has been an area of active research for many years. In particular, performance hounds and code construction for several families of codes have been studied for block fading channels. In this work, we consider duobinary turbo codes for block fading channels. A simple decodability condition guaranteeing full diversity based on decodable subsets is introduced. The performance of systematic duobinary turbo codes is analyzed with regard to the channel interleaver and confirmed with simulations. An interesting relationship between the frame size and distance spectrum of these tailbiting codes is revealed