Trellis decoding techniques and their performance in the adder channel for synchronous and asynchronous CCMA codes

Computing and Communications

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Published

Publication date	1997
Host publication	Cryptography and coding: 6th IMA International Conference Cirencester, UK, December 17–19, 1997 Proceedings
Editors	Michael Darnell
Place of Publication	Berlin
Publisher	Springer
Pages	23-29
Number of pages	7
ISBN (electronic)	978-3-540-69668-1
ISBN (print)	978-3-540-63927-5
<mark>Original language</mark>	English

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	1355
ISSN (Print)	0302-9743

Abstract

A novel technique that allows efficient trellis decoding for M-choose-T synchronous collaborative coding multiple access (CCMA) codes is investigated. The results show that a sufficient performance improvement is achieved without the need for additional information regarding the active users. The application of the proposed technique to asynchronous CCMA codes is also analysed. The modified decoding procedure shows a further improvement when compared to the conventional hard decoding technique.

Research