Abstract
We consider a multiple-access system in which each user is given q out of Q available subchannels (q ≪ Q). We investigate capacities of two channels emerging in the system under consideration in the case of single-user reception. These channels can be considered as modifications of the A-channel. In the first case we assume that a signal transmitted by a certain user is always registered by the receiver. Thus, activity of other users is the only obstacle to correct reception of information transmitted by a certain user in the multiple-access system. In the second case we assume that the output of each subchannel is inverted with probability p. Analytical expressions (both asymptotic and nonasymptotic) are derived and investigated.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
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.
Tsang, T.K.K. and El-Gamal, M.N., Ultra-Wideband (UWB) Communications Systems: An Overview, in Proc. 3rd Int. IEEE-NEWCAS Conf., Quebec City, Canada, 2005, pp. 381–386.
Witrisal, K., Leus, G., Janssen, G.J.M., Pausini, M., Troesch, F., Zasowski, T., and Romme, J., Noncoherent Ultra-Wideband Systems, IEEE Signal Process. Mag., 2009, vol. 26, no. 4, pp. 48–66.
Zigangirov, K.Sh., Popov, S.A., and Chepyzhov, V.V., Nonbinary Convolutional Coding in Channels with Jamming, Probl. Peredachi Inf., 1995, vol. 31, no. 2, pp. 84–101 [Probl. Inf. Trans. (Engl. Transl.), 1995, vol. 31, no. 2, pp. 169–183].
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].
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].
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].
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.
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].
Zigangirov, K.Sh., Theory of Code Division Multiple Access Communication, Piscataway: Wiley — IEEE Press, 2004.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © D.S. Osipov, A.A. Frolov, V.V. Zyablov, 2013, published in Problemy Peredachi Informatsii, 2013, Vol. 49, No. 4, pp. 13–27.
Supported in part by the Russian Foundation for Basic Research, project no. 12-07-31035-mol a.
Rights and permissions
About this article
Cite this article
Osipov, D.S., Frolov, A.A. & Zyablov, V.V. On the user capacity for a multiple-access system in a vector disjunctive channel with errors. Probl Inf Transm 49, 308–321 (2013). https://doi.org/10.1134/S0032946013040029
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S0032946013040029