TRANSMITTER APPARATUS AND BIT INTERLEAVING METHOD THEREOF

0Associated
Cases 
0Associated
Defendants 
0Accused
Products 
0Forward
Citations 
0
Petitions 
0
Assignments
First Claim
1. A receiving apparatus comprising:
 a receiver configured to receive a signal from a transmitting apparatus;
a demodulator configured to demodulate the signal to generate values according to a 16quadrature amplitude modulation (QAM);
a deinterleaver configured to split the values into a plurality of groups and deinterleave the plurality of groups to provide deinterleaved values; and
a decoder configured to decode the deinterleaved values based on a low density parity check (LDPC) code having a code rate being 5/15 and a code length being 16200 bits,wherein the plurality of groups are deinterleaved based on a following equation;
Yπ
(j)=Xj for (0≤
j<
N_{group}),where X_{j }is a j^{th }group among the plurality of groups, Y_{j }is a j^{th }group among the deinterleaved plurality of groups, N_{group }is a total number of the plurality of groups, and π
(j) denotes a deinterleaving order for the deinterleaving, andwherein the π
(j) is represented as follows;
0 Assignments
0 Petitions
Accused Products
Abstract
A transmitting apparatus is provided. The transmitting apparatus includes: an encoder configured to generate a lowdensity parity check (LDPC) codeword by LDPC encoding of input bits based on a parity check matrix including information word bits and parity bits, the LDPC codeword including a plurality of bit groups each including a plurality of bits; an interleaver configured to interleave the LDPC codeword; and a modulator configured to map the interleaved LDPC codeword onto a modulation symbol, wherein the interleaver is further configured to interleave the LDPC codeword such that a bit included in a predetermined bit group from among the plurality of bit groups constituting the LDPC codeword onto a predetermined bit of the modulation symbol.
0 Citations
No References
No References
6 Claims
 1. A receiving apparatus comprising:
a receiver configured to receive a signal from a transmitting apparatus; a demodulator configured to demodulate the signal to generate values according to a 16quadrature amplitude modulation (QAM); a deinterleaver configured to split the values into a plurality of groups and deinterleave the plurality of groups to provide deinterleaved values; and a decoder configured to decode the deinterleaved values based on a low density parity check (LDPC) code having a code rate being 5/15 and a code length being 16200 bits, wherein the plurality of groups are deinterleaved based on a following equation;
Yπ
(j)=Xj for (0≤
j<
N_{group}),where X_{j }is a j^{th }group among the plurality of groups, Y_{j }is a j^{th }group among the deinterleaved plurality of groups, N_{group }is a total number of the plurality of groups, and π
(j) denotes a deinterleaving order for the deinterleaving, andwherein the π
(j) is represented as follows; View Dependent Claims (2, 3)
 4. A receiving method comprising:
receiving a signal from a transmitting apparatus; demodulating the signal to generate values according to a 16quadrature amplitude modulation (QAM); splitting the values into a plurality of groups; deinterleaving the plurality of groups to provide deinterleaved values; and decoding the deinterleaved values based on a low density parity check (LDPC) code having a code rate being 5/15 and a code length being 16200 bits, wherein the plurality of groups are deinterleaved based on a following equation;
Yπ
(j)=Xj for (0≤
j<
N_{group}),where X_{j }is a j group among the plurality of groups, Y_{j }is a j^{th }group among the deinterleaved plurality of groups, N_{group }is a total number of the plurality of groups, and π
(j) denotes a deinterleaving order for the deinterleaving, andwherein the π
(j) is represented as follows; View Dependent Claims (5, 6)
1 Specification
This is a Continuation of U.S. application Ser. No. 15/686,280 filed Aug. 25, 2017, which is a Continuation of application Ser. No. 14/716,503 filed May 19, 2015, and claims priority from U.S. Provisional Application No. 62/001,160 filed on May 21, 2014 and Korean Patent Application No. 1020150069924 filed on May 19, 2015, the disclosures of which are incorporated herein by reference in their entirety.
Apparatuses and methods consistent with exemplary embodiments relate to a transmitting apparatus and an interleaving method thereof, and more particularly, to a transmitting apparatus which processes and transmits data, and an interleaving method thereof.
In the 21st century informationoriented society, broadcasting communication services are moving into the era of digitalization, multichannel, wideband, and high quality. In particular, as high quality digital televisions, portable multimedia players and portable broadcasting equipment are increasingly used in recent years, there is an increasing demand for methods for supporting various receiving methods of digital broadcasting services.
In order to meet such demand, standard groups are establishing various standards and are providing a variety of services to satisfy users'"'"' needs. Therefore, there is a need for a method for providing improved services to users with high decoding and receiving performance.
Exemplary embodiments of the inventive concept may overcome the above disadvantages and other disadvantages not described above. However, it is understood that the exemplary embodiment are not required to overcome the disadvantages described above, and may not overcome any of the problems described above.
The exemplary embodiments provide a transmitting apparatus which can map a bit included in a predetermined bit group from among a plurality of bit groups of a low density parity check (LDPC) codeword onto a predetermined bit of a modulation symbol, and transmit the bit, and an interleaving method thereof.
According to an aspect of an exemplary embodiment, there is provided a transmitting apparatus including: an encoder configured to generate an LDPC codeword by LDPC encoding; an interleaver configured to interleave the LDPC codeword; and a modulator configured to map the interleaved LDPC codeword onto a modulation symbol, wherein the modulator is further configured to map a bit included in a predetermined bit group from among a plurality of bit groups constituting the LDPC codeword onto a predetermined bit of the modulation symbol.
Each of the plurality of bit groups may be formed of M number of bits. M may be a common divisor of N_{ldpc }and K_{ldpc }and may be determined to satisfy Q_{ldpc}=(N_{ldpc}−K_{ldpc})/M. In this case, Q_{ldpc }may be a cyclic shift parameter value regarding columns in a column group of an information word submatrix of a parity check matrix, N_{ldpc }may be a length of the LDPC codeword, and K_{ldpc }may be a length of information word bits of the LDPC codeword.
The interleaver may include: a parity interleaver configured to interleave parity bits of the LDPC codeword; a group interleaver configured to divide the parityinterleaved LDPC codeword by the plurality of bit groups and rearrange an order of the plurality of bit groups in bit group wise; and a block interleaver configured to interleave the plurality of bit groups the order of which is rearranged.
The group interleaver may be configured to rearrange the order of the plurality of bit groups in bit group wise by using the following equation:
Y_{j}=X_{π(j) }(0≤j<N_{group})
where X_{j }is a j^{th }bit group before the plurality of bit groups are interleaved, Y_{j }is a j^{th }bit group after the plurality of bit groups are interleaved, N_{group }is a total number of the plurality of bit groups, and π(j) is a parameter indicating an interleaving order.
Here, π(j) may be determined based on at least one of a length of the LDPC codeword, a modulation method, and a code rate.
When the LDPC codeword has a length of 16200, the modulation method is 16QAM, and the code rate is 5/15, π(j) may be defined as in table 15.
The block interleaver may be configured to interleave by writing the plurality of bit groups in each of a plurality of columns in bit group wise in a column direction, and reading each row of the plurality of columns in which the plurality of bit groups are written in bit group wise in a row direction.
The block interleaver may be configured to serially write, in the plurality of columns, at least some bit groups which are writable in the plurality of columns in bit group wise from among the plurality of bit groups, and then divide and write the other bit groups in an area which remains after the at least some bit groups are written in the plurality of columns in bit group wise.
According to an aspect of another exemplary embodiment, there is provided an interleaving method of a transmitting apparatus, including: generating an LDPC codeword by LDPC encoding; interleaving the LDPC codeword; and mapping the interleaved LDPC codeword onto a modulation symbol, wherein the mapping comprises mapping a bit included in a predetermined bit group from among a plurality of bit groups constituting the LDPC codeword onto a predetermined bit of the modulation symbol.
Each of the plurality of bit groups may be formed of M number of bits, and M may be a common divisor of N_{ldpc }and K_{ldpc }and may be determined to satisfy Q_{ldpc}=(N_{ldpc}−K_{ldpc})/M. In this case, Q_{ldpc }may be a cyclic shift parameter value regarding columns in a column group of an information word submatrix of a parity check matrix, N_{ldpc }may be a length of the LDPC codeword, and K_{ldpc }may be a length of information word bits of the LDPC codeword.
The interleaving may include: interleaving parity bits of the LDPC codeword; dividing the parityinterleaved LDPC codeword by the plurality of bit groups and rearranging an order of the plurality of bit groups in bit group wise; and interleaving the plurality of bit groups the order of which is rearranged.
The rearranging in bit group wise may include rearranging the order of the plurality of bit groups in bit group wise by using the following equation:
Y_{j}=X_{π(j) }(0≤j<N_{group})
where X_{j }is a j^{th }a bit group before the plurality of bit groups are interleaved, Y_{j }is a j^{th }bit group after the plurality of bit groups are interleaved, N_{group }is a total number of the plurality of bit groups, and π(j) is a parameter indicating an interleaving order.
Here, π(j) may be determined based on at least one of a length of the LDPC codeword, a modulation method, and a code rate.
When the LDPC codeword has a length of 16200, the modulation method is 16QAM, and the code rate is 5/15, π(j) may be defined as in table 15.
The interleaving the plurality of bit groups may include interleaving by writing the plurality of bit groups in each of a plurality of columns in bit group wise in a column direction, and reading each row of the plurality of columns in which the plurality of bit groups are written in bit group wise in a row direction.
The interleaving the plurality of bit groups may include serially writing, in the plurality of columns, at least some bit groups which are writable in the plurality of columns in bit group wise from among the plurality of bit groups, and then dividing and writing the other bit groups in an area which remains after the at least some bit groups are written in the plurality of columns in bit group wise.
According to various exemplary embodiments, improved decoding and receiving performance can be provided.
The above and/or other aspects will be more apparent by describing in detail exemplary embodiments, with reference to the accompanying drawings, in which:
Hereinafter, various exemplary embodiments will be described in greater detail with reference to the accompanying drawings.
In the following description, same reference numerals are used for the same elements when they are depicted in different drawings. The matters defined in the description, such as detailed construction and elements, are provided to assist in a comprehensive understanding of the exemplary embodiments. Thus, it is apparent that the exemplary embodiments can be carried out without those specifically defined matters. Also, functions or elements known in the related art are not described in detail since they would obscure the exemplary embodiments with unnecessary detail.
According to
The transmitting apparatus 10000 according to an exemplary embodiment illustrated in
The Input Formatting block 11000, 110001 generates a baseband frame (BBFRAME) from an input stream of data to be serviced. Herein, the input stream may be a transport stream (TS), Internet protocol (IP) stream, a generic stream (GS), a generic stream encapsulation (GSE), etc.
The BICM block 12000, 120001 determines a forward error correction (FEC) coding rate and a constellation order depending on a region where the data to be serviced will be transmitted (e.g., a fixed PHY frame or mobile PHY frame), and then, performs encoding. Signaling information on the data to be serviced may be encoded through a separate BICM encoder (not illustrated) or encoded by sharing the BICM encoder 12000, 120001 with the data to be serviced, depending on a system implementation.
The Framing/Interleaving block 13000, 130001 combines time interleaved data with signaling information to generate a transmission frame.
The Waveform Generation block 14000, 140001 generates an OFDM signal in the time domain on the generated transmission frame, modulates the generated OFDM signal to a radio frequency (RF) signal and transmits the modulated RF signal to a receiver.
In the TDM system architecture, there are four main blocks (or parts): the Input Formatting block 11000, the BICM block 12000, the Framing/Interleaving block 13000, and the Waveform Generation block 14000.
Data is input and formatted in the Input Formatting block, and forward error correction applied and mapped to constellations in the BICM block 12000. Interleaving, both time and frequency, and frame creation done in the Framing/Interleaving block 13000. Subsequently, the output waveform is created in the Waveform Generation block 14000.
In the LDM system architecture, there are several different blocks compared with the TDM system architecture. Specifically, there are two separate Input Formatting blocks 11000, 110001 and BICM blocks 12000, 120001, one for each of the layers in LDM. These are combined before the Framing/Interleaving block 13000 in the LDM Injection block. The Waveform Generation block 14000 is similar to TDM.
As illustrated in
Input data packets input to the Input Formatting block 11000 can consist of various types, but at the encapsulation operation these different types of packets become generic packets which configure baseband frames. Here, the format of generic packets is variable. It is possible to easily extract the length of the generic packet from the packet itself without additional information. The maximum length of the generic packet is 64 kB. The maximum length of the generic packet, including header, is four bytes. Generic packets must be of integer byte length.
The scheduler 11200 receives an input stream of encapsulated generic packets and forms them into physical layer pipes (PLPs), in the form of baseband frames. In the abovementioned TDM system there may be only one PLP, called single PLP or SPLP, or there may be multiple PLPs, called MPLP. One service cannot use more than four PLPs. In the case of an LDM system consisting of two layers, two PLPs are used, one for each layer.
The scheduler 11200 receives encapsulated input packet streams and directs how these packets are allocated to physical layer resources. Specifically, the scheduler 11200 directs how the baseband framing block will output baseband frames.
The functional assets of the Scheduler 11200 are defined by data size(s) and time(s). The physical layer can deliver portions of data at these discrete times. The scheduler 11200 uses the inputs and information including encapsulated data packets, quality of service metadata for the encapsulated data packets, a system buffer model, constraints and configuration from system management, and creates a conforming solution in terms of configuration of the physical layer parameters. The corresponding solution is subject to the configuration and control parameters and the aggregate spectrum available.
Meanwhile, the operation of the Scheduler 11200 is constrained by combination of dynamic, quasistatic, and static configurations. The definition of these constraints is left to implementation.
In addition, for each service a maximum of four PLPs shall be used. Multiple services consisting of multiple time interleaving blocks may be constructed, up to a total maximum of 64 PLPs for bandwidths of 6, 7 or 8 MHz. The baseband framing block 11300, as illustrated in
A baseband frame 3500, as illustrated in
The baseband frame header construction block 3200, 32001, . . . 3200n configures the baseband frame header. The baseband frame header 35001, as illustrated in
The main feature of the base header 3710 is to provide a pointer including an offset value in bytes as an initiation of the next generic packet within the baseband frame. When the generic packet initiates the baseband frame, the pointer value becomes zero. If there is no generic packet which is initiated within the baseband frame, the pointer value is 8191, and a 2byte base header may be used.
The extension field (or extension header) 3730 may be used later, for example, for the baseband frame packet counter, baseband frame time stamping, and additional signaling, etc.
The baseband frame scrambling block 3300, 33001, . . . 3300n scrambles the baseband frame.
In order to ensure that the payload data when mapped to constellations does not always map to the same point, such as when the payload mapped to constellations consists of a repetitive sequence, the payload data shall always be scrambled before forward error correction encoding.
The scrambling sequences shall be generated by a 16bit shift register that has 9 feedback taps. Eight of the shift register outputs are selected as a fixed randomizing byte, where each bit from t his byte is used to individually XOR the corresponding input data. The data bits are XORed MSB to MSB and so on until LSB to LSB. The generator polynomial is G(x)=1+X+X^{3}+X^{6}+X^{7}+X^{11}+X^{12}+X^{13}+X^{16}.
As illustrated in
The input to the FEC block 1400, 141001, . . . , 14100n is a Baseband frame, of length K_{payload}, and the output from the FEC block is a FEC frame. The FEC block 14100, 141001, . . . , 14100n is implemented by concatenation of an outer code and an inner code with the information part. The FEC frame has length N_{inner}. There are two different lengths of LDPC code defined: N_{inner}=64800 bits and N_{inner}=16200 bits
The outer code is realized as one of either Bose, RayChaudhuri and Hocquenghem (BCH) outer code, a Cyclic Redundancy Check (CRC) or other code. The inner code is realized as a Low Density Parity Check (LDPC) code. Both BCH and LDPC FEC codes are systematic codes where the information part I contained within the codeword. The resulting codeword is thus a concatenation of information or payload part, BCH or CRC parities and LDPC parities, as shown in
The use of LDPC code is mandatory and is used to provide the redundancy needed for the code detection. There are two different LDPC structures that are defined, these are called Type A and Type B. Type A has a code structure that shows better performance at low code rates while Type B code structure shows better performance at high code rates. In general N_{inner}=64800 bit codes are expected to be employed. However, for applications where latency is critical, or a simpler encoder/decoder structure is preferred, N_{inner}=16200 bit codes may also be used.
The outer code and CRC consist of adding M_{outer }bits to the input baseband frame. The outer BCH code is used to lower the inherent LDPC error floor by correcting a predefined number of bit errors. When using BCH codes the length of M_{outer }is 192 bits (N_{inner}=64800 bit codes) and 168 bits (for N_{inner}=16200 bit codes). When using CRC the length of M_{outer }is 32 bits. When neither BCH nor CRC are used the length of M_{outer }is zero. The outer code may be omitted if it is determined that the error correcting capability of the inner code is sufficient for the application. When there is no outer code the structure of the FEC frame is as shown in
The LDPC codeword of the LDPC encoder, i.e., a FEC Frame, shall be bit interleaved by a Bit Interleaver block 14200. The Bit Interleaver block 14200 includes a parity interleaver 14210, a groupwise interleaver 14220 and a block interleaver 14230. Here, the parity interleaver is not used for Type A and is only used for Type B codes.
The parity interleaver 14210 converts the staircase structure of the paritypart of the LDPC paritycheck matrix into a quasicyclic structure similar to the informationpart of the matrix.
Meanwhile, the parity interleaved LDPC coded bits are split into N_{group}=N_{inner}/360 bit groups, and the groupwise interleaver 14220 rearranges the bit groups.
The block interleaver 14230 block interleaves the groupwise interleaved LDPC codeword.
Specifically, the block interleaver 14230 divides a plurality of columns into part 1 and part 2 based on the number of columns of the block interleaver 14230 and the number of bits of the bit groups. In addition, the block interleaver 14230 writes the bits into each column configuring part 1 column wise, and subsequently writes the bits into each column configuring part 2 column wise, and then reads out row wise the bits written in each column.
In this case, the bits constituting the bit groups in the part 1 may be written into the same column, and the bits constituting the bit groups in the part 2 may be written into at least two columns.
Back to
Each FEC frame shall be mapped to a FEC block by first demultiplexing the input bits into parallel data cell words and then mapping these cell words into constellation values.
As illustrated in
The input to the time interleaving block 14310 and the framing block 14320 may consist of MPLPs however the output of the framing block 14320 is OFDM symbols, which are arranged in frames. The frequency interleaver included in the frequency interleaving block 14330 operates an OFDM symbols.
The time interleaver (TI) configuration included in the time interleaving block 14310 depends on the number of PLPs used. When there is only a single PLP or when LDM is used, a sheer convolutional interleaver is used, while for multiple PLP a hybrid interleaver consisting of a cell interleaver, a block interleaver and a convolutional interleaver is used. The input to the time interleaving block 14310 is a stream of cells output from the mapper block (
The framing block 14320 maps the interleaved frames onto at least one transmitter frame. The framing block 14320, specifically, receives inputs (e.g. data cell) from at least one physical layer pipes and outputs symbols.
In addition, the framing block 14320 creates at least one special symbol known as preamble symbols. These symbols undergo the same processing in the waveform block mentioned later.
As illustrated in
Meanwhile, the purpose of the frequency interleaving block 14330 is to ensure that sustained interference in one part of the spectrum will not degrade the performance of a particular PLP disproportionately compared to other PLPs. The frequency interleaver 14330, operating on the all the data cells of one OFDM symbol, maps the data cells from the framing block 14320 onto the N data carriers.
As illustrated in
The pilot inserting block 14100 inserts a pilot to various cells within the OFDM frame.
Various cells within the OFDM frame are modulated with reference information whose transmitted value is known to the receiver.
Cells containing the reference information are transmitted at a boosted power level. The cells are called scattered, continual, edge, preamble or frameclosing pilot cells. The value of the pilot information is derived from a reference sequence, which is a series of values, one for each transmitted carrier on any given symbol.
The pilots can be used for frame synchronization, frequency synchronization, time synchronization, channel estimation, transmission mode identification and can also be used to follow the phase noise.
The pilots are modulated according to reference information, and the reference sequence is applied to all the pilots (e.g. scattered, continual edge, preamble and frame closing pilots) in every symbol including preamble and the frameclosing symbol of the frame.
The reference information, taken from the reference sequence, is transmitted in scattered pilot cells in every symbol except the preamble and the frameclosing symbol of the frame.
In addition to the scattered pilots described above, a number of continual pilots are inserted in every symbol of the frame except for Preamble and the frameclosing symbol. The number and location of continual pilots depends on both the FFT size and scattered pilot pattern in use.
The MISO block 14200 applies a MISO processing.
The Transmit Diversity Code Filter Set is a MISO predistortion technique that artificially decorrelates signals from multiple transmitters in a Single Frequency Network in order to minimize potential destructive interference. Linear frequency domain filters are used so that the compensation in the receiver can be implemented as part of the equalizer process. The filter design is based on creating allpass filters with minimized crosscorrelation over all filter pairs under the constraints of the number of transmitters M∈{2, 3, 4} and the time domain span of the filters NE {64, 256}. The longer time domain span filters will increase the decorrelation level, but the effective guard interval length will be decreased by the filter time domain span and this should be taken into consideration when choosing a filter set for a particular network topology.
The IFFT block 14300 specifies the OFDM structure to use for each transmission mode. The transmitted signal is organized in frames. Each frame has a duration of T_{F}, and consists of L_{F }OFDM symbols. N frames constitute one superframe. Each symbol is constituted by a set of K_{total }carriers transmitted with a duration Ts. Each symbol is composed of a useful part with duration Tu and a guard interval with a duration A. The guard interval consists of a cyclic continuation of the useful part, Tu, and is inserted before it.
The PAPR block 14400 applies the Peak to Average Power Reduction technique.
The GI inserting block 14500 inserts the guard interval into each frame.
The bootstrap block 14600 prefixes the bootstrap signal to the front of each frame.
The input processing block 11000 includes a scheduler 11200. The BICM block 15000 includes an L signaling generator 15100, an FEC encoder 152001 and 152002, a bit interleaver 153002, a demux 154002, constellation mappers 155001 and 155002. The L signaling generator 15100 may be included in the input processing block 11000, according to an exemplary embodiment.
An n number of service data are mapped to a PLP0 to a PLPn respectively. The scheduler 11200 determines a position, modulation and coding rate for each PLP in order to map a plurality of PLPs to a physical layer of T2. In other words, the scheduler 11200 generates L1 signaling information. The scheduler 11200 may output dynamic field information among L1 post signaling information of a current frame, using the raming/Interleavingblock 13000 (
The L1 signaling generator 15100 may differentiate the L1 pre signaling information from the L1 post signaling information to output them. The FEC encoders 152001 and 152002 perform respective encoding operations which include shortening and puncturing for the L1 pre signaling information and the L1 post signaling information. The bit interleaver 153002 performs interleaving by bit for the encoded L1 post signaling information. The demux 154002 controls robustness of bits by modifying an order of bits constituting cells and outputs the cells which include bits. Two constellation mappers 155001 and 155002 map the L1 pre signaling information and the L1 post signaling information to constellations, respectively. The L1 pre signaling information and the L1 post signaling information processed through the above described processes are output to be included in each frame by the Framing/Interleaving block 13000 (
The apparatus 20000 for receiving broadcast signals according to an embodiment of the present invention can correspond to the apparatus 10000 for transmitting broadcast signals, described with reference to
The synchronization & demodulation module 21000 can receive input signals through m Rx antennas, perform signal detection and synchronization with respect to a system corresponding to the apparatus 20000 for receiving broadcast signals and carry out demodulation corresponding to a reverse procedure of the procedure performed by the apparatus 10000 for transmitting broadcast signals.
The frame parsing module 22000 can parse input signal frames and extract data through which a service selected by a user is transmitted. If the apparatus 10000 for transmitting broadcast signals performs interleaving, the frame parsing module 22000 can carry out deinterleaving corresponding to a reverse procedure of interleaving. In this case, the positions of a signal and data that need to be extracted can be obtained by decoding data output from the signaling decoding module 25200 to restore scheduling information generated by the apparatus 10000 for transmitting broadcast signals.
The demapping & decoding module 23000 can convert the input signals into bit domain data and then deinterleave the same as necessary. The demapping & decoding module 23000 can perform demapping for mapping applied for transmission efficiency and correct an error generated on a transmission channel through decoding. In this case, the demapping & decoding module 23000 can obtain transmission parameters necessary for demapping and decoding by decoding the data output from the signaling decoding module 25000.
The output processor 24000 can perform reverse procedures of various compression/signal processing procedures which are applied by the apparatus 10000 for transmitting broadcast signals to improve transmission efficiency. In this case, the output processor 24000 can acquire necessary control information from data output from the signaling decoding module 25000. The output of the output processor 24000 corresponds to a signal input to the apparatus 10000 for transmitting broadcast signals and may be MPEGTSs, IP streams (v4 or v6) and generic streams.
The signaling decoding module 25000 can obtain PLS information from the signal demodulated by the synchronization & demodulation module 21000. As described above, the frame parsing module 22000, demapping & decoding module 23000 and output processor 24000 can execute functions thereof using the data output from the signaling decoding module 25000.
As shown in
The first processing block 21000 can include a tuner 21100, an ADC block 21200, a preamble detector 21300, a guard sequence detector 21400, a waveform transform block 21500, a time/frequency synchronization block 21600, a reference signal detector 21700, a channel equalizer 21800 and an inverse waveform transform block 21900.
The tuner 21100 can select a desired frequency band, compensate for the magnitude of a received signal and output the compensated signal to the ADC block 21200.
The ADC block 21200 can convert the signal output from the tuner 21100 into a digital signal.
The preamble detector 21300 can detect a preamble (or preamble signal or preamble symbol) in order to check whether or not the digital signal is a signal of the system corresponding to the apparatus 20000 for receiving broadcast signals. In this case, the preamble detector 21300 can decode basic transmission parameters received through the preamble.
The guard sequence detector 21400 can detect a guard sequence in the digital signal. The time/frequency synchronization block 21600 can perform time/frequency synchronization using the detected guard sequence and the channel equalizer 21800 can estimate a channel through a received/restored sequence using the detected guard sequence.
The waveform transform block 21500 can perform a reverse operation of inverse waveform transform when the apparatus 10000 for transmitting broadcast signals has performed inverse waveform transform. When the broadcast transmission/reception system according to one embodiment of the present invention is a multicarrier system, the waveform transform block 21500 can perform FFT. Furthermore, when the broadcast transmission/reception system according to an embodiment of the present invention is a single carrier system, the waveform transform block 21500 may not be used if a received time domain signal is processed in the frequency domain or processed in the time domain.
The time/frequency synchronization block 21600 can receive output data of the preamble detector 21300, guard sequence detector 21400 and reference signal detector 21700 and perform time synchronization and carrier frequency synchronization including guard sequence detection and block window positioning on a detected signal. Here, the time/frequency synchronization block 21600 can feed back the output signal of the waveform transform block 21500 for frequency synchronization.
The reference signal detector 21700 can detect a received reference signal. Accordingly, the apparatus 20000 for receiving broadcast signals according to an embodiment of the present invention can perform synchronization or channel estimation.
The channel equalizer 21800 can estimate a transmission channel from each Tx antenna to each Rx antenna from the guard sequence or reference signal and perform channel equalization for received data using the estimated channel.
The inverse waveform transform block 21900 may restore the original received data domain when the waveform transform block 21500 performs waveform transform for efficient synchronization and channel estimation/equalization. If the broadcast transmission/reception system according to an embodiment of the present invention is a single carrier system, the waveform transform block 21500 can perform FFT in order to carry out synchronization/channel estimation/equalization in the frequency domain and the inverse waveform transform block 21900 can perform IFFT on the channelequalized signal to restore transmitted data symbols. If the broadcast transmission/reception system according to an embodiment of the present invention is a multicarrier system, the inverse waveform transform block 21900 may not be used.
The abovedescribed blocks may be omitted or replaced by blocks having similar or identical functions according to design.
As shown in
The block interleaver 22100 can deinterleave data input through data paths of the m Rx antennas and processed by the synchronization & demodulation module 21000 on a signal block basis. In this case, if the apparatus 10000 for transmitting broadcast signals performs pairwise interleaving, the block interleaver 22100 can process two consecutive pieces of data as a pair for each input path. Accordingly, the block interleaver 22100 can output two consecutive pieces of data even when deinterleaving has been performed. Furthermore, the block interleaver 22100 can perform a reverse operation of the interleaving operation performed by the apparatus 10000 for transmitting broadcast signals to output data in the original order.
The cell demapper 22200 can extract cells corresponding to common data, cells corresponding to data pipes and cells corresponding to PLS data from received signal frames. The cell demapper 22200 can merge data distributed and transmitted and output the same as a stream as necessary. When two consecutive pieces of cell input data are processed as a pair and mapped in the apparatus 10000 for transmitting broadcast signals, the cell demapper 22200 can perform pairwise cell demapping for processing two consecutive input cells as one unit as a reverse procedure of the mapping operation of the apparatus 10000 for transmitting broadcast signals.
In addition, the cell demapper 22200 can extract PLS signaling data received through the current frame as PLSpre & PLSpost data and output the PLSpre & PLSpost data.
The abovedescribed blocks may be omitted or replaced by blocks having similar or identical functions according to design.
The demapping & decoding module 23000 shown in
The bit interleaved and coded & modulation module of the apparatus 10000 for transmitting broadcast signals according to an embodiment of the present invention can process input data pipes by independently applying SISO, MISO and MIMO thereto for respective paths, as described above. Accordingly, the demapping & decoding module 23000 illustrated in
As shown in
A description will be given of each block of the demapping & decoding module 23000.
The first block 23100 processes an input data pipe according to SISO and can include a time deinterleaver block 23110, a cell deinterleaver block 23120, a constellation demapper block 23130, a celltobit mux block 23140, a bit deinterleaver block 23150 and an FEC decoder block 23160.
The time deinterleaver block 23110 can perform a reverse process of the process performed by the time interleaving block 14310 illustrated in
The cell deinterleaver block 23120 can perform a reverse process of the process performed by the cell interleaver block illustrated in
The constellation demapper block 23130 can perform a reverse process of the process performed by the mapper 12300 illustrated in
The celltobit mux block 23140 can perform a reverse process of the process performed by the mapper 12300 illustrated in
The bit deinterleaver block 23150 can perform a reverse process of the process performed by the bit interleaver 12200 illustrated in
The FEC decoder block 23460 can perform a reverse process of the process performed by the FEC encoder 12100 illustrated in
The second block 23200 processes an input data pipe according to MISO and can include the time deinterleaver block, cell deinterleaver block, constellation demapper block, celltobit mux block, bit deinterleaver block and FEC decoder block in the same manner as the first block 23100, as shown in
The MISO decoding block 11110 can perform a reverse operation of the operation of the MISO processing in the apparatus 10000 for transmitting broadcast signals. If the broadcast transmission/reception system according to an embodiment of the present invention uses STBC, the MISO decoding block 11110 can perform Alamouti decoding.
The third block 23300 processes an input data pipe according to MIMO and can include the time deinterleaver block, cell deinterleaver block, constellation demapper block, celltobit mux block, bit deinterleaver block and FEC decoder block in the same manner as the second block 23200, as shown in
The MIMO decoding block 23310 can receive output data of the cell deinterleaver for input signals of the m Rx antennas and perform MIMO decoding as a reverse operation of the operation of the MIMO processing in the apparatus 10000 for transmitting broadcast signals. The MIMO decoding block 23310 can perform maximum likelihood decoding to obtain optimal decoding performance or carry out sphere decoding with reduced complexity. Otherwise, the MIMO decoding block 23310 can achieve improved decoding performance by performing MMSE detection or carrying out iterative decoding with MMSE detection.
The fourth block 23400 processes the PLSpre/PLSpost information and can perform SISO or MISO decoding.
The basic roles of the time deinterleaver block, cell deinterleaver block, constellation demapper block, celltobit mux block and bit deinterleaver block included in the fourth block 23400 are identical to those of the corresponding blocks of the first, second and third blocks 23100, 23200 and 23300 although functions thereof may be different from the first, second and third blocks 23100, 23200 and 23300.
The shortened/punctured FEC decoder 23410 can perform deshortening and depuncturing on data shortened/punctured according to PLS data length and then carry out FEC decoding thereon. In this case, the FEC decoder used for data pipes can also be used for PLS. Accordingly, additional FEC decoder hardware for the PLS only is not needed and thus system design is simplified and efficient coding is achieved.
The abovedescribed blocks may be omitted or replaced by blocks having similar or identical functions according to design.
The demapping & decoding module according to an embodiment of the present invention can output data pipes and PLS information processed for the respective paths to the output processor, as illustrated in
The output processor 24000 shown in
The BB scrambler block 24100 can descramble an input bit stream by generating the same PRBS as that used in the apparatus for transmitting broadcast signals for the input bit stream and carrying out an XOR operation on the PRBS and the bit stream.
The padding removal block 24200 can remove padding bits inserted by the apparatus for transmitting broadcast signals as necessary.
The CRC8 decoder block 24300 can check a block error by performing CRC decoding on the bit stream received from the padding removal block 24200.
The BB frame processor block 24400 can decode information transmitted through a BB frame header and restore MPEGTSs, IP streams (v4 or v6) or generic streams using the decoded information.
The abovedescribed blocks may be omitted or replaced by blocks having similar or identical functions according to design.
The output processor 24000 shown in
A dejitter buffer block 24500 included in the output processor shown in
A null packet insertion block 24600 can restore a null packet removed from a stream with reference to a restored DNP (deleted null packet) and output common data.
A TS clock regeneration block 24700 can restore time synchronization of output packets based on ISCR (input stream time reference) information.
A TS recombining block 24800 can recombine the common data and data pipes related thereto, output from the null packet insertion block 24600, to restore the original MPEGTSs, IP streams (v4 or v6) or generic streams. The TTO, DNT and ISCR information can be obtained through the BB frame header.
An inband signaling decoding block 24900 can decode and output inband physical layer signaling information transmitted through a padding bit field in each FEC frame of a data pipe.
The output processor shown in
The abovedescribed blocks may be omitted or replaced by blocks having similar r identical functions according to design.
The encoder 110 generates a low density parity check (LDPC) codeword by performing LDPC encoding based on a parity check matrix. To achieve this, the encoder 110 may include an LDPC encoder (not shown) to perform the LDPC encoding.
Specifically, the encoder 110 LDPCencodes information word (or information) bits to generate the LDPC codeword which is formed of information word bits and parity bits (that is, LDPC parity bits). Here, bits input to the encoder 110 may be used as the information word bits. Also, since an LDPC code is a systematic code, the information word bits may be included in the LDPC codeword as they are.
The LDPC codeword is formed of the information word bits and the parity bits. For example, the LDPC codeword is formed of N_{ldpc }number of bits, and includes K_{ldpc }number of information word bits and N_{parity}=N_{ldpc}−K_{ldpc }number of parity bits.
In this case, the encoder 110 may generate the LDPC codeword by performing the LDPC encoding based on the parity check matrix. That is, since the LDPC encoding is a process for generating an LDPC codeword to satisfy H·C^{T}=0, the encoder 110 may use the parity check matrix when performing the LDPC encoding. Herein, H is a parity check matrix and C is an LDPC codeword.
For the LDPC encoding, the transmitting apparatus 100 may include a memory and may prestore parity check matrices of various formats.
For example, the transmitting apparatus 100 may prestore parity check matrices which are defined in Digital Video BroadcastingCable version 2 (DVBC2), Digital Video BroadcastingSatelliteSecond Generation (DVBS2), Digital Video BroadcastingSecond Generation Terrestrial (DVBT2), etc., or may prestore parity check matrices which are defined in the North America digital broadcasting standard system Advanced Television System Committee (ATSC) 3.0 standards, which are currently being established. However, this is merely an example and the transmitting apparatus 100 may prestore parity check matrices of other formats in addition to these parity check matrices.
Hereinafter, a parity check matrix according to various exemplary embodiments will be explained in detail with reference to the drawings. In the parity check matrix, elements other than elements having 1 have 0.
For example, the parity check matrix according to an exemplary embodiment may have a configuration of
Referring to
The information word submatrix 210 includes K_{ldpc }number of columns and the parity submatrix 220 includes N_{parity}=N_{ldpc}−K_{ldpc }number of columns. The number of rows of the parity check matrix 200 is identical to the number of columns of the parity submatrix 220, N_{parity}=N_{ldpc}−K_{ldpc}.
In addition, in the parity check matrix 200, N_{ldpc }is a length of an LDPC codeword, K_{ldpc }is a length of information word bits, and N_{parity}=N_{ldpc}−K_{ldpc }is a length of parity bits. The length of the LDPC codeword, the information word bits, and the parity bits mean the number of bits included in each of the LDPC codeword, the information word bits, and the parity bits.
Hereinafter, the configuration of the information word submatrix 210 and the parity submatrix 220 will be explained in detail.
The information word submatrix 210 includes K_{ldpc }number of columns (that is, 0^{th }column to (K_{ldpc1})^{th }column), and follows the following rules:
First, M number of columns from among K_{ldpc }number of columns of the information word submatrix 210 belong to the same group, and K_{ldpc }number of columns is divided into K_{ldpc}/M number of column groups. In each column group, a column is cyclicshifted from an immediately previous column by Q_{ldpc}. That is, Q_{ldpc }may be a cyclic shift parameter value regarding columns in a column group of the information word submatrix 210 of the parity check matrix 200.
Herein, M is an interval at which a pattern of a column group, which includes a plurality of columns, is repeated in the information word submatrix 210 (e.g., M=360), and Q_{ldpc }is a size by which one column is cyclicshifted from an immediately previous column in a same column group in the information word submatrix 210. Also, M is a common divisor of N_{ldpc }and K_{ldpc }and is determined to satisfy Q_{ldpc}=(N_{ldpc}−K_{ldpc})/M. Here, M and Q_{ldpc }are integers and K_{ldpc}/M is also an integer. M and Q_{ldpc }may have various values according to a length of the LDPC codeword and a code rate (CR)(or, coding rate).
For example, when M=360 and the length of the LDPC codeword, N_{ldpc}, is 64800, Q_{ldpc }may be defined as in table 1 presented below, and, when M=360 and the length N_{ldpc }of the LDPC codeword is 16200, Q_{ldpc }may be defined as in table 2 presented below.
Second, when the degree of the 0^{th }column of the i^{th }column group (i=0, 1, . . . , K_{ldpc}/M−1) is D_{i }(herein, the degree is the number of value 1 existing in each column and all columns belonging to the same column group have the same degree), and a position (or an index) of each row where 1 exists in the 0^{th }column of the i^{th }column group is R_{i,0}^{(0)}, R_{i,0}^{(1)}, . . . , R_{i,0}^{(D}^{i}^{1)}, an index R_{i,j}^{(k)}, of a row where k^{th }1 is located in the j^{th }column in the i^{th }column group is determined by following Equation 1:
R_{i,j}^{(k)}=R_{i,(j1)}^{(k)}+Q_{ldpc }mod(N_{ldpc}−K_{ldpc}) (1),
where k=0, 1, 2, . . . D_{i}−1; i=0, 1, . . . , K_{ldpc}/M−1; and j=1, 2, . . . , M−1.
Equation 1 can be expressed as following Equation 2:
R_{i,j}^{(k)}={R_{i,0}^{(k)}+(j mod M)×Q_{ldpc}}mod(N_{ldpc}−K_{ldpc}) (2),
where k=0, 1, 2, . . . D_{i}−1; i=0, 1, . . . , K_{ldpc}/M−1; and j=1, 2, . . . , M−1. Since j=1, 2, . . . , M−1, (j mod M) of Equation 2 may be regarded as j.
In the above equations, R_{i,j}^{(k) }is an index of a row where k^{th }1 is located in the j^{th }column in the i^{th }column group, N_{ldpc }is a length of an LDPC codeword, K_{ldpc }is a length of information word bits, D_{i }is a degree of columns belonging to the i^{th }column group, M is the number of columns belonging to a single column group, and Q_{ldpc }is a size by which each column in the column group is cyclicshifted.
As a result, referring to these equations, when only R_{i,0}^{(k) }is known, the index R_{i,j}^{(k) }of the row where the k^{th }1 is located in the j^{th }column in the i^{th }column group can be known. Therefore, when the index value of the row where the k^{th }1 is located in the 0^{th }column of each column group is stored, a position of column and row where 1 is located in the parity check matrix 200 having the configuration of
According to the abovedescribed rules, all of the columns belonging to the i^{th }column group have the same degree D_{i}. Accordingly, the LDPC codeword which stores information on the parity check matrix according to the abovedescribed rules may be briefly expressed as follows.
For example, when N_{ldpc }is 30, K_{ldpc }is 15, and Q_{ldpc }is 3, position information of the row where 1 is located in the 0^{th }column of the three column groups may be expressed by a sequence of Equations 3 and may be referred to as “weight−1 position sequence”.
R_{1,0}^{(1)}=1, R_{1,0}^{(2)}=2, R_{1,0}^{(3)}=8, R_{1,0}^{(4)}=10,
R_{2,0}^{(1)}=0, R_{2,0}^{(2)}=9, R_{2,0}^{(3)}==13,
R_{3,0}^{(1)}=0, R_{3,0}^{(2)}=14. (3),
where R_{i,j}^{(k) }is an index of a row where k^{th }1 is located in the j^{th }column in the i^{th }column group.
The weight−1 position sequence like Equation 3 which expresses an index of a row where 1 is located in the 0^{th }column of each column group may be briefly expressed as in Table 3 presented below:
Table 3 shows positions of elements having value 1 in the parity check matrix, and the i^{th }weight−1 position sequence is expressed by indexes of rows where 1 is located in the 0^{th }column belonging to the i^{th }column group.
The information word submatrix 210 of the parity check matrix according to an exemplary embodiment may be defined as in Tables 4 to 12 presented below, based on the above descriptions.
Specifically, Tables 4 to 12 show indexes of rows where 1 is located in the 0^{th }column of the i^{th }column group of the information word submatrix 210. That is, the information word submatrix 210 is formed of a plurality of column groups each including M number of columns, and positions of 1 in the 0^{th }column of each of the plurality of column groups may be defined by Tables 4 to 12.
Herein, the indexes of the rows where 1 is located in the 0^{th }column of the i^{th }column group mean “addresses of parity bit accumulators”. The “addresses of parity bit accumulators” have the same meaning as defined in the DVBC2/S2/T2 standards or the ATSC 3.0 standards which are currently being established, and thus, a detailed explanation thereof is omitted.
For example, when the length N_{ldpc }of the LDPC codeword is 16200, the code rate is 5/15, and M is 360, the indexes of the rows where 1 is located in the 0^{th }column of the i^{th }column group of the information word submatrix 210 are as shown in Table 4 presented below:
In another example, when the length N_{ldpc }of the LDPC codeword is 16200, the code rate is 7/15, and M is 360, the indexes of the rows where 1 is located in the 0^{th }column of the i^{th }column group of the information word submatrix 210 are as shown in Table 5 or 6 presented below:
In another example, when the length N_{ldpc }of the LDPC codeword is 16200, the code rate is 9/15, and M is 360, the indexes of rows where 1 exists in the 0^{th }column of the i^{th }column group of the information word submatrix 210 are defined as shown in Table 7 or 8 below.
In another example, when the length N_{ldpc }of the LDPC codeword is 16200, the code rate is 11/15, and M is 360, the indexes of rows where 1 exists in the 0th column of the i^{th }column group of the information word submatrix 210 are defined as shown in Table 9 or 10 below.
In another example, when the length N_{ldpc }of the LDPC codeword is 16200, the code rate is 13/15, and M is 360, the indexes of rows where 1 exists in the 0^{th }column of the i^{th }column group of the information word submatrix 210 are defined as shown in Table 11 or 12 below.
In the abovedescribed examples, the length of the LDPC codeword is 16200 and the code rate is 5/15, 7/15, 9/15, 11/15, and 13/15. However, this is merely an example and the position of 1 in the information word submatrix 210 may be defined variously when the length of the LDPC codeword is 64800 or the code rate has different values.
Meanwhile, even when the order of numbers in a sequence corresponding to the i^{th }column group of the parity check matrix 200 as shown in the abovedescribed Tables 4 to 12 is changed, the changed parity check matrix is a parity check matrix used for the same code. Therefore, a case in which the order of numbers in the sequence corresponding to the i^{th }column group in Tables 4 to 12 is changed is covered by the inventive concept.
According to an exemplary embodiment, even when the arrangement order of sequences corresponding to each column group is changed in Tables 4 to 12, cycle characteristics on a graph of a code and algebraic characteristics such as degree distribution are not changed. Therefore, a case in which the arrangement order of the sequences shown in Tables 4 to 12 is changed is also covered by the inventive concept.
In addition, even when a multiple of Q_{ldpc }is equally added to all sequences corresponding to a certain column group in Tables 4 to 12, the cycle characteristics on the graph of the code or the algebraic characteristics such as degree distribution are not changed. Therefore, a result of equally adding a multiple of Q_{ldpc }to the sequences shown in Tables 4 to 12 is also covered by the inventive concept. However, it should be noted that, when the resulting value obtained by adding the multiple of Q_{ldpc }to a given sequence is greater than or equal to (N_{ldpc}−K_{ldpc}), a value obtained by applying a modulo operation for (N_{ldpc}−K_{ldpc}) to the resulting value should be applied instead.
Once positions of the rows where 1 exists in the 0^{th }column of the i^{th }column group of the information word submatrix 210 are defined as shown in Tables 4 to 12, positions of rows where 1 exists in another column of each column group may be defined since the positions of the rows where 1 exists in the 0^{th }column are cyclicshifted by Q_{ldpc }in the next column.
For example, in the case of Table 4, in the 0^{th }column of the 0^{th }column group of the information word submatrix 210, 1 exists in the 553^{th }row, 742^{nd }row, 901^{st }row, . . . .
In this case, since Q_{ldpc}=(N_{ldpc}−K_{ldpc})/M=(16200−5400)/360=30, the indexes of the rows where 1 is located in the 1^{st }column of the 0^{th }column group may be 583(=553+30), 931(=901+30), . . . , and the indexes of the rows where 1 is located in the 2^{nd }column of the 0^{th }column group may be 607(=577+30), 796(=766+30), 955(=925+30), . . . .
In the abovedescribed method, the indexes of the rows where 1 is located in all rows of each column group may be defined.
The parity submatrix 220 of the parity check matrix 200 shown in
The parity submatrix 220 includes N_{ldpc}−K_{ldpc }number of columns (that is, K_{ldpc}^{th }column to (N_{ldpc1})^{th }column), and has a dual diagonal or staircase configuration. Accordingly, the degree of columns except the last column (that is, (N_{ldpc1})^{th }column) from among the columns included in the parity submatrix 220 is 2, and the degree of the last column is 1.
As a result, the information word submatrix 210 of the parity check matrix 200 may be defined by Tables 4 to 12, and the parity submatrix 220 of the parity check matrix 200 may have a dual diagonal configuration.
When the columns and rows of the parity check matrix 200 shown in
Q_{ldpc}·i+j⇒M·j+i (0≤i<M, 0≤j<Q_{ldpc}) (4)
K_{ldpc}+Q_{ldpc}·k+l⇒K_{ldpc}+M·l+k (0≤k<M, 0<l<Q_{ldpc}) (5)
The method for permutating based on Equation 4 and Equation 5 will be explained below. Since row permutation and column permutation apply the same principle, the row permutation will be explained by the way of an example.
In the case of the row permutation, regarding the X^{th }row, i and j satisfying X=Q_{ldpc}×i+j are calculated and the X^{th }row is permutated by assigning the calculated i and j to M×j+i. For example, regarding the 7^{th }row, i and j satisfying 7=2×i+j are 3 and 1, respectively. Therefore, the 7^{th }row is permutated to the 13^{th }row (10×+3=13).
When the row permutation and the column permutation are performed in the abovedescribed method, the parity check matrix of
Referring to
Accordingly, the parity check matrix 300 having the configuration of
Since the parity check matrix 300 is formed of the quasicyclic matrices of M×M, M number of columns may be referred to as a column block and M number of rows may be referred to as a row block. Accordingly, the parity check matrix 300 having the configuration of
Hereinafter, the submatrix of M×M will be explained.
First, the (N_{qc_column}−1)^{th }column block A (330) of the 0^{th }row block has a form shown in Equation 6 presented below:
As described above, A 330 is an M×M matrix, values of the 0^{th }row and the (M−1)^{th }column are all “0”, and, regarding 0<i<(M−2), the (i+1)^{th }row of the i^{th }column is “1” and the other values are “0”.
Second, regarding 0<i<(N_{ldpc}−K_{ldpc})/M−1 in the parity submatrix 320, the i^{th }row block of the (K_{ldpc}/M+i)^{th }column block is configured by a unit matrix I_{M×M }340. In addition, regarding 0<i<(N_{ldpc}−K_{ldpc})/M−2, the (i+1)^{th }row block of the (K_{ldpc}/M+i)^{th }column block is configured by a unit matrix I_{M×M }340.
Third, a block 350 constituting the information word submatrix 310 may have a cyclicshifted format of a cyclic matrix P, P^{a}^{ij}, or an added format of the cyclicshifted matrix P^{a}^{ij }of the cyclic matrix P (or an overlapping format).
For example, a format of the block P 350 in which the upper suffix aij of P is 1 (that is, P^{1}) of cyclic matrix P may be expressed by Equation 7 presented below:
The cyclic matrix P is a square matrix having an M×M size and is a matrix in which a weight of each of M number of rows is 1 and a weight of each of M number of columns is 1. When a_{ij }is 0, the cyclic matrix P, that is, P^{0 }indicates a unit matrix I_{MM}. And, for convenience of indication, when a_{ij }is ∞, P^{0 }is defined as a zero matrix.
A submatrix existing where the i^{th }row block and the j^{th }column block intersect in the parity check matrix 300 of
Hereinafter, a method for performing LDPC encoding based on the parity check matrix 200 as shown in
First, when information word bits having a length of K_{ldpc }are [i_{0}, i_{1}, i_{2}, . . . , i_{K}_{ldpc}_{1}], and parity bits having a length of N_{ldpc}−K_{ldpc }are [p_{0}, p_{1}, p_{2}, . . . p_{N}_{ldpc}_{K}_{ldpc}_{1}], the LDPC encoding is performed by the following process.
Step 1) Parity bits are initialized as ‘0’. That is, p_{0}=p_{1}=p_{2}= . . . =p_{N}_{ldpc}_{K}_{ldpc}_{1}=0.
Step 2) The 0^{th }information word bit i_{0 }is accumulated in a parity bit having the address of the parity bit defined in the first row (that is, the row of i=0) of table 4 as the index of the parity bit. This may be expressed by Equation 8 presented below:
Herein, i_{0 }is a 0^{th }information word bit, p_{1 }is an ith parity bit, and G is a binary operation. According to the binary operation, 1⊕1 equals 0, 1⊕0 equals 1, 0⊕1 equals 1, 0⊕0 equals 0.
Step 3) The other 359 information word bits i_{m }(m=1, 2, . . . , 359) are accumulated in the parity bit. The other information word bits may belong to the same column group as that of i_{0}. In this case, the address of the parity bit may be determined based on Equation 9 presented below:
(x+(m mod 360)×Q_{ldpc})mod(N_{ldpc}−K_{ldpc}) (9)
Herein, x is an address of a parity bit accumulator corresponding to the information word bit i_{0}, and Q_{ldpc }is a size by which each column is cyclicshifted in the information word submatrix, and may be 108 in the case of table 4. In addition, since m=1, 2, . . . , 359, (m mod 360) in Equation 9 may be regarded as m.
As a result, information word bits i_{m }(m=1, 2, . . . , 359) are accumulated in the parity bits having the address of the parity bit calculated based on Equation 9 as the index. For example, an operation as shown in Equation 10 presented below may be performed for the information word bit i_{1}:
Herein, i_{1 }is a 1^{st }information word bit, p_{1 }is an ith parity bit, and ⊕ is a binary operation. According to the binary operation, 1⊕1 equals 0, 1⊕0 equals 1, 0⊕1 equals 1, 0⊕0 equals 0.
Step 4) The 360^{th }information word bits i_{360 }is accumulated in a parity bit having the address of the parity bit defined in the 2^{nd }row (that is, the row of i=1) of table 4 as the index of the parity bit.
Step 5) The other 359 information word bits belonging to the same group as that of the information word bit i_{360 }are accumulated in the parity bit. In this case, the address of the parity bit may be determined based on Equation 9. However, in this case, x is the address of the parity bit accumulator corresponding to the information word bit i_{360}.
Step 6) Steps 4 and 5 described above are repeated for all of the column groups of table 4.
Step 7) As a result, a parity bit p_{1 }is calculated based on Equation 11 presented below. In this case, i is initialized as 1.
p_{i}=p_{i}⊕p_{i1 }i=1,2, . . . ,N_{ldpc}−K_{ldpc}−1 (11)
In Equation 11, p_{i }is an ith parity bit, N_{ldpc }is a length of an LDPC codeword, K_{ldpc }is a length of an information word of the LDPC codeword, and ⊕ is a binary operation.
As a result, the encoder 110 may calculate the parity bits according to the abovedescribed method.
In another example, a parity check matrix according to an exemplary embodiment may have a configuration as shown in
Referring to
First, M_{1}, M_{2}, Q_{1}, and Q_{2}, which are parameter values related to the parity check matrix 400 as shown in
The matrix A is formed of K number of columns and g number of rows, and the matrix C is formed of K+g number of columns and N−K−g number of rows. Herein, K is a length of information word bits, and N is a length of the LDPC codeword.
Indexes of rows where 1 is located in the 0^{th }column of the ith column group in the matrix A and the matrix C may be defined based on table 14 according to the length and the code rate of the LDPC codeword. In this case, an interval at which a pattern of a column is repeated in each of the matrix A and the matrix C, that is, the number of columns belonging to the same group, may be 360.
For example, when the length N of the LDPC codeword is 16200 and the code rate is 5/15, the indexes of rows where 1 is located in the 0^{th }column of the ith column group in the matrix A and the matrix C are defined as shown in table 14 presented below:
In the abovedescribed example, the length of the LDPC codeword is 16200 and the code rate 5/15. However, this is merely an example and the indexes of rows where 1 is located in the 0^{th }column of the ith column group in the matrix A and the matrix C may be defined variously when the length of the LDPC codeword is 64800 or the code rate has different values.
Hereinafter, positions of rows where 1 exists in the matrix A and the matrix C will be explained with reference to table 14 by way of an example.
Since the length N of the LDPC codeword is 16200 and the code rate is 5/15 in table 10, M_{1}=720, M_{2}=10080, Q_{1}=2 and Q_{2}=28 in the parity check matrix 400 defined by table 14 with reference to table 12.
Herein, Q_{1 }is a size by which columns of the same column group are cyclicshifted in the matrix A, and Q_{2 }is a size by which columns of the same column group are cyclicshifted in the matrix C.
In addition, Q_{1}=M_{1}/L, Q_{2}=M_{2}/L, M_{1}=g, and M_{2}=N−K−g, and L is an interval at which a pattern of a column is repeated in the matrix A and the matrix C, and for example, may be 360.
The index of the row where 1 is located in the matrix A and the matrix C may be determined based on the M_{1 }value.
For example, since M_{1}=720 in the case of table 14, the positions of the rows where 1 exists in the 0^{th }column of the ith column group in the matrix A may be determined based on values smaller than 720 from among the index values of table 14, and the positions of the rows where 1 exists in the 0^{th }column of the ith column group in the matrix C may be determined based on values greater than or equal to 720 from among the index values of table 14.
Specifically, in table 14, the sequence corresponding to the 0^{th }column group is “69, 244, 706, 5145, 5994, 6066, 6763, 6815, and 8509”. Accordingly, in the case of the 0^{th }column of the 0^{th }column group of the matrix A, 1 may be located in the 69^{th }row, 244^{th }row, and 706^{th }row, and, in the case of the 0^{th }column of the 0^{th }column group of the matrix C, 1 may be located in the 5145^{th }row, 5994^{th }row, 6066^{th }row, 6763^{rd }row, 6815^{th }row, and 8509^{th }row.
Once positions of 1 in the 0^{th }column of each column group of the matrix A are defined, positions of rows where 1 exists in another column of each column group may be defined by cyclicshifting from the previous column by Q_{1}. Once positions of 1 in the 0^{th }column of each column group of the matrix C are defined, Position of rows where 1 exists in another column of each column group may be defined by cyclicshifting from the previous column by Q_{2}.
In the abovedescribed example, in the case of the 0th column of the 0^{th }column group of the matrix A, 1 exists in the 69^{th }row, 244^{th }row, and 706^{th }row. In this case, since Q_{1}=2, the indexes of rows where 1 exists in the 1^{st }column of the 0^{th }column group are 71(=69+2), 246(=244+2), and 708(=706+2), and the index of rows where 1 exists in the 2^{nd }column of the 0^{th }column group are 73(=71+2), 248 (=246+2), and 710(=708+2).
In the case of the 0th column of the 0^{th }column group of the matrix C, 1 exists in the 5145^{th }row, 5994^{th }row, 6066th row, 6763^{rd }row, 6815th row, and 8509^{th }row. In this case, since Q_{2}=28, the index of rows where 1 exists in the 1^{st }column of the 0^{th }column group are 5173(=5145+28), 6022(=5994+28), 6094 (6066+28), 6791(=6763+28), 6843(=6815+28), and 8537(=8509+28) and the indexes of rows where 1 exists in the 2^{nd }column of the 0^{th }column group are 5201(=5173+28), 6050(=6022+28), 6122(=6094+28), 6819(=6791+28), 6871(=6843+28), and 8565(=8537+28).
In this method, the positions of rows where 1 exists in all column groups of the matrix A and the matrix C are defined.
The matrix B may have a dual diagonal configuration, the matrix D may have a diagonal configuration (that is, the matrix D is an identity matrix), and the matrix Z may be a zero matrix.
As a result, the parity check matrix 400 shown in
Hereinafter, a method for performing LDPC encoding based on the parity check matrix 400 shown in
For example, when an information word block S=(s_{0}, s_{1}, . . . , S_{K+1}) is LDPCencoded, an LDPC codeword Λ=(λ_{0}, λ_{1}, . . . , λ_{N1})=(s_{0}, s_{1}, . . . , S_{K+1}, p_{0}, p_{1}, . . . , p_{M}_{1}_{+M}_{2}_{−1}) including a parity bit P=(p_{0}, p_{1}, . . . , p_{M}_{1}_{+M}_{2}_{−1}) may be generated.
M_{1 }and M_{2 }indicate the size of the matrix B having the dual diagonal configuration and the size of the matrix C having the diagonal configuration, respectively, and M_{1}=g, M_{2}=N−K−g.
A process of calculating a parity bit is as follows. In the following explanation, the parity check matrix 400 is defined as shown in table 14 by way of an example, for the convenience of explanation.
Step 1) λ and p are initialized as λ_{i}=s_{i }(i=0, 1, . . . , K−1), p_{j}=0 (j=0, 1, . . . , M_{1}+M_{2}−1).
Step 2) The 0^{th }information word bit λ_{0 }is accumulated in the address of the parity bit defined in the first row (that is, the row of i=0) of table 14. This may be expressed by Equation 12 presented below:
Step 3) Regarding the next L−1 number of information word bits λ_{m }(m=1, 2, . . . , L−1), λ_{m }is accumulated in the parity bit address calculated based on Equation 13 presented below:
(χ+m×Q_{1})mod M_{1 }(if χ<M_{1})
M_{1}+{(χ−M_{1}+m×Q_{2})mod M_{2}} (if χ≥M_{1}) (13)
Herein, x is an address of a parity bit accumulator corresponding to the 0^{th }information word bit λ_{0}.
In addition, Q_{1}=M_{1}/L and Q_{2}=M_{2}/L. In addition, since the length N of the LDPC codeword is 16200 and the code rate is 5/15 in table 14, M_{1}=1080, M_{2}=37800, Q_{1}=3, Q_{2}=105, and L=360 with reference to table 13.
Accordingly, an operation as shown in Equation 14 presented below may be performed for the 1^{st }information word bit λ_{1}:
Step 4) Since the same address of the parity bit as in the second row (that is the row of i=1) of table 14 is given to the Lth information word bit λ_{L}, in a similar method to the abovedescribed method, the address of the parity bit regarding the next L−1 number of information word bits λ_{m }(m=L+1, L+2, . . . , 2L−1) is calculated based on Equation 13. In this case, x is the address of the parity bit accumulator corresponding to the information word bit λ_{L}, and may be obtained based on the second row of table 14.
Step 5) The abovedescribed processes are repeated for L number of new information word bits of each group by considering new rows of table 14 as the address of the parity bit accumulator.
Step 6) After the abovedescribed processes are repeated for the codeword bits λ_{0 }to λ_{K+1}, values regarding Equation 15 presented below are calculated in sequence from i=1:
P=P_{i}⊕P_{i1 }(i=1,2, . . . ,M_{1}−1) (15)
Step 7) Parity bits λ_{K }to λ_{K+M}_{1}_{1 }corresponding to the matrix B having the dual diagonal configuration are calculated based on Equation 16 presented below:
λ_{K+L×t+s}=p_{Q}_{i}_{×S+i }(0≤s<L, 0≤t<Q_{1}) (16)
Step 8) The address of the parity bit accumulator regarding L number of new codeword bits λ_{K }to λ_{K+M}_{1}_{1 }of each group is calculated based on table 14 and Equation 13.
Step 9) After the codeword bits λ_{K }to λ_{K+M}_{1}_{1 }are calculated, parity bits λ_{K+M}_{1 }to λ_{K+M}_{1}_{+M}_{2}_{1 }corresponding to the matrix C having the diagonal configuration are calculated based on Equation 17 presented below:
λ_{K+M}_{1}_{+L×t+s}=p_{M}_{1}_{+Q}_{2}×s+i(0≤s<L, 0≤t<Q_{2}) (17)
As a result, the parity bits may be calculated in the abovedescribed method.
Referring back to
In this case, the encoder 110 may perform the LDPC encoding by using the parity check matrix, and the parity check matrix is configured as shown in
In addition, the encoder 110 may perform Bose, Chaudhuri, Hocquenghem (BCH) encoding as well as LDPC encoding. To achieve this, the encoder 110 may further include a BCH encoder (not shown) to perform BCH encoding.
In this case, the encoder 110 may perform encoding in an order of BCH encoding and LDPC encoding. Specifically, the encoder 110 may add BCH parity bits to input bits by performing BCH encoding and LDPCencodes the information word bits including the input bits and the BCH parity bits, thereby generating the LDPC codeword.
The interleaver 120 interleaves the LDPC codeword. That is, the interleaver 120 receives the LDPC codeword from the encoder 110, and interleaves the LDPC codeword based on various interleaving rules.
In particular, the interleaver 120 may interleave the LDPC codeword such that a bit included in a predetermined bit group from among a plurality of bit groups constituting the LDPC codeword (that is, a plurality of groups or a plurality of blocks) is mapped onto a predetermined bit of a modulation symbol. Accordingly, the modulator 130 may map a bit included in a predetermined group from among the plurality of groups of the LDPC codeword onto a predetermined bit of the modulation symbol.
To achieve this, as shown in
The parity interleaver 121 interleaves the parity bits constituting the LDPC codeword.
Specifically, when the LDPC codeword is generated based on the parity check matrix 200 having the configuration of
u_{1}=c_{i }for 0≤i<K_{ldpc}, and
u_{K}_{ldpc}_{+M·t+s}=c_{K}_{ldpc}_{+Q}_{ldpc}_{·s+t }for 0≤s<M, 0≤t<Q_{ldpc} (18),
where M is an interval at which a pattern of a column group is repeated in the information word submatrix 210, that is, the number of columns included in a column group (for example, M=360), and Q_{ldpc }is a size by which each column is cyclicshifted in the information word submatrix 210. That is, the parity interleaver 121 performs parity interleaving with respect to the LDPC codeword c=(c_{0}, c_{1}, . . . , c_{N}_{ldpc}_{1}), and outputs U=(u_{0}, u_{1}, . . . , u_{N}_{ldpc}_{1}).
The LDPC codeword parityinterleaved in the abovedescribed method may be configured such that a predetermined number of continuous bits of the LDPC codeword have similar decoding characteristics (cycle distribution, a degree of a column, etc.).
For example, the LDPC codeword may have the same characteristics on the basis of M number of continuous bits. Herein, M is an interval at which a pattern of a column group is repeated in the information word submatrix 210 and, for example, may be 360.
Specifically, a product of the LDPC codeword bits and the parity check matrix should be “0”. This means that a sum of products of the ith LDPC codeword bit, c_{i }(i=0, 1, . . . , N_{ldpc1}) and the i^{th }column of the parity check matrix should be a “0” vector. Accordingly, the ith LDPC codeword bit may be regarded as corresponding to the ith column of the parity check matrix.
In the case of the parity check matrix 200 of
In this case, since M number of continuous bits in the information word bits correspond to the same column group of the information word submatrix 210, the information word bits may be formed of M number of continuous bits having the same codeword characteristics. When the parity bits of the LDPC codeword are interleaved by the parity interleaver 121, the parity bits of the LDPC codeword may be formed of M number of continuous bits having the same codeword characteristics.
However, regarding the LDPC codeword encoded based on the parity check matrix 300 of
The group interleaver 122 may divide the parityinterleaved LDPC codeword into a plurality of bit groups and rearrange the order of the plurality of bit groups in bit group wise (or bit group unit). That is, the group interleaver 122 may interleave the plurality of bit groups in bit group wise.
To achieve this, the group interleaver 122 divides the parityinterleaved LDPC codeword into a plurality of bit groups by using Equation 19 or Equation 20 presented below.
where N_{group }is the total number of bit groups, X_{j }is the j^{th }bit group, and u_{k }is the k^{th }LDPC codeword bit input to the group interleaver 122. In addition,
is the largest integer below k/360.
Since 360 in these equations indicates an example of the interval M at which the pattern of a column group is repeated in the information word submatrix, 360 in these equations can be changed to M.
The LDPC codeword which is divided into the plurality of bit groups may be as shown in
Referring to
Specifically, since the LDPC codeword is divided by M number of continuous bits, K_{ldpc }number of information word bits are divided into (K_{ldpc}/M) number of bit groups and N_{ldpc}−K_{ldpc }number of parity bits are divided into (N_{ldpc}−K_{ldpc})/M number of bit groups. Accordingly, the LDPC codeword may be divided into (N_{ldpc}/M) number of bit groups in total.
For example, when M=360 and the length N_{ldpc }of the LDPC codeword is 16200, the number of groups N_{groups }constituting the LDPC codeword is 45(=16200/360), and, when M=360 and the length N_{ldpc }of the LDPC codeword is 64800, the number of bit groups N_{group }constituting the LDPC codeword is 180(=64800/360).
As described above, the group interleaver 122 divides the LDPC codeword such that M number of continuous bits are included in a same group since the LDPC codeword has the same codeword characteristics on the basis of M number of continuous bits. Accordingly, when the LDPC codeword is grouped by M number of continuous bits, the bits having the same codeword characteristics belong to the same group.
In the abovedescribed example, the number of bits constituting each bit group is M. However, this is merely an example and the number of bits constituting each bit group is variable.
For example, the number of bits constituting each bit group may be an aliquot part of M. That is, the number of bits constituting each bit group may be an aliquot part of the number of columns constituting a column group of the information word submatrix of the parity check matrix. In this case, each bit group may be formed of aliquot part of M number of bits. For example, when the number of columns constituting a column group of the information word submatrix is 360, that is, M=360, the group interleaver 122 may divide the LDPC codeword into a plurality of bit groups such that the number of bits constituting each bit group is one of the aliquot parts of 360.
In the following explanation, the number of bits constituting a bit group is M by way of an example, for the convenience of explanation.
Thereafter, the group interleaver 122 interleaves the LDPC codeword in bit group wise. Specifically, the group interleaver 122 may group the LDPC codeword into the plurality of bit groups and rearrange the plurality of bit groups in bit group wise. That is, the group interleaver 122 changes positions of the plurality of bit groups constituting the LDPC codeword and rearranges the order of the plurality of bit groups constituting the LDPC codeword in bit group wise.
Herein, the group interleaver 122 may rearrange the order of the plurality of bit groups in bit group wise such that bit groups including bits mapped onto the same modulation symbol from among the plurality of bit groups are spaced apart from one another at predetermined intervals.
In this case, the group interleaver 122 may rearrange the order of the plurality of bit groups in bit group wise by considering at least one of the number of rows and columns of the block interleaver 124, the number of bit groups of the LDPC codeword, and the number of bits included in each bit group, such that bit groups including bits mapped onto the same modulation symbol are spaced apart from one another at predetermined intervals.
To achieve this, the group interleaver 122 may rearrange the order of the plurality of groups in bit group wise by using Equation 21 presented below:
Y_{j}=X_{π(j) }(0≤j<N_{group}) (21),
where X_{j }is the j^{th }bit group before group interleaving, and Y_{j }is the j^{th }bit group after group interleaving. In addition, π(j) is a parameter indicating an interleaving order and is determined by at least one of a length of an LDPC codeword, a modulation method, and a code rate. That is, π(j) denotes a permutation order for group wise interleaving.
Accordingly, X_{π(j) }is a π(j)^{th }bit group before group interleaving, and Equation 21 means that the preinterleaving π(j)^{th }bit group is interleaved into the j^{th }bit group.
According to an exemplary embodiment, an example of π(j) may be defined as in Tables 15 to 27 presented below.
In this case, π(j) is defined according to a length of an LPDC codeword and a code rate, and a parity check matrix is also defined according to a length of an LDPC codeword and a code rate. Accordingly, when LDPC encoding is performed based on a specific parity check matrix according to a length of an LDPC codeword and a code rate, the LDPC codeword may be interleaved in bit group wise based on π(j) satisfying the corresponding length of the LDPC codeword and code rate.
For example, when the encoder 110 performs LDPC encoding at a code rate of 5/15 to generate an LDPC codeword of a length of 16200, the group interleaver 122 may perform interleaving by using π(j) which is defined according to the length of the LDPC codeword of 16200 and the code rate of 5/15 in tables 15 to 27 presented below.
For example, when the length of the LDPC codeword is 16200, the code rate is 5/15, and the modulation method (or modulation format) is 16Quadrature Amplitude Modulation (QAM), π(j) may be defined as in table 15 presented below. In particular, table 15 may be applied when LDPC encoding is performed based on the parity check matrix defined by table 14.
In the case of Table 15, Equation 21 may be expressed as Y_{0}=X_{π(0)}=X_{3}, Y_{1}=X_{π(1)}=X_{33}, Y_{2}=X_{π(2)}=X_{39}, . . . , Y_{43}=X_{π(43)}=X_{35}, Y_{44}=X_{π(44)}=X_{27}. Accordingly, the group interleaver 122 may rearrange the order of the plurality of bit groups in bit group wise by changing the 3^{rd }bit group to the 0^{th }bit group, the 33^{rd }bit group to the 1^{st }bit group, the 39^{th }bit group to the 2^{nd }bit group, . . . , the 35^{th }bit group to the 43^{rd }bit group, and the 27^{th }bit group to the 44^{th }bit group. Herein, the changing the Ath bit group to the Bth bit group means rearranging the order of bit groups so that the Ath bit group is to be the Bth bit group.
In another example, when the length of the LDPC codeword is 16200, the code rate is 7/15, and the modulation method is 16QAM, π(j) may be defined as in table 16 presented below. In particular, table 16 may be applied when LDPC encoding is performed based on the parity check matrix defined by table 5.
In the case of Table 16, Equation 21 may be expressed as Y_{0}=X_{π(0)}=X_{20}, Y_{1}=X_{π(1)}=X_{13}, Y_{2}=X_{π(2)}=X_{11}, . . . , Y_{43}=X_{π(43)}=X_{1}, and Y_{44}=X_{π(44)}=X_{38}. Accordingly, the group interleaver 122 may rearrange the order of the plurality of bit groups in bit group wise by changing the 20^{th }bit group to the 0^{th }bit group, the 13^{th }bit group to the 1^{st }bit group, the 11^{th }bit group to the 2^{nd }bit group, . . . , the 1^{st }bit group to the 43^{rd }bit group, and the 38^{th }bit group to the 44^{th }bit group.
In another example, when the length of the LDPC codeword is 16200, the code rate is 9/15, and the modulation method is 16QAM, π(j) may be defined as in table 17 presented below. In particular, table 17 may be applied when LDPC encoding is performed based on the parity check matrix defined by table 7.
In the case of Table 17, Equation 21 may be expressed as Y_{0}=X_{π(0)}=X_{17}, Y_{1}=X_{π(1)}=X_{5}, Y_{2}=X_{π(2)}=X_{7}, . . . , Y_{43}=X_{π(43)}=X_{1}, and Y_{44}=X_{π(44)}=X_{21}. Accordingly, the group interleaver 122 may rearrange the order of the plurality of bit groups in bit group wise by changing the 17^{th }bit group to the 0^{th }bit group, the 8^{th }bit group to the 1^{st }bit group, the 7^{th }bit group to the 2^{nd }bit group, . . . , the 1^{st }bit group to the 43^{rd }bit group, and the 21^{st }bit group to the 44^{th }bit group.
In another example, when the length of the LDPC codeword is 16200, the code rate is 11/15, and the modulation method is 16QAM, π(j) may be defined as in table 18 presented below. In particular, table 18 may be applied when LDPC encoding is performed based on the parity check matrix defined by table 9.
In the case of Table 18, Equation 21 may be expressed as Y_{0}=X_{π(0)}=X_{21}, Y_{1}=X_{π(1)}=X_{23}, Y_{2}=X_{π(2)}=X_{5}, . . . , Y_{43}=X_{π(43)}=X_{16}, Y_{44}=X_{π(44)}=X_{30}. Accordingly, the group interleaver 122 may rearrange the order of the plurality of bit groups in bit group wise by changing the 21^{st }bit group to the 0^{th }bit group, the 23^{rd }bit group to the 1^{st }bit group, the 5^{th }bit group to the 2^{nd }bit group, . . . , the 16^{th }bit group to the 43^{rd }bit group, and the 30^{th }bit group to the 44^{th }bit group.
In another example, when the length of the LDPC codeword is 16200, the code rate is 13/15, and the modulation method is 16QAM, π(j) may be defined as in table 19 presented below. In particular, table 19 may be applied when LDPC encoding is performed based on the parity check matrix defined by table 11.
In the case of Table 19, Equation 21 may be expressed as Y_{0}=X_{π(0)}=X_{4}, Y_{1}=X_{π(1)}=X_{13}, Y_{2}=X_{π(2)}=X_{5}, . . . , Y_{43}=X_{π(43)}=X_{24}, and Y_{44}=X_{π(44)}=X_{38}. Accordingly, the group interleaver 122 may rearrange the order of the plurality of bit groups in bit group wise by changing the 4^{th }bit group to the 0^{th }bit group, the 13^{th }bit group to the 1^{st }bit group, the 8^{th }bit group to the 2^{nd }bit group . . . 24^{th }bit group to the 43^{rd }bit group, and the 38^{th }bit group to the 44^{th }bit group, . . . , .
In another example, when the length of the LDPC codeword is 16200, the code rate is 5/15, and the modulation method is 16QAM, π(j) may be defined as in table 20 presented below. In particular, table 20 may be applied when LDPC encoding is performed based on the parity check matrix defined by table 4.
In the case of Table 20, Equation 21 may be expressed as Y_{0}=X_{π(0)}=X_{5}, Y_{1}=X_{π(1)}=X_{20}, Y_{2}=X_{π(2)}=X_{9}, . . . , Y_{43}=X_{π(43)}=X_{39}, and Y_{44}=X_{π(44)}=X_{29}. Accordingly, the group interleaver 122 may rearrange the order of the plurality of bit groups in bit group wise by changing the 5^{th }bit group to the 0^{th }bit group, the 20^{th }bit group to the 1^{st }bit group, the 9^{th }bit group to the 2^{nd }bit group, . . . , the 39^{th }bit group to the 43^{rd }bit group, and the 29^{th }bit group to the 44^{th }bit group.
In another example, when the length of the LDPC codeword is 16200, the code rate is 7/15, and the modulation method is 16QAM, π(j) may be defined as in table 21 presented below. In particular, table 21 may be applied when LDPC encoding is performed based on the parity check matrix defined by table 6.
In the case of Table 21, Equation 21 may be expressed as Y_{0}=X_{π(0)}=X_{8}, Y_{1}=X_{π(1)}=X_{16}, Y_{2}=X_{π(2)}=X_{13}, . . . , Y_{43}=X_{π(43)}=X_{34}, and Y_{44}=X_{π(44)}=X_{38}. Accordingly, the group interleaver 122 may rearrange the order of the plurality of bit groups in bit group wise by changing the 18^{th }bit group to the 0^{th }bit group, the 16^{th }bit group to the 1^{st }bit group, the 13^{th }bit group to the 2^{nd }bit group, . . . , the 34^{th }bit group to the 43^{rd }bit group, and the 38^{th }bit group to the 44^{th }bit group.
In another example, when the length of the LDPC codeword is 16200, the code rate is 9/15, and the modulation method is 16QAM, π(j) may be defined as in table 22 presented below. In particular, table 22 may be applied when LDPC encoding is performed based on the parity check matrix defined by table 8.
In the case of Table 22, Equation 21 may be expressed as Y_{0}=X_{π(0)}=X_{20}, Y_{1}=X_{π(1)}=X_{14}, Y_{2}=X_{π(2)}=X_{13}, . . . , Y_{43}=X_{π(43)}=X_{43}, and Y_{44}=X_{π(44)}=X_{44}. Accordingly, the group interleaver 122 may rearrange the order of the plurality of bit groups in bit group wise by changing the 20^{th }bit group to the 0^{th }bit group, the 14^{th }bit group to the 1^{st }bit group, the 13^{th }bit group to the 2^{nd }bit group, . . . , the 43^{rd }bit group to the 43^{rd }bit group, and the 44^{th }bit group to the 44^{th }bit group.
In another example, when the length of the LDPC codeword is 16200, the code rate is 11/15, and the modulation method is 16QAM, π(j) may be defined as in table 23 presented below. In particular, table 23 may be applied when LDPC encoding is performed based on the parity check matrix defined by table 10.
In the case of Table 23, Equation 21 may be expressed as Y_{0}=X_{π(0)}=X_{15}, Y_{1}=X_{π(1)}=X_{10}, Y_{2}=X_{π(2)}=X_{5}, . . . , Y_{43}=X_{π(43)}=X_{30}, Y_{44}=X_{π(44)}=X_{31}. Accordingly, the group interleaver 122 may rearrange the order of the plurality of bit groups in bit group wise by changing the 15^{th }bit group to the 0^{th }bit group, the 10^{th }bit group to the 1^{st }bit group, the 5th bit group to the 2^{nd }bit group, . . . , the 30^{th }bit group to the 43^{rd }bit group, and the 31^{st }bit group to the 44^{th }bit group.
In another example, when the length of the LDPC codeword is 16200, the code rate is 13/15, and the modulation method is 16QAM, π(j) may be defined as in table 24 presented below. In particular, table 24 may be applied when LDPC encoding is performed based on the parity check matrix defined by table 12.
In the case of Table 24, Equation 21 may be expressed as Y_{0}=X_{π(0)}=X_{4}, Y_{1}=X_{π(1)}=X_{11}, Y_{2}=X_{π(2)}=X_{1}, . . . , Y_{43}=X_{π(43)}=X_{28}, Y_{44}=X_{π(44)}=X_{29}. Accordingly, the group interleaver 122 may rearrange the order of the plurality of bit groups in bit group wise by changing the 4^{th }bit group to the 0^{th }bit group, the 11^{th }bit group to the 1^{st }bit group, the 1^{st }bit group to the 2^{nd }bit group, . . . , the 28^{th }bit group to the 43^{rd }bit group, and the 29^{th }bit group to the 44^{th }bit group.
In another example, when the length of the LDPC codeword is 16200, the code rate is 7/15, and the modulation method is 256QAM, π(j) may be defined as in table 25 presented below. In particular, table 25 may be applied when LDPC encoding is performed based on the parity check matrix defined by table 6.
In the case of Table 25, Equation 21 may be expressed as Y_{0}=X_{π(0)}=X_{39}, Y_{1}=X_{π(1)}=X_{8}, Y_{2}=X_{π(2)}=X_{33}, . . . , Y_{43}=X_{π(43)}=X_{34}, Y_{44}=X_{π(44)}=X_{44}. Accordingly, the group interleaver 122 may rearrange the order of the plurality of bit groups in bit group wise by changing the 39^{th }bit group to the 0^{th }bit group, the 18^{th }bit group to the 1^{st }bit group, the 33^{th }bit group to the 2^{nd }bit group, . . . , the 34^{th }bit group to the 43^{rd }bit group, and the 44^{th }bit group to the 44^{th }bit group.
In another example, when the length of the LDPC codeword is 16200, the code rate is 9/15, and the modulation method is 16QAM, π(j) may be defined as in table 26 presented below. In particular, table 26 may be applied when LDPC encoding is performed based on the parity check matrix defined by table 7.
In the case of Table 26, Equation 21 may be expressed as Y_{0}=X_{π(0)}=X_{17}, Y_{1}=X_{π(1)}=X_{5}, Y_{2}=X_{π(2)}=X_{7}, . . . , Y_{43}=X_{π(43)}=X_{1}, Y_{44}=X_{π(44)}=X_{21}. Accordingly, the group interleaver 122 may rearrange the order of the plurality of bit groups in bit group wise by changing the 17^{th }bit group to the 0^{th }bit group, the 8^{th }bit group to the 1^{st }bit group, the 7^{th }bit group to the 2^{nd }bit group, . . . , the 1^{st }bit group to the 43^{rd }bit group, and the 21^{st }it group to the 44^{th }bit group.
In another example, when the length of the LDPC codeword is 16200, the code rate is 9/15, and the modulation method is 16QAM, π(j) may be defined as in table 27 presented below. In particular, table 27 may be applied when LDPC encoding is performed based on the parity check matrix defined by table 8.
In the case of Table 27, Equation 21 may be expressed as Y_{0}=X_{π(0)}=X_{4}, Y_{1}=X_{π(1)}=X_{14}, Y_{2}=X_{π(2)}=X_{13}, . . . , Y_{43}=X_{π(43)}=X_{43}, Y_{44}=X_{π(44)}=X_{3}. Accordingly, the group interleaver 122 may rearrange the order of the plurality of bit groups in bit group wise by changing the 4^{th }bit group to the 0^{th }bit group, the 14^{th }bit group to the 1^{st }bit group, the 13^{th }bit group to the 2^{nd }bit group, . . . , the 43^{rd }bit group to the 43^{rd }bit group, and the 3^{rd }bit group to the 44^{th }bit group.
In the abovedescribed examples, the length of the LDPC codeword is 16200 and the code rate is 5/15, 7/15, 9/15, 11/15, and 13/15. However, this is merely an example and the interleaving pattern may be defined variously when the length of the LDPC codeword is 64800 or the code rate has different values.
As described above, the group interleaver 122 may rearrange the order of the plurality of bit groups in bit group wise by using Equation 21 and Tables 15 to 27.
“jth block of Groupwise Interleaver output” in tables 15 to 27 indicates the jth bit group output from the group interleaver 122 after interleaving, and “π(j)th block of Groupwise Interleaver input” indicates the π(j)th bit group input to the group interleaver 122.
In addition, since the order of the bit groups constituting the LDPC codeword is rearranged by the group interleaver 122 in bit group wise, and then the bit groups are blockinterleaved by the block interleaver 124, which will be described below, “Order of bit groups to be block interleaved” is set forth in Tables 15 to 27 in relation to π(j).
The LDPC codeword which is groupinterleaved in the abovedescribed method is illustrated in
That is, as shown in
The group twist interleaver 123 interleaves bits in a same group. That is, the group twist interleaver 123 may rearrange the order of the bits in the same bit group by changing the order of the bits in the same bit group.
In this case, the group twist interleaver 123 may rearrange the order of the bits in the same bit group by cyclicshifting a predetermined number of bits from among the bits in the same bit group.
For example, as shown in
In addition, the group twist interleaver 123 may rearrange the order of bits in each bit group by cyclicshifting a different number of bits in each bit group.
For example, the group twist interleaver 123 may cyclicshift the bits included in the bit group Y_{1 }to the right by 1 bit, and may cyclicshift the bits included in the bit group Y_{2 }to the right by 3 bits.
However, the abovedescribed group twist interleaver 123 may be omitted according to circumstances.
In addition, the group twist interleaver 123 is placed after the group interleaver 122 in the abovedescribed example. However, this is merely an example. That is, the group twist interleaver 123 changes only the order of bits in a certain bit group and does not change the order of the bit groups. Therefore, the group twist interleaver 123 may be placed before the group interleaver 122.
The block interleaver 124 interleaves the plurality of bit groups the order of which has been rearranged. Specifically, the block interleaver 124 may interleave the plurality of bit groups the order of which has been rearranged by the group interleaver 122 in bit group wise (or bits group unit). The block interleaver 124 is formed of a plurality of columns each including a plurality of rows and may interleave by dividing the plurality of rearranged bit groups based on a modulation order determined according to a modulation method.
In this case, the block interleaver 124 may interleave the plurality of bit groups the order of which has been rearranged by the group interleaver 122 in bit group wise. Specifically, the block interleaver 124 may interleave by dividing the plurality of rearranged bit groups according to a modulation order by using a first part and a second part.
Specifically, the block interleaver 124 interleaves by dividing each of the plurality of columns into a first part and a second part, writing the plurality of bit groups in the plurality of columns of the first part serially in bit group wise, dividing the bits of the other bit groups into groups (or sub bit groups) each including a predetermined number of bits based on the number of columns, and writing the sub bit groups in the plurality of columns of the second part serially.
Herein, the number of bit groups which are interleaved in bit group wise may be determined by at least one of the number of rows and columns constituting the block interleaver 124, the number of bit groups and the number of bits included in each bit group. In other words, the block interleaver 124 may determine the bit groups which are to be interleaved in bit group wise considering at least one of the number of rows and columns constituting the block interleaver 124, the number of bit groups and the number of bits included in each bit group, interleave the corresponding bit groups in bit group wise, and divide bits of the other bit groups into sub bit groups and interleave the sub bit groups. For example, the block interleaver 124 may interleave at least part of the plurality of bit groups in bit group wise using the first part, and divide bits of the other bit groups into sub bit groups and interleave the sub bit groups using the second part.
Meanwhile, interleaving bit groups in bit group wise means that the bits included in the same bit group are written in the same column. In other words, the block interleaver 124, in case of bit groups which are interleaved in bit group wise, may not divide the bits included in the same bit groups and write the bits in the same column, and in case of bit groups which are not interleaved in bit group wise, may divide the bits in the bit groups and write the bits in different columns.
Accordingly, the number of rows constituting the first part is a multiple of the number of bits included in one bit group (for example, 360), and the number of rows constituting the second part may be less than the number of bits included in one bit group.
In addition, in all bit groups interleaved by the first part, the bits included in the same bit group are written and interleaved in the same column of the first part, and in at least one group interleaved by the second part, the bits are divided and written in at least two columns of the second part.
The specific interleaving method will be described later.
Meanwhile, the group twist interleaver 123 changes only the order of bits in the bit group and does not change the order of bit groups by interleaving. Accordingly, the order of the bit groups to be blockinterleaved by the block interleaver 124, that is, the order of the bit groups to be input to the block interleaver 124, may be determined by the group interleaver 122. Specifically, the order of the bit groups to be blockinterleaved by the block interleaver 124 may be determined by π(j) defined in Tables 15 to 27.
As described above, the block interleaver 124 may interleave the plurality of bit groups the order of which has been rearranged in bit group wise by using the plurality of columns each including the plurality of rows.
In this case, the block interleaver 124 may interleave the LDPC codeword by dividing the plurality of columns into at least two parts. For example, the block interleaver 124 may divide each of the plurality of columns into the first part and the second part and interleave the plurality of bit groups constituting the LDPC codeword.
In this case, the block interleaver 124 may divide each of the plurality of columns into N number of parts (N is an integer greater than or equal to 2) according to whether the number of bit groups constituting the LDPC codeword is an integer multiple of the number of columns constituting the block interleaver 124, and may perform interleaving.
When the number of bit groups constituting the LDPC codeword is an integer multiple of the number of columns constituting the block interleaver 124, the block interleaver 124 may interleave the plurality of bit groups constituting the LDPC codeword in bit group wise without dividing each of the plurality of columns into parts.
Specifically, the block interleaver 124 may interleave by writing the plurality of bit groups of the LDPC codeword on each of the columns in bit group wise in a column direction, and reading each row of the plurality of columns in which the plurality of bit groups are written in bit group wise in a row direction.
In this case, the block interleaver 124 may interleave by writing bits included in a predetermined number of bit groups, which corresponds to a quotient obtained by dividing the number of bit groups of the LDPC codeword by the number of columns of the block interleaver 124, on each of the plurality of columns serially in a column direction, and reading each row of the plurality of columns in which the bits are written in a row direction.
Hereinafter, the group located in the j^{th }position after being interleaved by the group interleaver 122 will be referred to as group Y_{j}.
For example, it is assumed that the block interleaver 124 is formed of C number of columns each including R_{1 }number of rows. In addition, it is assumed that the LDPC codeword is formed of N_{group }number of bit groups and the number of bit groups N_{group }is a multiple of C.
In this case, when the quotient obtained by dividing N_{group }number of bit groups constituting the LDPC codeword by C number of columns constituting the block interleaver 124 is A (=N_{group}/C) (A is an integer greater than 0), the block interleaver 124 may interleave by writing A (=N_{group}/C) number of bit groups on each column serially in a column direction and reading bits written on each column in a row direction.
For example, as shown in
Accordingly, the block interleaver 124 interleaves all bit groups constituting the LDPC codeword in bit group wise.
However, when the number of bit groups of the LDPC codeword is not an integer multiple of the number of columns of the block interleaver 124, the block interleaver 124 may divide each column into 2 parts and interleave a part of the plurality of bit groups of the LDPC codeword in bit group wise, and divide bits of the other bit groups into sub bit groups and interleave the sub bit groups. In this case, the bits included in the other bit groups, that is, the bits included in the number of groups which correspond to the remainder when the number of bit groups constituting the LDPC codeword is divided by the number of columns are not interleaved in bit group wise, but interleaved by being divided according to the number of columns.
Specifically, the block interleaver 124 may interleave the LDPC codeword by dividing each of the plurality of columns into two parts.
In this case, the block interleaver 124 may divide the plurality of columns into the first part and the second part based on at least one of the number of columns of the block interleaver 124, the number of bit groups of the LDPC codeword, and the number of bits of bit groups.
Here, each of the plurality of bit groups may be formed of 360 bits. In addition, the number of bit groups of the LDPC codeword is determined based on the length of the LDPC codeword and the number of bits included in the bit group. For example, when an LDPC codeword in the length of 16200 is divided such that each bit group has 360 bits, the LDPC codeword is divided into 45 bit groups. Alternatively, when an LDPC codeword in the length of 64800 is divided such that each bit group has 360 bits, the LDPC codeword may be divided into 180 bit groups. Further, the number of columns constituting the block interleaver 124 may be determined according to a modulation method. This will be explained in detail below.
Accordingly, the number of rows constituting each of the first part and the second part may be determined based on the number of columns constituting the block interleaver 124, the number of bit groups constituting the LDPC codeword, and the number of bits constituting each of the plurality of bit groups.
Specifically, in each of the plurality of columns, the first part may be formed of as many rows as the number of bits included in at least one bit group which can be written in each column in bit group wise from among the plurality of bit groups of the LDPC codeword, according to the number of columns constituting the block interleaver 124, the number of bit groups constituting the LDPC codeword, and the number of bits constituting each bit group.
In each of the plurality of columns, the second part may be formed of rows excluding as many rows as the number of bits included in at least some bit groups which can be written in each of the plurality of columns in bit group wise. Specifically, the number rows of the second part may be the same value as a quotient when the number of bits included in all bit groups excluding bit groups corresponding to the first part is divided by the number of columns constituting the block interleaver 124. In other words, the number of rows of the second part may be the same value as a quotient when the number of bits included in the remaining bit groups which are not written in the first part from among bit groups constituting the LDPC codeword is divided by the number of columns.
That is, the block interleaver 124 may divide each of the plurality of columns into the first part including as many rows as the number of bits included in bit groups which can be written in each column in bit group wise, and the second part including the other rows.
Accordingly, the first part may be formed of as many rows as the number of bits included in bit groups, that is, as many rows as an integer multiple of M. However, since the number of codeword bits constituting each bit group may be an aliquot part of M as described above, the first part may be formed of as many rows as an integer multiple of the number of bits constituting each bit group.
In this case, the block interleaver 124 may interleave by writing and reading the LDPC codeword in the first part and the second part in the same method.
Specifically, the block interleaver 124 may interleave by writing the LDPC codeword in the plurality of columns constituting each of the first part and the second part in a column direction, and reading the plurality of columns constituting the first part and the second part in which the LDPC codeword is written in a row direction.
That is, the block interleaver 124 may interleave by writing the bits included in at least some bit groups which can be written in each of the plurality of columns in bit group wise in each of the plurality of columns of the first part serially, dividing the bits included in the other bit groups except the at least some bit groups and writing in each of the plurality of columns of the second part in a column direction, and reading the bits written in each of the plurality of columns constituting each of the first part and the second part in a row direction.
In this case, the block interleaver 124 may interleave by dividing the other bit groups except the at least some bit groups from among the plurality of bit groups based on the number of columns constituting the block interleaver 124.
Specifically, the block interleaver 124 may interleave by dividing the bits included in the other bit groups by the number of a plurality of columns, writing each of the divided bits in each of a plurality of columns constituting the second part in a column direction, and reading the plurality of columns constituting the second part, where the divided bits are written, in a row direction.
That is, the block interleaver 124 may divide the bits included in the other bit groups except the bit groups written in the first part from among the plurality of bit groups of the LDPC codeword, that is, the bits in the number of bit groups which correspond to the remainder when the number of bit groups constituting the LDPC codeword is divided by the number of columns, by the number of columns, and may write the divided bits in each column of the second part serially in a column direction.
In this case, the block interleaver 124 may interleave by dividing the other bit groups except the at least some bit groups from among the plurality of bit groups based on the number of columns constituting the block interleaver 124.
To be specific, the block interleaver 124 may interleave by dividing the bits included in the reminder bit groups by the number of a plurality of columns, writing each of the divided bits in each of a plurality of columns constituting the second part in a column direction, and reading the plurality of columns constituting the second part, where the divided bits are written in a row direction.
That is, the block interleaver 124 may divide the bits included in the other bit groups except the bit groups written in the first part from among the plurality of bit groups constituting the LDPC codeword, that is, the bits in the number of bit groups which correspond to the remainder when the number of bit groups constituting the LDPC codeword is divided by the number of columns, and may write the divided bits in each column of the second part serially in a column direction.
For example, it is assumed that the block interleaver 124 is formed of C number of columns each including R_{1 }number of rows. In addition, it is assumed that the LDPC codeword is formed of N_{group }number of bit groups, the number of bit groups N_{group }is not a multiple of C, and A×C+1=N_{group }(A is an integer greater than 0). In other words, it is assumed that when the number of bit groups constituting the LDPC codeword is divided by the number of columns, the quotient is A and the remainder is 1.
In this case, as shown in
That is, in the abovedescribed example, the number of bit groups which can be written in each column in bit group wise is A, and the first part of each column may be formed of as many rows as the number of bits included in A number of bit groups, that is, may be formed of as many rows as A×M number.
In this case, the block interleaver 124 writes the bits included in the bit groups which can be written in each column in bit group wise, that is, A number of bit groups, in the first part of each column in the column direction.
That is, as shown in
As described above, the block interleaver 124 writes the bits included in the bit groups which can be written in each column in bit group wise in the first part of each column.
In other words, in the above exemplary embodiment, the bits included in each of bit group (Y_{0}), bit group (Y_{1}), . . . , bit group (Y_{A−1}) may not be divided and all of the bits may be written in the first column, the bits included in each of bit group (Y_{A}), bit group (Y_{A+1}), . . . , bit group (Y_{2A1}) may not be divided and all of the bits may be written in the second column, and the bits included in each of bit group (Y_{CAA}), bit group (Y_{CAA+1}), . . . , group (Y_{CA1}) may not be divided and all of the bits may be written in the C column. As such, all bit groups interleaved by the first part are written in the same column of the first part.
Thereafter, the block interleaver 124 divides bits included in the other bit groups except the bit groups written in the first part of each column from among the plurality of bit groups, and writes the bits in the second part of each column in the column direction. In this case, the block interleaver 124 divides the bits included in the other bit groups except the bit groups written in the first part of each column by the number of columns, so that the same number of bits are written in the second part of each column, and writes the divided bits in the second part of each column in the column direction.
In the abovedescribed example, since A×C+1=N_{group}, when the bit groups constituting the LDPC codeword are written in the first part serially, the last bit group Y_{Ngroup1 }of the LDPC codeword is not written in the first part and remains. Accordingly, the block interleaver 124 divides the bits included in the bit group Y_{Ngroup1 }into C number of sub bit groups as shown in
The bits divided based on the number of columns may be referred to as sub bit groups. In this case, each of the sub bit groups may be written in each column of the second part. That is, the bits included in the bit groups may be divided and may form the sub bit groups.
That is, the block interleaver 124 writes the bits in the 1^{st }to R_{2}^{th }rows of the second part of the 1^{st }column, writes the bits in the 1^{st }to R_{2}^{th }rows of the second part of the 2^{nd }column, . . . , and writes the bits in the 1^{st }to R_{2}^{th }rows of the second part of the column C. In this case, the block interleaver 124 may write the bits in the second part of each column in the column direction as shown in
That is, in the second part, the bits constituting the bit group may not be written in the same column and may be written in the plurality of columns. In other words, in the above example, the last bit group (Y_{Ngroup1}) is formed of M number of bits and thus, the bits included in the last bit group (Y_{Ngroup1}) may be divided by M/C and written in each column. That is, the bits included in the last bit group (Y_{Ngroup1}) are divided by M/C, forming M/C number of sub bit groups, and each of the sub bit groups may be written in each column of the second part.
Accordingly, in at least one bit group which is interleaved by the second part, the bits included in the at least one bit group are divided and written in at least two columns constituting the second part.
In the abovedescribed example, the block interleaver 124 writes the bits in the second part in the column direction. However, this is merely an example. That is, the block interleaver 124 may write the bits in the plurality of columns of the second part in the row direction. In this case, the block interleaver 124 may write the bits in the first part in the same method as described above.
Specifically, referring to
On the other hand, the block interleaver 124 reads the bits written in each row of each part serially in the row direction. That is, as shown in
Accordingly, the block interleaver 124 may interleave a part of the plurality of bit groups constituting the LDPC codeword in bit group wise, and divide and interleave some of the remaining bit groups. That is, the block interleaver 124 may interleave by writing the LDPC codeword constituting a predetermined number of bit groups from among the plurality of bit groups in the plurality of columns of the first part in bit group wise, dividing the bits of the other bit groups and writing the bits in each of the columns of the second part, and reading the plurality of columns of the first and second parts in the row direction.
As described above, the block interleaver 124 may interleave the plurality of bit groups in the methods described above with reference to
In particular, in the case of
However, the bit group which does not belong to the first part may not be interleaved as shown in
In
The block interleaver 124 may have a configuration as shown in tables 28 and 29 presented below:
Herein, C (or N_{C}) is the number of columns of the block interleaver 124, R_{1 }is the number of rows constituting the first part in each column, and R_{2 }is the number of rows constituting the second part in each column.
Referring to Tables 28 and 29, the number of columns has the same value as a modulation order according to a modulation method, and each of a plurality of columns is formed of rows corresponding to the number of bits constituting the LDPC codeword divided by the number of a plurality of columns.
For example, when the length N_{ldpc }of the LDPC codeword is 16200 and the modulation method is 16QAM, the block interleaver 124 if formed of 4 columns as the modulation order is 4 in the case of 16QAM, and each column is formed of rows as many as R_{1}+R_{2}=4050(=16200/4).
Meanwhile, referring to Tables 28 and 29, when the number of bit groups constituting an LDPC codeword is an integer multiple of the number of columns, the block interleaver 124 interleaves without dividing each column. Therefore, R_{1 }corresponds to the number of rows constituting each column, and R_{2 }is 0. In addition, when the number of bit groups constituting an LDPC codeword is not an integer multiple of the number of columns, the block interleaver 124 interleaves the groups by dividing each column into the first part formed of R_{1 }number of rows, and the second part formed of R_{2 }number of rows.
When the number of columns of the block interleaver 124 is equal to the number of bits constituting a modulation symbol, bits included in a same bit group are mapped onto a single bit of each modulation symbol as shown in Tables 28 and 29.
For example, when N_{ldpc}=16200 and the modulation method is 16QAM, the block interleaver 124 may be formed of four (4) columns each including 4050 rows. In this case, the bits included in each of the plurality of bit groups are written in the four (4) columns and the bits written in the same row in each column are output serially. In this case, since four (4) bits constitute a single modulation symbol in the modulation method of 256QAM, bits included in the same bit group, that is, bits output from a single column, may be mapped onto a single bit of each modulation symbol. For example, bits included in a bit group written in the 1^{st }column may be mapped onto the first bit of each modulation symbol.
Referring to Tables 28 and 29, the total number of rows of the block interleaver 124, that is, R_{1}+R_{2}, is N_{ldpc}/C.
In addition, the number of rows of the first part, R_{1}, is an integer multiple of the number of bits included in each group, M (e.g., M=360), and maybe expressed as └N_{group}/C┘×M, and the number of rows of the second part, R_{2}, may be N_{ldpc}/C−R_{1}. Herein, └N_{group}/C┘ is the largest integer below N_{group}/C. Since R_{1 }is an integer multiple of the number of bits included in each group, M, bits may be written in R_{1 }in bit groups wise.
In addition, when the number of bit groups of the LDPC codeword is not a multiple of the number of columns, it can be seen from Tables 28 and 29 that the block interleaver 124 interleaves by dividing each column into two parts.
Specifically, the length of the LDPC codeword divided by the number of columns is the total number of rows included in the each column. In this case, when the number of bit groups of the LDPC codeword is a multiple of the number of columns, each column is not divided into two parts. However, when the number of bit groups of the LDPC codeword is not a multiple of the number of columns, each column is divided into two parts.
For example, it is assumed that the number of columns of the block interleaver 124 is identical to the number of bits constituting a modulation symbol, and an LDPC codeword is formed of 64800 bits as shown in Table 28. In this case, each bit group of the LDPC codeword is formed of 360 bits, and the LDPC codeword is formed of 64800/360(=180) bit groups.
When the modulation method is 16QAM, the block interleaver 124 may be formed of four (4) columns and each column may have 64800/4(=16200) rows.
In this case, since the number of bit groups of the LDPC codeword divided by the number of columns is 180/4(=45), bits can be written in each column in bit group wise without dividing each column into two parts. That is, bits included in 45 bit groups which is the quotient when the number of bit groups constituting the LDPC codeword is divided by the number of columns, that is, 45×360(=16200) bits can be written in each column.
However, when the modulation method is 256QAM, the block interleaver 124 may be formed of eight (8) columns and each column may have 64800/8(=8100) rows.
In this case, since the number of bit groups of the LDPC codeword divided by the number of columns is 180/8=22.5, the number of bit groups constituting the LDPC codeword is not an integer multiple of the number of columns. Accordingly, the block interleaver 124 divides each of the eight (8) columns into two parts to perform interleaving in bit group wise.
In this case, since the bits should be written in the first part of each column in bit group wise, the number of bit groups which can be written in the first part of each column in bit group wise is 22, which is the quotient when the number of bit groups constituting the LDPC codeword is divided by the number of columns, and accordingly, the first part of each column has 22×360(=7920) rows. Accordingly, 7920 bits included in 22 bit groups may be written in the first part of each column.
The second part of each column has rows which are the rows of the first part subtracted from the total rows of each column. Accordingly, the second part of each column includes 8100−7920(=180) rows.
In this case, the bits included in the other bit groups which have not been written in the first part are divided and written in the second part of each column.
Specifically, since 22×8(=176) bit groups are written in the first part, the number of bit groups to be written in the second part is 180−176 (=4) (for example, bit group Y_{176}, bit group Y_{177}, bit group Y_{179 }from among bit group Y_{0}, bit group Y_{1}, bit group Y_{2}, . . . , constituting the LDPC codeword).
Accordingly, the block interleaver 124 may write the four (4) bit groups which have not been written in the first part and remains from among the groups constituting the LDPC codeword in the second part of each column serially.
That is, the block interleaver 124 may write 180 bits of the 360 bits included in the bit group Y_{176 }in the 1^{st }row to the 180^{th }row of the second part of the 1^{st }column in the column direction, and may write the other 180 bits in the 1st row to the 180^{th }row of the second part of the 2^{nd }column in the column direction. In addition, the block interleaver 124 may write 180 bits of the 360 bits included in the bit group Y_{177 }in the 1^{st }row to the 180^{th }row of the second part of the 3^{rd }column in the column direction, and may write the other 180 bits in the 1^{st }row to the 180^{th }row of the second part of the 4^{th }column in the column direction. In addition, the block interleaver 124 may write 180 bits of the 360 bits included in the bit group Y_{178 }in the I^{st }row to the 180^{th }row of the second part of the 5^{th }column in the column direction, and may write the other 180 bits in the 1^{st }row to the 180^{th }row of the second part of the 6^{th }column in the column direction. In addition, the block interleaver 124 may write 180 bits of the 360 bits included in the bit group Y_{179 }in the 1st row to the 180^{th }row of the second part of the 7^{th }column in the column direction, and may write the other 180 bits in the 1st row to the 180^{th }row of the second part of the 8^{th }column in the column direction.
Accordingly, the bits included in the bit group which has not been written in the first part and remains are not written in the same column in the second part and may be divided and written in the plurality of columns.
Hereinafter, the block interleaver 124 of
In a groupinterleaved LDPC codeword (v_{0}, v_{1}, . . . , v_{N}_{ldpc}_{1}), Y_{j }is continuously arranged like V={Y_{0}, Y_{1}, . . . Y_{N}_{group}_{1}}.
The LDPC codeword after group interleaving may be interleaved by the block interleaver 124 as shown in
Specifically, input bits vi are written serially from the first part to the second part column wise, and then read out serially from the first part to the second part row wise. That is, the data bits v_{i }are written serially into the block interleaver columnwise starting in the first part and continuing columnwise finishing in the second part, and then read out serially rowwise from the first part and then rowwise from the second part. Accordingly, the bit included in the same bit group in the first part may be mapped onto a single bit of each modulation symbol.
In this case, the number of columns and the number of rows of the first part and the second part of the block interleaver 124 vary according to a modulation format and a length of the LDPC codeword as in Table 30 presented below. That is, the first part and the second part block interleaving configurations for each modulation format and code length are specified in Table 30 presented below. Herein, the number of columns of the block interleaver 124 may be equal to the number of bits constituting a modulation symbol. In addition, a sum of the number of rows of the first part, N_{r1 }and the number of rows of the second part, N_{r2}, is equal to N_{ldpc}/N_{C }(herein, N_{C }is the number of columns). In addition, since N_{r1}(=└N_{group}/N_{C}┘×360) is a multiple of 360, a multiple of bit groups may be written in the first part.
Hereinafter, an operation of the block interleaver 124 will be explained in detail.
Specifically, as shown in
and r_{i}=(i mod N_{r1}), respectively.
In addition, the input bit v_{i }(N_{C}×N_{r1}≤i<N_{ldpc}) is written in r_{i }row of c_{i }column of the second part of the block interleaver 124. Herein, c_{i }and r_{i }satisfy
and r_{i}=N_{r1}+{(i−N_{C}×N_{r1})mod N_{r2}}, respectively.
An output bit q_{j}(0≤j<N_{ldpc}) is read from c_{j }column of r_{j }row. Herein, r_{j }and c_{j }satisfy
and c_{j}=(j mod N_{C}), respectively.
For example, when the length N_{ldpc }of an LDPC codeword is 64800 and the modulation method is 256QAM, the order of bits output from the block interleaver 124 may be (q_{0}, q_{1}, q_{2}, . . . , q_{63357}, q_{63358}, q_{63359}, q_{63360}, q_{63361}, . . . , q_{64799})=(v_{0}, v_{7920}, v_{15840}, . . . , v_{47519}, v_{55439}, v_{63359}, v_{63360}, v_{63540}, . . . , v_{64799}). Herein, the indexes of the right side of the foregoing equation may be specifically expressed for the eight (8) columns as 0, 7920, 15840, 23760, 31680, 39600, 47520, 55440, 1, 7921, 15841, 23761, 31681, 39601, 47521, 55441, . . . , 7919, 15839, 23759, 31679, 39599, 47519, 55439, 63359, 63360, 63540, 63720, 63900, 64080, 64260, 64440, 64620, . . . , 63539, 63719, 63899, 64079, 64259, 64439, 64619, 64799.
Hereinafter, the interleaving operation of the block interleaver 124 will be explained in detail.
The block interleaver 124 may interleave by writing a plurality of bit groups in each column in bit group wise in a column direction, and reading each row of the plurality of columns in which the plurality of bit groups are written in bit group wise in a row direction.
In this case, the number of columns constituting the block interleaver 124 may vary according to a modulation method, and the number of rows may be the length of the LDPC codeword/the number of columns.
For example, when the modulation method is 16QAM, the block interleaver 124 may be formed of 4 columns. In this case, when the length N_{ldpc }of the LDPC codeword is 16200, the number of rows is 4050 (=16200/4).
Hereinafter, the method for interleaving the plurality of bit groups in bit group wise by the block interleaver 124 will be explained in detail.
When the number of bit groups constituting the LDPC codeword is an integer multiple of the number of columns, the block interleaver 124 may interleave by writing the bit groups as many as the number of bit groups divided by the number of columns in each column serially in bit group wise.
For example, when the modulation method is 16QAM and the length N_{ldpc }of the LDPC codeword is 16200, the block interleaver 124 may be formed of four (4) columns each including 4050 rows. In this case, since the LDPC codeword is divided into (16200/360=45) number of bit groups when the length N_{ldpc }of the LDPC codeword is 64800, the number of bit groups (=45) of the LDPC codeword may not be an integer multiple of the number of columns (=4) when the modulation method is 16QAM. That is, remainder is generated when the number of bit groups of the LDPC codeword is divided by the number of columns.
As described above, when the number of the bit groups constituting the LDPC codeword is not an integer multiple of the number of columns constituting the block interleaver 124, the block interleaver 124 may divide each column into N number of parts (N is an integer greater than or equal to 2) and perform interleaving.
To be specific, the block interleaver 124 may divide each column into a part which includes rows as many as the number of bits included in a bit group which can be written in each column in bit group wise (that is, the first part) and a part including remaining rows (that is, the second part), and perform interleaving using each of the divided part.
Here, the part which includes rows as many as the number of bits included in a bit group that can be written in bit group wise, that is, the first part may be composed of rows as many as an integer multiple of M. That is, when the modulation method is 256QAM, each column of the block interleaver 124 consists of 4050 rows, and thus each column of the block interleaver 124 may be composed of the first part including 3960 (=360×11) rows and the second part including 90 (=40503960) rows.
In this case, the block interleaver 124, after sequentially writing at least a part of bit groups which can be written in bit group wise to each of the plurality of columns from among the plurality of bit groups, may divide and write remaining bit groups at an area remaining from an area where at least a part of bit groups are written at each of a plurality of columns. That is, the block interleaver 124 may write bits included in at least a part of bit groups that can be written in the first part of each column in bit group wise, and divide and write the bits included in the remaining bit group in the second part of each column.
For example, when the modulation method is 16QAM, as illustrated in
In this case, the block interleaver 124 write bits included in the bit group that can be written in group wise in the first part of each column in a column direction.
That is, the block interleaver 124, as illustrated in
As described above, the block interleaver 124 writes bits included in the bit group that can be written in group wise in the first part of each column in bit group wise.
Thereafter, the block interleaver 124 may divide bits included in remaining bit groups excluding the group written in the first part of each column, from among a plurality of groups, and write in the second part of each column in a column direction. In this case, the block interleaver 124, so that the same number of bits can be written in the second part of each column, may divide the bits included in the remaining bit groups excluding the bit group written in the first part of a column into the number of columns, and write the divided bit to each column of the second part in a column direction.
For example, as illustrated in
That is, the block interleaver 124 may write bits from the 1^{st }row to the 90^{th }row of the second part of the first column, may write bits from the 1^{st }row to the 90^{th }row of the second part of the second column, may write bits from the 1^{st }row to the 90^{th }row of the second part of the third column, may write bits from the 1^{st }row to the 90^{th }row of the second part of the fourth column. In this case, the block interleaver 124 may write bits in the second part of each column in a column direction as illustrated in
Meanwhile, in the aforementioned example, it is described that the block interleaver 124 write bits in the second part in a column direction, it is merely exemplary. That is, the block interleaver 124 may write bits in a plurality of columns of the second part in a row direction. Meanwhile, the block interleaver 124 may write bits in the same manner as mentioned above, as to the first part.
To be specific, referring to
Meanwhile, the block interleaver 124 sequentially reads the bits written in each row of each part in a row direction. That is, the block interleaver 124, as illustrated in
As described above, the block interleaver 124 may interleave the plurality of bit groups of the LDPC codeword in the method described above with reference to
The modulator 130 maps the interleaved LDPC codeword onto a modulation symbol. Specifically, the modulator 130 may demultiplex the interleaved LDPC codeword, modulate the demultiplexed LDPC codeword, and map the LDPC codeword onto a constellation.
First, the modulator 130 demultiplexes the interleaved LDPC codeword. To achieve this, the modulator 130 may include a demultiplexer (not shown) to demultiplex the interleaved LDPC codeword.
The demultiplexer (not shown) demultiplexes the interleaved LDPC codeword. Specifically, the demultiplexer (not shown) performs serialtoparallel conversion with respect to the interleaved LDPC codeword, and demultiplexes the interleaved LDPC codeword into a cell having a predetermined number of bits (or a data cell).
For example, as shown in
In this case, the bits having the same index in each of the plurality of substreams may constitute the same cell. Accordingly, the cells may be configured like (y_{0,0}, y_{1,0}, . . . , y_{ηMOD−1,0})=(q_{0}, q_{1}, q_{ηMOD−1}), (y_{0,1}, y_{1,1}, . . . , y_{ηMOD−1,1})=(q_{ηMOD}, q_{ηMOD+1}, . . . , q_{2×ηMOD−1}), . . . .
Herein, the number of substreams, N_{substreams}, may be equal to the number of bits constituting a modulation symbol, η_{MOD}. Accordingly, the number of bits constituting each cell may be equal to the number of bits constituting a modulation symbol (that is, a modulation order).
For example, when the modulation method is 16QAM, the number of bits constituting the modulation symbol, η_{MOD}, is 8 and thus the number of substreams, N_{substreams}, is 4, and the cells may be configured like (y_{0,0}, y_{1,0}, y_{2,0}, y_{3,0})=(q_{0}, q_{1}, q_{2}, q_{3}, q_{4}), (y_{0,1}, y_{1,1}, y_{2,1}, y_{3,1, 1})=(q_{4}, q_{5}, q_{6}, q_{7}), (y_{0,2}, y_{1,2}, y_{2,2}, y_{3,2})=(q_{8}, q_{9}, q_{10}, q_{11}), . . . .
The modulator 130 may map the demultiplexed LDPC codeword onto modulation symbols.
Specifically, the modulator 130 may modulate bits (that is, cells) output from the demultiplexer (not shown) in various modulation methods such as 16QAM, etc. For example, when the modulation method is QPSK, 16QAM, 64QAM, 256QAM, 1024QAM, and 4096QAM, the number of bits constituting the modulation symbol, η_{MOD }(that is, the modulation order), may be 2, 4, 6, 8, 10 and 12, respectively.
In this case, since each cell output from the demultiplexer (not shown) is formed of as many bits as the number of bits constituting the modulation symbol, the modulator 130 may generate the modulation symbol by mapping each cell output from the demultiplexer (not shown) onto a constellation point serially. Herein, the modulation symbol corresponds to a constellation point on the constellation.
However, the abovedescribed demultiplexer (not shown) may be omitted according to circumstances. In this case, the modulator 130 may generate modulation symbols by grouping a predetermined number of bits from interleaved bits serially and mapping the predetermined number of bits onto constellation points. In this case, the modulator 130 may generate the modulation symbols by mapping η_{MOD }number of bits onto the constellation points serially according to a modulation method.
The modulator 130 may modulate by mapping cells output from the demultiplexer (not shown) onto constellation points in a nonuniform constellation (NUC) method.
In the nonuniform constellation method, once a constellation point of the first quadrant is defined, constellation points in the other three quadrants may be determined as follows. For example, when a set of constellation points defined for the first quadrant is X, the set becomes −conj(X) in the case of the second quadrant, becomes conj(X) in the case of the third quadrant, and becomes −(X) in the case of the fourth quadrant.
That is, once the first quadrant is defined, the other quadrants may be expressed as follows:
1 Quarter (first quadrant)=X
2 Quarter (second quadrant)=−conj(X)
3 Quarter (third quadrant)=conj(X)
4 Quarter (fourth quadrant)=−X
Specifically, when the nonuniform MQAM is used, M number of constellation points may be defined as z={z_{0}, z_{1}, . . . , z_{M1}}. In this case, when the constellation points existing in the first quadrant are defined as {x_{0}, x_{1}, x_{2}, . . . , x_{M/41}}, z may be defined as follows:
from z_{0 }to z_{M/41}=from x_{0 }to x_{M/4 }
from z_{M/4 }to z_{2×M/41}=−conj(from x_{0 }to x_{M/4})
from z_{2×M/4 }to z_{3×M/41}=conj(from x_{0 }to x_{M/4})
from z_{3×M/4 }to z_{4×M/41}=−(from x_{0 }to x_{M/4})
Accordingly, the modulator 130 may map the bits [y_{0}, . . . , y_{m1}] output from the demultiplexer (not shown) onto constellation points in the nonuniform constellation method by mapping the output bits onto z_{L }having an index of
An example of the constellation defined according to the nonuniform constellation method may be expressed as in table 31 presented below when the code rate is 5/15, 7/15, 9/15, 11/15, 13/15:
The interleaving is performed in the abovedescribed method for the following reasons.
Specifically, when the LDPC codeword bits are mapped onto the modulation symbol, the bits may have different reliability (that is, receiving performance or receiving probability) according to where the bits are mapped onto in the modulation symbol. The LDPC codeword bits may have different codeword characteristics according to the configuration of a parity check matrix. That is, the LDPC codeword bits may have different codeword characteristics according to the number of 1 existing in the column of the parity check matrix, that is, the column degree.
Accordingly, the interleaver 120 may interleave to map the LDPC codeword bits having a specific codeword characteristic onto specific bits in the modulation symbol by considering both the codeword characteristics of the LDPC codeword bits and the reliability of the bits constituting the modulation symbol.
For example, when the LDPC codeword formed of bit groups X_{0 }to X_{44 }is groupinterleaved based on Equation 12 and Table 15, the group interleaver 122 may output the bit groups in the order of X_{3}, X_{33}, X_{39}, . . . , X_{35}, X_{27}.
In this case, the number of columns of the block interleaver 124 is four (4) and the number of rows in the first part is 3960 and the number of rows in the second part is 90.
Accordingly, from among the 45 groups constituting the LDPC codeword 11 bit groups (X_{3}, X_{33}, X_{39}, X_{2}, X_{38}, X_{29}, X_{0}, X_{10}, X_{25}, X_{17}, X_{7}) may be inputted to the first part of the first column of the block interleaver 124, 11 bit groups (X_{21}, X_{44}, X_{37}, X_{8}, X_{34}, X_{20}, X_{1}, X_{4}, X_{31}, X_{11}, X_{42}) may be inputted to the first part of the second column of the block interleaver 124, 11 bit groups (X_{22}, X_{13}, X_{12}, X_{28}, X_{26}, X_{43}, X_{30}, X_{14}, X_{16}, X_{23}, X_{24}) may be inputted to the first part of the third column of the block interleaver 124, 11 bit groups (X_{15}, X_{5}, X_{18}, X_{9}, X_{36}, X_{6}, X_{19}, X_{32}, X_{40}, X_{41}, X_{35}) may be inputted to the first part of the fourth column of the block interleaver 124.
The group X_{27 }is input to the second part of the block interleaver 124. To be specific, from among 360 bits constituting the group X_{27}, bits are serially inputted to the second part of the first column, the second part of the second column, the second part of the third column, and the second part of the fourth column by 90 bits.
In addition, the block interleaver 124 may output the bits inputted to the 1^{st }row to the last row of each column serially, and the bits outputted from the block interleaver 124 may be inputted to the modulator 130 serially. In this case, the demultiplexer (not shown) may be omitted or the bits may be outputted serially without changing the order of bits inputted to the demultiplexer (not shown). Accordingly, the bits included in each of the bit groups X_{3}, X_{21}, X_{22}, X_{15 }may constitute the modulation symbol.
As described above, since a specific bit is mapped onto a specific bit in a modulation symbol through interleaving, a receiver side can achieve high receiving performance and high decoding performance.
Hereinafter, a method for determining π(j), which is a parameter used for group interleaving, according to various exemplary embodiments, will be explained. The criteria which needs to be considered is as shown below:
Criteria 1) Determine different interleaving orders based on a modulation method and a code rate.
Criteria 2) Consider functional features of each bit group of an LDPC codeword and functional features of bits constituting a modulation symbol at the same time.
For example, in an LDPC codeword, performance characteristics vary in group wise by the degree of variable node corresponding to bits constituting of each group, that is, the number of edges connected to the variable node, and characteristics of graphs connected to the variable node. In general, the greater is the degree of the variable node, the better is the performance.
Meanwhile, bits constituting a modulation symbol may have different performance characteristics. For example, when using nonuniform 16QAM (hereinafter, 16NUQ) constellation as illustrated in Table 31, with respect to four (4) bits y_{0}, y_{1}, y_{2}, y_{3 }constituting a 16NUQ symbol, signal reception performance of each bit (P(yi)) is represented by P(y_{0})≥P(y_{1})≥P(y_{2})≥P(y_{3}).
Therefore, when using an LDPC code of which a length is 16200, and 16NUQ, the characteristics of the LDPC code and a modulation method need to be considered, and to which bit, from among four (4) bits constituting a 16NUQ symbol, each bit group of 45 bit groups is mapped needs to be selected.
In this case, the first column of the block interleaver 124 corresponds to y_{0 }having the highest performance from among four (4) bits constituting the 16NUQ symbol, the second column corresponds to y_{1}, the third column corresponds to y_{2}, 4^{th }column corresponds to y_{3}. Here, 45 is not a multiple number of four (4), and thus, one (1) bit groups corresponding to the second part of the block interleaver 124 may correspond four (4) bits constituting a 16NUQ symbol. For example, when one bit group of an LDPC codeword is written in the first column and the 4^{th }column of the second part, and this bit group may be mapped on y_{0}, y_{1}, y_{2}, y_{3}.
Accordingly, when an LDPC codeword of which a length is 16200 and 16NUQ are used, from among four (4) bits constituting a 16NUQ symbol, eleven (11) bit groups to be mapped onto y_{0 }need to be selected, eleven (11) bit groups to be mapped onto y_{1 }need to be selected, eleven (11) bit groups to be mapped onto y_{2 }need to be selected, eleven (11) bit groups to be mapped onto y_{3 }need to be selected, and one (1) bit group to be mapped onto y_{0}, y_{1}, y_{2}, y_{3 }needs to be selected.
Meanwhile, in order to predict decoding performance in reference to an LDPC code and a modulation method, a density evolution method can be used. The density evolution method is performed by receiving a probability density function (PDF) with respect to a loglikelihood ratio (LLR) for each bit group of an LDPC codeword and calculating a minimum signaltonoise ratio (SNR) which satisfies quasi error free (QEF). Here, the SNR is called a noise threshold.
The 16NUQ is formed of four (4) bit levels. Here, a PDF of an LLR value which corresponds to each bit level is g_{0}(x), g_{1}(x), g_{2}(x), g_{3}(x). That is, when i is an integer between 0 and 3, from among four (4) bits constituting a 16NUQ symbol, the PDF with respect to the LLR value of the channel output value corresponding to y_{1 }is g_{1}(x).
Meanwhile, from among 45 bit groups constituting an LDPC codeword of which a length is 16200, the PDF of a channel LLR with respect to eleven (11) bit groups corresponding to the first part is f_{1}(x), the PDF of the channel LLR with respect to eleven (11) bit groups corresponding to the second part is f_{2}(x), the PDF of the channel LLR with respect to eleven (11) bit groups corresponding to the third part is f_{3}(x), the PDF of the channel LLR with respect to eleven (11) bit groups corresponding to the fourth part is f_{4}(x). In addition, the PDF of the channel LLR with respect to one (1) bit group corresponding to the first columns, second columns, third columns and 4^{th }columns of the second part is f_{5}(x). In this case, the relation formula as Equation 22 shown below can be conceived.
f_{1}(x)=g_{0}(x), f_{2}(x)=g_{1}(x), f_{3}(x)=g_{2}(x), f_{4}(x)=g_{3}(x), f_{5}(x)=(g_{0}(x)+g_{1}(x)+g_{2}(x)+g_{3}(x))/4 [Equation 22]
In various exemplary embodiments, in a process of designing a group interleaver by determining π(j) which is a parameter used for group interleaving, the first step is a process to select one from among f_{1}(x) to f_{5}(x) as each of PDFs of LLR values of 45 bit groups constituting an LDPC codeword of which length is 16200.
At step 11 of the first step of a group interleaver design, PDFs of LLR values of all bit groups are not selected. Therefore, when using the density evolution method, the PDFs with respect to the LLR values of the all bit groups use f_{remain}(x) value according to Equation 23. This is a weighted average of PDFs which are not yet selected.
f_{remain}(x)=(11×f_{1}(x)+11f_{2}(x)+11f_{3}(x)11×f_{4}(x)+f_{5}(x))/45 [Equation 23]
At step 12 of the first step of the group interleaver design, a PDF of an LLR value of each bit group is selected from among f_{1}(x) to f_{5}(x). There are a total of 45 bit groups, and a total of five (5) PDFs can be selected for respective of bit groups. For example, it can be assumed that f_{1}(x) is selected as a PDF of the first bit group, and PDFs of the remaining bit groups are not selected. In this case, for PDFs of the remaining bit groups, f_{remain}(x) is used as Equation 24 shown below. This is a weighted average value of PDFs which are not yet selected.
f_{remainn}(x)=(10×f_{1}(x)+11×f_{2}(x)+11×f_{3}(x)+11×f_{4}(x)+f_{5}(x))/44 [Equation 24]
At the above step, in order for f_{1}(x) to be selected as the PDF of the first bit group, one of cases in which an value of a noise threshold obtained by the density evolution method is the least may be selected arbitrarily, according to an exemplary embodiment. The noise thresholds are different according to channels, and the channel and noise threshold considered in the present invention will be described in greater detail later
At step 13 of the group interleaver design, a next bit group for which a PDF is selected, and also, the PDF is selected for this bit group, based on the step 12. For example, if it is assumed that, at the 12 step, f_{1}(x) is selected as the PDF of the first bit group since the average value of the noise threshold is the least in this case, f_{3}(x) is selected as a PDF of the second bit group. In this case, PDFs of the remaining bit groups uses f_{remain}(x) as Equation 25 shown below. This is a weighted average PDFs which are not yet selected.
f_{remain}(x)=(10×f_{1}(x)+11×f_{2}(x)+10×f_{3}(x)+11×f_{4}(x)+f_{5}(x))/43 [Equation 25]
After performing through step 146 of the first step of the group interleaver design in the same manner as above, one PDF from among f_{1}(x) to f_{5}(x) is selected or allocated to each of 45 bit groups. That is, when the first step of the group interleaver design is completed, PDFs of LLR values of the respective of 45 bit groups are selected from f_{1}(x) to f_{5}(x).
In the above process, after noise threshold is calculated by using the density evolution, and based on the calculated noise threshold, a position where each bit group corresponds to each column of the first part of the block interleaver 124 by each step is determined. The noise threshold is defined as different values according to a given channel environment, and thus, a channel environment considered in the system needs to be reflected for determination. In other words, a performance of a code by interleaving is substantially changeable according to a channel which evaluates a performance, and therefore, a channel should be considered for the interleaving pattern.
For example, in general, in many cases, a good interleaving pattern in AWGN channel is not good in a Rayleigh channel. In this case, if a channel environment where a given system is used is closer to the Rayleigh channel, it may be better to select the interleaving pattern which is good in Rayleigh than the interleaving pattern which is good in the AWGN channel.
In conclusion, in order to determine the interleaving pattern, not only a predetermined channel environment but also various channel environments to be considered in the system should be considered to calculate a good interleaving pattern.
It is considered that there are channels C_{1}, C_{2}, . . . , C_{k }to be considered in the present invention, a noise threshold which is used for final determination is as shown below, after each noise threshold calculated in the 1i step is calculated, and the noise threshold thereof is indicated as TH_{1}[i], TH_{2}[i], . . . , TH_{k}[i].
TH[i]=W_{1}*TH_{1}[i]+W_{2}*TH_{2}[i]+ . . . +W_{k}*TH_{k}[i],
Here, W_{1}+W_{2}+ . . . +W_{k}=1, W_{1}, W_{2}, . . . , W_{k}>0.
W_{1}, W_{2}, . . . , W_{k }are adjusted according to a level of importance of a channel, that is, W_{1}, W_{2}, . . . , W_{k }are is adjusted to be large in an important channel, and W_{1}, W_{2}, . . . , W_{k }are adjusted to be small in a less important channel (ex: when considering two different channels such as AWGN and Rayleigh, if it seems that the level of importance of any channel is deemed higher, asymmetric value such as W_{1}=0.25, W_{2}=0.75 is set regarding weight values W_{1}, W_{2 }which correspond to each channel.).
The second step of the group interleaver design is to generate a plurality of π(j)s which satisfy the conditions determined at the first step, observe actual bit error rate (BER) and frame error rate (FER) performances for a predetermined SNR value, and select π(j) having the best performance. As such, the reason why the step of measuring actual performances is used in addition to the density evolution is that the density evolution may not estimate a correct performance of the LDPC code which has a limited length because the density evolution calculates a theoretical noise threshold under an assumption that a length of the LDPC codeword is unlimited.
In general, π(j) which satisfies a predetermined condition in the first step is generated by 50, and then in each channel, a performance is tested regarding FER=10{circumflex over ( )}−3 area. Out of this, 5 interleaver patterns of which SNR gain is estimated to be largest in the target FER (ex: FER=10{circumflex over ( )}−6) are selected, performance of the final target FER is tested, and then the interleaver having the best performance is finally selected. Here, a method of selecting the interleaver of which SNR gain seems the largest is that, FER performance, which is required by the system from the actual computational experiment result with respect to FER=10{circumflex over ( )}−3 area, is estimated through extrapolation, and then estimated performance in the target FER which is requested in the system is compared, and the interleaver having a better performance is determined as an excellent interleaver. In the present invention, a method of extrapolation is applied based on a linear function for convenient explanation, but various extrapolation methods may be applied.
Meanwhile,
However, if the finally selected interleaver shows the errorfloor on the target FER, π(j) which satisfies a predetermined condition in first step is further generated by 50 and the above process is repeated.
According to the abovedescribed method, π(j) of Tables 1527 used for group interleaving can be determined.
Hereinbelow, step 2 of the group interleaver design will be described in greater detail.
Meanwhile, as described above, in that each of bit groups constituting the LDPC codeword correspond to each column group of the parity check matrix, a degree of each column group has an effect on decoding performance of the LDPC codeword.
For example, that a degree of column groups is relatively high indicates that there are relatively larger number of parity check equations which are related to bit groups corresponding to column groups, the bit groups which correspond to column groups having a relatively high degree within a parity check matrix formed of a plurality of column groups may have a greater effect on decoding performance of the LDPC codeword rather than bit groups which correspond to column groups having a relatively low degree. In other words, if column groups having a relatively high degree are not mapped appropriately, the performance of the LDPC codeword will be substantially degraded.
Therefore, the group interleaver may be designed such that a bit group(s) having the highest degree, from among the bit groups constituting the LDPC codeword, is interleaved according to the π(j) and mapped to a specific bit of the modulation symbol (or transmission symbol), and the other bit groups not having the highest degree is randomly mapped to the modulation symbol. Under this condition, by observing actual BER/FER performance, the case where the performance of the LDPC codeword is substantially degraded may be avoided.
Hereinbelow, a case where the encoder 110 performs LDPC encoding by using the code rate 5/15 to generate an LDPC codeword having the length of 16200, and constitutes a modulation symbol by using 16NUQ will be described in a greater detail.
In this case, the encoder 110 may perform LDPC encoding based on the parity check matrix comprising the information word submatrix defined by Table 14 and the parity submatrix having a diagonal configuration.
Accordingly, the parity check matrix is formed of 45 column groups, and from among the 45 column groups, 10 column groups have the degree of 10, 7 column groups have the degree of 9, 28 column groups have the degree of 1.
Therefore, with respect to only 10 column groups of which the degree is 10, from among the 45 column groups, several π(j) for the 10 column groups may be generated to satisfy a predetermined condition in the first step of the group interleaver design, and π(j) for the other column groups may be remain as a blank. The bit groups which correspond to the other column groups may be set to be mapped randomly onto bits constituting a modulation symbol. Then, π(j) for 10 column groups having the most excellent performance is selected by observing actual BER/FER performance regarding a specific SNR value. By fixing a part of π(j), i.e. π(j) for 10 column groups selected as described above, substantial degradation of the performance of the LDPC codeword may be avoided.
On the other hand, Table 32 may be presented as below Table 321
In case of Table 32, Equation 21 may be expressed as Y_{7}=X_{π(7)}=X_{10}, Y_{10}=X_{π(10)}=X_{7}, Y_{14}=X_{π(14)}=X_{8}, Y_{20}=X_{π(20)}=X_{11}, Y_{23}=X_{π(23)}=X_{13}, Y_{24}=X_{π(24)}=X_{12}, Y_{29}=X_{π(29)}=X_{14}, Y_{34}=X_{π(34)}=X_{5}, Y_{36}=X_{π(36)}=X_{9}, Y_{38}=X_{π(38)}=X_{6}.
That is, the group interleaver 122 may rearrange the order of the plurality of bit groups by changing the 10th bit group to the 7^{th }bit group, the 7th bit group to the 10th bit group, the 8th bit group to the 14th bit group, the 11th bit group to the 20th bit group, the 13th bit group to the 23^{rd }bit group, the 12th bit group to the 24th bit group, the 14th bit group to the 29^{th }bit group, the 5 bit group to the 24th bit group, the 9th bit group to the 36th bit group, and the 6th bit group to the 38th bit group, and by rearranging randomly the other bit groups.
In a case where some bit groups are already fixed, the aforementioned feature is applied in the same manner. In other words, bit groups which correspond to column groups having a relatively high degree from among the other bit groups which are not fixed may have a greater effect on decoding performance of the LDPC codeword than bit groups which correspond to column groups having a relatively low degree. That is, even in the case where degradation of the performance of the LDPC codeword is prevented by fixing the bit groups having the highest degree, the performance of the LDPC codeword may vary according to a method of mapping the other bit groups. Accordingly, a method of mapping bit groups having the next highest degree needs to be selected appropriately, to avoid the case where the performance is relatively poor.
Therefore, in a case where bit groups having the highest degree are already fixed, bit groups having the next highest degree, from among the bit groups constituting the LDPC codeword, may be interleaved according to the π(j) and mapped to a specific bit of a modulation symbol, and the other bit groups may be randomly mapped. Under this condition, by observing actual BER/FER performance, the case where the performance of the LDPC codeword is substantially degraded may be avoided.
Hereinbelow, a case where the encoder 110 performs LDPC encoding by using the code rate 5/15 to generate an LDPC codeword having the length of 16200, and constitutes a modulation symbol by using 16NUQ will be described in a greater detail.
In this case, the encoder 110 may perform LDPC encoding based on the parity check matrix comprising the information word submatrix defined by Table 14 and the parity submatrix having a diagonal configuration.
Accordingly, the parity check matrix is formed of 45 column groups, and from among the 45 column groups, 10 column groups have the degree of 10, 7 column groups have the degree of 9, 28 column groups have the degree of 1.
Therefore, in a case where 10 column groups of which the degree is 10 are already fixed as in Table 32, so that, with respect to only 7 column groups of which the degree is 9, from among the other 35 column groups, several π(j) for the 7 column groups may be generated to satisfy a predetermined condition in a first step of the group interleaver design, and π(j) for the other column groups may be remained as a blank. The bit groups which correspond to the other column groups may be set to be mapped randomly onto bits constituting a modulation symbol. Then, π(j) for 7 column groups having the most excellent performance is selected by observing actual BER/FER performance regarding a specific SNR value. By fixing a part of π(j), i.e. π(j) for 7 column groups selected as described above, substantial degradation of the performance of the LDPC codeword may be avoided.
On the other hand, Table 33 may be presented as below Table 331
In case of Table 33, Equation 21 may be expressed as Y_{0}=X_{π(0)}=X_{3}, Y_{3}=X_{π(3)}=X_{2}, Y_{6}=X_{π(6)}=X, . . . , Y_{34}=X_{π(34)}=X_{5}, Y_{36}=X_{π(36)}=X_{9}, Y_{38}=X_{π(38)}=X_{6}.
That is, the group interleaver 122 may rearrange the order of the plurality of bit groups by changing the 3^{rd }bit group to the 0^{th }bit group, the 2^{nd }bit group to the 3^{rd }bit group, the 0^{th }bit group to the 6^{th }bit group, . . . , the 5^{th }bit group to the 34^{th }bit group, the 9^{th }bit group to the 36^{th }bit group, and the 6^{th }bit group to the 38^{th }bit group, and by rearranging randomly the other bit groups.
In the exemplary embodiments described above, the case of performing LDPC encoding based on the coding rate of 5/15 and the parity check matrix formed of the information word submatrix defined by Table 14 and the parity submatrix having a diagonal configuration is described, but this is merely exemplary, and even in a case of performing LDPC encoding based on different code rates and different parity check matrix, π(j) can be determined based on the aforementioned method
The transmitting apparatus 100 may transmit the signal mapped onto the constellation to a receiving apparatus (for example, 1200 of
The demodulator 1210 receives and demodulates a signal transmitted from the transmitting apparatus 100. Specifically, the demodulator 1210 generates a value corresponding to an LDPC codeword by demodulating the received signal, and outputs the value to the multiplexer 1220. In this case, the demodulator 1210 may use a demodulation method corresponding to a modulation method used in the transmitting apparatus 100. To do so, the transmitting apparatus 100 may transmit information regarding the modulation method to the receiving apparatus 2700, or the transmitting apparatus 100 may perform modulation using a predefined modulation method between the transmitting apparatus 100 and the receiving apparatus 1500.
The value corresponding to the LDPC codeword may be expressed as a channel value for the received signal. There are various methods for determining the channel value, and for example, a method for determining a Log Likelihood Ratio (LLR) value may be the method for determining the channel value.
The LLR value is a log value for a ratio of the probability that a bit transmitted from the transmitting apparatus 100 is 0 and the probability that the bit is 1. In addition, the LLR value may be a bit value which is determined by a hard decision, or may be a representative value which is determined according to a section to which the probability that the bit transmitted from the transmitting apparatus 100 is 0 or 1 belongs.
The multiplexer 1220 multiplexes the output value of the demodulator 1210 and outputs the value to the deinterleaver 1230.
Specifically, the multiplexer 1220 is an element corresponding to a demultiplexer (not shown) provided in the transmitting apparatus 100, and performs an operation corresponding to the demultiplexer (not shown). That is, the multiplexer 1220 performs an inverse operation of the operation of the demultiplexer (not shown), and performs celltobit conversion with respect to the output value of the demodulator 1210 and outputs the LLR value in the unit of bit. However, when the demultiplexer (not shown) is omitted from the transmitting apparatus 100, the multiplexer 1220 may be omitted from the receiving apparatus 1200.
The information regarding whether the demultiplexing operation is performed or not may be provided by the transmitting apparatus 100, or may be predefined between the transmitting apparatus 100 and the receiving apparatus 1500.
The deinterleaver 1230 deinterleaves the output value of the multiplexer 1220 and outputs the values to the decoder 1240.
Specifically, the deinterleaver 1230 is an element corresponding to the interleaver 120 of the transmitting apparatus 100 and performs an operation corresponding to the interleaver 120. That is, the deinterleaver 1230 deinterleaves the LLR value by performing the interleaving operation of the interleaver 120 inversely.
To do so, the deinterleaver 1230 may include a block deinterleaver 1231, a group twist deinterleaver 1232, a group deinterleaver 1233, and a parity deinterleaver 1234 as shown in
The block deinterleaver 1231 deinterleaves the output of the multiplexer 1220 and outputs the value to the group twist deinterleaver 1232.
Specifically, the block deinterleaver 1231 is an element corresponding to the block interleaver 124 provided in the transmitting apparatus 100 and performs the interleaving operation of the block interleaver 124 inversely.
That is, the block deinterleaver 1231 deinterleaves by writing the LLR value output from the multiplexer 1220 in each row in the row direction and reading each column of the plurality of rows in which the LLR value is written in the column direction by using at least one row formed of the plurality of columns.
In this case, when the block interleaver 124 interleaves by dividing the column into two parts, the block deinterleaver 1231 may deinterleave by dividing the row into two parts.
In addition, when the block interleaver 124 writes and reads in and from the bit group that does not belong to the first part in the row direction, the block deinterleaver 1231 may deinterleave by writing and reading values corresponding to the group that does not belong to the first part in the row direction.
Hereinafter, the block deinterleaver 1531 will be explained with reference to
An input LLR v_{i }(0≤i<N_{ldpc}) is written in a r_{i }row and a c_{i }column of the block deinterleaver 1531. Herein, c_{i}=(i mod N_{c}) and
On the other hand, an output LLR q_{i}(0≤i<N_{c}×N_{r1}) is read from a c_{i }column and a r_{i }row of the first part of the block deinterleaver 1531. Herein,
r_{i}=(i mod N_{r1}).
In addition, an output LLR q_{i}(N_{c}×N_{r1}≤i<N_{ldpc}) is read from a c_{i }column and a r_{i }row of the second part. Herein,
r_{i}=N_{r1}+{(i−N_{c}×N_{r1}) mode N_{r2}}.
The group twist deinterleaver 1232 deinterleaves the output value of the block deinterleaver 1231 and outputs the value to the group deinterleaver 1233.
Specifically, the group twist deinterleaver 1232 is an element corresponding to the group twist interleaver 123 provided in the transmitting apparatus 100, and may perform the interleaving operation of the group twist interleaver 123 inversely.
That is, the group twist deinterleaver 1232 may rearrange the LLR values of the same bit group by changing the order of the LLR values existing in the same bit group. When the group twist operation is not performed in the transmitting apparatus 100, the group twist deinterleaver 1232 may be omitted.
The group deinterleaver 1233 (or the groupwise deinterleaver) deinterleaves the output value of the group twist deinterleaver 1232 and outputs the value to the parity deinterleaver 1234.
Specifically, the group deinterleaver 1233 is an element corresponding to the group interleaver 122 provided in the transmitting apparatus 100 and may perform the interleaving operation of the group interleaver 122 inversely.
That is, the group deinterleaver 1233 may rearrange the order of the plurality of bit groups in bit group wise. In this case, the group deinterleaver 1233 may rearrange the order of the plurality of bit groups in bit group wise by applying the interleaving method of Tables 15 to 27 inversely according to a length of the LDPC codeword, a modulation method and a code rate.
The parity deinterleaver 1234 performs parity deinterleaving with respect to the output value of the group deinterleaver 1233 and outputs the value to the decoder 1240.
Specifically, the parity deinterleaver 1234 is an element corresponding to the parity interleaver 121 provided in the transmitting apparatus 100 and may perform the interleaving operation of the parity interleaver 121 inversely. That is, the parity deinterleaver 1234 may deinterleave the LLR values corresponding to the parity bits from among the LLR values output from the group deinterleaver 1233. In this case, the parity deinterleaver 1234 may deinterleave the LLR value corresponding to the parity bits inversely to the parity interleaving method of Equation 18.
However, the parity deinterleaver 1234 may be omitted depending on the decoding method and embodiment of the decoder 1240.
Although the deinterleaver 1230 of
For example, when the code rate is 5/15 and the modulation method is 16QAM, the group deinterleaver 1233 may perform deinterleaving based on table 15.
In this case, bits each of which belongs to each of bit groups X_{3}, X_{21}, X_{22}, X_{15 }may constitute a single modulation symbol. Since one bit in each of the bit groups X_{3}, X_{21}, X_{22}, X_{15 }constitutes a single modulation symbol, the deinterleaver 1230 may map bits onto decoding initial values corresponding to the bit groups X_{3}, X_{21}, X_{22}, X_{15 }based on the received single modulation symbol.
The decoder 1240 may perform LDPC decoding by using the output value of the deinterleaver 1230. To achieve this, the decoder 1240 may include an LDPC decoder (not shown) to perform the LDPC decoding.
Specifically, the decoder 1240 is an element corresponding to the encoder 110 of the transmitting apparatus 100 and may correct an error by performing the LDPC decoding by using the LLR value output from the deinterleaver 1230.
For example, the decoder 1240 may perform the LDPC decoding in an iterative decoding method based on a sumproduct algorithm. The sumproduct algorithm is one example of a message passing algorithm, and the message passing algorithm refers to an algorithm which exchanges messages (e.g., LLR value) through an edge on a bipartite graph, calculates an output message from messages input to variable nodes or check nodes, and updates.
The decoder 1240 may use a parity check matrix when performing the LDPC decoding. In this case, the parity check matrix used in the decoding may have the same configuration as that of the parity check matrix used in the encoding of the encoder 110, and this has been described above with reference to
In addition, information on the parity check matrix and information on the code rate, etc. which are used in the LDPC decoding may be prestored in the receiving apparatus 1200 or may be provided by the transmitting apparatus 100.
First, an LDPC codeword is generated by LDPC encoding based on a parity check matrix (S1410), and the LDPC codeword is interleaved (S1420).
Then, the interleaved LDPC codeword is mapped onto a modulation symbol (S1430). In this case, a bit included in a predetermined bit group from among a plurality of bit groups constituting the LDPC codeword may be mapped onto a predetermined bit in the modulation symbol.
In this case, each of the plurality of bit groups may be formed of M number of bits, and M may be a common divisor of N_{ldpc }and K_{ldpc }and may be determined to satisfy Q_{ldpc}=(N_{ldpc}−K_{ldpc})/M. Here, Q_{ldpc }is a cyclic shift parameter value regarding columns in a column group of an information word submatrix of a parity check matrix, N_{ldpc }is a length of an LDPC codeword, and K_{ldpc }is a length of information word bits of an LDPC codeword.
Meanwhile, operation S1420 may include interleaving parity bits of the LDPC codeword, dividing the parityinterleaved LDPC codeword by a plurality of bit groups and rearranging the order of the plurality of bit groups in bit group wise, and interleaving the plurality of bit groups the order of which is rearranged.
The order of the plurality of bit groups may be rearranged in bit group wise based on abovedescribed Equation 21.
Meanwhile, π(j) in Equation 21 may be determined based on at least one of a length of an LDPC codeword, a modulation method, and a code rate.
For example, when the LDPC codeword has the length of 16200, the modulation method is 16QAM, and the code rate is 5/15, π(j) may be defined as in Table 15.
Meanwhile, at S1420, dividing the LDPC codeword into the plurality of bit groups, rearranging the order of the plurality of bit groups in bit group wise, and interleaving the plurality of bit groups of which the order is rearranged are included.
However, this is merely exemplary, and π(j) may be defined as Tables 1527 described above.
The interleaving the plurality of bit groups may include: writing the plurality of bit groups in each of a plurality of columns in bit group wise in a column direction, and reading each row of the plurality of columns in which the plurality of bit groups are written in bit group wise in a row direction.
In addition, the interleaving the plurality of bit groups may include: serially write, in the plurality of columns, at least some bit groups which are writable in the plurality of columns in bit group wise from among the plurality of bit groups, and then dividing and writing the other bit groups in an area which remains after the at least some bit groups are written in the plurality of columns in bit group wise.
Referring to
The controller 3810 determines an RF channel and a PLP through which a selected service is transmitted. The RF channel may be identified by a center frequency and a bandwidth, and the PLP may be identified by its PLP ID. A specific service may be transmitted through at least one PLP included in at least one RF channel, for each component constituting the specific service. Hereinafter, for the sake of convenience of explanation, it is assumed that all of data needed to play back one service is transmitted as one PLP which is transmitted through one RF channel. In other words, a service has only one data obtaining path to reproduce the service, and the data obtaining path is identified by an RF channel and a PLP.
The RF receiver 3820 detects an RF signal from an RF channel selected by a controller 3810 and delivers OFDM symbols, which are extracted by performing signal processing on the RF signal, to the demodulator 3830. Herein, the signal processing may include synchronization, channel estimation, equalization, etc. Information required for the signal processing may be a value predetermined by the receiving apparatus 3810 and a transmitter according to use and implementation thereof and included in a predetermined OFDM symbol among the OFDM symbols and then transmitted to the receiving apparatus.
The demodulator 3830 performs signal processing on the OFDM symbols, extracts user packet and delivers the user packet to a service reproducer 3740, and the service reproducer 3840 uses the user packet to reproduce and then output a service selected by a user. Here, a format of the user packet may differ depending on a service implementation method and may be, for example, a TS packet or a IPv4 packet.
Referring to
The frame demapper 3831 selects a plurality of OFDM cells constituting an FEC block which belongs to a selected PLP in a frame including OFDM symbols, based on control information from the controller 3833, and provides the selected OFDM cells to the BICM decoder 3834. The frame demapper 3831 also selects a plurality of OFDM cells corresponding to at least one FEC block which includes L1 signaling, and delivers the selected OFDM cells to the BICM decoder 3832 for L1 signaling.
The BICM decoder for L1 signaling 3832 performs signal processing on an OFDM cell corresponding to an FEC block which includes L1 signaling, extracts L1 signaling bits and delivers the L signaling bits to the controller 3833. In this case, the signal processing may include an operation of extracting an LLR value for decoding an LDPC codeword and a process of using the extracted LLR value to decode the LDPC codeword.
The controller 3833 extracts an L1 signaling table from the L1 signaling bits and uses the L1 signaling table value to control operations of the frame demapper 3831, the BICM decoder 3834 and the output handler 3835.
The BICM decoder 3834 performs signal processing on the OFDM cells constituting FEC blocks which belong to a selected PLP to extract BBF (Baseband frame)s and delivers the BBFs to the output handler 3835. In this case, the signal processing may include an operation of extracting an LLR value for decoding an LDPC codeword and an operation of using the extracted LLR value to decode the LDPC codeword, which may be performed based on control information output from the controller 3833.
The output handler 3835 performs signal processing on a BBF, extracts a user packet and delivers the extracted user packet to a service reproducer 3840. In this case, the signal processing may be performed based on control information output from the controller 3833.
According to an exemplary embodiment, the output handler 3835 comprises a BBF handler (not shown) which extracts BBP (Baseband packet) from the BBF.
It is assumed that service information on all services selectable by a user are acquired at an initial scan (S4010) prior to the user'"'"'s service selection (S4020). Service information may include information on a RF channel and a PLP which transmits data required to reproduce a specific service in a current receiving apparatus. As an example of the service information, program specific information/service information (PSI/SI) in an MPEG2TS is available, and normally can be achieved through L2 signaling and an upperlayer signaling.
In the initial scan (S4010), comprehensive information on a payload type of PLPs which are transmitted to a specific frequency band. As an example, there may be information on whether every PLP transmitted to the frequency band includes a specific type of data.
When the user selects a service (S4020), the receiving apparatus transforms the selected service to a transmitting frequency and performs RF signaling detection (S4030). In the frequency transforming operation (S4020), the service information may be used.
When an RF signal is detected, the receiving apparatus performs an L1 signaling extracting operation from the detected RF signal (S4050). Then, the receiving apparatus selects a PLP transmitting the selected service, based on the extracted L signaling, (S4060) and extracts a BBF from the selected PLP (S4070). In S4060, the service information may be used.
The operation to extract a BBF (S4070) may include an operation of demapping the transmitted frame and selecting OFDM cells included in a PLP, an operation of extracting an LLR value for LDPC coding/decoding from an OFDM cell, and an operation of decoding the LDPC codeword using the extracted LLR value.
The receiving apparatus, using header information of an extracted BBF, extracts a BBP from the BBF (S4080). The receiving apparatus also uses header information of an extracted BBP to extract a user packet from the extracted BBP (S4090). The extracted user packet is used to reproduce the selected service (S4100). In the BBP extraction operation (S4080) and user packet extraction operation (S4090), L1 signaling information extracted in the L1 signaling extraction operation may be used.
According to an exemplary embodiment, the L1 signaling information includes information on types of a user packet transmitted through a corresponding PLP, and information on an operation used to encapsulate the user packet in a BBF. The foregoing information may be used in the user packet extraction operation (S1480). Specifically, this information may be used in an operation of extracting the user packet which is a reverse operation of encapsulation of the user packet in the BBF. In this case, process for extracting user packet from the BBP (restoring null TS packet and inserting TS sync byte) is same as above description.
A nontransitory computer readable medium, which stores a program for performing the above encoding and/or interleaving methods according to various exemplary embodiments in sequence, may be provided.
The nontransitory computer readable medium refers to a medium that stores data semipermanently rather than storing data for a very short time, such as a register, a cache, and a memory, and is readable by an apparatus. The abovedescribed various applications or programs may be stored in a nontransitory computer readable medium such as a compact disc (CD), a digital versatile disk (DVD), a hard disk, a Bluray disk, a universal serial bus (USB), a memory card, and a read only memory (ROM), and may be provided. Although a bus is not illustrated in the block diagrams of the transmitter apparatus and the receiver apparatus, communication may be performed between each element of each apparatus via the bus. In addition, each apparatus may further include a processor such as a central processing unit (CPU) or a microprocessor to perform the abovedescribed various operations.
At least one of the components, elements or units represented by a block in illustrating the abovedescribed transmitting apparatus and receiving apparatus may be embodied as various numbers of hardware, software and/or firmware structures that execute respective functions described above, according to an exemplary embodiment. For example, at least one of these components, elements or units may use a direct circuit structure, such as a memory, processing, logic, a lookup table, etc. that may execute the respective functions through controls of one or more microprocessors or other control apparatuses. Also, at least one of these components, elements or units may be specifically embodied by a module, a program, or a part of code, which contains one or more executable instructions for performing specified logic functions, and executed by one or more microprocessors or other control apparatuses. Also, at least one of these components, elements or units may further include a processor such as a CPU that performs the respective functions, a microprocessor, or the like. Two or more of these components, elements or units may be combined into one single component, element or unit which performs all operations or functions of the combined two or more components, elements of units. Also, at least part of functions of at least one of these components, elements or units may be performed by another of these components, element or units. Further, although a bus is not illustrated in the above block diagrams, communication between the components, elements or units may be performed through the bus. Functional aspects of the above exemplary embodiments may be implemented in algorithms that execute on one or more processors. Furthermore, the components, elements or units represented by a block or processing steps may employ any number of related art techniques for electronics configuration, signal processing and/or control, data processing and the like.
The foregoing exemplary embodiments and advantages are merely exemplary and are not to be construed as limiting the present inventive concept. The exemplary embodiments can be readily applied to other types of apparatuses. Also, the description of the exemplary embodiments is intended to be illustrative, and not to limit the scope of the inventive concept, and many alternatives, modifications, and variations will be apparent to those skilled in the art.