Low-complexity high-rate Reed-Solomon block turbo Codes

Rong Zhou (1) , Raphaël Le Bidan (2) , Ramesh Pyndiah (1) , André Goalic (1)

1 TAMCIC - Traitement Algorithmique et Matériel de la Communication, de l'Information et de la Connaissance
2 SC - Département Signal et Communications

This letter considers high-rate block turbo codes (BTC) obtained by concatenation of two single-error-correcting Reed--Solomon (RS) constituent codes. Simulation results show that these codes perform within 1 dB of the theoretical limit for binary transmission over additive white Gaussian noise with a low-complexity decoder. A comparison with Bose--Chaudhuri--Hocquenghem BTCs of similar code rate reveals that RS BTCs have interesting advantages in terms of memory size and decoder complexity for very-high-data-rate decoding architectures.

Mots clés: Reed-Solomon code; Block turbo code; Product code

Domaines: Traitement du signal et de l'image [eess.SP]

Rong Zhou, Raphaël Le Bidan, Ramesh Pyndiah, André Goalic. Low-complexity high-rate Reed-Solomon block turbo Codes. IEEE Transactions on Communications, 2007, 55 (9), pp.1656 - 1660. ⟨10.1109/TCOMM.2007.904365⟩. ⟨hal-01876249⟩