Professional Documents
Culture Documents
1
Figure 3. Without Channel Coding
2
and is then modulated. The symbols are 1962. However, these codes were neglected for
transmitted over multiple transmitters. These more than 30 years, since the hardware at that
symbols travel through the channel involving time could not attain the requirements needed
the AWGN and Rayleigh fading. The Rayleigh by the encoding process [10]. With the
fading is a statiscally model for the effecvt of increased capacity of computers and the
propogation environment on a radio signal development of relevant theories such as the
such as that used by the wireless devices. In the belief propagation algorithm and Turbo codes,
given channel which is being received at the LDPC codes were rediscovered by Mackay and
receiver which later produces a data as same as Neal in 1996. In the last decade, researchers
the data input.The received signal r can be have made great progress in the study of LDPC
written as: codes.
r=α*t+n (1)
A low-density parity-check (LDPC) code is
where, α → fading amplitude otherwise known as linear error correcting
t → transmitted channel symbol code. It is a method of transmitting a message
n → AWGN over a noisy transmission channel. LDPC codes
Various factors such as environmental are widely used in applications which require
changes,buildings, obstacles,etc in the real reliable and highly efficient inorder to transfer
time affect the channel with the variation of the information in the presence of corrupting
time which results in the scattering of signals. noise. There are two obvious characteristics for
Thus, we assume the channel model to be LDPC codes:
having a Rayleigh fading model, which seems • Parity-check: LDPC codes are represented
to be a reasonable channel model. In addition to by a parity-check matrix H, where H is a
that, we assume an additive white Gaussian binary matrix that, must satisfy cH T= 0, where
noise (AWGN) channel model to represent a c is a codeword.
noisy channel. The system model is represented • Low-density: H is a sparse matrix (i.e. the
as: number of ‘1’s is much lower than the number
y=Hx+N (2) of ‘0’s). It is the sparseness of H that
guarantees the low computing complexity.
where H represents the Rayleigh channel in a
matrix form, consisting of all the channel Consider a massive MIMO system with nT
parameters corresponding to their channel path. transmit antennas and nR receive antennas. A
N represents an AWGN channel. The error K-bit information sequence b is encoded to a N-
status of both the system is considered and bit LDPC codeword u with the code rate of R =
compared. K/N. Then, N coded bits are modulated as Mo-
ary QAM symbols to be transmitted by nT
III. CHANNEL CODING transmit antennas using a spatial multiplexing
over Nch channel uses. Note that nT symbols
Channel coding, also called forward error are transmitted at each channel use resulting in
control coding (FECC), is a process of
detecting and correcting bit errors in digital 𝐍
communication systems. Channel coding is 𝑵𝒄𝒉 =
𝒏𝑻𝐥𝐨𝐠𝟐𝑴𝒐
functioned both at the transmitter and at the
receiver. At the transmitter side, channel The MIMO system at the lth channel use is
coding is referred to as encoder, where extra expressed as:
parity bits are added with the original data
before modulation [7]. At the receiver side, y(l) = H(l)x(l) + w(l) (3)
channel coding is referred to as the decoder,
where it detect and correct errors. where l = 1, 2, _ _ _ , Nch and entries of w(l) are
independent and identically distributed zero-
A. Low-Density Parity Code mean circular symmetric complex white
Low-density parity-check (LDPC) codes are Gaussian with variance of σ2, and entries of H(l)
a class of linear block error correction codes are circular symmetric complex Gaussian with
(ECC) providing near-capacity performance. zero mean and unit variance. The real-valued
They were invented by Robert Gallager in representation of Equation (3) is written by:
3
It is known that the BER is better for channel
y̅ (l) = H̅ (l) x̅ (l) + w̅ (l) (4) using coding compared with the channel
without coding.The simulation results for
The receiver of massive MIMO system with the 16x16 and 32x32 is as Figure 6 and 7.
real-valued representation given in Equation(4)
can be expressed by a bipartite graph shown in Here in Figure 6, considering 10dB BER range,
Figure 5. The receiver consists of a detector and for uncoded system the range is between is 10-2
a decoder which exchange messages with each to 10-1 whereas for the LDPC coded system the
other iteratively by joint detection and range is at 10-3. It can be seen that there is a
decoding. The detector is composed of Nch difference of 0.099 between both the systems.
detector nodes, DETl , l = 1, ..., Nch, while the
decoder is composed of N variable nodes, v1, ..., In Figure 7, considering 20dB BER range, the
vN, and N - K check nodes, c1, ... , cN-K . Each range of uncoded system is between 10-6 to
detector node DETl is composed of 2nR 10-5, whereas for LDPC coded system the range
observation nodes, o1(l), ... , o2nR(l), and 2nT is between 10-3 to 10-2. There is a difference of
middle nodes, m1(l) ,... ,m2nT(l), connected 0.009999 between both the systems.
through edges. Each middle node is connected
to log2√Mo variable nodes, where each real-
valued symbol is generated from log2√Mo bits.
We define variable super-nodes, v1,..., vNch,
each of which is a group of variable nodes
associated with symbols transmitted at each
channel use. Signals y̅(1), ..., y̅(Nch) received over
Nch channel uses are input to detector nodes
DET1, ..., DETNch , respectively.
4
Thus considering both the Figure 6 and Figure Codes and Convolution Codes Over AWGN
7 it can be seen that, the performance of BER Channel”, International Journal of Pure and
for LDPC is better when compared with Applied Mathematics Volume 114 No. 11
uncoded systems. 2017.