On the capacity of a multiple-access vector adder channel

Abstract

We investigate the capacity of the Q-frequency S-user vector adder channel (channel with intensity information) introduced by Chang and Wolf. Both coordinated and uncoordinated types of transmission are considered. Asymptotic (under the conditions Q → ∞, S = γQ, 0 < γ < ∞) upper and lower bounds on the relative (per subchannel) capacity are derived. The lower bound for the coordinated case is shown to increase with γ. At the same time, the relative capacity for the uncoordinated case is upper bounded by a constant.

This is a preview of subscription content, access via your institution.

References

  1. 1.

    Chang, S.-C. and Wolf, J.K., On the T -User M-Frequency Noiseless Multiple-Access Channels with and without Intensity Information, IEEE Trans. Inform. Theory, 1981, vol. 27, no. 1, pp. 41–48.

    Article  MATH  MathSciNet  Google Scholar 

  2. 2.

    Bassalygo, L.A. and Pinsker, M.S., Evaluation of the Asymptotics of the Summarized Capacity of an M-Frequency T -User Noiseless Multiple-Access Channel, Probl. Peredachi Inf., 2000, vol. 36, no. 2, pp. 3–9 [Probl. Inf. Trans. (Engl. Transl.), 2000, vol. 36, no. 2, pp. 91–97]..

    MathSciNet  Google Scholar 

  3. 3.

    Wilhelmsson, L. and Zigangirov, K.Sh., On the Asymptotic Capacity of a Multiple-Access Channel, Probl. Peredachi Inf., 1997, vol. 33, no. 1, pp. 12–20 [Probl. Inf. Trans. (Engl. Transl.), 1997, vol. 33, no. 1, pp. 9–16].

    MathSciNet  Google Scholar 

  4. 4.

    Gober, P. and Han Vinck, A.J., Note on “On the Asymptotic Capacity of a Multiple-Access Channel” by L. Wilhelmsson and K.Sh. Zigangirov, Probl. Peredachi Inf., 2000, vol. 36, no. 1, pp. 21–25 [Probl. Inf. Trans. (Engl. Transl.), 2000, vol. 36, no. 1, pp. 19–22].

    Google Scholar 

  5. 5.

    Han Vinck, A.J., Keuning, J., and Kim, S.W., On the Capacity for the T -User M-Frequency Noiseless Multiple Access Channel without Intensity Information, Proc. 1995 IEEE Int. Sympos. on Information Theory, Whistler, BC, Canada, Sept. 17–22, 1995, pp. 444.

  6. 6.

    Han Vinck, A.J. and Keuning, J., On the Capacity of the Asynchronous T -User M-Frequency Noiseless Multiple-Access Channel without Intensity Information, IEEE Trans. Inform. Theory, 1996, vol. 42, no. 6, pp. 2235–2238.

    Article  MATH  Google Scholar 

  7. 7.

    Gober, P., Han Vinck, A.J., and Coetzee, S., A New Approach to Uncoordinated Frequency Hopping Multiple-Access Communication, Proc. 1998 IEEE Int. Sympos. on Information Theory, MIT, Cambridge, MA, USA, Aug. 16–21, 1998, pp. 403.

  8. 8.

    Cohen, A., Heller, J., and Viterbi, A.J., A New Coding Technique for Asynchronous Multiple Access Communication, IEEE Trans. Commun. Technology, 1971, vol. 19, no. 5, pp. 849–855.

    Article  Google Scholar 

  9. 9.

    Viterbi, A.J., Very Low Rate Convolutional Codes for Maximum Theoretical Performance of Spread-Spectrum Multiple Access Channels, IEEE J. Select. Areas Commun., 1990, vol. 8, no. 8, pp. 641–649.

    Article  Google Scholar 

  10. 10.

    Osipov, D.S., Frolov, A.A., and Zyablov, V.V., Multiple Access System for a Vector Disjunctive Channel, Probl. Peredachi Inf., 2012, vol. 48, no. 3, pp. 52–59 [Probl. Inf. Trans. (Engl. Transl.), 2012, vol. 48, no. 3, pp. 243–249].

    Google Scholar 

  11. 11.

    Frolov, A., Zyablov, V., Sidorenko, V., and Fischer, R., On a Multiple-Access in a Vector Disjunctive Channel, Proc. 2013 IEEE Int. Sympos. on Information Theory (ISIT’2013), Istanbul, Turkey, July 7–12, 2013, pp. 211–215.

  12. 12.

    Chang, S.C. and Weldon, E.J., Jr., Coding for T -User Multiple-Access Channels, IEEE Trans. Inform. Theory, 1979, vol. 25, no. 6, pp. 684–691.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Affiliations

Authors

Corresponding author

Correspondence to A. A. Frolov.

Additional information

Original Russian Text © A.A. Frolov, V.V. Zyablov, 2014, published in Problemy Peredachi Informatsii, 2014, Vol. 50, No. 2, pp. 20–30.

Supported in part by the Russian Foundation for Basic Research, project no. 13-01-12458-ofi-m2.

In the literature, the terms “synchronous” and “asynchronous” are also used.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Frolov, A.A., Zyablov, V.V. On the capacity of a multiple-access vector adder channel. Probl Inf Transm 50, 133–143 (2014). https://doi.org/10.1134/S0032946014020021

Download citation

Keywords

  • Information Transmission
  • Multiple Access
  • Convolutional Code
  • Channel Output
  • Intensity Information