Turbo codes with recursive nonsystematic quick-look-in constituent codes

Prior attempts at designing nonsystematic turbo codes have not achieved performances better than systematic turbo codes. This paper presents a new class of nonsystematic turbo codes that perform very well. The idea behind this new class of codes is to use a doubly-asymmetric turbo code where one of the constituent codes is a "recursive nonsystematic quick look-in" code, and the other constituent code(s) is a "big numerator accumulator".