Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Trellis decoding technique for binary-adder channel with M users and its application in LANs

Trellis decoding technique for binary-adder channel with M users and its application in LANs

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Add to cart
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)
Add to cart

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IEE Proceedings - Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

© IEE
Published

A trellis design procedure for the M-user binary-adder channel is introduced. Based on this technique, trellis diagrams for some known 2-user coding schemes have been designed. In addition, a DC-free 2-user binary coding scheme, together with its trellis structure, is introduced and investigated. It is shown that the new technique provides about 2 dB energy gain in comparison with the conventional techniques. A useful and interesting application of this technique would be the token-ring local area network where the number of users can be increased without bandwidth expansion.

Inspec keywords: decoding; telecommunication channels; trellis codes; multi-access systems; token networks; local area networks

Other keywords: trellis design procedure; trellis structure; token-ring local area network; energy gain; multiple access adder channel; LAN; multiuser binary-adder channel; DC-free 2-user binary coding; trellis diagrams; trellis decoding

Subjects: Computer communications; Multiple access communication; Codes; Local area networks

References

    1. 1)
      • da Rocha, V., Markarian, G., Honary, B.: `Trellis decoding of block codes for the 2-userbinary adder channel', Proceedings of the ICC '93, Geneva, p. 821–826.
    2. 2)
      • J. Justensen . Information rate and power spectra of digital codes. IEEE Trans. , 3 , 457 - 472
    3. 3)
      • G.L. Cariolaro , G.P. Tronca . Spectra of block coded digital signals. IEEE Trans. , 10 , 1555 - 1564
    4. 4)
      • R. McEliece . On the BCJR trellis for linear block codes. IEEE Trans. , 4 , 1072 - 1092
    5. 5)
      • Markarian, G., Nikogosian, K., Manukian, H.: `Maximum likelihood decodingalgorithm adapted for line codes used in fibre-optic communication', Proceedings of the first international symposium on Communicationtheory and applications, 1991, Scotland, p. 229–238.
    6. 6)
      • P.G. Farrell , J.K. Skwirzynski . (1981) Survey of channel coding for multi-user systems, New concepts in multi-user communication.
    7. 7)
      • V. Sidorenko , G. Markarian , B. Honary . Minimal trellis design for linear codesbased on the Shannon product. IEEE Trans. , 6
    8. 8)
      • Kasami, T., Lin, S., Yamamura, S.: `Further results on coding for a multiple-access channels', Proceedings of Hungarian Colloquium on Information theory, 1975, Keszthely, Hungary, p. 369–391.
    9. 9)
      • Markarian, G., Honary, B.: `Trellis decoding for binary adder channel', Proceedings of the 3rd international symposium on Communicationtheory and applications, 1995, UK, p. 334–335.
    10. 10)
      • Honary, B., Markarian, G., Edgar, J.: `New spectral shaping codes and their trellises', Proceedings of GLOBECOM'95, 1995, Singapore.
    11. 11)
      • K. Cattermole , J. O'Reilly . (1986) Problems of randomness in digital communication. Vol. 2.
    12. 12)
      • J.K. Wolf . Efficient maximum likelihood decoding of linear block codes using a trellis. IEEE Trans. , 1 , 76 - 80
    13. 13)
      • S. Lin , V. Wei . Non-homogeneous trellis codes for the quasi-synchronous multiple-accessbinary adder channel with two users. IEEE Trans. , 6 , 787 - 796
    14. 14)
      • T. Kasami , S. Lin . Coding for a multiple access channel. IEEE Trans. , 2 , 129 - 137
http://iet.metastore.ingenta.com/content/journals/10.1049/ip-com_19971086
Loading

Related content

content/journals/10.1049/ip-com_19971086
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
Print this page
This is a required field
Please enter a valid email address