On the complexity of unary error correction codes for the near-capacity transmission of symbol values from an infinite set

Zhang, W., Maunder, R.G. and Hanzo, L. (2013) On the complexity of unary error correction codes for the near-capacity transmission of symbol values from an infinite set. 2013 IEEE Wireless Communications and Networking Conference (WCNC 2013), , Shanghai, China. 07 - 10 Apr 2013. pp. 2795-2800 . (doi:10.1109/WCNC.2013.6555003).

Record type: Conference or Workshop Item (Paper)

Abstract

Unary Error Correction (UEC) codes have recently been proposed for the near-capacity Joint Source and Channel Coding (JSCC) of symbol values that are selected from a set having an infinite cardinality. In this paper, we characterize the computational complexity of UEC decoders and use complexity analysis for striking a desirable trade-off between the contradictory requirements of low complexity and near-capacity operation. We investigate a wide range of application scenarios and offer a deep insight into their beneficial parameterizations. In particular, we introduce puncturing for controlling the scheme’s throughput and for facilitating fair comparisons with a Separate Source and Channel Coding (SSCC) benchmarker. The UEC scheme is found to offer almost 1.3 dB gain, when operating within 1.6 dB of the capacity bound. This is achieved without any increase in transmission energy, bandwidth, transmit duration or decoding complexity.

Text

1569678857.pdf - Accepted Manuscript

Available under License University of Southampton Accepted Manuscript Licence.

Download (343kB)

Text

slides_WCNC2013.pdf - Other

Download (876kB)