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

Standard

Trellis decoding techniques and their performance in the adder channel for synchronous and asynchronous CCMA codes. / Benachour, Phillip ; Markarian, Garik ; Honary, Bahram.
Cryptography and coding: 6th IMA International Conference Cirencester, UK, December 17–19, 1997 Proceedings. ed. / Michael Darnell. Berlin: Springer, 1997. p. 23-29 (Lecture Notes in Computer Science; Vol. 1355).

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

Harvard

Benachour, P , Markarian, G & Honary, B 1997, Trellis decoding techniques and their performance in the adder channel for synchronous and asynchronous CCMA codes. in M Darnell (ed.), Cryptography and coding: 6th IMA International Conference Cirencester, UK, December 17–19, 1997 Proceedings. Lecture Notes in Computer Science, vol. 1355, Springer, Berlin, pp. 23-29.

APA

Benachour, P., Markarian, G., & Honary, B. (1997). Trellis decoding techniques and their performance in the adder channel for synchronous and asynchronous CCMA codes. In M. Darnell (Ed.), Cryptography and coding: 6th IMA International Conference Cirencester, UK, December 17–19, 1997 Proceedings (pp. 23-29). (Lecture Notes in Computer Science; Vol. 1355). Springer.

Vancouver

Benachour P , Markarian G , Honary B. Trellis decoding techniques and their performance in the adder channel for synchronous and asynchronous CCMA codes. In Darnell M, editor, Cryptography and coding: 6th IMA International Conference Cirencester, UK, December 17–19, 1997 Proceedings. Berlin: Springer. 1997. p. 23-29. (Lecture Notes in Computer Science).

Author

Benachour, Phillip ; Markarian, Garik ; Honary, Bahram. / Trellis decoding techniques and their performance in the adder channel for synchronous and asynchronous CCMA codes. Cryptography and coding: 6th IMA International Conference Cirencester, UK, December 17–19, 1997 Proceedings. editor / Michael Darnell. Berlin : Springer, 1997. pp. 23-29 (Lecture Notes in Computer Science).

Bibtex

@inproceedings{2c9e460434af4f2d9ca25821d2ef2dae,

title = "Trellis decoding techniques and their performance in the adder channel for synchronous and asynchronous CCMA codes",

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.",

author = "Phillip Benachour and Garik Markarian and Bahram Honary",

year = "1997",

language = "English",

isbn = "978-3-540-63927-5",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "23--29",

editor = "Michael Darnell",

booktitle = "Cryptography and coding",

}

RIS

TY - GEN

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

AU - Benachour, Phillip

AU - Markarian, Garik

AU - Honary, Bahram

PY - 1997

Y1 - 1997

N2 - 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.

AB - 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.

M3 - Conference contribution/Paper

SN - 978-3-540-63927-5

T3 - Lecture Notes in Computer Science

SP - 23

EP - 29

BT - Cryptography and coding

A2 - Darnell, Michael

PB - Springer

CY - Berlin

ER -

Research