Skip to main content

Throughput increase of ALOHA-based systems with multiuser sequence detection

  • Networks and Information Theory
  • Conference paper
  • First Online:
  • 157 Accesses

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

Abstract

Multi-user detectors have been suggested to improve the performance of CDMA based random-access systems [1, 2, 3, 4]. It is shown that with the maximum-likelihood (ML) multi-user sequence detector (MUSD) [1], spreading codes are often unnecessary in the AWGN channel; the MUSD can separate interfering packets of data using the same symbol pulse. A bit error probability of 10−4 is attained at signal-to-noise ratios of 12 to 30 dB provided the packets are offset slightly. The offset may be considered as a probable outcome in many systems, with failure (collision) occurring when the offset is too small. Alternatively, the desired offset may be designed into the system in a more controlled way. A generalization of ALOHA is given where ‘slot’-collisions are replaced by ‘subslot’-collisions. Throughputs obtained depend on the complexity available. For example, relative to a single user continuously transmitting, 91% throughput is achieved with 4 subslots, which requires an 8-state VerdÚ-Viterbi trellis detection algorithm, while 159% throughput is achieved with 10 subslots, requiring 512 states. Potentially, systems with K-subslots obtain K carrier-sense channels when carrier-sensing is available for each subslot.

This work is based on writings found in the Ph.D. thesis of the first author

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. VerdÚ, “Minimum Probability of Error for Asynchronous Gaussian Multiple-Access Channels,” IEEE Trans. Inform. Theory, vol. IT-32, pp. 85–96, Jan. 1986.

    Article  Google Scholar 

  2. R. Lupas and S. VerdÚ, “Near-Far Resistance of Multiuser Detectors in Asynchronous Channels,” IEEE Trans. Commun., vol. COM-38, pp. 496–508, April 1990.

    Google Scholar 

  3. M. K. Varanasi and B. Aazhang, “Multistage Detection in Asynchronous Code-Division Multiple-Access Communications,” IEEE Trans. Commun., vol. COM-38, pp. 509–519, April 1990.

    Google Scholar 

  4. Z. Xie, C. K. Rushforth, and S. R. T., “Multiuser Signal Detection Using Sequential Decoding,” IEEE Trans. Commun., vol. COM-38, pp. 578–583, May 1990.

    Google Scholar 

  5. R. M. Metcalfe and D. R. Boggs, “Ethernet: Distributed Packet Switching for Local Computer Networks,” Commun. ACM, vol. 19, pp. 395–404, July 1976.

    Google Scholar 

  6. G. D. Forney, “Maximum Likelihood Sequence Estimation of Digital Sequences in the Presence of Intersymbol Interference,” IEEE Trans. Inform. Theory, vol. IT-18, pp. 363–378, May 1972.

    Google Scholar 

  7. J. G. Proakis, Digital Communications. New York: McGraw-Hill, Inc., 1983.

    Google Scholar 

  8. W. A. Rosenkrantz and D. Towsley, “On the Instability of the Slotted ALOHA Multiaccess Algorithm,” IEEE Trans. Automat. Contr., vol. 28, pp. 994–996, 1983.

    Google Scholar 

  9. S. M. Ross, Introduction to Probability Models. San Diego, CA.: Academic Press, Inc., 4th ed., 1989.

    Google Scholar 

  10. S. Ghez, S. Verdu, and S. C. Schwartz, “Optimal Decentralized Control in the Random Access Multipacket Channel,” IEEE Trans. Automat. Contr., vol. 34, pp. 1153–1163, Nov. 1989.

    Google Scholar 

  11. J. L. Massey, “Some New Approaches to Random-Access Communications,” in Performance '87, also in Multiple-Access Communications, N. Abramson, Ed., pp. 354–368, pp. 551–569, 1988.

    Google Scholar 

  12. S. Ghez, S. Verdu, and S. C. Schwartz, “Stability Properties of Slotted Aloha with Multipacket Reception Capability,” IEEE Trans. Automat. Contr., vol. 33, pp. 640–649, July 1988.

    MathSciNet  Google Scholar 

  13. N. Mahravari, “Random-Access Communication with Multiple Reception,” IEEE Trans. Inform. Theory, vol. IT-36, pp. 614–622, May 1990.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

T. Aaron Gulliver Norman P. Secord

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fergus Ross, J.A., Taylor, D.P. (1994). Throughput increase of ALOHA-based systems with multiuser sequence detection. In: Gulliver, T.A., Secord, N.P. (eds) Information Theory and Applications. ITA 1993. Lecture Notes in Computer Science, vol 793. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57936-2_49

Download citation

  • DOI: https://doi.org/10.1007/3-540-57936-2_49

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57936-6

  • Online ISBN: 978-3-540-48392-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics