Abstract
The paper addresses the problem of constructing an asynchronous multiple access system for a multiuser Q-frequency channel with additive white gaussian noise (AWGN). To solve the problem we propose a coding scheme for the channel. The major component of the scheme is non-binary low-density parity-check (LDPC) code. To increase the transmission rate we introduce the embedded modulation. The efficiency of the resulting multiple-access system is shown by simulations.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. J. Viterbi, “Very low rate convolutional codes for maximum theoretical performance of spread-spectrum multiple access channels,” IEEE J. Sel. Areas Commun. 8, 641–649 (1990).
A. Cohen, J. Heller, and A. J. Viterbi, “A new coding technique for asynchronous multiple access communication,” IEEE Trans. Commun. Technol. 19, 849–855 (1971).
D. S. Osipov, A. A. Frolov, and V. V. Zyablov, “Multiple access system for a vector disjunctive channel,” Probl. Inf. Transm. 48, 243–249 (2012).
V. R. Sidorenko and R. Fischer, “Low-complexity list decoding of Reed-Solomon coded pulse position modulation,” in Proc. 9th Int. ITG Conf. on Systems, Communication and Coding, Munich, Germany(SCC 2013), Jan. 21–24, 2013 (ITG, Munich, 2013).
A. A. Frolov, V. V. Zyablov, V. R. Sidorenko, and R. Fischer, “On a multiple-access in a vector disjunctive channel,” in Proc. IEEE Int. Symp. Inf. Theory, Istanbul, Turkey, July, 2013 (IEEE, New York, 2013), pp. 211–215.
W. Kautz and R. Singleton, “Nonrandom binary super-imposed codes,” IEEE Trans. Inf. Theory, 363–377 (1964).
R. G. Gallager, Low-Density Parity-Check Codes (MIT Press, Cambridge, 1963).
M. Davey and D. J. C. MacKay, “Low density parity check codes over GF(q),” IEEE Commun. Lett. 2, 165–167 (1998).
K. A. Kondrashov and V. B. Afanassiev, “Ordered statistics decoding for semi-orthogonal linear block codes over random non-Gaussian channels,” in Proc. 13th Int. Workshop on Algebraic and Combinatorial Coding Theory (ACCT 2012), Pomorie, Bulgaria, June 15–21, 2012 (Institute of Mathematics and Informatics, Bulgaria BAS, 2012), pp. 192–196.
A. A. Frolov and V. V. Zyablov, “Asymptotic estimation of the fraction of errors correctable by q-ary ldpc codes,” Probl. Inf. Transm. 46, 142–159 (2010).
L. Barnault and D. Declercq, “Fast Decoding Algorithm for LDPC over \(GF(2\hat q)\),” in Proc. Inf. Theory Workshop, Paris, France, March, 2003 (IEEE, New York, 2003), pp. 70–73.
H. Wymeersch, H. Steendam, and M. Moeneclaey, “Log-domain decoding of LDPC codes over GF(q),” in Proc. IEEE Int. Conf. on Commun., Paris, France, June 20–24, 2004 (IEEE, New York, 2004), pp. 772–776.
D. Declercq and M. Fossorier, “Decoding Algorithms for Nonbinary LDPC Codes Over GF(q),” IEEE Trans. Commun. 55, 633–643 (2007).
Xiao-Yu Hu, E. Eleftheriou, and D.-M. Arnold, “Regular and irregular progressive edge-growth tanner graphs,” IEEE Trans. Inf. Theory. 51, 386–398 (2005).
Author information
Authors and Affiliations
Corresponding author
Additional information
Published in Russian in Informatsionnye Protsessy, 2014, Vol. 14, No. 2, pp. 151–159.
The article was translated by the authors.
Rights and permissions
About this article
Cite this article
Frolov, A.A., Zyablov, V.V. A coding technique for Q-frequency S-user gaussian channel. J. Commun. Technol. Electron. 59, 1483–1488 (2014). https://doi.org/10.1134/S1064226914120055
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1064226914120055