Advertisement

Multiuser coding based on detecting matrices for Synchronous-CDMA systems

  • Wai Ho Mow
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1355)

Abstract

A multiuser coding approach to the design of spreading sequences for synchronous CDMA systems in which each receiver makes use of the knowledge of the spreading sequences and idle status of all users was recently introduced. For interuser-interference-free communications using sequences of length L, the system capacity (i.e. maximum number of simultaneous users) of the resultant system is about Llog2(L)/2 while that of conventional system is only L. In this work, it is shown that in this approach the synchronous CDMA system is equivalent to the classical multiuser binary adder channel. Consequently, the multiuser codes based on ternary detecting matrices can be used as the spreading sequences. A new recursive construction of ternary detecting matrices which generalizes and/or improves the best previously known constructions is presented. Comparing with previous works, a remarkable improvement on the system capacity is obtained.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    G. H. Khachatrian and S. S. Martirossian, “A New Approach to the Design of Codes for Synchronous-CDMA Systems,” IEEE Trans. Inform. Theory, vol. IT-41, pp. 1503–1506, 1995.CrossRefGoogle Scholar
  2. 2.
    Y. W. Wu and S. C. Chang, “Coding Scheme for Synchronous-CDMA Systems,” IEEE Trans. Inform. Theory, vol. IT-43, pp. 1064–1067, 1997.Google Scholar
  3. 3.
    S.-C. Chang and E. J. Weldon, Jr., “Coding for T-User Multiple-Access Channels,” IEEE Trans. Inform. Theory, vol. IT-25, pp. 684–691, 1979.Google Scholar
  4. 4.
    S. Söderberg and H. S. Shapiro, “A combinatory detection problem,” Amer. Math. Monthly, vol. 70, pp. 1066–1070, 1963.Google Scholar
  5. 5.
    D. G. Cantor and W. H. Mills, “Determining a Subset from Certain Combinatorial Properties,” Canad. J. Math, vol. 18, pp. 42–48, 1966.Google Scholar
  6. 6.
    B. Lindström, “On a combinatory detection problem,” Publ. Hung. Acad. Sci., vol. 9, pp. 195–207, 1964.Google Scholar
  7. 7.
    T. J. Ferguson, “Generalized T-User Codes for Multiple-Access Channels,” IEEE Trans. Inform. Theory, vol. IT-28, pp. 775–778, 1982.CrossRefGoogle Scholar
  8. 8.
    S.-C. Chang, “Further Results on Coding for T-User Multiple-Access Channels,” IEEE Trans. Inform. Theory, vol. IT-30, pp. 411–415, 1984.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Wai Ho Mow
    • 1
  1. 1.Division of Communication Engineering School of EEE, Block S1Nanyang Technological UniversityNanyang AvenueSingapore

Personalised recommendations