Please use this identifier to cite or link to this item:
Scopus Web of Science® Altmetric
Type: Conference paper
Title: Irregular repeat accumulate codes with few iterations for the binary adder channel
Author: Wang, G.
Land, I.
Grant, A.
Citation: International Symposium on Turbo Codes and Iterative Information Processing, ISTC, 2012, pp.215-219
Publisher: IEEE
Issue Date: 2012
ISBN: 9781457721137
ISSN: 2165-4700
Conference Name: 2012 7th International Symposium on Turbo Codes and Iterative Information Processing (ISTC) (27 Aug 2012 - 31 Aug 2012 : Gothenburg, Sweden)
Statement of
Guangsong Wang, Ingmar Land, Alex Grant
Abstract: Iterative interference cancellation is a powerful technique for design of multiuser decoders. Careful encoder and decoder design is essential for reducing implementation complexity. When used in conjunction with iteratively-decodeable sparse graph codes, there is a choice to be made between the number of multiuser interference cancellation stages and the number of iterations used for decoding each user's code. Too few decoder iterations may increase the number of interference cancellation steps, whereas too many may superfluous, or even inhibit the convergence behaviour of the cancellation loop. In this paper we design non-systematic irregular repeat-accumulate codes for multiple-access channels where the number of cancellation stages and number of decoder iterations at each stage are fixed. The design goal is minimal bit error rate. Our formulation is based on extrinsic information transfer, and introduces the number of iterations directly into the curve fitting problem. For clear development of concepts, we restrict attention to the binary adder channel, where our approach is exact. Generalisation to other sparse graph codes and other multiple-access channels is straightforward, subject to the usual approximations.
Rights: © 2012 IEEE
DOI: 10.1109/ISTC.2012.6325230
Grant ID:
Appears in Collections:Aurora harvest 7
Mathematical Sciences publications

Files in This Item:
There are no files associated with this item.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.