Abstract
We introduce a method for generating a sequence of semi-random interleavers, intended to be optimally stored and employed in a turbo coding system that requires flexibility of the input block (i.e., interleaver) size N. A distinctive feature of this method is seen in the very simple rules for obtaining shorter/longer interleavers by pruning/adding positions to the interleaver currently used in the system. For each N, the obtained bit error rate (BER) is not higher than the BER for ordinary S-random interleaver of the same N. The method always converges and is suitable for obtaining interleavers of large lengths.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
