Various models have been proposed for the design of interleavers for turbo code systems. Most of them require to be implemented as lookup tables. In this article, we apply the former Almost Regular Permutation for the case of binary codes. This model obtains slightly better error correcting performance than the standard 3G model and is easier to implement especially in the prospect of high speed decoding. Thus it might be a good candidate for arising B3G (Beyond 3G) technologies.
展开▼
