TRANSMITTING/RECEIVING SYSTEM AND METHOD OF PROCESSING BROADCAST SIGNAL IN TRANSMITTING/RECEIVING SYSTEM

• US 20100316110A1
• Filed: 06/11/2010
• Published: 12/16/2010
• Est. Priority Date: 06/11/2009
• Status: Active Grant

• Current Assignee: LG Electronics, Inc. (LG Corporation)
• Original Assignee: LG Electronics, Inc. (LG Corporation)
• Inventors: CHOI, In Hwan, Kim, Byoung Gill, Lee, Hyoung Gon, Song, Won Gyu, Kim, Jin Woo
• Granted Patent: US 8,432,961 B2
• Time in Patent Office: Days
• US Class Current: 375/232
• CPC Class Codes: H04L 1/0065 Serial concatenated codes
• CPC Class Codes: H04L 1/0071 Use of interleaving interleaving per se H03M13/27
• CPC Class Codes: H04L 2001/0093 Point-to-multipoint
• CPC Class Codes: H04N 21/4382 Demodulation or channel decoding, e.g. QPSK demodulation analog front ends or means for connecting modulators, demodulators or transceivers to a transmission line H04L27/0002

Abstract

A transmitting system, a receiving system, and a method of processing broadcast signals are disclosed. The receiving system includes a tuner, a channel equalizer, a storage unit, an inner decoder, a deinterleaver, an outer decoder, and an interleaver. The tuner receives a broadcast signal including a data group. The channel equalizer channel-equalizes the broadcast signal. The storage unit stores mobile service data included in the channel-equalized broadcast signal, and repeatedly outputs the stored mobile service data for a predetermined number of turbo decoding iterations. The inner decoder matches the mobile service data being outputted from the storage unit with mobile service data being outer-decoded and fed-back and inner-decodes the matched mobile service data. The deinterleaver deinterleaves the inner-decoded mobile service data in block units. The outer decoder outer-decodes the deinterleaved mobile service data. The interleaver interleaves the outer-decoded mobile service data in block units and feeding-back the interleaved mobile service data to the inner decoder.

Claims

1. A receiving system, comprising:

a tuner for receiving a broadcast signal including a data group, wherein the data group includes at least mobile service data, a plurality of known data sequences, fast information channel (FIC) data, and transmission parameter channel (TPC) data, wherein the FIC data includes information for acquiring rapid mobile services, and wherein the TPC data includes version information of the FIC data;

a channel equalizer for channel-equalizing the broadcast signal by using at least one of the plurality of known data sequences;

a storage unit for storing mobile service data included in the channel-equalized broadcast signal, and repeatedly outputting the stored mobile service data for a predetermined number of turbo decoding iterations;

an inner decoder for matching the mobile service data being outputted from the storage unit with mobile service data being outer-decoded and fed-back and inner-decoding the matched mobile service data;

a deinterleaver for deinterleaving the inner-decoded mobile service data in block units;

an outer decoder for outer-decoding the deinterleaved mobile service data; and

an interleaver for interleaving the outer-decoded mobile service data in block units and feeding-back the interleaved mobile service data to the inner decoder.

2. The receiving system of claim 1, wherein the interleaver generates an interleaving pattern P′

(i) by applying i to the equation show below and outputs a symbol of the mobile service data stored in location P′

(i) in an increasing order of i, wherein P′

(i)<

B.

P′

(i)={89×

i×

(i+1)/2} mod L,

wherein L≧

B, L=2^m, m is an integer, 0≦

i≦

L−

1, and B represents a block length of the mobile service data being inputted.

3. The receiving system of claim 1, wherein the interleaver comprises:

a counter for sequentially counting from 0 to L, wherein L≧

B, L=2^m, m is an integer, 0≦

i≦

L−

1, and B represents a block length of the mobile service data being inputted;

a first operator for adding a count value of the counter and a previous value fed-backed and feeding-back the added value to an inputting end;

a second operator for multiplying the output of the first operator by a constant 89;

a third operator for performing a modulo L operation on the output of the second operator, thereby generating an interleaving pattern P(i); and

an outputting block for having a memory and, when the output P(i) of the third operator is greater than or equal to B, discarding P(i), storing a symbol of inputted mobile service data in a remaining location of P(i) and then outputting data by an increasing order of i.

4. The receiving system of claim 3, further comprising:

a multiplexer for selecting a constant 0 at a beginning of interleaving process by block-units, selecting the output of the first operator afterwards, and then outputting the selected value to the inputting end of the first operator.

5. The receiving system of claim 4, further comprising:

a fourth operator for performing a modulo L operation on the output of the first operator and outputting the result to the second operator and the multiplexer.

6. The receiving system of claim 1, wherein the interleaver and the deinterleaver share a memory, wherein an interleaving pattern P(i) is generated from at least one of the interleaver and the deinterleaver, wherein the interleaver performs interleaving by using the interleaving pattern P(i) and the memory, and wherein the deinterleaver performs deinterleaving by using the interleaving pattern P(i) and the memory.

7. The receiving system of claim 6, wherein the interleaver performs a process of writing an i^th input symbol of the mobile service data in location P(i) of the memory, and performs a process of reading an i^th output symbol of the mobile service data in position i of the memory from 0 to B−

1, thereby performing interleaving on one block, wherein 0 ≦

i ≦

B−

1, and B represents a block length of the mobile service data being inputted.

8. The receiving system of claim 6, wherein the deinterleaver performs a process of writing an i^th input symbol of the mobile service data in location i of the memory, and performs a process of reading an i^th output symbol of the mobile service data in position P(i) of the memory from 0 to B−

1, thereby performing deinterleaving on one block, wherein 0≦

i≦

B−

1, and B represents a block length of the mobile service data being inputted.

9. The receiving system of claim 1, further comprising:

a Reed-Solomon (RS) frame decoder for configuring an RS frame by gathering the outer-decoded mobile service data, and performing cyclic redundancy check (CRC)-decoding and RS-decoding on the configured RS frame.

10. The receiving system of claim 1, wherein one of the plurality of known data sequences includes a first M symbol sequence and a second M symbol sequence that have a first data pattern, wherein the remaining known data sequences include an N symbol sequence having a second data pattern other than the first data pattern, and wherein the known data sequences having the second data pattern are spaced 16 segmeants apart within the data group.

11. A method of processing a broadcast signal in a receiving system, the method comprising:

receiving, by a tuner, a broadcast signal including a data group, wherein the data group includes at least mobile service data, a plurality of known data sequences, fast information channel (FIC) data, and transmission parameter channel (TPC) data, wherein the FIC data includes information for acquiring rapid mobile services, and wherein the TPC data includes version information of the FIC data;

channel-equalizing, by a channel equalizer, the broadcast signal by using at least one of the plurality of known data sequences;

storing mobile service data included in the channel-equalized broadcast signal in a buffer, and repeatedly outputting the stored mobile service data for a predetermined number of turbo decoding iterations;

matching, by an inner decoder, the mobile service data being outputted from the buffer with mobile service data being outer-decoded and fed-back and inner-decoding the matched mobile service data;

deinterleaving, by a deinterleaver, the inner-decoded mobile service data in block units;

outer-decoding, an outer decoder, the deinterleaved mobile service data; and

interleaving, by an interleaver, the outer-decoded mobile service data in block units and feeding-back the interleaved mobile service data to the inner decoder.

12. The method of claim 11, wherein interleaving the outer-decoded mobile service data generates an interleaving pattern P′

(i) by applying i to the equation show below and outputs a symbol of the mobile service data stored in location P′

(i) in an increasing order of i, wherein P′

(i)<

B.

P′

(i)={89×

i×

(i+1)/2} mod L,

wherein L≧

B, L=2^m, m is an integer, 0≦

i≦

L−

1, and B represents a block length of the mobile service data being inputted.

13. The method of claim 11, wherein interleaving the outer-decoded mobile service data comprises:

sequentially counting, by a counter, from 0 to L, wherein L≧

B, L=2^m, m is an integer, 0≦

i≦

L−

1, and B represents a block length of the mobile service data being inputted;

adding, by a first operator, a count value of the counter and a previous value fed-backed and feeding-back the added value to an inputting end;

multiplying, by a second operator, the output of the first operator by a constant 89;

performing, by a third operator, a modulo L operation on the output of the second operator, thereby generating an interleaving pattern P(i); and

when the output P(i) of the third operator is greater than or equal to B, discarding P(i), storing a symbol of inputted mobile service data in a remaining location of P(i) and then outputting data by an increasing order of i in an outputting block having a memory.

14. The method of claim 13, further comprising:

selecting a constant 0 at a beginning of interleaving process by block-units, selecting the output of the first operator afterwards, and then outputting the selected value to the inputting end of the first operator.

15. The method of claim 14, further comprising:

performing a modulo L operation on the output of the first operator.

16. The method of claim 11, wherein a memory shares, wherein an interleaving pattern P(i) is generated from at least one of the interleaving step and the deinterleaving step, wherein the interleaving on the outer-decoded mobile service data is performed by using the interleaving pattern P(i) and the memory, and wherein the deinterleaving on the inner-decoded mobile service data is performed by using the interleaving pattern P(i) and the memory.

17. The method of claim 16, wherein the interleaving on the outer-decoded mobile service data performs a process of writing an i^th input symbol of the mobile service data in location P(i) of the memory, and performs a process of reading an i^th output symbol of the mobile service data in position i of the memory from 0 to B−

1, thereby performing interleaving on one block, wherein 0≦

i≦

B−

1, and B represents a block length of the mobile service data being inputted.

18. The method of claim 16, wherein the deinterleaving on the inner-decoded mobile service data performs a process of writing an i^th input symbol of the mobile service data in location i of the memory, and performs a process of reading an i^th output symbol of the mobile service data in position P(i) of the memory from 0 to B−

1, thereby performing deinterleaving on one block, wherein 0≦

i≦

B−

1, and B represents a block length of the mobile service data being inputted.

19. The method of claim 11, further comprising:

configuring a Reed-Solomon (RS) frame by gathering the outer-decoded mobile service data, and performing cyclic redundancy check (CRC)-decoding and RS-decoding on the configured RS frame.

20. The method of claim 11, wherein one of the plurality of known data sequences includes a first M symbol sequence and a second M symbol sequence that have a first data pattern, wherein the remaining known data sequences include an N symbol sequence having a second data pattern other than the first data pattern, and wherein the known data sequences having the second data pattern are spaced 16 segmeants apart within the data group.