The Generator and Parity-Check Matrices of Turbo Codes

Turbo codes are typically represented as parallel concatenated convolutional codes, but will be treated as serially concatenated codes in this paper. Treating turbo codes as serially concatenated codes makes possible the general description of their generator and parity-check matrices. Given the generator and parity-check matrices, turbo codes may be analyzed from a block and low-density parity-check code point of view.