Abstract
A new encoding technique for low density parity check (LDPC) code at the uplink of 3rd Generation Partnership Project Long Term Evolution (3GPP LTE) is proposed. The concept of approximate lower triangulation (ALT) is used where the parity check matrix is preprocessed and encoded in O(n) complexity. This encoding technique is applied in the uplink of LTE system where single carrier frequency division multiple access (SC-FDMA) is used as the multiple access scheme. As the encoding is performed in a O(n) complexity, it will outperform the existing LDPC encoding which is not used in LTE uplink due to its high encoding complexity. The proposed encoding is simulated in the SCFDMA scenario and the BER curve is shown.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cimini Jr., L.J.: Analysis and Simulation of a Digital Mobile Channel Using Orthogonal Frequency Division Multipexing. IEEE Trans. Commun. 33(7), 665–675 (1985)
Ekstrom, H., Furuskar, A., Karlsson, J., Meyer, M., Parkvall, S., Torsner, J., Wahlqvist, M.: Technical Solutions for the 3G Long-Term Evolution. IEEE Commun. Mag. 44(3), 38–45 (2006)
Gallager, R.G.: Low Density Parity Check Codes. IRE transactions on Information Theory IT-8, 21–28 (1962)
Gallager, R.G.: Low-Density Parity-Check Codes. MIT Press, MA (1963)
Mackay, D.J.C., Neal, R.M.: Near Shannon limit performance of low density parity check codes. IEE Electron Letter 32(18), 1645–1646 (1996)
Mackay, D.J.C.: Good error-correcting codes based on very sparse matrices. IEEE Trans. Inform. Theory IT-45(2), 399–431 (1999)
Wiberg, N.: Codes and decoding on general graphs. Linkoeping studies in science and technology (440) (1996)
Richardson, T.J., Shokrollahi, A., Urbanke, R.: Design of capacity approaching low-density parity-check codes. IEEE Trans. Inform. Theory 47, 619–637 (2001)
Luby, M., Mitzenmacher, M., Shokrollahi, A., Spielman, D.: Analysis of low density codes and improved designs using irregular graphs. In: Proc. 30th Annu. ACM Symp. Theory of computing, pp. 249–258 (1998)
Kschischang, F.R.: Codes defined of graphs. IEEE Commun. Mag. 41(8), 118–125 (2003)
Luby, M., Mitzenmacher, M., Shokrollahi, A., Spielman, D., Stemann, V.: Practical loss-resilient codes. In: Proc. 29th Annual ACM Symp. Theory of Computing, pp. 150–159 (1997)
Sipser, M., Spielman, D.: Expander codes. IEEE Trans. Inform. Theory 42, 1710–1722 (1996)
MacKay, D.J.C., Wilson, S.T., Davey, M.C.: Comparison of constructions of irregular Gallager codes. In: Proc. 36th Allerton Conf. Communication, Control, and Computing (September 1998)
Richardson, T.J., Urbanke, R.: Efficient encoding of low-density parity-check codes. IEEE Trans. Inform. Theory 47(2), 638–656 (2001)
Lin, S., Costello, D.J.: Error control coding. Pearson prentice hall, London (2004)
Nee, R.V., Prasad, R.: OFDM for wireless multimedia communications. Artech House (2000)
Luby, M., Mitzenmacher, M., Shokrollahi, A., Spielman, D.: Improved low-density parity-check codes using irregular graphs. IEEE Trans. Inf. Theory 47(2), 585–598 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Islam, M.R., Kim, J. (2009). Low Density Parity Check Code for the Single Carrier Frequency Division Multiple Access. In: Lee, Yh., Kim, Th., Fang, Wc., Ślęzak, D. (eds) Future Generation Information Technology. FGIT 2009. Lecture Notes in Computer Science, vol 5899. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10509-8_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-10509-8_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10508-1
Online ISBN: 978-3-642-10509-8
eBook Packages: Computer ScienceComputer Science (R0)