Evolutionary Algorithm Aided Interleaver Design for Serially Concatenated Codes
Evolutionary Algorithm Aided Interleaver Design for Serially Concatenated Codes
In this paper, we propose an algorithm for designing the interleavers of Serially Concatenated Codes (SCCs), in order to increase the Minimum Hamming Distance (MHD) between the legitimate permutations of the encoded bit sequence and hence to improve the corresponding error floor. Unlike previous so-called Code Matched Interleaver (CMI) designs, our approach is capable of creating interleavers for serial concatenations of both irregular and non-linear codes, as well as achieving MHDs that are arbitrarily close to the maximum possible, provided that a sufficiently high off-line complexity is affordable. However, owing to the efficiency of the proposed approach, only a relatively low number of algorithm generations are required to achieve significant improvements to the error floor of low-delay wireless sensor network, speech and audio schemes, for example. Indeed, we demonstrate that our interleavers are capable of completely eradicating the error floors that would otherwise be apparent, if classic random or S-random interleavers were employed.
interleaver, serial concatenation, evolutionary algorithm, distance spectrum, fixed length code, FLC, unitary rate code, URC, termination, iterative decoding, error pattern, error event, error floor
1753-1758
Maunder, R. G.
76099323-7d58-4732-a98f-22a662ccba6c
Hanzo, L.
66e7266f-3066-4fc0-8391-e000acce71a1
July 2011
Maunder, R. G.
76099323-7d58-4732-a98f-22a662ccba6c
Hanzo, L.
66e7266f-3066-4fc0-8391-e000acce71a1
Maunder, R. G. and Hanzo, L.
(2011)
Evolutionary Algorithm Aided Interleaver Design for Serially Concatenated Codes.
IEEE Transactions on Communications, 59 (7), .
(doi:10.1109/TCOMM.2011.042111.090321).
Abstract
In this paper, we propose an algorithm for designing the interleavers of Serially Concatenated Codes (SCCs), in order to increase the Minimum Hamming Distance (MHD) between the legitimate permutations of the encoded bit sequence and hence to improve the corresponding error floor. Unlike previous so-called Code Matched Interleaver (CMI) designs, our approach is capable of creating interleavers for serial concatenations of both irregular and non-linear codes, as well as achieving MHDs that are arbitrarily close to the maximum possible, provided that a sufficiently high off-line complexity is affordable. However, owing to the efficiency of the proposed approach, only a relatively low number of algorithm generations are required to achieve significant improvements to the error floor of low-delay wireless sensor network, speech and audio schemes, for example. Indeed, we demonstrate that our interleavers are capable of completely eradicating the error floors that would otherwise be apparent, if classic random or S-random interleavers were employed.
Text
TCOM-09-0321.pdf
- Version of Record
More information
Published date: July 2011
Keywords:
interleaver, serial concatenation, evolutionary algorithm, distance spectrum, fixed length code, FLC, unitary rate code, URC, termination, iterative decoding, error pattern, error event, error floor
Organisations:
Southampton Wireless Group
Identifiers
Local EPrints ID: 267537
URI: http://eprints.soton.ac.uk/id/eprint/267537
PURE UUID: 37151fbb-1272-438f-86d2-4288e92bedba
Catalogue record
Date deposited: 09 Jun 2009 08:24
Last modified: 18 Mar 2024 03:09
Export record
Altmetrics
Contributors
Author:
R. G. Maunder
Author:
L. Hanzo
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics