Escolar Documentos
Profissional Documentos
Cultura Documentos
fading Channel
Maw-Yang Liu1, Chien-Hsien Chiang1, Chia-Fu Yang2, and Yi-Min Tsai2
Department of Electrical Engineering1
National Ilan University, Taiwan1
Public Television Service Foundation, Taiwan2
myliu@niu.edu.tw
1963 [5]. Lately, it has been re-discovered by MacKay and
Neal [6]. Gallager demonstrated that these codes was
processed on tracking the probability density or distribution of
the extrinsic information exchanged during the messagepassing decoding rules, and it can approach Shannon limit
while increasing code length [7]. Furthermore, Gallager
proposed a practical iterative algorithm that used extrinsic
information exchanged between bit nodes and check nodes for
decoding these codes [7]. Briefly, LDPC codes are linear block
codes whose parity check matrix is very sparse. BCH code is a
cyclic code that is constructed from Galois field. It was
proposed by Hocquenghem in 1959, but independently it was
also discovered by Bose and Ray-Chaudhuri in 1960 [8]. There
is a great deal of decoding algorithm for BCH code;
Berlekamp, Massey, Chien, Forney, and the others [9].
I. Introduction
Recently, novel digital terrestrial television (DTT)
broadcasting system can achieve high-speed data rate with
carrying high quality video over very bad transmission
environments. Such system employs orthogonal frequency
division multiplexing (OFDM) technique that provides a new
approach to achieve the high-speed transmission under 64QAM and 256-QAM modulation. Due to the high spectral
efficiency of M-QAM, the net data rates can be greatly
increased. OFDM techniques have been also exploited in many
communication systems, such as IEEE 802.16m wirelessMAN-Advanced (Wimax2), the asymmetric digital subscriber
loop (ADSL), and IEEE 802.11n, etc. [1][2]. Communication
system adopts this technique that can be useful to challenge the
carry out of Hi-definition televisions.
II.
c
978-1-4799-4315-9/14/$31.00 2014
IEEE
System Description
193
Source
Coding
BCH code
Encoder
LDPC code
Encoder
Rayleigh Fading
Channel
Source
Decoding
BCH code
Decoder
LDPC code
Decoder
Fig. 1: Proposed LDPC coding scheme for OFDM with QAM mapping over
Rayleigh channel.
p (r ) =
r2
)
2 2
(1)
194
x =G T s (2)
Here, s stands for message vector; G T are decomposed
from the parity check matrix H; in other words, H= G T . For
general encoding of linear block code, the generator matrix G
is produced in advance. However, the generator matrix G of
LDPC code is so huge; hence, we try to use the differential
coding technique to utilize parity check matrix H for
generating codeword instead of generator matrix G. For
differential coding, the parity check matrix can be represented
as H=[H1|H2], and the data sequence is transmitted and
processed by the logical combinations of the current bit and the
previous bit [15].
LDPC code can be represented by Tanner graph that is
composed of two sets of nodes. The first set consists of N bit
nodes to stand for the N bits of a codeword. The second set is
comprised of M nodes which represents the parity constraint
that associated with a parity check matrix H. The message is
sent from N bit nodes to check nodes in H; checking message
will be send back from check node to information codeword in
next loop. The iterations stop until all judgments of error
message is corrected in bipartite graph or information updates
completely at the iteration numbers [16]. In this paper, we
employ soft decision for LDPC decoding, which is based on
message passing rule with LLR [8].
In the following, we will present the trial measurement of
the proposed system architecture. The block diagram for trial
measurement is shown in Fig. 2. In this measuring system,
digital signal with QAM/OFDM is generated by ROHDE &
SCHWARZ BTC Broadcast Test Center (R&S BTC) and
receiver demodulates the real time signal from ROHDE &
SCHWARZ ETL TV Analyzer (R&S ETL) professional
testing machine. Owing to the functionality of testing
equipment, the system performance is demonstrated with the
C/N ratio (carrier to noise ratio). Also, the measuring result
format for the inner code (i.e. LDPC code) is bit error rate
(BER), while the outer code (i.e. BCH code) is frame error rate
(FER). Therefore, performance with BER is demonstrated
before BCH. This can also clearly reflect the powerful coding
195
[6]
[7]
[8]
[9]
[10]
[11]
[12]
[13]
[14]
[15]
[16]
References
[1]
[2]
[3]
[4]
[5]
196