CSIT Group - Research Areas
Iterative Decoding of concatenated codes
Iterative decoders (or turbo-decoders) are suboptimal although
effective decoders for component codes concatenated through an
interleaver. These techniques enable to build
powerful codes with very
large block size with a decoder whose complexity grows only linearly
with the block size.
Concatenated codes can employ different component codes. With component block codes we have the so-called Block Turbo Codes or Turbo Product Codes when interleaving imposes the "product" structure (even with more than two dimensions). With component convolutional codes we have Parallel or Serially concatenated Turbo-Codes. In Low Density Parity Check (LDPC) codes the components are simple Single Parity Check codes.
For over ten years we have been pursuing research on different kind of turbo-codes, for satellite communications, gaussian channels, erasure channels and optical channels. In particular in the last years we have focused on LDPC code design for the optical channel.
Concatenated codes can employ different component codes. With component block codes we have the so-called Block Turbo Codes or Turbo Product Codes when interleaving imposes the "product" structure (even with more than two dimensions). With component convolutional codes we have Parallel or Serially concatenated Turbo-Codes. In Low Density Parity Check (LDPC) codes the components are simple Single Parity Check codes.
For over ten years we have been pursuing research on different kind of turbo-codes, for satellite communications, gaussian channels, erasure channels and optical channels. In particular in the last years we have focused on LDPC code design for the optical channel.
Main
Related Publications: [1] M. Ferrari, S. Bellini “Rate-variable, multi-binary Turbo
Codes, with controlled error-floor”, IEEE Transactions on
Communications, vol. 57, No. 5, May 2009, Page(s): 1209-1214.
[2] M. Ferrari, S. Bellini “Maximum Likelihood Decoding of Turbo Codes on the Binary Erasure Channel” in the Proceedings of ICC 2008, Beijing, China, 19-23 May 2008, pp. 1144-1149
[3] M. Ferrari, S. Bellini “Refinements and Asymptotic performance of Bandwidth-efficient Turbo Product Codes”, IEEE Transactions on Communications, vol. 52, No. 6, June 2004, Page(s): 866-870.
[4] M. Ferrari, S. Bellini “Existence and uniqueness of the solution for turbo decoding of parallel concatenated Single Parity Check codes”, IEEE Transactions on Information Theory, Vol. 49 Issue 3, Mar 2003, Page(s): 722 -726
[5] M. Tomlinson, M. Ferrari, A. Ambroze "Search for good b/(b+1) high rate recursive systematic convolutional component codes", IEE Electronics Letters , Vol: 38 Issue: 25 , 5 Dec. 2002 Page(s): 1691 –1693.
[2] M. Ferrari, S. Bellini “Maximum Likelihood Decoding of Turbo Codes on the Binary Erasure Channel” in the Proceedings of ICC 2008, Beijing, China, 19-23 May 2008, pp. 1144-1149
[3] M. Ferrari, S. Bellini “Refinements and Asymptotic performance of Bandwidth-efficient Turbo Product Codes”, IEEE Transactions on Communications, vol. 52, No. 6, June 2004, Page(s): 866-870.
[4] M. Ferrari, S. Bellini “Existence and uniqueness of the solution for turbo decoding of parallel concatenated Single Parity Check codes”, IEEE Transactions on Information Theory, Vol. 49 Issue 3, Mar 2003, Page(s): 722 -726
[5] M. Tomlinson, M. Ferrari, A. Ambroze "Search for good b/(b+1) high rate recursive systematic convolutional component codes", IEE Electronics Letters , Vol: 38 Issue: 25 , 5 Dec. 2002 Page(s): 1691 –1693.
IEIIT - Corso Duca degli Abruzzi 24, 10129 Torino, Italy
Phone: +39 011 564 5400 - Fax: +39 011 564 5429
Last Update:
Wed, March 9, 2011