Scribd
Upload
27 views2 pages

Low Density Parity Check Code For The Single Carrier Frequency Division Multiple Access

The document proposes a new low complexity encoding technique for low density parity check (LDPC) codes to be used in the uplink of 3GPP LTE systems that use single carrier frequency division multiple access (SC-FDMA). The encoding technique uses approximate lower triangulation (ALT) to preprocess the parity check matrix, allowing encoding to be performed with O(n) linear complexity, outperforming existing LDPC encoding that is not used in LTE uplink due to its high complexity. Simulation results show the BER performance of the proposed low complexity LDPC encoding technique for SC-FDMA systems.

Uploaded by

Rafiul Kadir
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
27 views2 pages

Low Density Parity Check Code For The Single Carrier Frequency Division Multiple Access

The document proposes a new low complexity encoding technique for low density parity check (LDPC) codes to be used in the uplink of 3GPP LTE systems that use single carrier frequency division multiple access (SC-FDMA). The encoding technique uses approximate lower triangulation (ALT) to preprocess the parity check matrix, allowing encoding to be performed with O(n) linear complexity, outperforming existing LDPC encoding that is not used in LTE uplink due to its high complexity. Simulation results show the BER performance of the proposed low complexity LDPC encoding technique for SC-FDMA systems.

Uploaded by

Rafiul Kadir
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Low Density Parity Check Code for the Single

Carrier Frequency Division Multiple Access

Mohammad Rakibul Islam and Jinsang Kim

Dept. of Electronics and Radio Engineering Kyung Hee University


1 Seocheon, Kihung, Yongin, Gyeonggi, 449-701, Korea
rakibultowhid@yahoo.com

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 pre-
processed and encoded in O(n) complexity. This encoding technique is
applied in the uplink of LTE system where single carrier frequency divi-
sion 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.

Keywords: SC-FDMA, LTE, LDPC, ALT, low complexity.

1 Introduction
Orthogonal frequency division multiplexing (OFDM) has become widely ac-
cepted primarily because of its robustness against frequency selective fading
channels which are common in broadband mobile wireless communications [1].
Orthogonal frequency division multiple access (OFDMA) is a multiple access
scheme used to accommodate multiple simultaneous users. Despite the benefits
of OFDM and OFDMA, they suffer the drawback of high peak to average power
ratio (PAPR) and hence the single carrier frequency division multiple access (SC-
FDMA) is introduced which utilizes single carrier modulation and frequency do-
main equalization. SC-FDMA has similar performance and essentially the same
overall complexity as those of OFDMA system and has been adopted as the
uplink multiple access scheme for the 3rd Generation Partnership Project Long
Term Evolution (3GPP LTE) [2]. Turbo code is used in the SCFDMA system
as a tool for channel coding. But the turbo code suffers from the high decoding
complexity and relatively high latency, which make them unsuitable for some
applications. As SC-FDMA is used in the uplink of LTE system, Low density
parity check (LDPC) code can offer a potential candidacy in this regard. The
increase in hardware speed has made the choice of LDPC code very attractive for
wired and wireless systems. The remarkable performance of LDPC code has po-
sitioned them in many emerging digital communication systems, such as IEEE

Y.-h. Lee et al. (Eds.): FGIT 2009, LNCS 5899, pp. 246–253, 2009.

c Springer-Verlag Berlin Heidelberg 2009
LDPC code for the SC-FDMA 247

802.11n and 802.16e. LDPC codes were invented in 1962 by Robert Gallager
[3,4]. After the introduction of turbo codes, it was rediscovered by Mackay and
Neal [5,6] and Wiberg [7] in the late 90’s. Gallager considered only regular LDPC
codes. Regular codes are those which are represented by a sparse parity check
matrix with a constant number of ’ones’ (weight) in each column and in each
row. In the case of irregular LDPC codes, both weights become non-uniform and
performance of LDPC codes improves [8,9]. For a long time, encoding has been
considered as a less complex operation than decoding. Therefore, major efforts
have been given to reduce the decoding complexity and very little attention is
given to the encoding side. But the sparse structure of parity check matrix in
LDPC codes helps the belief propagation algorithm to estimate the transmitted
codeword with relatively small number of iterations which make the decoding
almost linear. Therefore encoding becomes more complicated operations than
decoding and hence, the encoding of LDPC gains the attention of recent re-
searchers. For the application of LDPC code in SCFDMA also encourages low
complexity encoding. The encoder implementation for an LDPC code has com-
plexity quadratic in the block length and to encode it in linear time remains
the challenging issue. It was suggested in [11] and [12] to use cascaded graphs
rather than bipartite graphs. To construct a code which can be encodable and
decodable in linear time, one has to choose the number of stages and the relative
size of each stage carefully. One weakness of this approach is that each stage has
considerably smaller length than the length of the overall code and results in
some performance loss compared to the standard LDPC code. It was suggested
in [13] to force the parity-check matrix to have almost lower triangular form. It
states that the ensemble of codes is restricted by the degree constraints as well as
by the constraint that the parity-check matrix has lower triangular shape. This
restriction confirms the encoding complexity in a linear time but, in general,
could not prevent some loss of performance. An LDPC encoding scheme with a
complexity O(n + g 2 ) was proposed in [14] where the authors developed a spe-
cial structure for the parity check matrix using approximate lower triangulation
(ALT). This makes the encoding almost linear when the associated coefficient g
can be kept quite small. But the larger gap makes the encoding complexity far
from linear.
The aim of this paper is to construct an LDPC code which can be encoded
with a O(n) complexity linear encoding by converting the parity check matrix
into an ALT form with some post processing steps. The rows of the parity
check matrix forming the ALT part are kept unchanged while deleting the other
rows. In this way the resultant H matrix will have same number of columns
but reduced number of rows and the codeword length remains same. In the
codeword, message length will vary depending on the length of the parity bits.
In this proposed scheme, the complexity is less than the well known Richardson
algorithm and the BER performance is almost similar to the Richardson scheme.
As the complexity is reduced, it can be used at the SC-FDMA system.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy