Skip to main content
SpringerLink
Log in

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

  • Conference paper
  • First Online:
Crytography and Coding (Cryptography and Coding 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1355))

Included in the following conference series:

  • 114 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. G, Farrell “Survey of channel coding for multi-user systems”, in Skwirzynski, J.K. (Ed.): “New concepts in multi-user communications” (Sijthoff and Noordhoff, 1981), pp. 133–159.

    Google Scholar 

  2. T. Kasami and S.Lin, “Coding for a multiple access channel”, IEEE Trans. on Inform. Theory, Vol. IT-22, No.2, pp 129–137, March 1976.

    Article  Google Scholar 

  3. G.Markarian, B.Honary, P.Benachour, “Trellis decoding techniques for the binary adder channel with M users”, IEE Proceedings on Communications, vol. 144, 1997.

    Google Scholar 

  4. V.Sidorenko, G.Markarian, B.Honary, “Minimal trellis design for linear codes based on the Shannon product”, IEEE Trans. Inform. Theory, vol. 42 pp.2048–2053, Nov. 1996.

    Article  Google Scholar 

  5. P.Mathys, “A class of codes for T active users out of N, for a multiple access communication system,” IEEE Trans. Inform. Theory, vol. 36 pp.1206–1219, Nov. 1990.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lancaster Communications Research Centre SECAMS, Lancaster University, LAI 4YR, Lancaster

    P. Benachour, G. Markarian & B. Honary

Authors
  1. P. Benachour
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. Markarian
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. B. Honary
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michael Darnell

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Benachour, P., Markarian, G., Honary, B. (1997). Trellis decoding techniques and their performance in the adder channel for synchronous and asynchronous CCMA codes. In: Darnell, M. (eds) Crytography and Coding. Cryptography and Coding 1997. Lecture Notes in Computer Science, vol 1355. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024446

Download citation

  • DOI: https://doi.org/10.1007/BFb0024446

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63927-5

  • Online ISBN: 978-3-540-69668-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation