Data processing apparatus and method
Abstract
A data processing apparatus maps symbols received from a predetermined number of sub-carrier signals of Orthogonal Frequency Division Multiplexed (OFDM) symbols into an output symbol stream. The data processor includes an interleaver memory which reads-in the predetermined number of data symbols for mapping onto the OFDM sub-carrier signals. The interleaver memory reads-out the data symbols on to the OFDM sub-carriers to effect the mapping, the read-out being in a different order than the read-in, the order being determined from a set of addresses, with the effect that the data symbols are interleaved on to the sub-carrier signals. The set of addresses are generated from an address generator which comprises a linear feedback shift register and a permutation circuit. The linear feedback shift register has ten register stages with a generator polynomial for the linear feedback shift register of Riʹ9=Ri-1ʹ0⊕Ri-1ʹ3, and the permutation code forms, with an additional bit, an eleven bit address. The permutation code is changed from one OFDM symbol to another, thereby providing an improvement in interleaving the data symbols for a 2K operating mode of an OFDM modulated system such as a Digital Video Broadcasting (DVB) standard such as DVB-Terrestria12 (DVB-T2). This is because there is a reduced likelihood that successive data bits which are close in order in an input data stream are mapped onto the same sub-carrier of an OFDM symbol.
Term
2.1 yearsto projected expiry
Projected expiry 24 October 2028, counted from filing; an application has no term until it is granted.
- Priority
- Filed
- Published
- Today
- Projected expiry
26 claims: 9 independent, 17 dependent
- 1A data processing apparatus for mapping symbols received from a predetermined number of sub-carrier signals of an Orthogonal Frequency Division Multiplexed (OFDM) symbol into an output symbol stream, the data processing apparatus comprising a de-interleaver operable to read-into a memory the predetermined number of data symbols from the OFDM sub-carrier signals, and to read-out of the memory the data symbols into the output symbol stream to effect the mapping, the read-out being in a different order than the read-in, the order being determined from a set of addresses, with the effect that the data symbols are de-interleaved from the OFDM sub-carrier signals, an address generator operable to generate the set of addresses, an address being generated for each of the received data symbols for mapping the data symbol received from the OFDM sub-carrier signal into the output symbol stream, the address generator comprising a linear feedback shift register including a predetermined number of register stages and being operable to generate a pseudo-random bit sequence in accordance with a generator polynomial, a permutation circuit operable to receive the content of the shift register stages and to permute the order of the bits present in the register stages in accordance with a permutation code to form an address of one of the OFDM sub-carriers, and a control unit operable in combination with an address check circuit to re-generate an address when a generated address exceeds a predetermined maximum valid address, wherein the predetermined maximum valid address is approximately two thousand, the linear feedback shift register has ten register stages with a generator polynomial for the linear feedback shift register of R i ʹ 9 = R i - 1 ʹ 0 ⊕ R i - 1 ʹ 3 , and the permutation code forms, with an additional bit, an eleven bit address, characterised in that the permutation circuit is arranged to change the permutation code, which permutes the order of the bits of the register stages to form the set of addresses from one OFDM symbol to another.
- 2A data processing apparatus as claimed in Claim 1, wherein the permutation circuit is operable to cycle through a sequence of different permutation codes for successive OFDM symbols.
- 3A data processing apparatus as claimed in Claim 2, wherein one of the sequence of different permutation codes forms the eleven bit address R i [ n ] for the i-th data symbol from the bit present in the n-th register stage R i ʹ n in accordance with the permutation code defined by the table:R' i for n = 9 8 7 6 5 4 3 2 1 0 R i for n = 0 7 5 1 8 2 6 9 3 4
- 6A data processing apparatus as claimed in Claim 5, wherein the OFDM symbol includes pilot sub-carriers, which are arranged to carry known symbols, and the predetermined maximum valid address depends on a number of the pilot sub-carrier symbols present in the OFDM symbol.
- 7A data processing apparatus as claimed in Claim 1 to 6, wherein the approximately two thousand sub-carriers is provided by one of a plurality of operating modes in which the approximately two thousand sub-carriers provides half or less than half a maximum number of sub-carriers in the OFDM symbols of any of the operating modes, and the data symbols include first sets of data symbols received from first OFDM symbols and second sets of data symbols received from second OFDM symbols, and the data processing apparatus is operable to de-interleave the first and second sets of data symbols into the output data stream in accordance with an odd interleaving process, the odd interleaving process including writing the first sets of data symbols received from the sub-carriers of the first OFDM symbols into a first part of the interleaver memory in accordance with an order determined by the set of addresses generated with one of the permutation codes of the sequence, reading out the first sets of data symbols from the first part of the interleaver memory into the output data stream in accordance with a sequential order of the first sets of input data symbols, writing the second set of data symbols received from the sub-carriers of the second OFDM symbols into a second part of the interleaver memory in accordance with an order defined by the set of addresses generated with another of the permutation codes of the sequence, and reading out the second sets of data symbols from the second part of the interleaver memory into the output data stream in accordance with a sequential order of the second sets of input data symbols.
- 8A receiver for receiving data from Orthogonal Frequency Division Multiplexing (OFDM) modulated symbols, the receiver being adapted to receive OFDM symbols, to recover the data symbols from a predetermined number of sub-carriers of the OFDM symbols, the receiver including a data processor which is adapted to map the data symbols received from the OFDM symbols into an output data stream, the data processor comprising a de-interleaver operable to read-into a memory the predetermined number of data symbols from the OFDM sub-carrier symbols, and to read-out of the memory the data symbols into the output symbol stream to effect the mapping, the read-out being in a different order than the read-in, the order being determined from a set of addresses, with the effect that the data symbols are de-interleaved from the OFDM sub-carrier signals, an address generator operable to generate the set of addresses, an address being generated for each of the received data symbols for mapping the received data symbol from the OFDM sub-carrier signal into the output symbol stream, the address generator comprising a linear feedback shift register including a predetermined number of register stages and being operable to generate a pseudo-random bit sequence in accordance with a generator polynomial, a permutation circuit operable to receive the content of the shift register stages and to permute the order of the bits present in the register stages in accordance with a permutation code to form an address of one of the OFDM sub-carriers, and a control unit operable in combination with an address check circuit to re-generate an address when a generated address exceeds a predetermined maximum valid address, wherein the predetermined maximum valid address is approximately two thousand, the linear feedback shift register has ten register stages with a generator polynomial for the linear feedback shift register of R i ʹ 9 = R i - 1 ʹ 0 ⊕ R i - 1 ʹ 3 , and the permutation order forms, with an additional bit, an eleven bit address, characterised in that the permutation circuit is arranged to change the permutation code, which permutes the order of the bits of the register stages to form the set of addresses from one OFDM symbol to another.
- 9A receiver as claimed in Claim 8, wherein the receiver is configured to receive data which has been modulated in accordance with a Digital Video Broadcasting standard such as the Digital Video Broadcasting-Terrestrial, Digital Video Broadcasting-Handheld or the Digital Video Broadcasting-Terrestrial2 standard.
- 10A method of mapping symbols received from a predetermined number of sub-carrier signals of Orthogonal Frequency Division Multiplexed (OFDM) symbols into an output symbol stream, the method comprising reading-into a memory the predetermined number of data symbols from the OFDM sub-carrier signals, reading-out of the memory the data symbols into the output symbol stream to effect the mapping, the read-out being in a different order than the read-in, the order being determined from a set of addresses, with the effect that the data symbols are de-interleaved from the OFDM sub-carrier signals, generating the set of addresses, an address being generated for each of the received symbols for mapping the received data symbol from the OFDM sub-carrier signal into the output symbol stream, the generating the set of addresses comprising using a linear feedback shift register including a predetermined number of register stages to generate a pseudo-random bit sequence in accordance with a generator polynomial, using a permutation circuit to receive the content of the shift register stages and to permute the order of the bits present in the register stages in accordance with a permutation code to form an address, and re-generating an address when a generated address exceeds a predetermined maximum valid address, wherein the predetermined maximum valid address is approximately two thousand, the linear feedback shift register has ten register stages with a generator polynomial for the linear feedback shift register of R i ʹ 9 = R i - 1 ʹ 0 ⊕ R i - 1 ʹ 3 , and the permutation code forms, with an additional bit, an eleven bit address, characterised by changing the permutation code, which permutes the order of the bits of the register stages to form the set of addresses from one OFDM symbol to another.
- 11A method as claimed in Claim 10, wherein the changing the permutation code includes cycling through a sequence of different permutation codes for successive OFDM symbols.
- 12A method as claimed in Claim 11, wherein one of the sequence of different permutation codes forms the eleven bit address R i [ n ] for the i-th data symbol from the bit present in the n-th register stage R i ʹ n in accordance with the permutation code is defined by the table:R' i for n = 9 8 7 6 5 4 3 2 1 0 R i for n = 0 7 5 1 8 2 6 9 3 4
- 15A method as claimed in Claim 14, wherein the OFDM symbol includes pilot sub-carriers, which are arranged to carry known symbols, and the predetermined maximum valid address depends on a number of the pilot sub-carrier symbols present in the OFDM symbol.
- 16A method as claimed any of Claim 10 to 15, wherein the approximately two thousand sub-carriers is provided by one of a plurality of operating modes in which the approximately two thousand sub-carriers provide half or less than half a maximum number of sub-carriers in the OFDM symbols of any of the operating modes, and the data symbols include first sets of data symbols received from first OFDM symbols and second sets of data symbols received from second OFDM symbols, and the reading-into the memory the predetermined number of data symbols from the OFDM sub-carrier signals, and the reading-out of the memory the data symbols into the output symbol stream is in accordance with an odd interleaving process, the odd interleaving process including writing the first sets of data symbols received from the sub-carriers of the first OFDM symbols into a first part of the interleaver memory in accordance with an order determined by the set of addresses generated with one of the permutation codes of the sequence, reading out the first sets of data symbols from the first part of the interleaver memory into the output data stream in accordance with a sequential order of the first sets of input data symbols, writing the second set of data symbols received from the sub-carriers of the second OFDM symbols into a second part of the interleaver memory in accordance with an order defined by the set of addresses generated with another of the permutation codes of the sequence, and reading out the second sets of data symbols from the second part of the interleaver memory into the output data stream in accordance with a sequential order of the second sets of input data symbols.
- 17A method of receiving data from Orthogonal Frequency Division Multiplexing OFDM modulated symbols, the method including receiving a predetermined number of data symbols from a predetermined number of sub-carrier signals from the OFDM symbols for forming an output data stream, reading-into a memory the predetermined number of data symbols from the OFDM sub-carrier signals, reading-out of the memory the data symbols into the output symbol stream to effect the mapping, the read-out being in a different order than the read-in, the order being determined from a set of addresses, with the effect that the data symbols are de-interleaved from the OFDM sub-carrier signals, generating the set of addresses, an address being generated for each of the received symbols for mapping the received data symbol from the OFDM sub-carrier signal into the output symbol stream, the generating the set of addresses comprising using a linear feedback shift register including a predetermined number of register stages to generate a pseudo-random bit sequence in accordance with a generator polynomial, using a permutation circuit to receive the content of the shift register stages and to permute the order of the bits present in the register stages in accordance with a permutation order to form an address, and re-generating an address when a generated address exceeds a predetermined maximum valid address, wherein the predetermined maximum valid address is approximately two thousand, the linear feedback shift register has ten register stages with a generator polynomial for the linear feedback shift register of R i ʹ 9 = R i - 1 ʹ 0 ⊕ R i - 1 ʹ 3 , and the permutation code forms, with an additional bit, an eleven bit address, characterised by changing the permutation code, which permutes the order of the bits of the register stages to form the set of addresses from one OFDM symbol to another.
- 18A method as claimed in Claim 17, wherein the receiving the data is in accordance with a Digital Video Broadcasting standard such as the Digital Video Broadcasting-Terrestrial, Digital Video Broadcasting-Handheld or the Digital Video Broadcasting-Terrestrial2 standard.
- 19An address generator for use with reception of data symbols interleaved onto sub-carriers of an Orthogonal Frequency Division Multiplexed symbol, the address generator being operable to generate a set of addresses, each address being generated for each of the data symbols to indicate one of the sub-carrier signals onto which the data symbol is to be mapped, the address generator comprising a linear feedback shift register including a predetermined number of register stages and being operable to generate a pseudo-random bit sequence in accordance with a generator polynomial, a permutation circuit operable to receive the content of the shift register stages and to permute the order of the bits present in the register stages in accordance with a permutation code to form an address, and a control unit operable in combination with an address check circuit to re-generate an address when a generated address exceeds a predetermined maximum valid address, wherein the predetermined maximum valid address is approximately two thousand, the linear feedback shift register has ten register stages with a generator polynomial for the linear feedback shift register of R i ʹ 9 = R i - 1 ʹ 0 ⊕ R i - 1 ʹ 3 , and the permutation code forms, with an additional bit, an eleven bit address, characterised in that the permutation circuit is arranged to change the permutation code, which permutes the order of the bits of the register stages to form the set of addresses from one OFDM symbol to another.
- 20An address generator as claimed in Claim 19, wherein the permutation circuit is operable to cycle through a sequence of different permutation codes for successive OFDM symbols.
- 21An address generator as claimed in Claim 20, wherein one of the sequence of different permutation codes forms the eleven bit address R i [ n ] for the i-th data symbol from the bit present in the n-th register stage R i ʹ n in accordance with the permutation code is defined by the table:R' i for n = 9 8 7 6 5 4 3 2 1 0 R i for n = 0 7 5 1 8 2 6 9 3 4
- 23A data processing apparatus operable to map data symbols received from a predetermined number of sub-carrier signals of Orthogonal Frequency Division Multiplexed OFDM symbols into an output data stream, the predetermined number of sub-carrier signals being determined in accordance with one of a plurality of operating modes and the data symbols being divided into first sets of data symbols for mapping onto first OFDM symbols and second sets of data symbols for mapping onto second OFDM symbols, the data processing apparatus comprising a de-interleaver operable to read-into a memory the predetermined number of data symbols from the OFDM sub-carrier signals, and to read-out of the memory the data symbols into the output symbol stream to effect the mapping, the read-out being in a different order than the read-in, the order being determined from a set of addresses, with the effect that the data symbols are de-interleaved from the OFDM sub-carrier signals, an address generator operable to generate the set of addresses, an address being generated for each of the received data symbols for mapping the received data symbol from the OFDM sub-carrier signal into the output symbol stream, the address generator comprising a linear feedback shift register including a predetermined number of register stages and being operable to generate a pseudo-random bit sequence in accordance with a generator polynomial, a permutation circuit operable to receive the content of the shift register stages and to permute the order of the bits present in the register stages in accordance with a permutation code to form an address of one of the OFDM sub-carriers, and a control unit operable in combination with an address check circuit to re-generate an address when a generated address exceeds a predetermined maximum valid address, wherein one of a plurality of operating modes provides OFDM symbols with approximately two thousand sub-carriers which is half or less than half a maximum number of sub-carriers in the OFDM symbols of any of the operating modes, the predetermined maximum valid address is approximately two thousand, the linear feedback shift register has ten register stages with a generator polynomial for the linear feedback shift register of R i ʹ 9 = R i - 1 ʹ 0 ⊕ R i - 1 ʹ 3 , and the permutation code forms, with an additional bit, an eleven bit address, and the data processing apparatus is operable to de-interleave the first and second sets of data symbols into the output data stream in accordance with an odd interleaving process, the odd interleaving process including writing the first sets of data symbols received from the sub-carriers of the first OFDM symbols into a first part of the interleaver memory in accordance with an order determined by the set of addresses, reading out the first sets of data symbols from the first part of the interleaver memory into the output data stream in accordance with a sequential order of the first sets of input data symbols, writing the second set of data symbols received from the sub-carriers of the second OFDM symbols into a second part of the interleaver memory in accordance with an order defined by the set of addresses, and reading out the second sets of data symbols from the second part of the interleaver memory into the output data stream in accordance with a sequential order of the second sets of input data symbols.
- 24A data processing apparatus as claimed in Claim 23, wherein the permutation code forms the eleven bit address R i [ n ] for the i-th data symbol from the bit present in the n-th register stage R i ʹ n in accordance with the permutation code defined by the table:R' i for n = 9 8 7 6 5 4 3 2 1 0 R i for n = 0 7 5 1 8 2 6 9 3 4
- 25A method of mapping data symbols received from a predetermined number of sub-carrier signals of Orthogonal Frequency Division Multiplexed OFDM symbols into an output data stream, the predetermined number of sub-carrier signals being determined in accordance with one of a plurality of operating modes and the data symbols include first sets of data symbols received from first OFDM symbols and second sets of data symbols received from second OFDM symbols, the method comprising reading-into a memory the predetermined number of data symbols from the OFDM sub-carrier signals, reading-out of the memory the data symbols into the output symbol stream to effect the mapping, the read-out being in a different order than the read-in, the order being determined from a set of addresses, with the effect that the data symbols are de-interleaved from the OFDM sub-carrier signals, generating the set of addresses, an address being generated for each of the received symbols for mapping the data symbol received from the OFDM sub-carrier signal into the output symbol stream, the generating the set of addresses comprising using a linear feedback shift register including a predetermined number of register stages to generate a pseudo-random bit sequence in accordance with a generator polynomial, using a permutation circuit to receive the content of the shift register stages and to permute the order of the bits present in the register stages in accordance with a permutation order to form an address, and re-generating an address when a generated address exceeds a predetermined maximum valid address, wherein the predetermined maximum valid address is approximately two thousand, the linear feedback shift register has ten register stages with a generator polynomial for the linear feedback shift register of R i ʹ 9 = R i - 1 ʹ 0 ⊕ R i - 1 ʹ 3 , and the permutation code forms, with an additional bit, an eleven bit address, and the operating mode provides approximately two thousand sub-carriers per OFDM symbol which is half or less than half a maximum number of sub-carriers in the OFDM symbols of any of the operating modes, and the reading-into the memory the predetermined number of data symbols from the OFDM sub-carrier signals, and the reading-out of the memory the data symbols into the output symbol stream is in accordance with an odd interleaving process, the odd interleaving process including writing the first sets of data symbols received from the sub-carriers of the first OFDM symbols into a first part of the interleaver memory in accordance with an order determined by the set of addresses, reading out the first sets of data symbols from the first part of the interleaver memory into the output data stream in accordance with a sequential order of the first sets of input data symbols, writing the second set of data symbols received from the sub-carriers of the second OFDM symbols into a second part of the interleaver memory in accordance with an order defined by the set of addresses, and reading out the second sets of data symbols from the second part of the interleaver memory into the output data stream in accordance with a sequential order of the second sets of input data symbols.
- 26A method as claimed in Claim 25, wherein the permutation code forms the eleven bit address R i [ n ] for the i-th data symbol from the bit present in the n-th register stage R i ʹ n in accordance with the permutation code is defined by the table:R' i for n = 9 8 7 6 5 4 3 2 1 0 R i for n = 0 7 5 1 8 2 6 9 3 4
Independent claims26
85 paragraphs, as filed
<u style="single">Field of Invention</u>
0001The present invention relates to data processing apparatus operable to map symbols received from a predetermined number of sub-carrier signals of OFDM symbols into an output symbol stream.
0002Embodiments of the present invention can provide an OFDM receiver.
<u style="single">Background of the Invention</u>
0003The Digital Video Broadcasting-Terrestrial standard (DVB-T) utilises Orthogonal Frequency Division Multiplexing (OFDM) to communicate data representing video images and sound to receivers via a broadcast radio communications signal. There are known to be two modes for the DVB-T standard which are known as the 2k and the 8k mode. The 2k mode provides 2048 sub-carriers whereas the 8k mode provides 8192 sub-carriers. Similarly for the Digital Video Broadcasting-Handheld standard (DVB-H) a 4k mode has been provided, in which the number of sub-carriers is 4096.
0004Error correction coding schemes such as LDPC/BCH coding, which have been proposed for DVB-T2 perform better when noise and degradation of the symbol values resulting from communication is un-correlated. Terrestrial broadcast channels may suffer from correlated fading in both the time and the frequency domains. As such, by separating encoded symbols on to different sub-carrier signals of the OFDM symbol by as much as possible, the performance of error correction coding schemes can be increased. Accordingly, in order to improve the integrity of data communicated using DVB-T or DVB-H, a symbol interleaver is provided in order to interleave input data symbols as these symbols are mapped onto the sub-carrier signals of an OFDM symbol. Such a symbol interleaver comprises an interleaver memory and an address generator. The interleaver is arranged to read-into the interleaver memory the data symbols for mapping onto the OFDM sub-carrier signals, and to read-out of the memory the data symbols for the OFDM sub-carriers, the read-out being in a different order than the read-in, the order being determined from a set of addresses, which are generated by the address generator. For the 2k mode and the 8k mode an arrangement has been disclosed in the DVB-T standard for generating the addresses to effect the mapping. Likewise for the 4k mode of DVB-H standard, an arrangement for generating addresses for the mapping has been provided and an address generator for implementing this mapping is disclosed in European Patent application <patcit id="pcit0001" dnum="EP04251667A"><text>04251667.4</text></patcit>. The address generator comprises a linear feed back shift register which is operable to generate a pseudo random bit sequence and a permutation circuit. The permutation circuit permutes the order of the content of the linear feed back shift register in order to generate an address. The address provides an indication of a memory location of the interleaver memory for writing the input data symbol into or reading the input data symbol out from the interleaver memory for mapping onto one of the sub-carrier signal of the OFDM symbol. Similarly, an address generator in the receiver is arranged to generate addresses of the interleaver memory for writing the received data symbols into or reading the data symbols out from the interleaver memory to form an output data stream.
0005In accordance with a further development of the Digital Video Broadcasting-Terrestrial standard, known as DVB-T2, there is a desire to improve the communication of data, and more particularly to provide an improved arrangement for interleaving the data symbols onto the sub-carrier signals of OFDM symbols.
<u style="single">Summary of Invention</u>
0006According to an aspect of the present invention there is provided a data processing apparatus for mapping symbols received from a predetermined number of sub-carrier signals of an Orthogonal Frequency Division Multiplexed (OFDM) symbol into an output symbol stream. The data processing apparatus comprises a de-interleaver operable to read-into a memory the predetermined number of data symbols from the OFDM sub-carrier signals, and to read-out of the memory the data symbols into the output symbol stream to effect the mapping, the read-out being in a different order than the read-in, the order being determined from a set of addresses, with the effect that the data symbols are de-interleaved from the OFDM sub-carrier signals. An address generator operable to generate the set of addresses, an address being generated for each of the received data symbols for mapping the data symbol received from the OFDM sub-carrier signal into the output symbol stream. The address generator comprises a linear feedback shift register including a predetermined number of register stages and being operable to generate a pseudo-random bit sequence in accordance with a generator polynomial, a permutation circuit operable to receive the content of the shift register stages and to permute the order of the bits present in the register stages in accordance with a permutation code to form an address of one of the OFDM sub-carriers, and a control unit operable in combination with an address check circuit to re-generate an address when a generated address exceeds a predetermined maximum valid address. The predetermined maximum valid address is approximately two thousand, the linear feedback shift register has ten register stages with a generator polynomial for the linear feedback shift register of <maths id="math0001"><math display="inline"><msubsup><mi>R</mi><mi>i</mi><mi>ʹ</mi></msubsup><mfenced open="[" close="]"><mn>9</mn></mfenced><mo>=</mo><msubsup><mi>R</mi><mrow><mi>i</mi><mo>-</mo><mn>1</mn></mrow><mi>ʹ</mi></msubsup><mfenced open="[" close="]"><mn>0</mn></mfenced><mo>⊕</mo><msubsup><mi>R</mi><mrow><mi>i</mi><mo>-</mo><mn>1</mn></mrow><mi>ʹ</mi></msubsup><mfenced open="[" close="]"><mn>3</mn></mfenced><mo>,</mo></math><img file="EP2056476A2_D0001.tif" /></maths> and the permutation code forms, with an additional bit, an eleven bit address. The data processing apparatus is characterised in that the permutation circuit is arranged to change the permutation code, which permutes the order of the bits of the register stages to form the set of addresses from one OFDM symbol to another.
0007Embodiments of the present invention can provide a data processing apparatus operable as a symbol interleaver for mapping data symbols received from OFDM symbols having substantially two thousand sub-carrier signals, into an output data stream which can provide an improvement in the integrity of the communicated data. The improvement is provided as a result of a change of the permutation code, which is used to change the order of the bits in the feed back shift register, from one OFDM symbol to another. For example, the permutation code used may be one of a sequence of different permutation codes which is cycled through, for each of a plurality of OFDM symbols. As a result, an improvement is provided in reducing a possibility that successive or data bits which are close in order in an input data stream are mapped onto the same sub-carrier of an OFDM symbol, so that the error correction encoding can work more efficiently.
0008In one embodiment the number of sub-carrier signals maybe a value substantially between eight hundred and two thousand and forty eight. Furthermore, the OFDM symbol may include pilot sub-carriers, which are arranged to carry known symbols, and the predetermined maximum valid address may depend on a number of the pilot sub-carrier symbols present in the OFDM symbol. As such the 2k mode can be provided with an efficient symbol interleaver, for example for a DVB standard, such as DVB-T2, DVB-T or DVB-H.
0009In one example the sequence of different permutation codes forms the eleven bit address <i>R<sub>i</sub></i>[<i>n</i>] for the i-th data symbol from the bit present in the n-th register stage <maths id="math0002"><math display="inline"><msubsup><mi>R</mi><mi>i</mi><mi>ʹ</mi></msubsup><mfenced open="[" close="]"><mi>n</mi></mfenced></math><img file="EP2056476A2_D0002.tif" /></maths> in accordance with the permutation code defined by the table: <tables id="tabl0001" num="0001"><table frame="all"><tgroup cols="11"><colspec colnum="1" colname="col1" colwidth="18mm" /><colspec colnum="2" colname="col2" colwidth="10mm" /><colspec colnum="3" colname="col3" colwidth="10mm" /><colspec colnum="4" colname="col4" colwidth="10mm" /><colspec colnum="5" colname="col5" colwidth="10mm" /><colspec colnum="6" colname="col6" colwidth="10mm" /><colspec colnum="7" colname="col7" colwidth="10mm" /><colspec colnum="8" colname="col8" colwidth="10mm" /><colspec colnum="9" colname="col9" colwidth="10mm" /><colspec colnum="10" colname="col10" colwidth="10mm" /><colspec colnum="11" colname="col11" colwidth="10mm" /><tbody><row><entry>R'<sub>i</sub> for n =</entry><entry>9</entry><entry>8</entry><entry>7</entry><entry>6</entry><entry>5</entry><entry>4</entry><entry>3</entry><entry>2</entry><entry>1</entry><entry>0</entry></row><row><entry>R<sub>i</sub> for n =</entry><entry>0</entry><entry>7</entry><entry>5</entry><entry>1</entry><entry>8</entry><entry>2</entry><entry>6</entry><entry>9</entry><entry>3</entry><entry>4</entry></row></tbody></tgroup></table></tables>
0010Although the sequence of permutation codes can include any number of permutation codes, in one example there are two permutation codes. In one example, the two permutation codes are: <tables id="tabl0002" num="0002"><table frame="all"><tgroup cols="11"><colspec colnum="1" colname="col1" colwidth="18mm" /><colspec colnum="2" colname="col2" colwidth="10mm" /><colspec colnum="3" colname="col3" colwidth="10mm" /><colspec colnum="4" colname="col4" colwidth="10mm" /><colspec colnum="5" colname="col5" colwidth="10mm" /><colspec colnum="6" colname="col6" colwidth="10mm" /><colspec colnum="7" colname="col7" colwidth="10mm" /><colspec colnum="8" colname="col8" colwidth="10mm" /><colspec colnum="9" colname="col9" colwidth="10mm" /><colspec colnum="10" colname="col10" colwidth="10mm" /><colspec colnum="11" colname="col11" colwidth="10mm" colsep="0" /><tbody><row><entry>R'<sub>i</sub> for n =</entry><entry>9</entry><entry>8</entry><entry>7</entry><entry>6</entry><entry>5</entry><entry>4</entry><entry>3</entry><entry>2</entry><entry>1</entry><entry>0</entry></row><row><entry>R<sub>i</sub> for n =</entry><entry>0</entry><entry>7</entry><entry>5</entry><entry>1</entry><entry>8</entry><entry>2</entry><entry>6</entry><entry>9</entry><entry>3</entry><entry>4</entry></row></tbody></tgroup></table></tables> and <tables id="tabl0003" num="0003"><table frame="all"><tgroup cols="11"><colspec colnum="1" colname="col1" colwidth="18mm" /><colspec colnum="2" colname="col2" colwidth="10mm" /><colspec colnum="3" colname="col3" colwidth="10mm" /><colspec colnum="4" colname="col4" colwidth="10mm" /><colspec colnum="5" colname="col5" colwidth="10mm" /><colspec colnum="6" colname="col6" colwidth="10mm" /><colspec colnum="7" colname="col7" colwidth="10mm" /><colspec colnum="8" colname="col8" colwidth="10mm" /><colspec colnum="9" colname="col9" colwidth="10mm" /><colspec colnum="10" colname="col10" colwidth="10mm" /><colspec colnum="11" colname="col11" colwidth="10mm" colsep="0" /><tbody><row><entry>R'<sub>i</sub> for n=</entry><entry>9</entry><entry>8</entry><entry>7</entry><entry>6</entry><entry>5</entry><entry>4</entry><entry>3</entry><entry>2</entry><entry>1</entry><entry>0</entry></row><row><entry>R<sub>i</sub> for n =</entry><entry>3</entry><entry>2</entry><entry>7</entry><entry>0</entry><entry>1</entry><entry>5</entry><entry>8</entry><entry>4</entry><entry>9</entry><entry>6</entry></row></tbody></tgroup></table></tables>
0011For example, the approximately two thousand sub-carriers may be provided as one of a plurality of operating modes, the approximately two thousand sub-carriers providing half or less than half a maximum number of sub-carriers in the OFDM symbols of any of the operating modes. The data symbols may be formed into or regarded as first sets of data symbols received from first OFDM symbols and second sets of data symbols received from second OFDM symbols. The data processing apparatus is operable to de-interleave the first and second sets of data symbols into the output data stream in accordance with an odd interleaving process. The odd interleaving process includes writing the first sets of data symbols received from the sub-carriers of the first OFDM symbols into a first part of the interleaver memory in accordance with an order determined by the set of addresses generated with one of the permutation codes of the sequence, reading out the first sets of data symbols from the first part of the interleaver memory into the output data stream in accordance with a sequential order of the first sets of input data symbols, writing the second set of data symbols received from the sub-carriers of the second OFDM symbols into a second part of the interleaver memory in accordance with an order defined by the set of addresses generated with another of the permutation codes of the sequence, and reading out the second sets of data symbols from the second part of the interleaver memory into the output data stream in accordance with a sequential order of the second sets of input data symbols.
0012The first OFDM symbols may be odd OFDM symbols, and the second OFDM symbols may be even OFDM symbols.
0013In some conventional OFDM transmitters and receivers, which operate in accordance with the 2k or 8k modes for DVB-T and the 4k mode for DVB-H, two symbol interleaving processes are used in the transmitter and the receiver; one for even OFMD symbols and one for odd OFMD symbols. However, analysis has shown that the interleaving schemes designed for the 2k and 8k symbol interleavers for DVB-T and the 4k symbol interleaver for DVB-H work better for odd symbols than for even symbols. Embodiments of the present invention are arranged so that only the odd symbol interleaving process is used unless the transmitter/receiver is in the mode with the maximum number of sub-carriers. Therefore, when the number data symbols which can be carried by the sub-carriers of an OFDM symbol in one of the plurality of operating modes is less than half of the number of data symbols, which can be carried in an operating mode which proves the most number of data bearing sub-carrier signals per OFDM symbol, then an interleaver of the transmitter and the receiver of the OFDM symbols is arranged to interleaver the data symbols of both the first and second sets using the odd interleaving process. Since the interleaver is interleaving the data symbols of both the first and second sets of data symbols onto the OFDM symbols using the odd interleaving process, the interleaver uses different parts of the interleaver memory to write in and read out the data symbols. Thus, compared with the example in which the interleaver is using the odd interleaving process and the even interleaving process to interleave the first and second sets of data symbols onto successive first and second OFDM symbols, which utilises the available memory, the amount of memory capacity used is twice the number of data symbols which can be carried by an OFDM symbol for the odd only interleaving. This is compared with a memory requirement of one times the number of data symbols, which can be carried in an OFDM symbol in the mode with the most number of data symbols per OFDM symbol using both the odd and even interleaving processes. However, the number of sub-carriers per OFDM symbol for this maximum operating mode is twice the capacity of the next largest number of sub-carriers per OFDM symbol for any other operating mode with the next largest number of sub-carriers per OFDM symbol.
0014According to some examples therefore, a minimum size of the interleaver memory can be provided in accordance with the maximum number of input data symbols which can be carried on the sub-carriers of the OFDM symbols which are available to carry the input data symbols in any of the operating modes.
0015In some embodiments the operating mode which provides the maximum number of sub-carriers per OFDM symbol is a 32K mode. The other modes may include one or more of 1K, 2K, 4K, 8K and 16K modes. Thus, as will be appreciated from the above explanation, in the 32K mode the odd and even interleaving processes are used to interleave the data symbols, so that the size of the interleaver memory can be just enough to account for 32K data symbols. However, for the 16K mode and any of the other modes, then the odd interleaving process only is used, so that with the 16K mode an equivalent memory size of 32K symbols is required, with the 4K mode an equivalent memory size of 8K symbols is required, and with the 2K mode an equivalent memory size of 4K symbols is required.
0016Various aspects and features of the present invention are defined in the appended claims. Further aspects of the present invention include a method of mapping data symbols received from a predetermined number of sub-carrier signals of Orthogonal Frequency Division Multiplexed (OFDM) symbols, as well as a receiver.
<u style="single">Brief Description of Drawings</u>
0017Embodiments of the present invention will now be described by way of example only with reference to the accompanying drawings, wherein like parts are provided with corresponding reference numerals, and in which: <ul id="ul0001" list-style="none" compact="compact"><li><figref idref="f0001">Figure 1</figref> is a schematic block diagram of a Coded OFDM transmitter which may be used, for example, with the DVB-T2 standard;</li><li><figref idref="f0002">Figure 2</figref> is a schematic block diagram of parts of the transmitter shown in <figref idref="f0001">Figure 1</figref> in which a symbol mapper and a frame builder illustrate the operation of an interleaver;</li><li><figref idref="f0003">Figure 3</figref> is a schematic block diagram of the symbol interleaver shown in <figref idref="f0002">Figure 2</figref>;</li><li><figref idref="f0004">Figure 4</figref> is a schematic block diagram of an interleaver memory shown in <figref idref="f0003">Figure 3</figref> and the corresponding symbol de-interleaver in the receiver;</li><li><figref idref="f0005">Figure 5</figref> is a schematic block diagram of an address generator shown in <figref idref="f0003">Figure 3</figref> for the 2k mode;</li><li><figref idref="f0006">Figure 6</figref> is a schematic block diagram of a Coded OFDM receiver which may be used, for example, with the DVB-T2 standard;</li><li><figref idref="f0006">Figure 7</figref> is a schematic block diagram of a symbol de-interleaver which appears in <figref idref="f0006">Figure 6</figref>;</li><li><figref idref="f0007">Figure 8(a)</figref> is diagram illustrating results for an interleaver for even OFDM symbols and <figref idref="f0008">Figure 8(b)</figref> is a diagram illustrating results for odd OFDM symbols; <figref idref="f0007">Figures 8(a)</figref> and <figref idref="f0008">8(b)</figref> show plots of the distance at the interleaver output of sub-carriers that were adjacent at the interleaver input;</li><li><figref idref="f0009">Figure 9</figref> provides a schematic block diagram of the symbol interleaver shown in <figref idref="f0003">Figure 3</figref>, illustrating an operating mode in which interleaving is performed in accordance with an odd interleaving mode only; and</li><li><figref idref="f0010">Figure 10</figref> provides a schematic block diagram of the symbol de-interleaver shown in <figref idref="f0006">Figure 7</figref>, illustrating the operating mode in which interleaving is performed in accordance with the odd interleaving mode only.</li></ul>
<u style="single">Description of Preferred Embodiments</u>
0018The following description is provided to illustrate the operation of a symbol interleaver in accordance with the present technique, although it will be appreciated that the symbol interleaver can be used with other modes, other DVB standards and other OFDM systems.
0019<figref idref="f0001">Figure 1</figref> provides an example block diagram of a Coded OFDM transmitter which may be used for example to transmit video images and audio signals in accordance with the DVB-T2 standard. In <figref idref="f0001">Figure 1</figref> a program source generates data to be transmitted by the COFDM transmitter. A video coder 2, and audio coder 4 and a data coder 6 generate video, audio and other data to be transmitted which are fed to a program multiplexer 10. The output of the program multiplexer 10 forms a multiplexed stream with other information required to communicate the video, audio and other data. The multiplexer 10 provides a stream on a connecting channel 12. There may be many such multiplexed streams which are fed into different branches A, B etc. For simplicity, only branch A will be described.
0020As shown in <figref idref="f0001">Figure 1</figref> a COFDM transmitter 20 receives the stream at a multiplexer adaptation and energy dispersal block 22. The multiplexer adaptation and energy dispersal block 22 randomises the data and feeds the appropriate data to a forward error correction encoder 24 which performs error correction encoding of the stream. A bit interleaver 26 is provided to interleave the encoded data bits which for the example of DVB-T2 is the LDCP/BCH encoder output. The output from the bit interleaver 26 is fed to a bit into constellation mapper 28, which maps groups of bits onto a constellation point, which is to be used for conveying the encoded data bits. The outputs from the bit into constellation mapper 28 are constellation point labels that represent real and imaginary components. The constellation point labels represent data symbols formed from two or more bits depending on the modulation scheme used. These will be referred to as data cells. These data cells are passed through a time-interleaver 30 whose effect is to interleaver data cells resulting from multiple LDPC code words.
0021The data cells are received by a frame builder 32, with data cells produced by branch B etc in <figref idref="f0001">Figure 1</figref>, via other channels 31. The frame builder 32 then forms many data cells into sequences to be conveyed on COFDM symbols, where a COFDM symbol comprises a number of data cells, each data cell being mapped onto one of the sub-carriers. The number of sub-carriers will depend on the mode of operation of the system, which may include one of 1k, 2k, 4k, 8k, 16k or 32k, each of which provides a different number of sub-carriers according, for example to the following table: <tables id="tabl0004" num="0004"><table frame="all"><title>Number of Sub-carriers Adapted from DVB-T/H</title><tgroup cols="2"><colspec colnum="1" colname="col1" colwidth="34mm" /><colspec colnum="2" colname="col2" colwidth="36mm" /><thead><row><entry align="center" valign="top">Mode</entry><entry align="center" valign="top">Sub-carriers</entry></row></thead><tbody><row><entry align="center">1K</entry><entry align="center">756</entry></row><row><entry align="center">2K</entry><entry align="center">1512</entry></row><row><entry align="center">4K</entry><entry align="center">3024</entry></row><row><entry align="center">8K</entry><entry align="center">6048</entry></row><row><entry align="center">16K</entry><entry align="center">12096</entry></row><row rowsep="0"><entry align="center">32K</entry><entry align="center">24192</entry></row></tbody></tgroup></table></tables>
0022Thus in one example, the number of sub-carriers for the 2k mode is one thousand five hundred and twelve. For the DVB-T2 system, the number of sub-carriers per OFDM symbol can vary depending upon the number of pilot and other reserved carriers. Thus, in DVB-T2, unlike in DVB-T, the number of sub-carriers for carrying data is not fixed. Broadcasters can select one of the operating modes from 1k, 2k, 4k, 8k, 16k, 32k each providing a range of sub-carriers for data per OFDM symbol, the maximum available for each of these modes being 1024, 2048, 4096, 8192, 16384, 32768 respectively. In DVB-T2 a physical layer frame is composed of many OFDM symbols. Typically the frame starts with one or more preamble or P2 OFDM symbols, which are then followed by a number payload carrying OFDM symbols. The end of the physical layer frame is marked by a frame closing symbols. For each operating mode, the number of sub-carriers may be different for each type of symbol. Furthermore, this may vary for each according to whether bandwidth extension is selected, whether tone reservation is enabled and according to which pilot sub-carrier pattern has been selected. As such a generalisation to a specific number of sub-carriers per OFDM symbol is difficult. However, the frequency interleaver for each mode can interleave any symbol whose number of sub-carriers is smaller than or the same as the maximum available number of sub-carriers for the given mode. For example, in the 1 k mode, the interleaver would work for symbols with the number of sub-carriers being less than or equal to 1024 and for 16k mode, with the number of sub-carriers being less than or equal to 16384.
0023The sequence of data cells to be carried in each COFDM symbol is then passed to the symbol interleaver 33. The COFDM symbol is then generated by a COFDM symbol builder block 37 which introduces pilot and synchronising signals fed from a pilot and embedded signal former 36. An OFDM modulator 38 then forms the OFDM symbol in the time domain which is fed to a guard insertion processor 40 for generating a guard interval between symbols, and then to a digital to analogue convertor 42 and finally to an RF amplifier within an RF front end 44 for eventual broadcast by the COFDM transmitter from an antenna 46.
0024As explained above, the present invention provides a facility for providing a quasi-optimal mapping of the data symbols onto the OFDM sub-carrier signals. According to the example technique the symbol interleaver is provided to effect the optimal mapping of input data symbols onto COFDM sub-carrier signals in accordance with a permutation code and generator polynomial, which has been verified by simulation analysis.
0025As shown in <figref idref="f0002">Figure 2</figref> a more detailed example illustration of the bit to symbol constellation mapper 28 and the frame builder 32 is provided to illustrate an example embodiment of the present technique. Data bits received from the bit interleaver 26 via a channel 62 are grouped into sets of bits to be mapped onto a data cell, in accordance with a number of bits per symbol provided by the modulation scheme. The groups of bits, which forms a data word, are fed in parallel via data channels 64 the a mapping processor 66. The mapping processor 66 then selects one of the data symbols, in accordance with a pre-assigned mapping. The constellation point, is represented by a real and an imaginary component that is provided to the output channel 29 as one of a set of inputs to the frame builder 32.
0026The frame builder 32 receives the data cells from the bit to constellation mapper 28 through channel 29, together with data cells from the other channels 31. After building a frame of many COFDM cell sequences, the cells of each COFDM symbol are then written into an interleaver memory 100 and read out of the interleaver memory 100 in accordance with write addresses and read addresses generated by an address generator 102. According to the write-in and read-out order, interleaving of the data cells is achieved, by generating appropriate addresses. The operation of the address generator 102 and the interleaver memory 100 will be described in more detail shortly with reference to <figref idref="f0003">Figures 3</figref>, <figref idref="f0004">4</figref> and <figref idref="f0005">5</figref>. The interleaved data cells are then combined with pilot and synchronisation symbols received from the pilot and embedded signalling former 36 into an OFDM symbol builder 37, to form the COFDM symbol, which is fed to the OFDM modulator 38 as explained above.
Interleaver
0027<figref idref="f0003">Figure 3</figref> provides an example of parts of the symbol interleaver 33, which illustrates the present technique for interleaving symbols. In <figref idref="f0003">Figure 3</figref> the input data cells from the frame builder 32 are written into the interleaver memory 100. The data cells are written into the interleaver memory 100 according to a write address fed from the address generator 102 on channel 104, and read out from the interleaver memory 100 according to a read address fed from the address generator 102 on a channel 106. The address generator 102 generates the write address and the read address as explained below, depending on whether the COFDM symbol is odd or even, which is identified from a signal fed from a channel 108, and depending on a selected mode, which is identified from a signal fed from a channel 110. As explained, the mode can be one of a 1k mode, 2k mode, 4k mode, 8k mode, 16k mode or a 32k mode. As explained below, the write address and the read address are generated differently for odd and even symbols as explained with reference to <figref idref="f0004">Figure 4</figref>, which provides an example implementation of the interleaver memory 100.
0028In the example shown in <figref idref="f0004">Figure 4</figref>, the interleaver memory is shown to comprise an upper part 100 illustrating the operation of the interleaver memory in the transmitter and a lower part 340, which illustrates the operation of the de-interleaver memory in the receiver. The interleaver 100 and the de-interleaver 340 are shown together in <figref idref="f0004">Figure 4</figref> in order to facilitate understanding of their operation. As shown in <figref idref="f0004">Figure 4</figref> a representation of the communication between the interleaver 100 and the de-interleaver 340 via other devices and via a transmission channel has been simplified and represented as a section 140 between the interleaver 100 and the de-interleaver 340. The operation of the interleaver 100 is described in the following paragraphs:
0029Although <figref idref="f0004">Figure 4</figref> provides an illustration of only four input data cells onto an example of four sub-carrier signals of a COFDM symbol, it will be appreciated that the technique illustrated in <figref idref="f0004">Figure 4</figref> can be extended to a larger number of sub-carriers such as 756 for the 1k mode 1512 for the 2k mode, 3024 for the 4k mode and 6048 for the 8k mode, 12096 for the 16k mode and 24192 for the 32k mode.
0030The input and output addressing of the interleaver memory 100 shown in <figref idref="f0004">Figure 4</figref> is shown for odd and even symbols. For an even COFDM symbol the data cells are taken from the input channel 77 and written into the interleaver memory 124.1 in accordance with a sequence of addresses 120 generated for each COFDM symbol by the address generator 102. The write addresses are applied for the even symbol so that as illustrated interleaving is effected by the shuffling of the write-in addresses. Therefore, for each interleaved symbol y(h(q)) = y'(q).
0031For odd symbols the same interleaver memory 124.2 is used. However, as shown in <figref idref="f0004">Figure 4</figref> for the odd symbol the write-in order 132 is in the same address sequence used to read out the previous even symbol 126. This feature allows the odd and even symbol interleaver implementations to only use one interleaver memory 100 provided the read-out operation for a given address is performed before the write-in operation. The data cells written into the interleaver memory 124 during odd symbols are then read out in a sequence 134 generated by the address generator 102 for the next even COFDM symbol and so on. Thus only one address is generated per symbol, with the read-in and write-out for the odd/even COFDM symbol being performed contemporaneously.
0032In summary, as represented in <figref idref="f0004">Figure 4</figref>, once the set of addresses H(q) has been calculated for all active sub-carriers, the input vector Y' = (y<sub>0'</sub>, y<sub>1'</sub>, y<sub>2'</sub>,...y<sub>Nmax-1'</sub>) is processed to produce the interleaved vector Y = (y<sub>0</sub>, y<sub>1</sub>, y<sub>2</sub>,...y<sub>Nmax-1</sub>) defined by: yH(<sub>q</sub>) = y'<sub>q</sub> for even symbols for q = 0,...,N<sub>max</sub>-1 y<sub>q</sub> = y'<sub>H(q)</sub> for odd symbols for q = 0,...,N<sub>max</sub>-1
0033In other words, for even OFDM symbols the input words are written in a permutated way into a memory and read back in a sequential way, whereas for odd symbols, they are written sequentially and read back permutated. In the above case, the permutation H(q) is defined by the following table: <tables id="tabl0005" num="0005"><table frame="none"><title>Table 1: permutation for simple case where Nmax =4</title><tgroup cols="5" rowsep="0"><colspec colnum="1" colname="col1" colwidth="16mm" /><colspec colnum="2" colname="col2" colwidth="16mm" colsep="0" /><colspec colnum="3" colname="col3" colwidth="16mm" /><colspec colnum="4" colname="col4" colwidth="16mm" /><colspec colnum="5" colname="col5" colwidth="16mm" colsep="0" /><tbody><row><entry rowsep="1">q</entry><entry rowsep="1">0</entry><entry colsep="0" rowsep="1">1</entry><entry colsep="0" rowsep="1">2</entry><entry rowsep="1">3</entry></row><row><entry>H(q)</entry><entry>1</entry><entry colsep="0">3</entry><entry colsep="0">0</entry><entry>2</entry></row></tbody></tgroup></table></tables>
0034As shown in <figref idref="f0004">Figure 4</figref>, the de-interleaver 340 operates to reverse the interleaving applied by the interleaver 100, by applying the same set of addresses as generated by an equivalent address generator, but applying the write-in and read-out addresses in reverse. As such, for even symbols, the write-in addresses 342 are in sequential order, whereas the read out address 344 are provided by the address generator. Correspondingly, for the odd symbols, the write-in order 346 is determined from the set of addresses generated by the address generator, whereas read out 348 is in sequential order.
<u style="single">Address Generation for the 2k Mode</u>
0035A schematic block diagram of the algorithm used to generate the permutation function H(q) is represented in <figref idref="f0005">Figure 5</figref> for the 2K mode. In <figref idref="f0005">Figure 5</figref> a linear feed back shift register is formed by twelve shift register stages 200, in order to generate an address between 0 and two thousand and forty eight, and an xor-gate 202 which is connected to the stages of the shift register 200 in accordance with a generator polynomial. Therefore, in accordance with the content of the shift register 200 a next bit of the shift register is provided from the output of the xor-gate 202 by xoring the content of shift register R[0] and register stage R[3]. According to the generator polynomial a pseudo random bit sequence is generated from the content of the shift register 200. However, in order to generate an address for the 2k mode as illustrated, a permutation circuit 210 is provided which effectively permutes the order of the bits within the shift register 200 from an order <i>R'<sub>i</sub>[n]</i> to an order <i>R¡[n</i>] at the output of the permutation circuit 210. Ten bits from the output of the permutation circuit 210 are then fed on a connecting channel 212 to which is added a most significant bit via a channel 214 which is provided by a toggle circuit 218. An eleven bit address is therefore generated on channel 212. However, in order to ensure the authenticity of an address, an address check circuit 216 analyses the generated address to determine whether it exceeds the maximum number of sub-carrier signals. If it does then a control signal is generated and fed via a connecting channel 220 to a control unit 224. If the generated address exceeds the maximum number of carrier signals then this address is rejected and a new address regenerated for the particular symbol.
0036In summary an (N<sub>r</sub> - 1) bit word R'<sub>i</sub> is defined, with N<sub>r</sub> = log<sub>2</sub> M<sub>max</sub>, where M<sub>max</sub> = 2048 in the 2K mode, using a LFSR (Linear Feedback Shift Register).
0037The polynomials used to generate this sequence are as follows: <maths id="math0003"><math display="block"><mn>2</mn><mo></mo><mi>K mode</mi><mo>:</mo><msubsup><mi>R</mi><mi>i</mi><mi>ʹ</mi></msubsup><mfenced open="[" close="]"><mn>9</mn></mfenced><mo>=</mo><msubsup><mi>R</mi><mrow><mi>i</mi><mo>-</mo><mn>1</mn></mrow><mi>ʹ</mi></msubsup><mfenced open="[" close="]"><mn>0</mn></mfenced><mo>⊕</mo><msubsup><mi>R</mi><mrow><mi>i</mi><mo>-</mo><mn>1</mn></mrow><mi>ʹ</mi></msubsup><mfenced open="[" close="]"><mn>3</mn></mfenced></math><img file="EP2056476A2_D0003.tif" /></maths> where i varies from 0 to M<sub>max</sub> - 1
0038Once one R'<sub>i</sub>, word has been generated, it goes through a permutation to produce another (N<sub>r</sub> - 1) bit word called R<sub>i</sub>. R<sub>i</sub> is derived from R'<sub>i</sub> by the bit permutations given in the table below: <tables id="tabl0006" num="0006"><table frame="all"><title>Table: Bit permutation for the 2K mode</title><tgroup cols="11"><colspec colnum="1" colname="col1" colwidth="30mm" /><colspec colnum="2" colname="col2" colwidth="10mm" /><colspec colnum="3" colname="col3" colwidth="10mm" /><colspec colnum="4" colname="col4" colwidth="10mm" /><colspec colnum="5" colname="col5" colwidth="10mm" /><colspec colnum="6" colname="col6" colwidth="10mm" /><colspec colnum="7" colname="col7" colwidth="10mm" /><colspec colnum="8" colname="col8" colwidth="10mm" /><colspec colnum="9" colname="col9" colwidth="10mm" /><colspec colnum="10" colname="col10" colwidth="10mm" /><colspec colnum="11" colname="col11" colwidth="10mm" /><tbody><row><entry><maths id="math0004"><math display="inline"><msubsup><mi>R</mi><mi>i</mi><mi>ʹ</mi></msubsup><mfenced open="[" close="]"><mi>n</mi></mfenced></math><img file="EP2056476A2_D0004.tif" /></maths> bit position</entry><entry>9</entry><entry>8</entry><entry>7</entry><entry>6</entry><entry>5</entry><entry>4</entry><entry>3</entry><entry>2</entry><entry>1</entry><entry>0</entry></row><row><entry><maths id="math0005"><math display="inline"><msub><mi>R</mi><mi>i</mi></msub><mfenced open="[" close="]"><mi>n</mi></mfenced></math><img file="EP2056476A2_D0005.tif" /></maths> bit position</entry><entry>0</entry><entry>7</entry><entry>5</entry><entry>1</entry><entry>8</entry><entry>2</entry><entry>6</entry><entry>9</entry><entry>3</entry><entry>4</entry></row></tbody></tgroup></table></tables>
0039As an example, for the permutation code above this means that for mode 2K, the bit number 9 of R'<sub>i</sub> is sent in bit position number 0 of R<sub>i</sub>.
0040The address H(q) is then derived from R<sub>i</sub> through the following equation: <maths id="math0006"><math display="block"><mi mathvariant="normal">H</mi><mfenced><mi mathvariant="normal">q</mi></mfenced><mo mathvariant="normal">=</mo><mfenced><mi>i mod</mi><mo></mo><mn mathvariant="normal">2</mn></mfenced><mo mathvariant="normal">⋅</mo><msup><mn mathvariant="normal">2</mn><mrow><msub><mi mathvariant="normal">N</mi><mi mathvariant="normal">r</mi></msub><mo mathvariant="normal">-</mo><mn mathvariant="normal">1</mn></mrow></msup><mo mathvariant="normal">+</mo><mstyle displaystyle="true"><munderover><mo mathvariant="normal">∑</mo><mrow><mi mathvariant="normal">j</mi><mo mathvariant="normal">=</mo><mn mathvariant="normal">0</mn></mrow><mrow><msub><mi mathvariant="normal">N</mi><mi mathvariant="normal">r</mi></msub><mo mathvariant="normal">-</mo><mn mathvariant="normal">2</mn></mrow></munderover></mstyle><msub><mi mathvariant="normal">R</mi><mi mathvariant="normal">i</mi></msub><mfenced><mi mathvariant="normal">j</mi></mfenced><mo mathvariant="normal">⋅</mo><msup><mn mathvariant="normal">2</mn><mi mathvariant="normal">j</mi></msup></math><img file="EP2056476A2_D0006.tif" /></maths>
0041The (i mod2) · 2<sup>N<sub2>r</sub2>-1</sup> part of the above equation is represented in <figref idref="f0005">Figure 5</figref> by the toggle block T 218.
0042An address check is then performed on H(q) to verify that the generated address is within the range of acceptable addresses: if (H(q)<N<sub>max</sub>), where, in one example N<sub>max</sub> = 1512 in the 2K mode, then the address is valid. If the address is not valid, the control unit is informed and it will try to generate a new H(q) by incrementing the index i.
0043The role of the toggle block is to make sure that we do not generate an address exceeding N<sub>max</sub> twice in a row. In effect, if an exceeding value was generated, this means that the MSB (i.e. the toggle bit) of the address H(q) was one. So the next value generated will have a MSB set to zero, insuring to produce a valid address.
0044The following equations sum up the overall behaviour and help to understand the loop structure of this algorithm: <img file="EP2056476A2_D0007.tif" />
0045As will be explained shortly, in one example of the address generator, the above mentioned permutation code is used for generating addresses for all OFDM symbols. In another example, the permutation codes may be changed between symbols, with the effect that a set of permutation codes are cycled through for successive OFMD symbols. To this end, the control lines 108, 110 providing an indication as to whether the OFDM symbol is odd or even and the current mode are used to select the permutation code. This example mode in which a plurality of permutation codes are cycled through is particularly appropriate for the example in which the odd interleaver only is used, which will be explained later. A signal indicating that a different permutation code should be used is provided via a control channel 111. In one example the possible permutation codes are pre-stored in the permutation code circuit 210. In another example, the control unit 224 supplies the new permutation code to be used for an OFDM symbol.
<u style="single">Receiver</u>
0046<figref idref="f0006">Figure 6</figref> provides an example illustration of a receiver which may be used with the present technique. As shown in <figref idref="f0006">Figure 6</figref>, a COFDM signal is received by an antenna 300 and detected by a tuner 302 and converted into a digital form by an analogue-to-digital converter 304. A guard interval removal processor 306 removes the guard interval from a received COFDM symbol, before the data is recovered from the COFDM symbol using a Fast Fourier Transform (FFT) processor 308 in combination with a channel estimator and correction 310 in co-operation with a embedded-signalling decoding unit 311, in accordance with known techniques. The demodulated data is recovered from a mapper 312 and fed to a symbol de-interleaver 314, which operates to effect the reverse mapping of the received data symbol to re-generate an output data stream with the data de-interleaved.
0047The symbol de-interleaver 314 is formed from a data processing apparatus as shown in <figref idref="f0006">Figure 6</figref> with an interleaver memory 540 and an address generator 542. The interleaver memory is as shown in <figref idref="f0004">Figure 4</figref> and operates as already explained above to effect de-interleaving by utilising sets of addresses generated by the address generator 542. The address generator 542 is formed as shown in <figref idref="f0006">Figure 7</figref> and is arranged to generate corresponding addresses to map the data symbols recovered from each COFDM sub-carrier signals into an output data stream.
0048The remaining parts of the COFDM receiver shown in <figref idref="f0006">Figure 6</figref> are provided to effect error correction decoding 318 to correct errors and recover an estimate of the source data.
0049One advantage provided by the present technique for both the receiver and the transmitter is that a symbol interleaver and a symbol de-interleaver operating in the receivers and transmitters can be switched between the 1k, 2k, 4k, 8k, 16k and the 32k mode by changing the generator polynomials and the permutation order. Hence the address generator 542 shown in <figref idref="f0006">Figure 7</figref> includes an input 544, providing an indication of the mode as well as an input 546 indicating whether there are odd/even COFDM symbols. A flexible implementation is thereby provided because a symbol interleaver and de-interleaver can be formed as shown in <figref idref="f0003">Figures 3</figref> and <figref idref="f0006">7</figref>, with an address generator as illustrated in <figref idref="f0005">Figure 5</figref>. The address generator can therefore be adapted to the different modes by changing to the generator polynomials and the permutation orders indicated for each of the modes. For example, this can be effected using a software change. Alternatively, in other embodiments, an embedded signal indicating the mode of the DVB-T2 transmission can be detected in the receiver in the embedded-signalling processing unit 311 and used to configure automatically the symbol de-interleaver in accordance with the detected mode.
<u style="single">Optimal Use of Odd Interleavers</u>
0050As shown in <figref idref="f0004">Figure 4</figref>, two symbol interleaving processes, one for even COFDM symbols and one for odd COFDM symbols allows the amount of memory used during interleaving to be reduced. In the example shown in <figref idref="f0004">Figure 4</figref>, the write in order for the odd symbol is the same as the read out order for the even symbol therefore, while an odd symbol is being read from the memory, an even symbol can be written to the location just read from; subsequently, when that even symbol is read from the memory, the following odd symbol can be written to the location just read from.
0051The selection of the polynomial generator and the permutation codes explained above have been identified following simulation analysis of the relative performance of the interleaver. The relative performance of the interleaver has been evaluated using a relative ability of the interleaver to separate successive symbols or an "interleaving quality". The relative measure of the interleaver quality is determined by defining a distance D (in number of sub-carriers). A criterion C is chosen to identify a number of sub-carriers that are at distance ≤ D at the output of the interleaver that were at distance ≤ D at the input of the interleaver, the number of sub-carriers for each distance D then being weighted with respect to the relative distance. The criterion C is evaluated for both odd and even COFDM symbols. Minimising C produces a superior quality interleaver. <maths id="math0007"><math display="block"><mi>C</mi><mo>=</mo><mstyle displaystyle="true"><munderover><mo>∑</mo><mn>1</mn><mrow><mi>d</mi><mo>=</mo><mi>D</mi></mrow></munderover></mstyle><mi /><mo></mo><msub><mi mathvariant="normal">N</mi><mi mathvariant="italic">even</mi></msub><mfenced><mi>d</mi></mfenced><mo>/</mo><mi>d</mi><mo>+</mo><mstyle displaystyle="true"><munderover><mo>∑</mo><mn>1</mn><mrow><mi>d</mi><mo>=</mo><mi>D</mi></mrow></munderover></mstyle><msub><mi mathvariant="normal">N</mi><mi mathvariant="italic">odd</mi></msub><mfenced><mi>d</mi></mfenced><mo>/</mo><mi>d</mi></math><img file="EP2056476A2_D0008.tif" /></maths> where: N<sub>even</sub>(d) and N<sub>odd</sub>(d) are number of sub-carriers in an even and odd symbol respectively at the output of the interleaver that remain within d sub-carrier spacing of each other.
0052As mentioned above, during an experimental analysis of the performance of the interleavers (using criterion C as defined above) and for example shown in <figref idref="f0007">Figure 8(a)</figref> and <figref idref="f0008">Figure 8(b)</figref> it has been discovered that the interleaving schemes designed for the 2k and 8k symbol interleavers for DVB-T and the 4k symbol interleaver for DVB-H work better for odd symbols than even symbols. Thus from performance evaluation results of the interleavers, for example for the 16K, as illustrated by <figref idref="f0007">Figures 8(a)</figref> and <figref idref="f0008">8(b)</figref> it has been revealed that the odd interleavers work better than the even interleavers. This can be seen by comparing <figref idref="f0007">Figure 8(a)</figref> which shows results for an interleaver for even symbols and <figref idref="f0008">Figure 8(b)</figref> illustrating results for odd symbols: it can be seen that the average distance at the interleaver output of sub-carriers that were adjacent at the interleaver input is greater for an interleaver for odd symbols than an interleaver for even symbols.
0053As will be understood, the amount of interleaver memory required to implement a symbol interleaver is dependent on the number of data symbols to be mapped onto the COFDM carrier symbols. Thus a 16k mode symbol interleaver requires half the memory required to implement a 32k mode symbol interleaver and similarly, the amount of memory required to implement an 8k symbol interleaver is half that required to implement a 16k interleaver. Therefore a transmitter or receiver which is arranged to implement a symbol interleaver of a mode, which sets the maximum number of data symbols which can be carried per OFDM symbol, then that receiver or transmitter will include sufficient memory to implement two odd interleaving processes for any other mode, which provides half or smaller than half the number of sub-carriers per OFDM symbol in that given maximum mode. For example a receiver or transmitter including a 32K interleaver will have enough memory to accommodate two 16K odd interleaving processes each with their own 16K memory.
0054Therefore, in order to exploit the better performance of the odd interleaving process, a symbol interleaver capable of accommodating multiple modulation modes can be arranged so that only an odd symbol interleaving process is used if in a mode which comprises half or less than half of the number of sub-carriers in a maximum mode, which represents the maximum number of sub-carriers per OFDM symbol. This maximum mode therefore sets the maximum memory size. For example, in a transmitter/receiver capable of the 32K mode, when operating in a mode with fewer carriers (i.e. 16K, 8K, 4K or 1K) then rather than employing separate odd and even symbol interleaving processes, two odd interleavers could be used.
0055An illustration is shown in <figref idref="f0009">Figure 9</figref> of an adaptation of the symbol interleaver 33, which is shown in <figref idref="f0003">Figure 3</figref> when interleaving input data symbols onto the sub-carriers of OFDM symbols in the odd interleaving mode only. The symbol interleaver 33.1 corresponds exactly to the symbol interleaver 33 as shown in <figref idref="f0003">Figure 3</figref>, except that the address generator 102.1 is adapted to perform the odd interleaving process only. For the example shown in <figref idref="f0009">Figure 9</figref>, the symbol interleaver 33.1 is operating in a mode where the number of data symbols which can be carried per OFDM symbol is less than half of the maximum number which can be carried by an OFDM symbol in an operating mode with the largest number of sub-carriers per OFDM symbol. As such, the symbol interleaver 33.1 has been arranged to partition the interleaver memory 100. For the present illustration shown in <figref idref="f0009">Figure 9</figref> the interleaver memory then 100 is divided into two parts 401, 402. As an illustration of the symbol interleaver 33.1 operating in a mode in which data symbols are mapped onto the OFDM symbols using the odd interleaving process, <figref idref="f0009">Figure 9</figref> provides an expanded view of each half of the interleaver memory 401, 402. The expanded view provides an illustration of the odd interleaving mode as represented for the transmitter side for four symbols A, B, C, D reproduced from <figref idref="f0004">Figure 4</figref>. Thus as shown in <figref idref="f0009">Figure 9</figref>, for successive sets of first and second data symbols, the data symbols are written into the interleaver memory 401, 402 in a sequential order and read out in a permuted order in accordance with the addresses generated by the address generator 102 as previously explained. Thus as illustrated in <figref idref="f0009">Figure 9</figref>, since an odd interleaving process is being performed for successive sets of first and second sets of data symbols, the interleaver memory must be partitioned into two parts. Symbols from a first set of data symbols are written into a first half of the interleaver memory 401, and symbols from a second set of data symbols are written into a second part of the interleaver memory 402. This is because the symbol interleaver is no longer able to reuse the same parts of the symbol interleaver memory as can be accommodated when operating in an odd and even mode of interleaving.
0056A corresponding example of the interleaver in the receiver, which appears in <figref idref="f0006">Figure 7</figref> but adapted to operate with an odd interleaving process only, is shown in <figref idref="f0010">Figure 10</figref>. As shown in <figref idref="f0010">Figure 10</figref> the interleaver memory 540 is divided into two halves 410, 412 and the address generator 542 is adapted to write data symbols into the interleaver memory and read data symbols from the interleaver memory into respective parts of the memory 410, 402 for successive sets of data symbols to implement an odd interleaving process only. Therefore, in correspondence with representation shown in <figref idref="f0009">Figure 9</figref>, <figref idref="f0010">Figure 10</figref> shows the mapping of the interleaving process which is performed at the receiver and illustrated in <figref idref="f0004">Figure 4</figref> as an expanded view operating for both the first and second halves of the interleaving memory 410, 412. Thus a first set of data symbols are written into a first part of the interleaver memory 410 in a permuted order defined in accordance with the addresses generated by the address generator 542 as illustrated by the order of writing in the data symbols which provides a write sequence of 1, 3, 0, 2. As illustrated the data symbols are then read out of the first part of the interleaver memory 410 in a sequential order thus recovering the original sequence A, B, C, D.
0057Correspondingly, a second subsequent set of data symbols which are recovered from a successive OFDM symbol are written into the second half of the interleaver memory 412 in accordance with the addresses generated by the address generator 542 in a permuted order and read out into the output data stream in a sequential order.
0058In one example the addresses generated for a first set of data symbols to write into the first half of the interleaver memory 410 can be reused to write a second subsequent set of data symbols into the interleaver memory 412. Correspondingly, the transmitter may also reuse addresses generated for one half of the interleaver for a first set of data symbols for reading out a second set of data symbols which have been written into the second half of the memory in sequential order.
<u style="single">Odd Interleaver with Offset</u>
0059The performance of an interleaver, which uses two odd interleavers could be further improved by using a sequence of odd only interleavers rather than a single odd only interleaver, so that any bit of data input to the interleave does not always modulate the same carrier in the OFDM symbol.
0060A sequence of odd only interleavers could be realised by either: <ul id="ul0002" list-style="bullet" compact="compact"><li>adding an offset to the interleaver address modulo the number of data carriers, or</li><li>using a sequence of permutations in the interleaver</li></ul>
<u style="single">Adding an Offset</u>
0061Adding an offset to the interleaver address modulo the number of data carriers effectively shifts and wraps-round the OFDM symbol so that any bit of data input to the interleaver does not always modulate the same carrier in the OFDM symbol. Thus the address generator, could optionally include an offset generator, which generates an offset in an address generated by the address generator on the output channel H(q).
0062The offset would change each symbol. For example, this offset could provide be a cyclic sequence. This cyclic sequence could be, for example, of length 4 and could consist of, for example, prime numbers. For example, such a sequence could be: 0, 41, 97, 157
0063Furthermore, the offset may be a random sequence, which may be generated by another address generator from a similar OFDM symbol interleaver or may be generated by some other means.
<u style="single">Using a Sequence of Permutations</u>
0064As shown in <figref idref="f0005">Figures 5</figref>, a control line 111 extends from the control unit of the address generator to the permutation circuit. As mentioned above, in one example the address generator can apply a different permutation code from a set of permutation codes for successive OFDM symbols. Using a sequence of permutations in the interleaver address generator reduces a likelihood that any bit of data input to the interleaver does not always modulate the same sub-carrier in the OFDM symbol.
0065For example, this could be a cyclic sequence, so that a different permutation code in a set of permutation codes in a sequence is used for successive OFDM symbols and then repeated. This cyclic sequence could be, for example, of length two or four. For the example of the 2K symbol interleaver a sequence of two permutation codes which are cycled through per OFDM symbol could be for example: <ul id="ul0003" list-style="none"><li>0 7 5 1 8 2 6 9 3 4 *</li><li>3 2 7 0 1 5 8 4 9 6 Whereas a sequence of four permutation codes could be: <ul id="ul0004" list-style="none"><li>0 7 5 1 8 2 6 9 3 4 *</li><li>3 2 7 0 1 5 8 4 9 6</li><li>4 8 3 2 9 0 1 5 6 7</li><li>7 3 9 5 2 1 0 6 4 8</li></ul></li></ul>
0066The switching of one permutation code to another could be effected in response to a change in the Odd/Even signal indicated on the control channel 108. In response the control unit 224 changes the permutation code in the permutation code circuit 210 via the control line 111. For the example of a 1 k symbol interleaver, two permutation codes could be: <ul id="ul0005" list-style="none"><li>4 3 2 1 0 5 6 7 8</li><li>3 2 5 0 1 4 7 8 6 whereas four permutation codes could be: <ul id="ul0006" list-style="none"><li>4 3 2 1 0 5 6 7 8</li><li>3 2 5 0 1 4 7 8 6</li><li>7 5 3 8 2 6 1 4 0</li><li>1 6 8 2 5 3 4 0 7</li></ul></li></ul>
0067Other combinations of sequences may be possible for 2k, 4k and 16k carrier modes or indeed 0.5k carrier mode. For example, the following permutation codes for each of the 0.5k, 2k, 4k and 16k provide good de-correlation of symbols and can be used cyclically to generate the offset to the address generated by an address generator for each of the respective modes: <ul id="ul0007" list-style="none" compact="compact"><li>4k Mode: <ul id="ul0008" list-style="none" compact="compact"><li>7 10 5 8 1 2 4 9 0 3 6 **</li><li>6 2 7 10 8 0 3 4 1 9 5</li><li>9 5 4 2 3 1 0 1 0 6 8 7</li><li>1 4 1 0 3 9 7 2 6 5 0 8</li></ul></li><li>8k Mode: <ul id="ul0009" list-style="none"><li>5 11 3 0 1 0 8 6 9 2 4 1 7 *</li><li>8 10 7 6 0 5 2 1 3 9 4 11</li><li>11 3 6 9 2 7 4 1 0 5 1 0 8</li><li>10 8 1 7 5 6 0 11 4 2 9 3</li></ul></li><li>16k Mode: <ul id="ul0010" list-style="none" compact="compact"><li>8 4 3 2 0 11 1 5 12 10 6 7 9</li><li>7 9 5 3 1 1 1 4 0 2 12 10 8 6</li><li>6 11 7 5 2 3 0 1 1 0 8 12 9 4</li><li>5 12 9 0 3 10 2 4 6 7 8 11 1</li></ul></li></ul>
0068For the permutation codes indicated above, the first two could be used in a two sequence cycle, whereas all four could be used for a four sequence cycle. In addition, some further sequences of four permutation codes, which are cycled through to provide the offset in an address generator to produce a good de-correlation in the interleaved symbols (some are common to the above) are provided below: <ul id="ul0011" list-style="none" compact="compact"><li>0.5k Mode: <ul id="ul0012" list-style="none" compact="compact"><li>3 7 4 6 1 2 0 5</li><li>4 2 5 7 3 0 1 6</li><li>5 3 6 0 4 1 2 7</li><li>6 1 0 5 2 7 4 3</li></ul></li><li>2k Mode: <ul id="ul0013" list-style="none" compact="compact"><li>0 7 5 1 8 2 6 9 3 4 *</li><li>4 8 3 2 9 0 1 5 6 7</li><li>8 3 9 0 2 1 5 7 4 6</li><li>7 0 4 8 3 6 9 1 5 2</li></ul></li><li>4k Mode: <ul id="ul0014" list-style="none" compact="compact"><li>7 1 0 5 8 1 2 4 9 0 3 6 **</li><li>6 2 7 1 0 8 0 3 4 1 9 5</li><li>1 0 3 4 1 2 7 0 6 8 5 9</li><li>0 8 9 5 1 0 4 6 3 2 1 7</li></ul></li><li>8k Mode: <ul id="ul0015" list-style="none" compact="compact"><li>5 11 3 0 1 0 8 6 9 2 4 1 7 *</li><li>10 8 5 4 2 9 1 0 6 7 3 11</li><li>11 6 9 8 4 7 2 1 0 10 5 3</li><li>8 3 1 1 7 9 1 5 6 4 0 2 1 0</li></ul></li></ul> *these are the permutations in the DVB-T standard **these are the permutations in the DVB-H standard
0069Examples of address generators, and corresponding interleavers, for the 2k, 4k and 8k modes are disclosed in European patent application number <patcit id="pcit0002" dnum="EP04251667A"><text>04251667.4</text></patcit>, the contents of which are incorporated herein be reference. An address generator for the 0.5k mode are disclosed in our co-pending <patcit id="pcit0003" dnum="GB0722553A"><text>UK patent application number 0722553.5</text></patcit>.Various modifications may be made to the embodiments described above without departing from the scope of the present invention. In particular, the example representation of the generator polynomial and the permutation order which have been used to represent aspects of the invention are not intended to be limiting and extend to equivalent forms of the generator polynomial and the permutation order.
0070As will be appreciated the transmitter and receiver shown in <figref idref="f0001">Figures 1</figref> and <figref idref="f0006">6</figref> respectively are provided as illustrations only and are not intended to be limiting. For example, it will be appreciated that the position of the symbol interleaver and the de-interleaver with respect, for example to the bit interleaver and the mapper can be changed. As will be appreciated the effect of the interleaver and de-interleaver is unchanged by its relative position, although the interleaver may be interleaving I/Q symbols instead of v-bit vectors. A corresponding change may be made in the receiver. Accordingly the interleaver and de-interleaver may be operating on different data types, and may be positioned differently to the position described in the example embodiments.
0071According to one implementation of a transmitter, a data processing apparatus operable to map input symbols to be communicated onto a predetermined number of sub-carrier signals of Orthogonal Frequency Division Multiplexed (OFDM) symbols, the data processing apparatus comprising <ul id="ul0016" list-style="none" compact="compact"><li>an interleaver operable to read-into a memory the predetermined number of data symbols for mapping onto the OFDM sub-carrier signals, and to read-out of the memory the data symbols for the OFDM sub-carriers to effect the mapping, the read-out being in a different order than the read-in, the order being determined from a set of addresses, with the effect that the data symbols are interleaved on the sub-carrier signals,</li><li>an address generator operable to generate the set of addresses, an address being generated for each of the input symbols for mapping the input data symbol on to one of the sub-carrier signals, the address generator comprising</li><li>a linear feedback shift register including a predetermined number of register stages and being operable to generate a pseudo-random bit sequence in accordance with a generator polynomial,</li><li>a permutation circuit operable to receive the content of the shift register stages and to permute the order of the bits present in the register stages in accordance with a permutation code to form an address, and</li><li>a control unit operable in combination with an address check circuit to re-generate an address when a generated address exceeds a predetermined maximum valid address, wherein</li><li>the predetermined maximum valid address is approximately two thousand,</li><li>the linear feedback shift register has ten register stages with a generator polynomial for the linear feedback shift register of <maths id="math0008"><math display="inline"><msubsup><mi>R</mi><mi>i</mi><mi>ʹ</mi></msubsup><mfenced open="[" close="]"><mn>9</mn></mfenced><mo>=</mo><msubsup><mi>R</mi><mrow><mi>i</mi><mo>-</mo><mn>1</mn></mrow><mi>ʹ</mi></msubsup><mfenced open="[" close="]"><mn>0</mn></mfenced><mo>⊕</mo><msubsup><mi>R</mi><mrow><mi>i</mi><mo>-</mo><mn>1</mn></mrow><mi>ʹ</mi></msubsup><mfenced open="[" close="]"><mn>3</mn></mfenced><mo>,</mo></math><img file="EP2056476A2_D0009.tif" /></maths> and the permutation code forms, with an additional bit, an eleven bit address, characterised in that</li><li>the permutation circuit is arranged to change the permutation code, which permutes the order of the bits of the register stages to form the addresses from one OFDM symbol to another.</li></ul>
0072As explained above the permutation codes and generator polynomial of the interleaver, which has been described with reference to an implementation of a particular mode, can equally be applied to other modes, by changing the predetermined maximum allowed address in accordance with the number of sub-carriers for that mode.
0073As mentioned above, embodiments of the present invention find application with DVB standards such as DVB-T, DVB-T2 and DVB-H, which are incorporated herein by reference. For example embodiments of the present invention may be used in a transmitter or receiver operating in accordance with the DVB-H standard, in handheld mobile terminals. The mobile terminals may be integrated with mobile telephones (whether second, third or higher generation) or Personal Digital Assistants or Tablet PCs for example. Such mobile terminals may be capable of receiving DVB-H or DVB-T/T2 compatible signals inside buildings or on the move in for example cars or trains, even at high speeds. The mobile terminals may be, for example, powered by batteries, mains electricity or low voltage DC supply or powered from a car battery. Services that may be provided by DVB-H may include voice, messaging, internet browsing, radio, still and/or moving video images, television services, interactive services, video or near-video on demand and option. The services might operate in combination with one another. In other examples embodiments of the present invention finds application with the DVB-T2 standard as specified in accordance with ETSI standard EN 302 755. In other examples embodiments of the present invention find application with the cable transmission standard known as DVB-C2. However, it will be appreciated that the present invention is not limited to application with DVB and may be extended to other standards for transmission or reception, both fixed and mobile.
33 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5 Sheet 6 Sheet 7 Sheet 8 Sheet 9 Sheet 10 Sheet 11 Sheet 12 Sheet 13 Sheet 14 Sheet 15 Sheet 16 Sheet 17 Sheet 18 Sheet 19 Sheet 20 Sheet 21 Sheet 22 Sheet 23 Sheet 24 Sheet 25 Sheet 26 Sheet 27 Sheet 28 Sheet 29 Sheet 30 Sheet 31 Sheet 32 Sheet 33
Every citation, both ways
| Document | Relation | Office | Cited during |
|---|---|---|---|
| EP1463255A1 | Cites | European Patent Office (EPO) | Search report |
| EP1463256A1 | Cites | European Patent Office (EPO) | Applicant |
| US6353900B1 | Cites | United States of America | Search report |
| GB722553A | Cites | United Kingdom | Applicant |
780 members in 23 offices
Priority claims6
| Document | Office | Kind | Date |
|---|---|---|---|
| 0721269 | United Kingdom | – | |
| 0721269 | United Kingdom | A | |
| 0722645 | United Kingdom | – | |
| 0722645 | United Kingdom | A | |
| 0722728 | United Kingdom | – | |
| 0722728 | United Kingdom | A |
Members780
| Document | Office | Kind | |
|---|---|---|---|
| EP1463255A1 | European Patent Office (EPO) | A1 | |
| EP1463256A1 | European Patent Office (EPO) | A1 | |
| KR20040084811A | Republic of Korea | A | |
| US2004246888A1 | United States of America | A1 | |
| EP1463256B1 | European Patent Office (EPO) | B1 | |
| EP1662739A1 | European Patent Office (EPO) | A1 | |
| EP1662740A1 | European Patent Office (EPO) | A1 | |
| DE602004000824D1 | Germany | D1 | |
| AT326105T | Austria | T | |
| ATE326105T1 | Austria | T1 | |
| DK1463256T3 | Denmark | T3 | |
| PL1463256T3 | Poland | T3 | |
| PT1463256E | Portugal | E | |
| ES2260728T3 | Spain | T3 | |
| KR100642539B1 | Republic of Korea | B1 | |
| DE602004000824T2 | Germany | T2 | |
| GB0721270D0 | United Kingdom | D0 | |
| GB0721271D0 | United Kingdom | D0 | |
| GB0721272D0 | United Kingdom | D0 | |
| GB0721269D0 | United Kingdom | D0 | |
| GB0722553D0 | United Kingdom | D0 | |
| GB0722645D0 | United Kingdom | D0 | |
| GB0722725D0 | United Kingdom | D0 | |
| GB0722728D0 | United Kingdom | D0 | |
| EP1662740B1 | European Patent Office (EPO) | B1 | |
| AT394003T | Austria | T | |
| ATE394003T1 | Austria | T1 | |
| EP1931097A1 | European Patent Office (EPO) | A1 | |
| DE602004013451D1 | Germany | D1 | |
| US7426240B2 | United States of America | B2 | |
| EP1662739B1 | European Patent Office (EPO) | B1 | |
| AT409383T | Austria | T | |
| ATE409383T1 | Austria | T1 | |
| ES2304757T3 | Spain | T3 | |
| DE602004016756D1 | Germany | D1 | |
| GB0818760D0 | United Kingdom | D0 | |
| GB0818909D0 | United Kingdom | D0 | |
| GB0819086D0 | United Kingdom | D0 | |
| GB0819090D0 | United Kingdom | D0 | |
| GB0819372D0 | United Kingdom | D0 | |
| GB0819374D0 | United Kingdom | D0 | |
| GB0819397D0 | United Kingdom | D0 | |
| GB0819398D0 | United Kingdom | D0 | |
| GB0819581D0 | United Kingdom | D0 | |
| GB0819583D0 | United Kingdom | D0 | |
| GB0819584D0 | United Kingdom | D0 | |
| GB0819590D0 | United Kingdom | D0 | |
| US2008298487A1 | United States of America | A1 | |
| PT1662739E | Portugal | E | |
| ES2310883T3 | Spain | T3 | |
| DK1662739T3 | Denmark | T3 | |
| PL1662739T3 | Poland | T3 | |
| US2009110091A1 | United States of America | A1 | |
| US2009110092A1 | United States of America | A1 | |
| US2009110093A1 | United States of America | A1 | |
| US2009110094A1 | United States of America | A1 | |
| US2009110095A1 | United States of America | A1 | |
| US2009110097A1 | United States of America | A1 | |
| US2009110098A1 | United States of America | A1 | |
| CN101425992A | China | A | |
| CN101425993A | China | A | |
| CN101425994A | China | A | |
| CN101425995A | China | A | |
| CN101425996A | China | A | |
| CN101425997A | China | A | |
| CN101425998A | China | A | |
| EP2056463A2 | European Patent Office (EPO) | A2 | |
| EP2056464A2 | European Patent Office (EPO) | A2 | |
| EP2056466A1 | European Patent Office (EPO) | A1 | |
| EP2056467A1 | European Patent Office (EPO) | A1 | |
| EP2056468A2 | European Patent Office (EPO) | A2 | |
| EP2056469A1 | European Patent Office (EPO) | A1 | |
| EP2056470A1 | European Patent Office (EPO) | A1 | |
| EP2056471A1 | European Patent Office (EPO) | A1 | |
| EP2056472A1 | European Patent Office (EPO) | A1 | |
| EP2056473A1 | European Patent Office (EPO) | A1 | |
| EP2056474A1 | European Patent Office (EPO) | A1 | |
| EP2056475A2 | European Patent Office (EPO) | A2 | |
| EP2056476A2This record | European Patent Office (EPO) | A2 | |
| EP2056477A1 | European Patent Office (EPO) | A1 | |
| EP2056478A1 | European Patent Office (EPO) | A1 | |
| EP2056510A2 | European Patent Office (EPO) | A2 | |
| EP2056549A2 | European Patent Office (EPO) | A2 | |
| EP2056550A2 | European Patent Office (EPO) | A2 | |
| GB2454193A | United Kingdom | A | |
| GB2454194A | United Kingdom | A | |
| GB2454195A | United Kingdom | A | |
| GB2454196A | United Kingdom | A | |
| GB2454267A | United Kingdom | A | |
| GB2454307A | United Kingdom | A | |
| GB2454308A | United Kingdom | A | |
| GB2454311A | United Kingdom | A | |
| GB2454312A | United Kingdom | A | |
| GB2454316A | United Kingdom | A | |
| GB2454317A | United Kingdom | A | |
| GB2454318A | United Kingdom | A | |
| GB2454319A | United Kingdom | A | |
| GB2454321A | United Kingdom | A | |
| GB2454322A | United Kingdom | A | |
| GB2454323A | United Kingdom | A |
68 legal events, as 10 offices reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | Office | |
|---|---|---|---|
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Opt-out of the competence of the unified patent court (upc) registeredP01 | P01 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed because of non-payment of the annual feeLapsedMM | MM | BE | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Patent ceasedCeasedPL | PL | CH | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| No opposition filedOpposition26N | 26N | EP | |
| No opposition filed within time limitOppositionORIGINAL CODE: 0009261PLBE | PLBE | EP | |
| Information on the status of an ep patent application or granted ep patentGrantedSTATUS: NO OPPOSITION FILED WITHIN TIME LIMITSTAA | STAA | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| No opposition filed against granted patent, or epo opposition proceedings concluded without decisionGrantedR097 | R097 | DE | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Deletion acc. to par. 5 (withdrawal of the translation of the ep patent)MK05 | MK05 | AT | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Definitive protectionFG2A | FG2A | ES | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Invalidated european patentMG4D | MG4D | LT | |
| Translation for ep filed (entry of ep into country)FP | FP | NL | |
| European patents granted designating irelandGrantedFG4D | FG4D | IE | |
| Dpma publication of mentioned ep patent grantGrantedR096 | R096 | DE | |
| European patent takes effect as a national patent in ch/liEP | EP | CH | |
| Reference to at number (ep patent validated in austria)REF | REF | AT | |
| Designated contracting statesAK | AK | EP | |
| European patent grantedGrantedFG4D | FG4D | GB | |
| (expected) grantORIGINAL CODE: 0009210GRAA | GRAA | EP | |
| Information on the status of an ep patent application or granted ep patentGrantedSTATUS: THE PATENT HAS BEEN GRANTEDSTAA | STAA | EP | |
| Grant fee paidORIGINAL CODE: EPIDOSNIGR3GRAS | GRAS | EP | |
| Intention to grant announcedINTG | INTG | EP | |
| Despatch of communication of intention to grant a patentORIGINAL CODE: EPIDOSNIGR1GRAP | GRAP | EP | |
| Information on the status of an ep patent application or granted ep patentGrantedSTATUS: GRANT OF PATENT IS INTENDEDSTAA | STAA | EP | |
| Party data changed (applicant data changed or rights of an application transferred)RAP1 | RAP1 | EP | |
| Designation fees paidAKX | AKX | EP | |
| First examination report despatched17Q | 17Q | EP | |
| Request for examination filed17P | 17P | EP | |
| Designated contracting statesAK | AK | EP | |
| Request for extension of the european patentAX | AX | EP | |
| Designated contracting statesAK | AK | EP | |
| Request for extension of the european patentAX | AX | EP | |
| Search report despatchedORIGINAL CODE: 0009013PUAL | PUAL | EP | |
| Public reference made under article 153(3) epc to a published international application that has entered the european phaseORIGINAL CODE: 0009012PUAI | PUAI | EP |
Numbers
- Publication
- 2056476
- Application
- 82534645
Titles3
- German
- Vorrichtung und Verfahren zur Datenverarbeitung
- English
- Data processing apparatus and method
- French
- Appareil et procédé de traitement de données
Classification
- CPC, 14
- H03M13/2742
- H03M13/27
- H04L27/2647
- H03M13/6552
- H04L1/0057
- H04L1/0071
- H04L27/2626
- H04L5/0044
- H04L27/2601
- H03M13/2739
- H03M13/2785
- H03M13/2789
- H04N7/24
- G06F7/584
- IPC, 4
- H03M13 27
- H04L27 26
- H04L1 00
- H04J11 00
Designated states38
- Contracting states, 34
- Austria
- Belgium
- Bulgaria
- Switzerland
- Cyprus
- Czechia
- Germany
- Denmark
- Estonia
- Spain
- Finland
- France
- United Kingdom
- Greece
- Croatia
- Hungary
- Ireland
- Iceland
- Italy
- Liechtenstein
- Lithuania
- Luxembourg
- Latvia
- Monaco
and 10 moreShow fewer
- Malta
- Netherlands (Kingdom of the)
- Norway
- Poland
- Portugal
- Romania
- Sweden
- Slovenia
- Slovakia
- Türkiye
- Extension states, 4
- Albania
- Bosnia and Herzegovina
- North Macedonia
- Serbia