Methods and apparatus to compute CRC for multiple code blocks in a communication system
Abstract
A method and a circuit for generating cyclic redundancy checks. The method calculates a plurality of cyclic redundancy checks for a transport block with a plurality of information bits. A transport block CRC is calculated for a transport block including a plurality of information bit. A transport block including the transport block CRC is segmented into a plurality of subsets and a plurality of cyclic redundancy checks are calculated for the plurality of subsets. At least one cyclic redundancy check among the plurality of cyclic redundancy checks is calculated based on a subset of information bits. In addition, a transport block cyclic redundancy check may be calculated based on all the information bits.
Term
1.8 yearsto projected expiry
Projected expiry 11 July 2028, counted from filing; an application has no term until it is granted.
- Priority and filed
- Published
- Today
- Projected expiry
18 claims: 7 independent, 11 dependent
- 1A method for generating Cyclic Redundancy Checks of information bits and transmitting the information bits together with the generated CRCs in a communication system, the method comprising the steps of:calculating a transport block CRC for a transport block including a plurality of information bits;segmenting a transport block including the transport block CRC into a plurality of subsets;calculating a plurality of CRCs for the plurality of subsets;and transmitting the plurality of subsets and the plurality of CRCs for the plurality of subsets.
- 13A circuit for generating cyclic redundancy checks in data communications, comprising:an input port for receiving information data;an output port for outputting the information data and cyclic redundancy checks;a linear feedback shift register unit communicatively connected between the input port and the output port, and comprising L shift registers for transforming the information data with a cyclic redundancy check generation polynomial g(x) having a degree of L-1;a cyclic redundancy check register unit communicatively connected between the input port and the linear feedback shift register unit, and comprising L cyclic redundancy check registers;a first switch communicatively connected between the input port and the cyclic redundancy check register unit;a second switch communicatively connected at a feedback loop of the linear feedback shift register unit;a third switch communicatively connected between the linear feedback shift register unit and the cyclic redundancy check register unit;a fourth switch communicatively connected between the input port, the linear feedback shift register unit and the output port, and having a first position for connecting the input port and the output port, and a second position for connecting the linear feedback shift register unit and the output port;and Controlling the first to the fourth switch to sequentially perform the first operation of initializing the linear feedback shift register unit and the cyclic redundancy check register unit to an all-zero state, the second operation of serially inputting a code block of information bits via the input port, the third operation of shifting the linear feedback shift register unit L times to obtain the cyclic redundancy checks for the code block and the fourth operation of resetting the linear feedback shift register unit to the all-zero state.
- 14A circuit for generating cyclic redundancy checks in data communications, comprising:an input port for receiving information data;an output port for outputting the information data and cyclic redundancy checks;a linear feedback shift register unit communicatively connected between the input port and the output port, and comprising L shift registers for transforming the information data with a cyclic redundancy check generation polynomial g(x) having a degree of L-1;L state registers communicatively connected to corresponding ones of the L shift registers to write and read data values to and from the L shift registers;a first switch communicatively connected between the input port and the linear feedback shift register unit;a second switch communicatively connected at a feedback loop of the linear feedback shift register unit;a third switch communicatively connected between the input port, the linear feedback shift register unit and the output port, and having a first position for connecting the input port with the output port, and a second position for connecting the linear feedback shift register unit and the output port ;and Controlling the first to the fourth switch to sequentially perform the first operation of initializing the linear feedback shift register unit and the state registers to an all-zero state, the second operation of serially inputting a code block of information bits via the input port, the third operation of writing the data values in the L shift registers in the feedback shift register unit to the respectively corresponding state registers, the fourth operation of shifting the linear feedback shift register unit L times to obtain the cyclic redundancy checks for the code block and the fifth operation of writing the data values in the state registers to the respectively corresponding shift registers in the feedback shift register unit.
- 15A circuit for generating cyclic redundancy checks in data communications, comprising:an input port for receiving information data;an output port for outputting the information data and cyclic redundancy checks;a first linear feedback shift register unit communicatively connected between the input port and the output port, and comprising L shift registers for transforming the information data with a cyclic redundancy check generation polynomial g(x) having a degree of L-1;a second linear feedback shift register unit communicatively connected between the input port and the output port being in parallel with the first linear feedback shift register unit, and comprising L shift registers for transforming the information data with a cyclic redundancy check generation polynomial g(x) having a degree of L-1;a first switch communicatively connected between the input port and a common node between the first and second linear feedback shift register units;a second switch communicatively connected at a feedback loop of the first linear feedback shift register unit;a third switch communicatively connected between the input port, the common node between the first and second linear feedback shift register units, and the output port, and having a first position for connecting the input port with the output port, a second position for connecting the first linear feedback shift register unit and the output port, and a third position for connecting the second linear feedback shift register unit and the output port;a fourth switch communicatively connected at a feedback loop of the second linear feedback shift register unit;and Controlling the first to the fourth switch to sequentially perform the first operation of initializing the first and second linear feedback shift register units to an all-zero state, the second operation of serially inputting a code block of information bits via the input port, the third operation of making a determination regarding whether the received code block is the last code block of the information data, the fourth operation of shifting the first linear feedback shift register unit L times to obtain the cyclic redundancy checks for the code block and the fifth operation of resetting the first linear feedback shift register unit to the all-zero state.
- 16A circuit for generating cyclic redundancy checks in data communications, comprising:an input port for receiving information data;an output port for outputting the information data and cyclic redundancy checks;a linear feedback shift register unit communicatively connected between the input port and the output port, and comprising L shift registers for transforming the information data with a cyclic redundancy check generation polynomial g(x) having a degree of L-1;a first switch communicatively connected between the input port and the linear feedback shift register unit;a second switch communicatively connected at a feedback loop of the linear feedback shift register unit;a third switch communicatively connected between the input port, the linear feedback shift register unit and the output port, and having a first position for connecting the input port with the output port, and a second position for connecting the linear feedback shift register unit and the output port;and Controlling the first to the fourth switch to sequentially perform the first operation of initializing the linear feedback shift register unit to an all-zero state, the second operation of serially inputting a code block of information bits via the input port, the third operation of shifting the linear feedback shift register unit L times to obtain the cyclic redundancy checks for the code block.
- 17A method for calculating cyclic redundancy check of a data packet, the method comprising the steps of:segregating the data packet into a plurality of code blocks, with each code block being represented by a polynomial established by: b i x = b i , 0 x B i - 1 + b i , 1 x B i - 2 + ⋯ + b i , B i - 2 x + b i , B i - 1 , where i is the index of the code block b i ( x ) , i = 0, 1, ..., C - 1, C is the total number of the code blocks, B i is the size of the i-th code block b i ( x );repeatedly inputting information bits of each code block into a linear feedback shift register unit comprising L shift registers, and generating a cyclic redundancy check for each code block in dependence upon an L-bit cyclic redundancy check polynomial: g x = g 0 x L + g 1 x L - 1 + ⋯ + g L - 1 x + g L , with the cyclic redundancy check p k ( x ) for a k-th code block b k ( x ) being established by: p k x = a k x ⋅ x L - q k x ⋅ g x where q k ( x ) is the quotient of a k ( x ) ·x L divided by g ( x ), a 0 ( x ) = b 0 ( x ), a k ( x ) = a k -1 ( x )· x B k + b k ( x ), B k is the size of the k-th code block b k ( x );and appending the generated cyclic redundancy checks at the end of the respective corresponding code blocks.
- 18A method for calculating cyclic redundancy check of a data packet, the method comprising the steps of:segregating the data packet into a plurality of code blocks, with each code block being represented by a polynomial established by: b i x = b i , 0 x B i - 1 + b i , 1 x B i - 2 + ⋯ + b i , B i - 2 x + b i , B i - 1 , where i is the index of the code block b i ( x ) , i = 0,1, ..., C -1, C is the total number of the code blocks, B i is the size of the i-th code block b i ( x );repeatedly inputting information bits of each code block into a first linear feedback shift register unit comprising L shift registers and a second linear feedback shift register unit comprising L shift registers, and generating a cyclic redundancy check for each code block in dependence upon an L-bit cyclic redundancy check polynomial: g x = g 0 x L + g 1 x L - 1 + ⋯ + g L - 1 x + g L , with the cyclic redundancy check p k ( x ) for a k-th code block b k ( x ) being established by: p k x = b k x ⋅ x L - q k x ⋅ g x , for k = 0 , 1 , … C - 2 , and p k x = a k x ⋅ x L - q k x ⋅ g x , for k = C - 2. where q k ( x ) is the quotient of a k ( x )· x L divided by g ( x ), a 0 ( x ) = b 0 ( x ) , a k ( x ) = a k -1 ( x )· x B k + b k ( x ), and B k is the size of the k-th code block b k ( x );and appending the generated cyclic redundancy checks at the end of the respective corresponding code blocks.
Independent claims7
117 paragraphs in 4 sections, as filed
BACKGROUND OF THE INVENTION
Field of the Invention
0001The present invention relates to methods and apparatus to generate cyclic redundancy checks to multiple code blocks.
Description of the Related Art
0002A wireless communication system generally includes multiple base stations and multiple mobile stations, while a single base station often communicates with a set of mobile stations. The transmission from a base station to a mobile station is known as downlink communication. Likewise, the transmission from a mobile station to a base station is known as uplink communication. Both base stations and mobile stations may employ multiple antennas for transmitting and receiving radio wave signals. The radio wave signal may be either Orthogonal Frequency Division Multiplexing (OFDM) signals or Code Division Multiple Access (CDMA) signals. A mobile station may be either a PDA, laptop, or handheld device.
0003In a third Generation Partnership Project long term evolution (3GPP LTE) system, when a transport block is large, the transport block is segmented into multiple code blocks so that multiple coded packets can be generated, which is advantageous because of benefits such as enabling parallel processing or pipelining implementation and flexible trade off between power consumption and hardware complexity.
0004In a contemporary High Speed Data Shared Channel (HS-DSCH) design, only one 24-bit cyclic redundancy check (CRC) is generated for the whole transport block for the purpose of error detection for that block. If multiple code blocks are generated and transmitted in one transmission time interval (TTI), the receiver may correctly decode some of the code blocks but not the others. In that case, the receiver will feed back a non-acknowledgement (NAK) to the transmitter because the CRC for the transport block will not check.
SUMMARY OF THE INVENTION
0005It is therefore an aspect of the present invention to provide improved methods and apparatus for generating cyclic redundancy checks for multiple code blocks in a communication system.
0006It is another aspect of the present invention to provide an improved method and apparatus for error detection in a communication system.
0007According to one aspect of the present invention, a method for communication is provided. A transport block CRC is calculated for a transport block including a plurality of information bit. A transport block included the transport block CRC is segmented into a plurality of subsets and a plurality of cyclic redundancy checks are calculated for the plurality of subsets.
0008The plurality of cyclic redundancy checks and the plurality of information bits are transmitted from a first node to a second node.
0009In response to the plurality of cyclic redundancy checks and the plurality of information bits received, the plurality of cyclic redundancy checks and the plurality of information bits are processed at the second node.
0010The subset of information bits may be jointly encoded by a certain type of forward error correcting code, such as a turbo code.
0011The subset of information bits and the at least one cyclic redundancy check that is calculated based on the subset of information bits may be jointly encoded.
0012A first cyclic redundancy check may be calculated for a first subset of information bits, and a second cyclic redundancy checks may be calculated for a second subset of information bits.
0013The first subset of information bits and the second subset of information bits may overlap with each other.
0014Alternatively, the first subset of information bits and the second subset of information bits may be separated from each other.
0015Still alternatively, the second subset of information bits may include the first subset of information bits.
0016At least one cyclic redundancy check among the plurality of cyclic redundancy checks may be calculated based on all of the information bits.
0017According to another aspect of the present invention, a method for communication is provided. At least one transport block of information bits are segmented into a plurality of code blocks. A plurality of code block cyclic redundancy checks are calculated for the plurality of code blocks, with at least one code block cyclic redundancy check being calculated based upon a corresponding code block. The plurality of code blocks and the plurality of code block cyclic redundancy checks are transmitted from a first node to a second node.
0018The bits in a code block selected from the plurality of code block may be jointly encoded using a certain type of forward error correcting code. In this case, a code block cyclic redundancy check is calculated based upon the jointly coded code block.
0019Each of the plurality of code block cyclic redundancy checks may be calculated based upon a corresponding one of the plurality of code blocks.
0020Each of the plurality of code block cyclic redundancy checks may be calculated based upon at least the corresponding one of the plurality of code blocks.
0021A transport block cyclic redundancy check may be calculated based on the transport block before segmenting the transport block.
0022The plurality of code blocks may include at least one code block from which no code block cyclic redundancy check is generated.
0023At least one code block cyclic redundancy check may be calculated based upon all of the plurality of code blocks.
0024According to yet another aspect of the present invention, a circuit for generating cyclic redundancy checks in data communications is provided with: an input port for receiving information data; an output port for outputting the information data and cyclic redundancy checks; a linear feedback shift register unit communicatively connected between the input port and the output port, and comprising L shift registers for transforming the information data with a cyclic redundancy check generation polynomial g(x) having a degree of L-1; a cyclic redundancy check register unit communicatively connected between the input port and the linear feedback shift register unit, and comprising L cyclic redundancy check registers; a first switch communicatively connected between the input port and the cyclic redundancy check register unit; a second switch communicatively connected at a feedback loop of the linear feedback shift register unit; a third switch communicatively connected between the linear feedback shift register unit and the cyclic redundancy check register unit; and a fourth switch communicatively connected between the input port, the linear feedback shift register unit and the output port, and having a first position for connecting the input port and the output port, and a second position for connecting the linear feedback shift register unit and the output port.
0025The linear feedback shift register unit and the cyclic redundancy check register unit may be initialized to an all-zero state. The first switch may be set to connect the input port to the linear feedback shift register unit. The second switch may be set to connect the feedback loop of the linear feedback shift register unit. The third switch may be set to disconnect the linear feedback shift register unit and the cyclic redundancy check register unit. The fourth switch may be set to the first position to connect the input port with the output port. A code block of information data may be received via the input port. The first switch may be set to disconnect the input port and the linear feedback shift register unit. The second switch may be set to disconnect the feedback loop of the linear feedback shift register unit. The third switch may be set to connect the linear feedback shift register unit and the cyclic redundancy check register unit. The fourth switch may be set to the second position to connect the linear feedback shift register unit with the output port. The linear feedback shift register unit may be shifted L times to obtain the cyclic redundancy checks for the code block.
0026According to still another aspect of the present invention, a circuit for generating cyclic redundancy checks in data communications is provided with an input port for receiving information data; an output port for outputting the information data and cyclic redundancy checks; a linear feedback shift register unit communicatively connected between the input port and the output port, and comprising L shift registers for transforming the information data with a cyclic redundancy check generation polynomial g(x) having a degree of L-1; L state registers communicatively connected to corresponding ones of the L shift registers to write and read data values to and from the L shift registers; a first switch communicatively connected between the input port and the linear feedback shift register unit; a second switch communicatively connected at a feedback loop of the linear feedback shift register unit; and a third switch communicatively connected between the input port, the linear feedback shift register unit and the output port, and having a first position for connecting the input port with the output port, and a second position for connecting the linear feedback shift register unit and the output port.
0027The linear feedback shift register unit and the state registers may be initialized to an all-zero state. The first switch may be set to connect the input port to the linear feedback shift register unit. The second switch may be set to connect the feedback loop of the linear feedback shift register unit. The third switch may be set to the first position to connect the input port with the output port. A code block of information data may be received via the input port. The data values in the L shift registers in the feedback shift register unit are written to the respectively corresponding state registers. The first switch may be set to disconnect the input port and the linear feedback shift register unit. The second switch may be set to disconnect the feedback loop of the linear feedback shift register unit. The third switch may be set to the second position to connect the linear feedback shift register unit with the output port. The linear feedback shift register unit are shifted L times to obtain the cyclic redundancy checks for the code block. Then, the first switch may be set to connect the input port to the linear feedback shift register unit; the second switch may be set to connect the feedback loop of the linear feedback shift register unit; and the third switch may be set to the first position to connect the input port with the output port. The data values in the state registers are written to the respectively corresponding shift registers in the feedback shift register unit.
0028According to still yet another aspect of the present invention, a circuit for generating cyclic redundancy checks in data communications is provided with an input port for receiving information data; an output port for outputting the information data and cyclic redundancy checks; a first linear feedback shift register unit communicatively connected between the input port and the output port, and comprising L shift registers for transforming the information data with a cyclic redundancy check generation polynomial g(x) having a degree of L-1; a second linear feedback shift register unit communicatively connected between the input port and the output port being in parallel with the first linear feedback shift register unit, and comprising L shift registers for transforming the information data with a cyclic redundancy check generation polynomial g(x) having a degree of L-1; a first switch communicatively connected between the input port and a common node between the first and second linear feedback shift register units; a second switch communicatively connected at a feedback loop of the first linear feedback shift register unit; a third switch communicatively connected between the input port, the common node between the first and second linear feedback shift register units, and the output port, and having a first position for connecting the input port with the output port, a second position for connecting the first linear feedback shift register unit and the output port, and a third position for connecting the second linear feedback shift register unit and the output port; and a fourth switch communicatively connected at a feedback loop of the second linear feedback shift register unit.
0029The first and second linear feedback shift register units and the cyclic redundancy check register unit may be initialized to an all-zero state. The first switch may be set to connect the input port to the common node between the first and second linear feedback shift register units; the second switch may be set to connect the feedback loop of the first linear feedback shift register unit; the third switch may be set to the first position to connect the input port with the output port; and the fourth switch may be set to connect the feedback loop of the second linear feedback shift register unit. A code block of information data may be received via the input port. A determination is made regarding whether the received code block is the last code block of the information data. When the received code block is not the last code block of the information data, the first switch may be set to disconnect the input port and the linear feedback shift register unit; the second switch may be set to disconnect the feedback loop of the linear feedback shift register unit; and the third switch may be set to the second position to connect the first linear feedback shift register unit with the output port. The first linear feedback shift register unit may be shifted L times to obtain the cyclic redundancy checks for the code block.
0030When the received code block of information data is the last code block of the information data, the third switch may be set to the third position to connect the second linear feedback shift register unit with the output port; and the fourth switch may be set to disconnect the feedback loop of the linear feedback shift register unit. The second linear feedback shift register unit may be shifted L times to obtain the cyclic redundancy checks for the code block,
0031According to a further aspect of the present invention, a circuit for generating cyclic redundancy checks in data communications is provided with an input port for receiving information data; an output port for outputting the information data and cyclic redundancy checks; a linear feedback shift register unit communicatively connected between the input port and the output port, and comprising L shift registers for transforming the information data with a cyclic redundancy check generation polynomial g(x) having a degree of L-1; a first switch communicatively connected between the input port and the linear feedback shift register unit; a second switch communicatively connected at a feedback loop of the linear feedback shift register unit; and a third switch communicatively connected between the input port, the linear feedback shift register unit and the output port, and having a first position for connecting the input port with the output port, and a second position for connecting the linear feedback shift register unit and the output port.
0032The linear feedback shift register unit may be initialized to an all-zero state. The first switch may be set to connect the input port to the linear feedback shift register unit; the second switch may be set to connect the feedback loop of the linear feedback shift register unit; and the third switch may be set to the first position to connect the input port with the output port. A code block of information data may be received via the input port. The first switch may be set to disconnect the input port and the linear feedback shift register unit; the second switch may be set to disconnect the feedback loop of the linear feedback shift register unit; and the third switch may be set to the second position to connect the linear feedback shift register unit with the output port. The linear feedback shift register unit may be shifted L times to obtain the cyclic redundancy checks for the code block.
BRIEF DESCRIPTION OF THE DRAWINGS
0033A more complete appreciation of the invention, and many of the attendant advantages thereof, will be readily apparent as the same becomes better understood by reference to the following detailed description when considered in conjunction with the accompanying drawings in which like reference symbols indicate the same or similar components, wherein: <ul id="ul0001" list-style="none" compact="compact"><li><figref idref="f0001">FIG. 1</figref> is an illustration of an Orthogonal Frequency Division Multiplexing (OFDM) transceiver chain suitable for the practice of the principles of the present invention;</li><li><figref idref="f0002">FIG. 2</figref> is two coordinate graphs of OFDM subcarriers showing amplitude as a function of frequency;</li><li><figref idref="f0003">FIG. 3</figref> is an illustration of the waveforms for OFDM symbols in a time domain;</li><li><figref idref="f0004">FIG. 4</figref> is an illustration of single carrier frequency division multiple access transceiver chain;</li><li><figref idref="f0005">FIG. 5</figref> schematically shows a Hybrid Automatic Repeat request (HARQ) transceiver chain;</li><li><figref idref="f0006">FIG. 6</figref> schematically shows a Multiple Input Multiple Output (MIMO) system;</li><li><figref idref="f0007">FIG. 7</figref> schematically shows a precoded MIMO system;</li><li><figref idref="f0008">FIG. 8</figref> schematically shows a coding chain for High Speed Data Shared Channel (HS-DSCH) in a High Speed Downlink Packet Access (HSDPA) system;</li><li><figref idref="f0009">FIG. 9</figref> schematically shows a transport block cyclic redundancy check (CRC) and code block segmentation;</li><li><figref idref="f0010">FIG. 10</figref> is an illustration of using a linear feedback shift register (LFSR) for CRC computation;</li><li><figref idref="f0011">FIG. 11</figref> schematically shows High Speed Data Shared Channel (HS-DSCH) hybrid ARQ functionality;</li><li><figref idref="f0012">FIG. 12</figref> schematically shows long term evolution (LTE) downlink subframe structure;</li><li><figref idref="f0013">FIG. 13</figref> schematically shows LTE uplink subframe structure;</li><li><figref idref="f0013">FIG. 14</figref> schematically shows code block CRC;</li><li><figref idref="f0014">FIG. 15</figref> illustrates an example of code block segmentation;</li><li><figref idref="f0015">FIG. 16</figref> schematically illustrates code block (CB) CRCs and transport block (TB) CRCs according to one embodiment of the principles of the present invention;</li><li><figref idref="f0016">FIG. 17</figref> schematically illustrates code block (CB) CRCs and transport block (TB) CRCs according to another embodiment of the principles of the present invention;</li><li><figref idref="f0017">FIG. 18</figref> schematically illustrates code block (CB) CRCs and transport block (TB) CRCs according to yet another embodiment of the principles of the present invention;</li><li><figref idref="f0018">FIG. 19</figref> schematically illustrates code block (CB) CRCs and transport block (TB) CRCs according to still another embodiment of the principles of the present invention;</li><li><figref idref="f0019">FIG. 20</figref> schematically illustrates code block (CB) CRCs and transport block (TB) CRCs according to a further embodiment of the principles of the present invention;</li><li><figref idref="f0020">FIG. 21</figref> schematically illustrates a CRC computation circuit for multiple code blocks constructed as an embodiment according to the principles of the present invention;</li><li><figref idref="f0021">FIG. 22</figref> schematically illustrates a CRC computation circuit for multiple code blocks constructed as another embodiment according to the principles of the present invention;</li><li><figref idref="f0022">FIG. 23</figref> schematically illustrates a CRC computation circuit for multiple code blocks constructed as still another embodiment according to the principles of the present invention; and</li><li><figref idref="f0023">FIG. 24</figref> schematically illustrates a CRC computation circuit for multiple code blocks constructed as a further embodiment according to the principles of the present invention.</li></ul>
DETAILED DESCRIPTION OF THE INVENTION
0034Orthogonal Frequency Division Multiplexing (OFDM) is a technology to multiplex data in frequency domain. Modulation symbols are carried on frequency sub-carriers. <figref idref="f0001">FIG. 1</figref> illustrates an Orthogonal Frequency Division Multiplexing (OFDM) transceiver chain. In a communication system using OFDM technology, at transmitter chain 110, control signals or data 111 is modulated by modulator 112 into a series of modulation symbols, that are subsequently serial-to-parallel converted by Serial/Parallel (S/P) converter 113. Inverse Fast Fourier Transform (IFFT) unit 114 is used to transfer the signals from frequency domain to time domain into a plurality of OFDM symbols. Cyclic prefix (CP) or zero prefix (ZP) is added to each OFDM symbol by CP insertion unit 116 to avoid or mitigate the impact due to multipath fading. Consequently, the signal is transmitted by transmitter (Tx) front end processing unit 117, such as an antenna (not shown), or alternatively, by fixed wire or cable. At receiver chain 120, assuming perfect time and frequency synchronization are achieved, the signal received by receiver (Rx) front end processing unit 121 is processed by CP removal unit 122. Fast Fourier Transform (FFT) unit 124 transfers the received signal from time domain to frequency domain for further processing.
0035In a OFDM system, each OFDM symbol consists of multiple sub-carriers. Each sub-carrier within an OFDM symbol carriers a modulation symbol. <figref idref="f0002">FIG. 2</figref> illustrates the OFDM transmission scheme using sub-carrier 1, sub-carrier 2, and sub-carrier 3. Because each OFDM symbol has finite duration in time domain, the sub-carriers overlap with each other in frequency domain. The orthogonality is, however, maintained at the sampling frequency assuming the transmitter and the receiver has perfect frequency synchronization, as shown in <figref idref="f0002">FIG. 2</figref>. In the case of frequency offset due to imperfect frequency synchronization or high mobility, the orthogonality of the sub-carriers at sampling frequencies is destroyed, resulting in inter-carrier-interference (ICI).
0036A time domain illustration of the transmitted and received OFDM symbols is shown in <figref idref="f0003">FIG. 3</figref>. As shown in <figref idref="f0003">FIG. 3</figref>,Due to multipath fading, the CP portion(CP1, CP2) of the received signal is often corrupted by the previous OFDM symbol. As long as the CP is sufficiently long, the received OFDM symbol without CP should, however, only contain its own signal convoluted by the multipath fading channel. In general, a Fast Fourier Transform (FFT) is taken at the receiver side to allow further processing frequency domain. The advantage of OFDM over other transmission schemes is its robustness to multipath fading. The multipath fading in time domain translates into frequency selective fading in frequency domain. With the cyclic prefix or zero prefix added, the inter-symbol-interference between adjacent OFDM symbols are avoided or largely alleviated. Moreover, because each modulation symbol is carried over a narrow bandwith, it experiences a single path fading. Simple equalization scheme can be used to combat frequency selection fading.
0037Single carrier frequency division multiple access (SC-FDMA), which utilizes single carrier modulation and frequency domain equalization is a technique that has similar performance and complexity as those of an OFDMA system. One advantage of SC-FDMA is that the SC-FDMA signal has lower peak-to-average power ratio (PAPR) because of its inherent single carrier structure. Low PAPR normally results in high efficiency of power amplifier, which is particularly important for mobile stations in uplink transmission. SC-FDMA is selected as the uplink multiple acess scheme in 3GPP long term evolution (LTE). An example of the transceiver chain for SC-FDMA is shown in <figref idref="f0004">FIG. 4</figref>. At the transmitter side, the data or control signal is serial to parallel (S/P) converted by a S/P converter 401. Discrete Fourier transform (DFT) will be applied to time-domain data or control signal by a DFT transmformer 402 before the time-domain data is mapped to a set of sub-carriers by a sub-carrier mapping unit 403. To ensure low PAPR, normally the DFT output in the frequency domain will be mapped to a set of contiguous sub-carriers. Then IFFT, normally with larger size than the DFT, will be applied by an IFFT transformer 404 to tranform the signal back to time domain. After parallel to serial (P/S) convertion by a P/S/ converter 405, cyclic prefix (CP) will be added by a CP insertion unit 406 to the data or the control signal before the data or the control signal is transmitted to a transmission front end processing unit 407. The processed signal with a cyclic prefix added is often referred to as a SC-FDMA block. After the signal passes through a communication channel 408, e.g., a multipath fading channel in a wireless communication system, the receiver will perform receiver front end processing by a receiver front end processing unit 409, remove the CP by a CP removal unit 410, apply FFT by a FFT transformer 412 and frequency domain equalization 413. Inverse Discrete Fourier transform (IDFT) 414 will be applied after the equalized signal is demapped in frequency domain. The output of IDFT will be passed for further time-domain processing such as demodulation and decoding after parallel to serial (P/S) converting by a P/S converter 415.
0038In packet-based wireless data communication systems, control signals transmitted through control channels, i.e., control channel transmission, generally accompany data signals transmitted through data channels, i.e., data transmission. Control channel information, including control channel format indicator (CCFI), acknowledgement signal (ACK), packet data control channel (PDCCH) signal, carries transmission format information for the data signal, such as user ID, resource assignment information, Payload size, modulation, Hybrid Automatic RepeatreQuest (HARQ) information, MIMO related information.
0039Hybrid Automatic Repeat reQuestion (HARQ) is widely used in communication systems to combat decoding failure and improve reliability. <figref idref="f0005">FIG. 5</figref> schematically shows a general Hybrid Automatic Repeat reQuestion (HARQ) transceiver chain including Encoder 501, Subpacket Generator 502, Transceiver Chain 503 and Decoder 504. Each data packet is coded using certain forward error correction (FEC) scheme. Each subpacket generated in Subpacket Generator 502 may only contains a portion of the coded bits. If the transmission for subpacket k fails, as indicated by a NAK in a feedback acknowledgement channel 505, a retransmission subpacket, subpacket k+1, is transmitted to help the receiver decode the packet. The retransmission subpackets may contain different coded bits than the previous subpackets. The receiver may softly combine or jointly decode all the received subpackets to improve the chance of decoding. Normally, a maximum number of transmissions is configured in consideration of both reliability, packet delay, and implementation complexity.
0040Multiple antenna communication systems, which is often referred to as multiple input multiple output (MIMO), are widely used in wireless communication to improve system performance. In a MIMO system shown in <figref idref="f0006">FIG. 6</figref>, the transmitter 601 has multiple antennas 602 capable of transmitting independent signals and the receiver 603 is equipped with multiple receive antennas 604. MIMO systems degenerates to single input multiple output (SIMO) if there is only one transmission antenna or if there is only one stream of data transmitted. MIMO systems degenerates to multiple input signle output (MISO) if there is only one receive antenna. MIMO systems degenerates to single input single output (SISO) if there is only one transmission antenna and one receive antenna. MIMO technology can significant increase throughput and range of the system without any increase in bandwidth or overall transmit power. In general, MIMO technology increases the spectral efficiency of a wireless communication system by exploiting the additional dimension of freedom in the space domain due to multiple antennas. There are many categories of MIMO technologies. For example, spatial multiplexing schemes increase the transmission rate by allowing multiple data streaming transmitted over multiple antennas. Transmit diversity methods such as space-time coding take advantage of spatial diversity due to multiple transmit antennas. Receiver diversity methods utilizes the spatial diversity due to multiple receive antennas. Beamforming technologies improve received signal gain and reducing interference to other users. Spatial division multiple access (SDMA) allows signal streams from or to multiple users to be transmitted over the same time-frequency resources. The receivers can separate the multiple data streams by the spatial signature of these data streams. Note these MIMO transmission techniques are not mutually exclusive. In fact, many MIMO schemes are often used in an advanced wireless systems.
0041When the channel is favorable, e.g., the mobile speed is low, it is possible to use closed-loop MIMO scheme to improve system performance. In a closed-loop MIMO systems, the receivers feedback the channel condition and/or preferred Tx MIMO processing schemes. The transmitter utlizes this feedback information, together with other considerations such as scheduling priority, data and resource availability, to jointly optimize the transmission scheme. A popular closed loop MIMO scheme is called MIMO precoding. With precoding, the transmit data streams are pre-multiplied by a matrix before being passed on to the multiple transmit antennas. As shown in <figref idref="f0007">FIG. 7</figref>, assume there are Nt transmit antennas 702 and Nr receive antennas 704. Denote the channel between the Nt transmit antennas 702 and the Nr receive antennas 704 as H. Therefore H is an Nt x Nr matrix. If the transmitter 701 has knowledge about H, the transmitter can choose the most advantageous transmission scheme according to H. For example, if maximizing throught is the goal, the precoding matrix can be chosen to be the right singluar matrix of H, if the knowledge of H is available at the transmitter. By doing so, the effective channel for the multiple data streams at the receiver side 703 can be diagonalized, eliminating the interference between the multiple data streams. However, the overhead required to feedback the exact value of H is often prohibitive. In order to reduce feedback overhead, a set of precoding matrices are defined to quantize the space of the possible values that H could substantiate. With the quantization, a receiver feeds back the preferred precoding scheme, normally in the form of the index of the preferred precoding matrix, the rank, and the indices of the preferred precoding vectors. The receiver may also feed back the associated CQI values for the preferred precoding scheme.
0042Another perspective of a MIMO system is whether the multiple data streams for transmission are encoded separately or encoded together. If all the layers for transmission are encoded together, we call it a single codeword (SCW) MIMO system.
0043In a LTE system, when a transport block is large, the transport block is segmented into multiple code blocks so that multiple coded packets can be generated, which is advantageous because of benefits such as enabling parallel processing or pipelining implementation and flexible trade off between power consumption and hardware complexity. As an example, the encoding process of the High Speed Data Shared Channel (HS-DSCH) in a High Speed Downlink Packet Access (HSDPA) system is illustrated in the <figref idref="f0008">FIG. 8</figref>. In the current HS-DSCH design, only one 24-bit cyclic redundancy check (CRC) is generated for the whole transport block for the purpose of error detection for that block. If multiple code blocks are generated and transmitted in one transmission time interval (TTI), the receiver may correctly decode some of the code blocks but not the others. In that case, the receiver will feedback a non-acknowledgement (NAK) to the transmitter because the CRC for the transport block will not check. The reference number 901 to 905 shows the relationship of transport block, transport block CRC (TB CRC), and code block segmentation in <figref idref="f0009">FIG. 9</figref>.
0044Assume we use an <i>L</i>-bit CRC polynomial to generate the code block CRC. Denote the CRC generation polynomial by <maths id="math0001" num="(1)"><math display="block"><mi>g</mi><mfenced><mi>x</mi></mfenced><mo>=</mo><msub><mi>g</mi><mn>0</mn></msub><mo></mo><msup><mi>x</mi><mi>L</mi></msup><mo>+</mo><msub><mi>g</mi><mn>1</mn></msub><mo></mo><msup><mi>x</mi><mrow><mi>L</mi><mo>-</mo><mn>1</mn></mrow></msup><mo>+</mo><mo>⋯</mo><mo>+</mo><msub><mi>g</mi><mrow><mi>L</mi><mo>-</mo><mn>1</mn></mrow></msub><mo></mo><mi>x</mi><mo>+</mo><msub><mi>g</mi><mi>L</mi></msub></math><img file="EP2015494A2_D0001.tif" /></maths>
0045In general, for a message: <maths id="math0002" num="(2)"><math display="block"><mi>m</mi><mfenced><mi>x</mi></mfenced><mo>=</mo><msub><mi>m</mi><mn>0</mn></msub><mo></mo><msup><mi>x</mi><mrow><mi>M</mi><mo>-</mo><mn>1</mn></mrow></msup><mo>+</mo><msub><mi>m</mi><mn>1</mn></msub><mo></mo><msup><mi>x</mi><mrow><mi>M</mi><mo>-</mo><mn>2</mn></mrow></msup><mo>+</mo><mo>⋯</mo><mo>+</mo><msub><mi>m</mi><mrow><mi>M</mi><mo>-</mo><mn>2</mn></mrow></msub><mo></mo><mi>x</mi><mo>+</mo><msub><mi>m</mi><mrow><mi>M</mi><mo>-</mo><mn>1</mn></mrow></msub><mo>,</mo></math><img file="EP2015494A2_D0002.tif" /></maths> the CRC encoding is performed in a systematic form. Denote the CRC parity bits of the message as <i>p</i><sub>0</sub>, <i>p</i><sub>1</sub><i>,</i> ..., <i>p</i><sub><i>L-</i>1</sub><i>,</i> which can also be represented as a polynomial of: <maths id="math0003" num="(3)"><math display="block"><mi>p</mi><mfenced><mi>x</mi></mfenced><mo>=</mo><msub><mi>p</mi><mn>0</mn></msub><mo></mo><msup><mi>x</mi><mrow><mi>L</mi><mo>-</mo><mn>1</mn></mrow></msup><mo>+</mo><msub><mi>p</mi><mn>1</mn></msub><mo></mo><msup><mi>x</mi><mrow><mi>L</mi><mo>-</mo><mn>2</mn></mrow></msup><mo>+</mo><mo>⋯</mo><mo>+</mo><msub><mi>p</mi><mrow><mi>L</mi><mo>-</mo><mn>2</mn></mrow></msub><mo></mo><mi>x</mi><mo>+</mo><msub><mi>p</mi><mrow><mi>L</mi><mo>-</mo><mn>1</mn></mrow></msub><mn>.</mn></math><img file="EP2015494A2_D0003.tif" /></maths>
0046The polynomial, <maths id="math0004" num="(4)"><math display="block"><mi>m</mi><mfenced><mi>x</mi></mfenced><mo>⋅</mo><msup><mi>x</mi><mi>L</mi></msup><mo>-</mo><mi>p</mi><mfenced><mi>x</mi></mfenced><mo>=</mo><msub><mi>m</mi><mn>0</mn></msub><mo></mo><msup><mi>x</mi><mrow><mi>M</mi><mo>+</mo><mi>L</mi><mo>-</mo><mn>1</mn></mrow></msup><mo>+</mo><msub><mi>m</mi><mn>1</mn></msub><mo></mo><msup><mi>x</mi><mrow><mi>M</mi><mo>+</mo><mi>L</mi><mo>-</mo><mn>2</mn></mrow></msup><mo>+</mo><mo>…</mo><mo>+</mo><msub><mi>m</mi><mrow><mi>M</mi><mo>-</mo><mn>2</mn></mrow></msub><mo></mo><msup><mi>x</mi><mrow><mi>L</mi><mo>+</mo><mn>1</mn></mrow></msup><mo>+</mo><msub><mi>m</mi><mrow><mi>M</mi><mo>-</mo><mn>1</mn></mrow></msub><mo></mo><msup><mi>x</mi><mi>L</mi></msup><mo>+</mo><msub><mi>p</mi><mn>0</mn></msub><mo></mo><msup><mi>x</mi><mrow><mi>L</mi><mo>-</mo><mn>1</mn></mrow></msup><mo>+</mo><msub><mi>p</mi><mn>1</mn></msub><mo></mo><msup><mi>x</mi><mrow><mi>L</mi><mo>-</mo><mn>2</mn></mrow></msup><mo>+</mo><mo>⋯</mo><mo>+</mo><msub><mi>p</mi><mrow><mi>L</mi><mo>-</mo><mn>2</mn></mrow></msub><mo></mo><mi>x</mi><mo>+</mo><msub><mi>p</mi><mrow><mi>L</mi><mo>-</mo><mn>1</mn></mrow></msub></math><img file="EP2015494A2_D0004.tif" /></maths> yields a remainder equal to 0 when divided by <i>g</i>(<i>x</i>).
0047Note that if each bit in the message is binary, the message can be represented as a polynomial defined on binary Galois field (GF(2)). In that case, the operation of '+' and '-' is the same. In other words, if the message bits are binary, the message with CRC attached can be represented by either <i>m</i>(<i>x</i>)·<i>x<sup>L</sup></i> + <i>p</i>(<i>x</i>) or <i>m</i>(<i>x</i>)·<i>x<sup>L</sup></i> - <i>p</i>(<i>x</i>)<i>.</i> In the rest of this invention, we assume the message bits are binary for the sake of convenience. The ideas disclosed in this invention may, however, certainly apply when the message bits are non-binary.
0048One reason of the popularity of CRC is because of its simplicity in implementation. CRC calculation can be easily implemented by a linear feedback shift register (LFSR). LFSR can be used as a circuit for polynomial division. As shown in <figref idref="f0010">FIG. 10</figref>, assume an L-bit CRC is used, LFSR 1000 has <i>L</i> shift registers(R<sub>0</sub>~R<sub>L-1</sub>). Switches 1001, 1003 and 1005 are initially placed at position X. The message bit <i>m</i><sub>0</sub>, <i>m</i><sub>1</sub>, ..., and <i>m</i><sub>M-1</sub> are fed into LFSR 1000 one at a time in an order of increasing index. After the last bit (<i>m</i><sub>M-1</sub>) has been fed into LFSR 1000, switches 1001, 1003 and 1005 are moved to position Y. LFSR 1000 is shifted by another L times to produce the CRC at the output of the rightmost register. Note the LFSR in <figref idref="f0009">FIG. 9</figref> is only an example. There are certainly other implementations of LFSR for polynomial division and CRC calculation.
0049The hybrid ARQ functionality matches the number of bits at the output of the channel coder to the total number of bits of the High Speed Physical Downlink Shared Channel (HS-PDSCH) set to which the High Speed Data Shared Channel (HS-DSCH) is mapped. The hybrid ARQ functionality is controlled by the redundancy version (RV) parameters. The exact set of bits at the output of the hybrid ARQ functionality depends on the number of input bits, the number of output bits, and the RV parameters. The hybrid ARQ functionality includes two rate-matching stages 1101 and 1103, and a virtual buffer 1105 as shown in <figref idref="f0011">FIG. 11</figref>. The output bits of the channel coder are segmented into systematic bits, parity bits 1 and parity bits 2 by bit separation stage 1107 and are inputted to the rate-matching stages. First rate matching stage 1101 matches the number of input bits to virtual IR buffer 1105, information about which is provided by higher layers. Note that, if the number of input bits does not exceed the virtual IR buffering capability, first rate-matching stage 1101 is transparent. Second rate matching stage 1103 matches the number of bits at the output of first rate matching stage 1101 to the number of physical channel bits available in the HS-PDSCH set in the TTI. The output bits of second rate matching stage 1103 are collected by a bit collection stage 1109 and are transmitted to a wireless network.
0050The downlink subframe structure of LTE is shown in <figref idref="f0012">FIG. 12</figref>. In a typical configuration, each subframe is 1 ms long, containing 14 OFDM symbols as shown in a vertical axis. Assume the OFDM symbols in a subframe are indexed from 0 to 13. Reference symbols (RS) for antenna 0 and 1 are located in OFDM symbols 0(1201), 4(1203), 7(1205), and 11(1207). If present, reference symbols (RS) for antennas 2 and 3 are located in OFDM symbols 1(1211) and 8(1213). The control channels, including Control Channel Format Indicator (CCFI), acknowledgement channel (ACK), packet data control channel (PDCCH), are transmitted in the first one, or two, or three OFDM symbols. The number of OFDM symbols used for control channel is indicated by CCFI. For example, the control channels can occupy the first OFDM symbol, or the first two OFDM symbols, or the first three OFDM symbols. Data channels, i.e., Physical Downlink Shared Channel (PDSCH), are transmitted in other OFDM symbols.
0051The uplink subframe structure (for data transmissions) is shown in <figref idref="f0013">FIG. 13</figref>. Note the LTE uplink is a SC-FDMA based system, which is very much like an OFDMA system with some differences. Similar to an OFDM symbol, each SC-FDMA block has a cyclic prefix (CP). For data transmissions, the reference signals (RSs) are located at the 4-th SC-FDMA block 1301 and the 11-th SC-FDMA block 1303, while the rest of the SC-FDMA blocks carrying data. Note that <figref idref="f0013">FIG. 13</figref> only shows the time-domain structure of an uplink subframe. For each individual UE, its transmission may only occupy a portion of the whole bandwidth in frequency domain. And different users and control signals are multiplexed in the frequency domain via SC-FDMA.
0052In this invention, we propose methods and apparatus to compute multiple CRCs for a transmission to improve the reliability of the transmission and reduce the transmitter and receiver complexity.
0053Aspects, features, and advantages of the invention are readily apparent from the following detailed description, simply by illustrating a number of particular embodiments and implementations, including the best mode contemplated for carrying out the invention. The invention is also capable of other and different embodiments, and its several details can be modified in various obvious respects, all without departing from the spirit and scope of the invention. Accordingly, the drawings and description are to be regarded as illustrative in nature, and not as restrictive. The invention is illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings. In the following illustrations, we use data channel in LTE systems as an example. The technique illustrated here, however, can certainly be used in other channel in LTE systems, and other data, control, or other channels in other systems whenever applicable.
0054We first illustrate the concept of transport block, code block, and code block Cyclic Redundancy Check (CRC). A portion of the encoding processing chain at the transmitter side is shown in <figref idref="f0013">FIG. 14</figref>. Multiple transport blocks in a TTI can be serially concatenated, if necessary. If the number of bits after transport concatenation is larger than Z, which is the maximum size of a code block in question, then code block segmentation is performed after the concatenation of the transport blocks. Note that in this invention, the transport blocks may or may not contain transport block CRC before the segmentation. After the code block segmentation, CRC can be generated for some, or all, of the code blocks. After the code block CRC is attached to a corresponding code block, the channel coder encodes the code block to which the CRC is attached. The hybrid ARQ functionality matches the number of bits outputted from the channel coder to the total number of bits of the High Speed Physical Downlink Shared Channel (HS-PDSCH) set to which the High Speed Data Shared Channel (HS-DSCH) is mapped. For illustration purpose, let's assume the code block CRC is generated for every code block, although the ideas disclosed in this invention certainly apply otherwise. For ease of illustration, we assume there is only one transport block. All the embodiments in this invention apply, however, to cases with multiple transport blocks and transport block concatenation. Also note that although we often use transmitter processing to illustrate the ideas of the invention, all the embodiments in this invention apply to CRC computation at both the transmitter and the receiver.
0055Denote the input bits to CRC computation by <i>a</i><sub>0</sub>, <i>a</i><sub>1</sub>, <i>..., a</i><sub><i>A</i>-1</sub><i>,</i> where <i>A</i> is the size of the transport block. We call the input bits the information bits. Again, the methods described in this invention apply regardless of whether there is one or multiple transport block or whether the transport blocks contain transport block CRC or not. Assume we use an <i>L</i>-bit CRC polynomial to generate the code block CRC. Denote the CRC generation polynomial by: <maths id="math0005" num="(5)"><math display="block"><mi>g</mi><mfenced><mi>x</mi></mfenced><mo>=</mo><msub><mi>g</mi><mn>0</mn></msub><mo></mo><msup><mi>x</mi><mi>L</mi></msup><mo>+</mo><msub><mi>g</mi><mn>1</mn></msub><mo></mo><msup><mi>x</mi><mrow><mi>L</mi><mo>-</mo><mn>1</mn></mrow></msup><mo>+</mo><mo>⋯</mo><mo>+</mo><msub><mi>g</mi><mrow><mi>L</mi><mo>-</mo><mn>1</mn></mrow></msub><mo></mo><mi>x</mi><mo>+</mo><msub><mi>g</mi><mi>L</mi></msub></math><img file="EP2015494A2_D0005.tif" /></maths>
0056The transport block can be represented by a polynomial: <maths id="math0006" num="(6)"><math display="block"><mi>a</mi><mfenced><mi>x</mi></mfenced><mo>=</mo><msub><mi>a</mi><mn>0</mn></msub><mo></mo><msup><mi>x</mi><mrow><mi>A</mi><mo>-</mo><mn>1</mn></mrow></msup><mo>+</mo><msub><mi>a</mi><mn>1</mn></msub><mo></mo><msup><mi>x</mi><mrow><mi>A</mi><mo>-</mo><mn>2</mn></mrow></msup><mo>+</mo><mo>⋯</mo><mo>+</mo><msub><mi>a</mi><mrow><mi>A</mi><mo>-</mo><mn>2</mn></mrow></msub><mo></mo><mi>x</mi><mo>+</mo><msub><mi>a</mi><mrow><mi>A</mi><mo>-</mo><mn>1</mn></mrow></msub></math><img file="EP2015494A2_D0006.tif" /></maths>
0057Assume with code block segmentation, the transport block message is segmented into <i>C</i> code blocks. Denote the bits in code block <i>i</i> by <i>b</i><sub><i>i,</i>0</sub><i>, b</i><sub><i>i,</i>1</sub>, ..., <i>b</i><sub><i>i</i>(<i>B<sub>l</sub></i>-1)</sub>, where <i>B<sub>i</sub></i> is the size of the code block <i>i, i</i> = 0, 1, ..., <i>C</i>-1. Note the polynomial representation of code block <i>i</i> is: <maths id="math0007" num="(7)"><math display="block"><msub><mi>b</mi><mi>i</mi></msub><mfenced><mi>x</mi></mfenced><mo>=</mo><msub><mi>b</mi><mrow><mi>i</mi><mo>,</mo><mn>0</mn></mrow></msub><mo></mo><msup><mi>x</mi><mrow><msub><mi>B</mi><mi>i</mi></msub><mo>-</mo><mn>1</mn></mrow></msup><mo>+</mo><msub><mi>b</mi><mrow><mi>i</mi><mo>,</mo><mn>1</mn></mrow></msub><mo></mo><msup><mi>x</mi><mrow><msub><mi>B</mi><mi>i</mi></msub><mo>-</mo><mn>2</mn></mrow></msup><mo>+</mo><mo>⋯</mo><mo>+</mo><msub><mi>b</mi><mrow><mi>i</mi><mo>,</mo><mfenced><msub><mi>B</mi><mi>i</mi></msub><mo>-</mo><mn>2</mn></mfenced></mrow></msub><mo></mo><mi>x</mi><mo>+</mo><msub><mi>b</mi><mrow><mi>i</mi><mo>,</mo><mfenced><msub><mi>B</mi><mi>i</mi></msub><mo>-</mo><mn>1</mn></mfenced></mrow></msub></math><img file="EP2015494A2_D0007.tif" /></maths>
0058Obviously, <maths id="math0008"><math display="inline"><mi>A</mi><mo>=</mo><mstyle displaystyle="true"><munderover><mo>∑</mo><mrow><mi>i</mi><mo>=</mo><mn>0</mn></mrow><mrow><mi>C</mi><mo>-</mo><mn>1</mn></mrow></munderover></mstyle><msub><mi>B</mi><mi>i</mi></msub><mn>.</mn></math><img file="EP2015494A2_D0008.tif" /></maths>
0059Without loss of generality, we further assume a natural order of mapping from the information bits in the transport block 1501 to the code blocks 1503, ... , 1505, as shown in <figref idref="f0014">FIG. 15</figref>. We define: <maths id="math0009" num="(8)"><math display="block"><msub><mi>D</mi><mi>i</mi></msub><mo>=</mo><mstyle displaystyle="true"><munderover><mo>∑</mo><mrow><mi>i</mi><mo>=</mo><mn>0</mn></mrow><mrow><mi>i</mi><mo>-</mo><mn>1</mn></mrow></munderover></mstyle><msub><mi>B</mi><mi>j</mi></msub><mo>,</mo><mspace width="1em" /><mi>for</mi><mspace width="1em" /><mi>i</mi><mo>=</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mo>…</mo><mo>,</mo><mi>C</mi><mn>.</mn></math><img file="EP2015494A2_D0009.tif" /></maths>
0060In other words, <maths id="math0010"><math display="inline"><msub><mi>D</mi><mn>0</mn></msub><mo>=</mo><mn>0</mn><mo>,</mo><mspace width="1em" /><msub><mi>D</mi><mn>1</mn></msub><mo>=</mo><msub><mi>B</mi><mn>0</mn></msub><mo>,</mo><mspace width="1em" /><msub><mi>D</mi><mn>2</mn></msub><mo>=</mo><msub><mi>B</mi><mn>0</mn></msub><mo>+</mo><msub><mi>b</mi><mn>1</mn></msub><mo>,</mo><mspace width="1em" /><mo>…</mo><mo>,</mo><mspace width="1em" /><msub><mi>D</mi><mi>C</mi></msub><mo>=</mo><mstyle displaystyle="true"><munderover><mo>∑</mo><mrow><mi>i</mi><mo>=</mo><mn>0</mn></mrow><mrow><mi>C</mi><mo>-</mo><mn>1</mn></mrow></munderover></mstyle><msub><mi>B</mi><mi>i</mi></msub><mo>=</mo><mi>A</mi><mn>.</mn></math><img file="EP2015494A2_D0010.tif" /></maths>
0061The transport block is segmented into <i>C</i> code blocks. The information bits in the <i>i</i>-th code block are as follows: <maths id="math0011" num="(9)"><math display="block"><msub><mi>b</mi><mrow><mi>i</mi><mo>,</mo><mn>0</mn></mrow></msub><mo>=</mo><msub><mi>a</mi><msub><mi>D</mi><mi>i</mi></msub></msub><mo>,</mo><mspace width="1em" /><msub><mi>b</mi><mrow><mi>i</mi><mo>,</mo><mn>1</mn></mrow></msub><mo>=</mo><msub><mi>a</mi><mrow><msub><mi>D</mi><mi>i</mi></msub><mo>+</mo><mn>1</mn></mrow></msub><mspace width="1em" /><mo>…</mo><mspace width="1em" /><msub><mi>b</mi><mrow><mi>i</mi><mo>,</mo><msub><mi>B</mi><mi>i</mi></msub></mrow></msub><mo>=</mo><msub><mi>a</mi><mrow><msub><mi>D</mi><mrow><mi>i</mi><mo>+</mo><mn>1</mn></mrow></msub><mo>-</mo><mn>1</mn></mrow></msub><mo>,</mo><mspace width="1em" /><mi>for</mi><mspace width="1em" /><mi>i</mi><mo>=</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mo>…</mo><mo>,</mo><mi>C</mi><mo>-</mo><mn>1.</mn></math><img file="EP2015494A2_D0011.tif" /></maths>
0062In this way, the relationship between the transport block and the code blocks can be established as follows, <maths id="math0012" num="(10)"><math display="block"><mi>a</mi><mfenced><mi>x</mi></mfenced><mo>=</mo><mstyle displaystyle="true"><munderover><mo>∑</mo><mrow><mi>i</mi><mo>=</mo><mn>0</mn></mrow><mrow><mi>C</mi><mo>-</mo><mn>1</mn></mrow></munderover></mstyle><mfenced open="[" close="]"><msub><mi>b</mi><mi>i</mi></msub><mfenced><mi>x</mi></mfenced><mo>⋅</mo><msup><mi>x</mi><mrow><mi>A</mi><mo>-</mo><msub><mi>D</mi><mrow><mi>i</mi><mo>+</mo><mn>1</mn></mrow></msub></mrow></msup></mfenced></math><img file="EP2015494A2_D0012.tif" /></maths>
0063We further define: <maths id="math0013" num="(11)"><math display="block"><msub><mi>a</mi><mi>k</mi></msub><mfenced><mi>x</mi></mfenced><mo>=</mo><mstyle displaystyle="true"><munderover><mo>∑</mo><mrow><mi>i</mi><mo>=</mo><mn>0</mn></mrow><mi>k</mi></munderover></mstyle><mfenced open="[" close="]"><msub><mi>b</mi><mi>i</mi></msub><mfenced><mi>x</mi></mfenced><mo>⋅</mo><msup><mi>x</mi><mrow><msub><mi>D</mi><mrow><mi>i</mi><mo>+</mo><mn>1</mn></mrow></msub><mo>-</mo><msub><mi>D</mi><mrow><mi>i</mi><mo>+</mo><mn>1</mn></mrow></msub></mrow></msup></mfenced><mo>,</mo><mspace width="1em" /><mi>for</mi><mspace width="1em" /><mi>k</mi><mo>=</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mo>…</mo><mo>,</mo><mi>C</mi><mo>-</mo><mn>1.</mn></math><img file="EP2015494A2_D0013.tif" /></maths> where <i>a<sub>k</sub></i>(<i>x</i>) is the polynomial presentation of the information bits up to the <i>k</i>-th code block, including information bits in the previous code blocks. It is easy to see that <i>a</i><sub>0</sub>(<i>x</i>) = <i>b</i><sub>0</sub>(<i>x</i>), and <i>a</i><sub><i>C-</i>1</sub>(<i>x</i>) = <i>a</i>(<i>x</i>)<i>.</i> For the sake of simplicity, in the rest of the invention, these notations are used without repeated definition.
0064In a first embodiment according to the principles of the present invention, in a transmission of a first plurality of bits with a second plurality of CRCs or in a receiving process of such a transmission, at least one CRC is computed based on a subset of bits of the first plurality of bits such that at least one bit of the first plurality of bits is not in the said subset. In an example shown in <figref idref="f0015">FIG. 16</figref>, a transport block CRC is generated from a transport block and a transport block 1601 including the transport block CRC is segmented code block 0 1603, code block 1 1605, code block 2 1607. CB0_CRC 1609 is computed based on information bits in Code Block 0 1603 but not based on information bits in Code Block 1 1605 or Code Block 2 1607. In doing so, a UE can use the CB0_CRC 1609 to check whether the information bits in Code Block 0 1603 are received correctly before finishing the receiver processing for Code Block 1 1605 and Code Block 2 1607. This feature is particularly beneficial in terms of UE complexity reduction and power saving. The code block CRC can be used for purposes such as, but not limited to, providing error detection for the corresponding code block or code blocks, early stopping of iterative turbo decoding that can achieve power saving and statistical multiplexing of decoding capacity among code blocks, detecting decoding error of one code block that can avoid unnecessary decoding of other code blocks in the event of decoding error of one code block, etc.
0065In a second embodiment according to the principles of the present invention, in a transmission of a first plurality of bits with a second plurality of CRCs or in the receiver processing of such a transmission, at least one CRC is computed based on a subset of the first plurality of bits that are jointly encoded by some type of forward error correcting code. For example, as shown in <figref idref="f0015">FIG. 16</figref>, CB0_CRC 1609 is computed based on the bits in Code Block 0 1603, a subset of all the bits in the transport block. The bits in Code Block 0 1603 are jointly encoded by some forward-error-correcting (FEC) code such as turbo code. FEC coding sometimes is also called channel coding. Note that CB0_CRC 1609 is normally also jointly encoded with information bits in Code Block 0 1603 to achieve error protection for both the information bits and the CRC bits. By synchronizing the block of information bits for CRC computation and the block of information bits for FEC channel coding, a UE can use the code block CRC during the decoding process and determining whether the corresponding code block is decoded correctly. And this process can be done separately for each code block with a code block CRC, either in a parallel or a pipeline and serial fashion.
0066In a third embodiment according to the principles of the present invention, in a transmission of a first plurality of bits with a second plurality of CRCs or in the receiver processing of such a transmission, a first CRC is computed based on a first subset of bits while a second CRC is computed based on a second subset of bits. One example is shown in <figref idref="f0015">FIG. 16</figref>. In this example, the "subset of bits" is referred to as a code block. A transport block 1601 including the transport block CRC is computed for the transport block. Then the transport block is segmented into three code blocks. A CRC is computed for each code block. CB0_CRC 1609, which is the code block CRC attached to Code Block 0 1603, is derived based on the bits in Code Block 0; CB1_CRC 1611, which is the code block CRC attached to Code Block 1 1605, is derived based on the bits in Code Block 1; CB2_CRC 1613, which is the code block CRC attached to Code Block 2 1607, is derived based on the bits in Code Block 2 including the transport block CRC. Also note that, in this example, the first subset of bits from which a first CRC is derived does not overlap with the second subset of bits from which a second CRC is derived. The subsets of bits can, however, certainly overlap without departing from the disclosure of this invention. Also note that some subsets may include all the bits in the transmission. Also note that it is not necessary to compute CRCs for all the code blocks to use this invention. Some code block may not have code block CRC. Also note that a subset can also include bits in multiple code blocks. For example, as shown in <figref idref="f0016">FIG. 17</figref>, CB0_CRC 1709 is derived based on the subset of bits that include the bits in Code Block 0 1703; CB1_CRC 1711 is derived based on the subset of bits that include both the bits in Code Block 0 1709 and the bits in Code Block 1 1705; CB2_CRC 1713 is derived based on the subset of bits that include the bits in Code Block 0 1703, the bits in Code Block 1 1705, and the bits in Code Block 2 1707.
0067In a fourth embodiment according to the principles of the present invention, in a transmission of a first plurality of bits with a second plurality of CRCs or in the receiver processing of such a transmission, the bits upon which a first CRC is derived are a subset of bits upon which a second CRC is derived. One example is shown in <figref idref="f0016">FIG. 17</figref>. For the purpose of illustration, we only show three code blocks. A transport block CRC is computed for the transport block. Then a transport block 1701 including the transport block CRC is segmented into three code blocks. A CRC is computed for each code block. CB0_CRC 1709, which is the code block CRC attached to Code Block 0 1703, is derived based on the bits in Code Block 0; CB1_CRC 1711, which is the code block CRC attached to Code Block 1 1705, is derived based on the bits in Code Block 0 and Code Block 1; CB2_CRC 1713, which is the code block CRC attached to Code Block 2 1707, is derived based on the bits in Code Block 0 1703, Code Block 1 1705, and Code Block 2 1707. By doing so, we improve the miss detection performance of these CRCs, comparing with the CRCs derived based on a single code block. We assume the transport block is <i>a</i>(<i>x</i>) = <i>a</i><sub>0</sub><i>x</i><sup><i>A-</i>1</sup> + <i>a</i><sub>1</sub><i>x</i><sup><i>A-</i>2</sup> + ··· + <i>a</i><sub><i>A-</i>2</sub><i>x</i> + <i>a</i><sub><i>A-</i>1</sub><i>,</i> where <i>A</i> is the transport block size. If transport block CRC (TB CRC) is used, the TB CRC is included in the message. As defined earlier, the transport block <i>a</i>(<i>x</i>) is segmented into <i>C</i> code blocks with code block <i>i</i> represented by <i>b<sub>i</sub></i>(<i>x</i>). We compute one CRC, namely CB0_CRC, and attach it to the first code block. The CB0_CRC can be derived from some or all of the bits in the first code block. We denote CB0_CRC by: <maths id="math0014" num="(12)"><math display="block"><msub><mi>p</mi><mn>0</mn></msub><mfenced><mi>x</mi></mfenced><mo>=</mo><msub><mi>p</mi><mrow><mn>0</mn><mo>,</mo><mn>0</mn></mrow></msub><mo></mo><msup><mi>x</mi><mrow><mi>L</mi><mo>-</mo><mn>1</mn></mrow></msup><mo>+</mo><msub><mi>p</mi><mrow><mn>0</mn><mo>,</mo><mn>1</mn></mrow></msub><mo></mo><msup><mi>x</mi><mrow><mi>L</mi><mo>-</mo><mn>2</mn></mrow></msup><mo>+</mo><mo>⋯</mo><mo>+</mo><msub><mi>p</mi><mrow><mn>0</mn><mo>,</mo><mi>L</mi><mo>-</mo><mn>2</mn></mrow></msub><mo></mo><mi>x</mi><mo>+</mo><msub><mi>p</mi><mrow><mn>0</mn><mo>,</mo><mi>L</mi><mo>-</mo><mn>1</mn></mrow></msub><mn>.</mn></math><img file="EP2015494A2_D0014.tif" /></maths>
0068One example of computing CB0_CRC is by finding the remainder of <i>b</i><sub>0</sub>(<i>x</i>)<i>·x<sup>L</sup></i> divided by the CRC generator polynomial <i>g</i>(<i>x</i>), in which <i>p</i><sub>0</sub>(<i>x</i>) can be represented as: <maths id="math0015" num="(13)"><math display="block"><msub><mi>p</mi><mn>0</mn></msub><mfenced><mi>x</mi></mfenced><mo>=</mo><msub><mi>b</mi><mn>0</mn></msub><mfenced><mi>x</mi></mfenced><mo>⋅</mo><msup><mi>x</mi><mi>L</mi></msup><mo>-</mo><msub><mi>q</mi><mn>0</mn></msub><mfenced><mi>x</mi></mfenced><mo>⋅</mo><mi>g</mi><mfenced><mi>x</mi></mfenced></math><img file="EP2015494A2_D0015.tif" /></maths> where <i>q</i><sub>0</sub>(<i>x</i>) is the quotient of <i>b</i><sub>0</sub>(<i>x</i>)<i>·x<sup>L</sup></i> divided by <i>g</i>(<i>x</i>). We compute another CRC, namely CB1_CRC, and attach it to the second code block. CB1_CRC can be derived from some or all of the bits in the first code block and some or all of the bits in the second code block. We denote CB1_CRC by: <maths id="math0016" num="(14)"><math display="block"><msub><mi>p</mi><mn>1</mn></msub><mfenced><mi>x</mi></mfenced><mo>=</mo><msub><mi>p</mi><mrow><mn>1</mn><mo>,</mo><mn>0</mn></mrow></msub><mo></mo><msup><mi>x</mi><mrow><mi>L</mi><mo>-</mo><mn>1</mn></mrow></msup><mo>+</mo><msub><mi>p</mi><mrow><mn>1</mn><mo>,</mo><mn>1</mn></mrow></msub><mo></mo><msup><mi>x</mi><mrow><mi>L</mi><mo>-</mo><mn>2</mn></mrow></msup><mo>+</mo><mo>⋯</mo><mo>+</mo><msub><mi>p</mi><mrow><mn>1</mn><mo>,</mo><mi>L</mi><mo>-</mo><mn>2</mn></mrow></msub><mo></mo><mi>x</mi><mo>+</mo><msub><mi>p</mi><mrow><mn>1</mn><mo>,</mo><mi>L</mi><mo>-</mo><mn>1</mn></mrow></msub><mn>.</mn></math><img file="EP2015494A2_D0016.tif" /></maths>
0069One example of computing CB1_CRC is by finding the remainder of <maths id="math0017"><math display="inline"><mfenced><msub><mi>b</mi><mn>0</mn></msub><mfenced><mi>x</mi></mfenced><mo>⋅</mo><msup><mi>x</mi><msub><mi>B</mi><mn>1</mn></msub></msup><mo>+</mo><msub><mi>b</mi><mn>1</mn></msub><mfenced><mi>x</mi></mfenced></mfenced><mo>⋅</mo><msup><mi>x</mi><mi>L</mi></msup></math><img file="EP2015494A2_D0017.tif" /></maths> divided by the CRC generator polynomial <i>g</i>(<i>x</i>), in which <i>p</i><sub>1</sub>(<i>x</i>) can be represented as: <maths id="math0018" num="(15)"><math display="block"><msub><mi>P</mi><mn>1</mn></msub><mfenced><mi>x</mi></mfenced><mo>=</mo><mfenced><msub><mi>b</mi><mn>0</mn></msub><mfenced><mi>x</mi></mfenced><mo>⋅</mo><msup><mi>x</mi><msub><mi>B</mi><mn>1</mn></msub></msup><mo>+</mo><msub><mi>b</mi><mn>1</mn></msub><mfenced><mi>x</mi></mfenced></mfenced><mo>⋅</mo><msup><mi>x</mi><mi>L</mi></msup><mo>-</mo><msub><mi>q</mi><mn>1</mn></msub><mfenced><mi>x</mi></mfenced><mo>⋅</mo><mi>g</mi><mfenced><mi>x</mi></mfenced><mo>,</mo></math><img file="EP2015494A2_D0018.tif" /></maths> where <i>q</i><sub>1</sub>(<i>x</i>) is the quotient of <maths id="math0019"><math display="inline"><mfenced><msub><mi>b</mi><mn>0</mn></msub><mfenced><mi>x</mi></mfenced><mo>⋅</mo><msup><mi>x</mi><msub><mi>B</mi><mn>1</mn></msub></msup><mo>+</mo><msub><mi>b</mi><mn>1</mn></msub><mfenced><mi>x</mi></mfenced></mfenced><mo>⋅</mo><msup><mi>x</mi><mi>L</mi></msup></math><img file="EP2015494A2_D0019.tif" /></maths> divided by <i>g</i>(<i>x</i>). By deriving CB1_CRC based on both the information bits in the first code block and the information bits in the second code block, we reduce the miss detection probability because CB1_CRC can be used to detect error of information bits in the first code block and the second code block.
0070Obviously, if there are more than two code blocks, we can extend the operations in similar ways. For example, the CRC attached to Code Block 2 can be derived from bits in Code Block 0, Code Block 1, and Code Block 2. Alternatively, the CRC attached to one code block does not need to be derived based on the bits from all of the previous code blocks, including the current code block. For example, the CRC attached to Code Block 2 can be derived from the bits in Code Block 1 and Code Block 2, but not the bits in Code Block 0. Note this embodiment also applies when there is no transport block CRC, as shown in <figref idref="f0017">FIG. 18</figref>. If the error detection of the CB CRC is reliably enough, TB CRC may not be needed.
0071In a fifth embodiment according to the principles of the present invention, in a transmission of a first plurality of bits with a second plurality of CRCs or in the receiver processing of such a transmission, a transport block CRC is derived from all the bits in a transport block before the code block segmentation while there is at least one subset of bits from which no code block CRC is computed. As shown in <figref idref="f0018">FIG. 19</figref>, a transport block CRC is computed based on bits in the transport block. Then the transport block 1901, including the transport block CRC, is segmented into three code blocks. In this example, CB0_CRC 1909 is computed based upon bits in Code Block 0 1903; CB1_CRC 1911 is computed based upon bits in Code Block 0 1903 and Code Block 1 1905. Because there is a transport block CRC that covers all the bits in the transport block, code block CRC for Code Block 2, however, is not necessary. The CB0_CRC 1909 can be used for stopping turbo decoding iterations for Code Block 0 1903; the CB1_CRC 1911 can be used for stopping turbo decoding iteration for Code Block 1 1905; and the TB_CRC can be used for stopping turbo decoding iteration for Code Block 2 1907. At the same time, TB_CRC provide error detection for the whole transport block. '
0072In a sixth embodiment according to the principles of the present invention, in a transmission of a first plurality of information bits with a second plurality of CRCs or in the receiver processing of such a transmission, a first CRC is derived from all the information bits while a second CRC is derived from a subset of the information bits. As shown in <figref idref="f0019">FIG. 20</figref>, no transport block CRC is computed before code block segmentation. The transport block 2001 is segmented into three code blocks. Code block CRC is computed for each of the three code blocks. CB0_CRC 2009 is derived from the bits in Code Block 0 2003; CB1_CRC 2011 is derived from the bits in Code Block 1 2005; CB2_CRC 2013 is derived from the bits in Code Block 0 2003, Code Block 1 2005, and Code Block 2 2007. The CB0_CRC 2009 can be used for stopping turbo decoding iterations or error detection for Code Block 0 2003; the CB1_CRC 2011 can be used for stopping turbo decoding iteration or error detection for Code Block 1 2005; and the CB2_CRC 2013 can be used for stopping turbo decoding iteration and error detection for Code Block 2 2007. At the same time, CB2_CRC 2013 provides error detection for the whole transport block.
0073In the following embodiments, we illustrate how linear feedback shift register (LFSR) based circuits can be used to efficiently calculate multiple CRCs for a plurality of information bits. Note that although we use the transmitter side CRC generation for illustration purpose, it is straightforward for a person of ordinary skill in the art to apply these methods to the receiver processing. For the sake of convenience, we assume the CRC calculation circuit is initialized to all-zero state. The ideas disclosed in this invention may apply, however, when the initial state of the LFSR are set to non-zero state.
0074In a seventh embodiment according to the principles of the present invention, a first plurality of CRCs for a second plurality of information bits can be computed recursively with one single CRC calculation circuit. We compute one CRC, namely CBO_CRC, and attach it to the first code block. The CB0_CRC can be derived from some or all of the bits in the first code block. We denote CB0_CRC by <maths id="math0020" num="(16)"><math display="block"><msub><mi>p</mi><mn>0</mn></msub><mfenced><mi>x</mi></mfenced><mo>=</mo><msub><mi>p</mi><mrow><mn>0</mn><mo>,</mo><mn>0</mn></mrow></msub><mo></mo><msup><mi>x</mi><mrow><mi>L</mi><mo>-</mo><mn>1</mn></mrow></msup><mo>+</mo><msub><mi>p</mi><mrow><mn>0</mn><mo>,</mo><mn>1</mn></mrow></msub><mo></mo><msup><mi>x</mi><mrow><mi>L</mi><mo>-</mo><mn>2</mn></mrow></msup><mo>+</mo><mo>⋯</mo><mo>+</mo><msub><mi>p</mi><mrow><mn>0</mn><mo>,</mo><mi>L</mi><mo>-</mo><mn>2</mn></mrow></msub><mo></mo><mi>x</mi><mo>+</mo><msub><mi>p</mi><mrow><mn>0</mn><mo>,</mo><mi>L</mi><mo>-</mo><mn>1</mn></mrow></msub><mn>.</mn></math><img file="EP2015494A2_D0020.tif" /></maths>
0075One example of computing CB0_CRC is by finding the remainder of <i>b</i><sub>0</sub>(<i>x</i>)<i>·x<sup>L</sup></i> divided by the CRC generator polynomial <i>g</i>(<i>x</i>), in which <i>p</i><sub>0</sub>(<i>x</i>) can be represented as: <maths id="math0021" num="(17)"><math display="block"><msub><mi>p</mi><mn>0</mn></msub><mfenced><mi>x</mi></mfenced><mo>=</mo><msub><mi>b</mi><mn>0</mn></msub><mfenced><mi>x</mi></mfenced><mo>⋅</mo><msup><mi>x</mi><mi>L</mi></msup><mo>-</mo><msub><mi>q</mi><mn>0</mn></msub><mfenced><mi>x</mi></mfenced><mo>⋅</mo><mi>g</mi><mfenced><mi>x</mi></mfenced></math><img file="EP2015494A2_D0021.tif" /></maths> where <i>q</i><sub>0</sub>(<i>x</i>) is the quotient of <i>b</i><sub>0</sub>(<i>x</i>)<i>·x<sup>L</sup></i> divided by <i>g</i>(<i>x</i>). We compute another CRC, namely CB1_CRC, and attach it to the second code block. CB1_CRC can be derived from the bits in the first code block and the bits in the second code block. We denote CBI_CRC by <maths id="math0022" num="18)"><math display="block"><msub><mi>p</mi><mn>1</mn></msub><mfenced><mi>x</mi></mfenced><mo>=</mo><msub><mi>p</mi><mrow><mn>1</mn><mo>,</mo><mn>0</mn></mrow></msub><mo></mo><msup><mi>x</mi><mrow><mi>L</mi><mo>-</mo><mn>1</mn></mrow></msup><mo>+</mo><msub><mi>p</mi><mrow><mn>1</mn><mo>,</mo><mn>1</mn></mrow></msub><mo></mo><msup><mi>x</mi><mrow><mi>L</mi><mo>-</mo><mn>2</mn></mrow></msup><mo>+</mo><mo>⋯</mo><mo>+</mo><msub><mi>p</mi><mrow><mn>1</mn><mo>,</mo><mi>L</mi><mo>-</mo><mn>2</mn></mrow></msub><mo></mo><mi>x</mi><mo>+</mo><msub><mi>p</mi><mrow><mn>1</mn><mo>,</mo><mi>L</mi><mo>-</mo><mn>1</mn></mrow></msub><mn>.</mn></math><img file="EP2015494A2_D0022.tif" /></maths>
0076In other words, CB1_CRC is the remainder of <maths id="math0023"><math display="inline"><mfenced><msub><mi>b</mi><mn>0</mn></msub><mfenced><mi>x</mi></mfenced><mo>⋅</mo><msup><mi>x</mi><msub><mi>B</mi><mn>1</mn></msub></msup><mo>+</mo><msub><mi>b</mi><mn>1</mn></msub><mfenced><mi>x</mi></mfenced></mfenced><mo>⋅</mo><msup><mi>x</mi><mi>L</mi></msup></math><img file="EP2015494A2_D0023.tif" /></maths> divided by the CRC generator polynomial <i>g</i>(<i>x</i>), in which <i>p</i><sub>1</sub>(<i>x</i>) can be represented as: <maths id="math0024" num="(19)"><math display="block"><msub><mi>P</mi><mn>1</mn></msub><mfenced><mi>x</mi></mfenced><mo>=</mo><mfenced><msub><mi>b</mi><mn>0</mn></msub><mfenced><mi>x</mi></mfenced><mo>⋅</mo><msup><mi>x</mi><msub><mi>B</mi><mn>1</mn></msub></msup><mo>+</mo><msub><mi>b</mi><mn>1</mn></msub><mfenced><mi>x</mi></mfenced></mfenced><mo>⋅</mo><msup><mi>x</mi><mi>L</mi></msup><mo>-</mo><msub><mi>q</mi><mn>1</mn></msub><mfenced><mi>x</mi></mfenced><mo>⋅</mo><mi>g</mi><mfenced><mi>x</mi></mfenced><mo>,</mo></math><img file="EP2015494A2_D0024.tif" /></maths> where <i>q</i><sub>1</sub>(<i>x</i>) is the quotient of <maths id="math0025"><math display="inline"><mfenced><msub><mi>b</mi><mn>0</mn></msub><mfenced><mi>x</mi></mfenced><mo>⋅</mo><msup><mi>x</mi><msub><mi>B</mi><mn>1</mn></msub></msup><mo>+</mo><msub><mi>b</mi><mn>1</mn></msub><mfenced><mi>x</mi></mfenced></mfenced><mo>⋅</mo><msup><mi>x</mi><mi>L</mi></msup></math><img file="EP2015494A2_D0025.tif" /></maths> divided by <i>g</i>(<i>x</i>)<i>.</i> By deriving CB1_CRC based on both the information bits in the first code block and the information bits in the second code block, we reduce the miss detection probability because CB1_CRC can be used to detect error in both the first code block and the second code block. Similarly, the CRC for the <i>k</i>-th code block can be computed as the remainder of <i>a<sub>k</sub></i>(<i>x</i>)·<i>x<sup>L</sup></i> divided by <i>g</i>(<i>x</i>). In other words, <maths id="math0026" num="(20)"><math display="block"><msub><mi>p</mi><mi>k</mi></msub><mfenced><mi>x</mi></mfenced><mo>=</mo><msub><mi>a</mi><mi>k</mi></msub><mfenced><mi>x</mi></mfenced><mo>⋅</mo><msup><mi>x</mi><mi>L</mi></msup><mo>-</mo><msub><mi>q</mi><mi>k</mi></msub><mfenced><mi>x</mi></mfenced><mo>⋅</mo><mi>g</mi><mfenced><mi>x</mi></mfenced></math><img file="EP2015494A2_D0026.tif" /></maths> where <i>q<sub>k</sub></i>(<i>x</i>) is the quotient of <i>a<sub>k</sub></i>(<i>x</i>)<i>·x<sup>L</sup></i> divided by <i>g</i>(<i>x</i>). Note that: <maths id="math0027" num="(21)"><math display="block"><msub><mi>a</mi><mi>k</mi></msub><mfenced><mi>x</mi></mfenced><mo>=</mo><msub><mi>a</mi><mrow><mi>k</mi><mo>-</mo><mn>1</mn></mrow></msub><mfenced><mi>x</mi></mfenced><mo>⋅</mo><msup><mi>x</mi><msub><mi>B</mi><mi>k</mi></msub></msup><mo>+</mo><msub><mi>b</mi><mi>k</mi></msub><mfenced><mi>x</mi></mfenced><mn>.</mn></math><img file="EP2015494A2_D0027.tif" /></maths>
0077This way of computing CRC lends itself well to a simple CRC calculation method. The CRC for the <i>k</i>-th code block can be represented as <maths id="math0028" num="(22)"><math display="block"><msub><mi>p</mi><mi>k</mi></msub><mfenced><mi>x</mi></mfenced><mo>=</mo><mo>⌊</mo><msub><mi>a</mi><mrow><mi>k</mi><mo>-</mo><mn>1</mn></mrow></msub><mfenced><mi>x</mi></mfenced><mo>⋅</mo><msup><mi>x</mi><mi>L</mi></msup><mo>⋅</mo><msup><mi>x</mi><msub><mi>B</mi><mi>k</mi></msub></msup><mo>+</mo><msub><mi>b</mi><mi>k</mi></msub><mfenced><mi>x</mi></mfenced><mo>⋅</mo><msup><mi>x</mi><mi>L</mi></msup><mo>⌋</mo><mo>-</mo><msub><mi>q</mi><mi>k</mi></msub><mfenced><mi>x</mi></mfenced><mo>⋅</mo><mi>g</mi><mfenced><mi>x</mi></mfenced><mo>=</mo><msub><mi>p</mi><mrow><mi>k</mi><mo>-</mo><mn>1</mn></mrow></msub><mfenced><mi>x</mi></mfenced><mo>⋅</mo><msup><mi>x</mi><msub><mi>B</mi><mi>k</mi></msub></msup><mo>+</mo><msub><mi>b</mi><mi>k</mi></msub><mfenced><mi>x</mi></mfenced><mo>⋅</mo><msup><mi>x</mi><mi>L</mi></msup><mo>+</mo><mfenced open="[" close="]"><msub><mi>q</mi><mrow><mi>k</mi><mo>-</mo><mn>1</mn></mrow></msub><mfenced><mi>x</mi></mfenced><mo>⋅</mo><msup><mi>x</mi><msub><mi>B</mi><mi>k</mi></msub></msup><mo>-</mo><msub><mi>q</mi><mi>k</mi></msub><mfenced><mi>x</mi></mfenced></mfenced><mo>⋅</mo><mi>g</mi><mfenced><mi>x</mi></mfenced></math><img file="EP2015494A2_D0028.tif" /></maths>
0078In other words, the CRC of <i>a<sub>k</sub></i>(<i>x</i>) is the same as the CRC of <i>p</i><sub><i>k-</i>1</sub>(x)<i>·x<sup>Bk</sup></i> + <i>b<sub>k</sub></i>(<i>x</i>)<i>·x<sup>L</sup>.</i>
0079One example of circuit to recursively compute the CRC <i>p<sub>i</sub></i>(<i>x</i>), <i>i</i> = 0, 1, ..., <i>C</i>-1 is shown in <figref idref="f0020">FIG. 21</figref>. As shown in <figref idref="f0020">FIG. 21</figref>, the circuit for computing the CRC is constructed with an input port 2109 for receiving information data, an output port 2111 for outputting the information data and CRC, a linear feedback shift register (LFSR) unit 2100 communicatively connected between input port 2109 and output port 2111. LFSR unit 2100 includes L shift registers 2115, L AND gates 2113 (represented by "×" surround by a circle) and L XOR gates 2117 (represented by "+" surround by a circle). A cyclic redundancy check register unit 2119 is connected between input port 2109 and LFSR unit 2100. Cyclic redundancy check register unit 2119 includes L cyclic redundancy check registers. A first switch 2101 is located between input port 2109 and cyclic redundancy check register unit 2119. First switch has a position X to connect input port 2109 and cyclic redundancy check register unit 2119, and a position Y to disconnect input port 2109 and cyclic redundancy check register unit 2119. A second switch 2103 is located at a feedback loop of LFSR unit 2100. Second switch 2103 has a position X to connect the feedback loop of LFST unit 2100, and a position Y to disconnect the feedback loop of LFST unit 2100. A third switch 2105 is located between LFST unit 2100 and cyclic redundancy check register unit 2119. Third switch 2105 has a position X to disconnect LFST unit 2100 and cyclic redundancy check register unit 2119, and a position Y to connect LFST unit 2100 and cyclic redundancy check register unit 2119. A fourth switch 2107 is located between input port 2109, LFSR unit 2100 and output port 2111. Fourth switch 2107 has a position X to connect input port 2109 and output port 2111, and a position Y to connect LFSR unit 2100 and output port 2111. The switches can be any contemporary electronic switches such as, for example, any contemporary field effect transistors (FETs). The corresponding procedure for operating the circuit shown in <figref idref="f0020">FIG. 21</figref> is outlined as follows:
0080Initialize LFSR unit 2100 to an all-zero state; Set k = 0; Initialize the CRC registers to zero; Set all switches 2101, 2103, 2105 and 2107 at position X.
0081Input <i>b<sub>k</sub></i>(<i>x</i>) into the circuit, one bit at a time. Note the LFSR is also shifted once for every bit input.
0082Change all 2101, 2103, 2105 and 2107 switches to position Y.
0083Shift LFSR unit 2100 and the CRC registers <i>L</i> times to output <i>p<sub>k</sub></i>(<i>x</i>), which is the <i>L</i>-bit CRC.
0084Reset LFSR unit 2100 to all-zero state; Change all switches to position X.
0085Increase k.
0086If <i>k</i> < <i>C</i>, go to Step 2.
0087The CRC attached to the k-th code block can be represented by Equation 20: <i>p<sub>k</sub></i>(<i>x</i>) = <i>a<sub>k</sub></i>(<i>x</i>)<i>·x<sup>L</sup></i> - <i>q<sub>k</sub></i>(<i>x</i>)·<i>g</i>(<i>x</i>). In other words, the CRC of the <i>k</i>-th code block is computed based on the information bits of the <i>k</i>-th code block and all previous code blocks. As we can see, the calculation of the code block CRCs is the same as the calculation of the transport block CRC, except that after input each code block to the circuit, the CRC should be stored and added back at some point into the CRC calculation for the next code block. In this way, separate circuits and extra computation complexity for calculating code block CRC and transport block CRC are avoided. In fact, the last code block CRC equals to a transport block CRC. This structure fits well with the pipelining structure of the multiple code blocks. In addition, the miss detection performance of the transport block is guaranteed at the minimum. Note that Equation (20) is only for the case when the k-th code block CEC is calculated based upon the information bits of the k-th code block and all previous code blocks.
0088Alternatively, another example of circuit to recursively compute the CRC <i>p<sub>i</sub></i>(<i>x</i>), <i>i</i> = 0, 1, ..., <i>C</i> -1 is shown in <figref idref="f0021">FIG. 22</figref> according to an eighth embodiment of the principles of the present invention. As shown in <figref idref="f0021">FIG. 22</figref>, the circuit is constructed with an input port 2215 for receiving information data, an output port 2217 for outputting the information data and CRC, a LFSR unit 2200 connected between input port 2215 and output port 2217. LFSR unit 2200 includes L shift registers. The circuit is further constructed with L state registers 2213 connected to corresponding ones of the L shift registers to write and read data values to and from the L shift registers. A first switch 2201 is located between input port 2215 and LFSR unit 2200. First switch 2201 has a position X to connect input port 2215 and LFSR unit 2200, and a position Y to disconnect input port 2215 and LFSR unit 2200. A second switch 2203 is located at a feedback loop of LFSR unit 2200. Second switch 2203 has a position X to connect the feedback loop of LFSR unit 2200, and a position Y to disconnect the feedback loop of LFSR unit 2200. A third switch 2205 is located between input port 2215, LFSR unit 2200 and output port 2217. Third switch 2205 has a position X for connecting input port 2215 with output port 2217, and a position Y for connecting LFSR unit 2200 and output port 2217. This circuit achieves the same CRC computation as the circuit shown in <figref idref="f0020">FIG. 21</figref>. The corresponding procedure is outlined as follows:
0089Initialize LFSR unit 2200 to all-zero state; Set k = 0; Initialize state registers 2213 to zero; Set all switches 2201, 2203 and 2205 at position X.
0090Input <i>b<sub>k</sub></i>(<i>x</i>) into the circuit via input port 2215, one bit at a time. Note the LFSR is also shifted once for every bit input.
0091Write the value of shift registers in LFSR unit 2200 to the corresponding state registers 2213; Change all switches 2201, 2203 and 2205 to position Y.
0092Shift LFSR unit 2200 <i>L</i> times to obtain <i>p<sub>k</sub></i>(<i>x</i>)<i>,</i> which is the <i>L</i>-bit CRC.
0093Change all switches 2201, 2203 and 2205 to position X; Write the value of state registers 2213 into the corresponding shift registers in LFSR unit 2200.
0094Increase K.
0095If <i>k</i> < <i>C</i>, go to Step 2.
0096Another method to compute CRCs for multiple code blocks is to use two LFSRs according to a ninth embodiment of the principles of the present invention. As shown in <figref idref="f0022">FIG. 23</figref>, the circuit is constructed with an input port 2311 for receiving information data, an output port 2313 for outputting the information data and cyclic redundancy checks, a first LFSR unit 2300 connected between input port 2311 and output port 2313, and including L shift registers, a second LFSR unit 2301 connected between input port 2311 and output port 2313, being in parallel with first FLSR unit 2300, and comprising L shift registers. A first switch 2303 is located between input port 2311 and a common node 2317 between first and second LFSR units 2300 and 2301. First switch has a position X for connecting input port 2311 with common node 2317, and a position Y for disconnecting input port 2311 with common node 2317. A second switch 2305 is located at a feedback loop of first LFSR unit 2300. Second switch 2305 has a position X for connecting the feedback loop of first LFSR unit 2300, and a position Y for disconnecting the feedback loop of first LFSR unit 2300. A third switch 2307 is located between input port 2311, common node 2317 between first and second LFSR units 2300 and 2301, and output port 2313. Third switch 2307 has a position X for connecting input port 2311 with output port 2313, a position Y for connecting first LFSR unit 2300 and output port 2313, and a position Z for connecting second LFSR unit 2301 and output port 2313. A fourth switch 2309 is located a feedback loop of second LFSR unit 2301. Fourth switch 2309 has a position X for connecting the feedback loop of second LFSR unit 2301, and a position Z for disconnecting the feedback loop of second LFSR unit 2301. This method can be outlined as follows:
0097Initialize first LFSR unit 2300 and second LFSR unit 2301 to all-zero state; Set <i>k</i> = 0; Set all switches 2303, 2305, 2307 and 2309 at position X.
0098Input <i>b<sub>k</sub></i>(<i>x</i>) into the circuit via input port 231 1, one bit at a time. Note that both first LFSR unit 2300 and second LFSR unit 2301 are also shifted once for every bit input.
0099Change first switch 2303 to position Y.
0100If <i>k</i> = <i>C-1,</i> go to Step 8; Otherwise, change switches 2305 and 2307 to position Y.
0101Shift first LFSR unit 2300 <i>L</i> times to obtain <i>p<sub>k</sub></i>(<i>x</i>)<i>,</i> which is the <i>L</i>-bit CRC for the <i>k</i>-th code block.
0102Change switches 2303, 2305 and 2307 to position X; Reset first LFSR unit 2300.
0103Increase <i>k</i>, go to Step 2.
0104Change switches 2305 and 2307 to position Z.
0105Shift second LFSR 2301 <i>L</i> times to obtain <i>p</i><sub><i>c</i>-1</sub>(<i>x</i>), which is the <i>L</i>-bit CRC for the last code block.
0106This method computes the <i>k</i>-th code block CRC only based on information bits in the <i>k</i>-th code block, except the last code block. Therefore, the <i>k</i>-th code block CRC, except the last code block CRC, can be represented by: <maths id="math0029" num="(23)"><math display="block"><msub><mi>p</mi><mi>k</mi></msub><mfenced><mi>x</mi></mfenced><mo>=</mo><msub><mi>b</mi><mi>k</mi></msub><mfenced><mi>x</mi></mfenced><mo>⋅</mo><msup><mi>x</mi><mi>L</mi></msup><mo>-</mo><msub><mi>q</mi><mi>k</mi></msub><mfenced><mi>x</mi></mfenced><mo>⋅</mo><mi>g</mi><mfenced><mi>x</mi></mfenced><mo>,</mo><mspace width="1em" /><mi>for</mi><mspace width="1em" /><mi>k</mi><mo>=</mo><mn>0</mn><mo>,</mo><mn>1</mn><mo>,</mo><mo>…</mo><mi>C</mi><mo>-</mo><mn>2</mn><mo>,</mo></math><img file="EP2015494A2_D0029.tif" /></maths> where C is the total number of code blocks. The last code block CRC is computed by LFSR2 and is derived from information bits in all the code blocks. Therefore, the last code block CRC can be represented by: <maths id="math0030" num="(24)"><math display="block"><msub><mi>p</mi><mi>k</mi></msub><mfenced><mi>x</mi></mfenced><mo>=</mo><msub><mi>a</mi><mi>k</mi></msub><mfenced><mi>x</mi></mfenced><mo>⋅</mo><msup><mi>x</mi><mi>L</mi></msup><mo>-</mo><msub><mi>q</mi><mi>k</mi></msub><mfenced><mi>x</mi></mfenced><mo>⋅</mo><mi>g</mi><mfenced><mi>x</mi></mfenced><mo>,</mo><mspace width="1em" /><mi>for</mi><mspace width="1em" /><mi>k</mi><mo>=</mo><mi>C</mi><mo>-</mo><mn>1.</mn></math><img file="EP2015494A2_D0030.tif" /></maths>
0107Another method is to insert <i>L</i> 0's at the bit positions for all code block CRCs to the message <i>a</i>(<i>x</i>) before input <i>a</i>(<i>x</i>) to the CRC calculation circuit according to a tenth embodiment of the principles of the present invention. An example of this implementation is illustrated in <figref idref="f0023">FIG. 24</figref>. The circuit is constructed with an input port 2407 for receiving information data, an output port 2409 for outputting the information data and CRCs, and a LFSR unit 2400 connected between input port 2407 and output port 2409, and including L shift registers for transforming the information data with a cyclic redundancy check generation polynomial g(x) having a degree of L-1. A first switch 2401 is located between input port 2407 and LFSR unit 2400. First switch 2401 has a position X for connecting input port 2407 and LFSR unit 2400, and a position Y for disconnecting input port 2407 and LFSR unit 2400. A second switch 2403 is located at a feedback loop of LFSR unit 2400. Second switch 2403 has a position X for connecting the feedback loop of LFSR unit 2400, and a position Y for disconnection the feedback loop of LFSR unit 2400. A third switch 2405 is located between input port 2407, LFSR unit 2400 and output port 2409. Third switch 2405 has a position X for connecting input port 2407 with output port 2409, and a position Y for connecting LFSR unit 2400 and output port 2409. Note that the L 0's is added implicitly by changing the switches' position from X to Y for L shifts. Essentially, in this case, we allow the initial state of the LFSR to be dependant on the previous code blocks and thus enabling the current CRC to protect the bits in the current code block and previous code blocks. This method can be outlined as follows:
0108Initialize LFSR unit 2400 to all-zero state; Set <i>k</i> = 0; Set all switches 2401, 2403 and 2405 at position X.
0109Input <i>b<sub>k</sub></i>(<i>x</i>) into the circuit via input port 2407, one bit at a time. Note the LFSR is also shifted once for every bit input.
0110Change all switches 2401, 2403 and 2405 to position Y.
0111Shift LFSR unit 2400 <i>L</i> times to obtain <i>p<sub>k</sub></i>(<i>x</i>)<i>,</i> which is the <i>L</i>-bit CRC for the <i>k</i>-th code block.
0112Change all switches to position X.
0113Increase <i>k</i>.
0114If <i>k</i> < <i>C</i>, go to Step 2.
0115While the invention has been shown and described in connection with the preferred embodiments, it will be apparent to those skilled in the art that modifications and variations can be made without departing from the spirit and scope of the invention as defined by the appended claims.
Contents4
61 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 Sheet 34 Sheet 35 Sheet 36 Sheet 37 Sheet 38 Sheet 39 Sheet 40 Sheet 41 Sheet 42 Sheet 43 Sheet 44 Sheet 45 Sheet 46 Sheet 47 Sheet 48 Sheet 49 Sheet 50 Sheet 51 Sheet 52 Sheet 53 Sheet 54 Sheet 55 Sheet 56 Sheet 57 Sheet 58 Sheet 59 Sheet 60 Sheet 61
Every citation, both ways
| Document | Relation | Office | Cited during |
|---|---|---|---|
| EP1011201A2 | Cites | European Patent Office (EPO) | Search report |
| EP1548989A2 | Cites | European Patent Office (EPO) | Search report |
| EP1624605A1 | Cites | European Patent Office (EPO) | Search report |
| US2004193993A1 | Cites | United States of America | Search report |
| GB2409384A | Cites | United Kingdom | Search report |
| WO9944341A1 | Cites | World Intellectual Property Organization (WIPO) | Search report |
31 members in 9 offices
Members31
| Document | Office | Kind | |
|---|---|---|---|
| EP2015494A2This record | European Patent Office (EPO) | A2 | |
| AU2008273136A1 | Australia | A1 | |
| CA2692719A1 | Canada | A1 | |
| KR20090006795A | Republic of Korea | A | |
| US2009019337A1 | United States of America | A1 | |
| WO2009008682A1 | World Intellectual Property Organization (WIPO) | A1 | |
| CN101689864A | China | A | |
| JP2010531613A | Japan | A | |
| AU2008273136B2 | Australia | B2 | |
| RU2010100829A | Russian Federation | A | |
| RU2435297C2 | Russian Federation | C2 | |
| JP2012100361A | Japan | A | |
| US8255761B1 | United States of America | B1 | |
| US2012240015A1 | United States of America | A1 | |
| US8386878B2 | United States of America | B2 | |
| US2013061118A1 | United States of America | A1 | |
| EP2015494A3 | European Patent Office (EPO) | A3 | |
| CN101689864B | China | B | |
| CN103795496A | China | A | |
| CN103795497A | China | A | |
| JP5503674B2 | Japan | B2 | |
| JP2014112961A | Japan | A | |
| US8862958B2 | United States of America | B2 | |
| JP5796099B2 | Japan | B2 | |
| JP2016007042A | Japan | A | |
| KR101606503B1 | Republic of Korea | B1 | |
| JP5940722B2 | Japan | B2 | |
| CA2692719C | Canada | C | |
| CN103795497B | China | B | |
| CN103795496B | China | B | |
| EP2015494B1 | European Patent Office (EPO) | B1 |
76 legal events, as 9 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 | |
| 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 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 | |
| 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 | |
| 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 | |
| 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 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 | |
| Invalidation of extension of european patentsMG9D | MG9D | LT | |
| Translation for ep filed (entry of ep into country)FP | FP | NL | |
| Reference to at number (ep patent validated in austria)REF | REF | AT | |
| Dpma publication of mentioned ep patent grantGrantedR096 | R096 | DE | |
| European patents granted designating irelandGrantedFG4D | FG4D | IE | |
| 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 | |
| Intention to grant announced (deleted)INTC | INTC | EP | |
| Information related to disapproval of communication of intention to grant by the applicant or resumption of examination proceedings by the epo deletedORIGINAL CODE: EPIDOSDIGR1GRAJ | GRAJ | EP | |
| Information on the status of an ep patent application or granted ep patentGrantedSTATUS: EXAMINATION IS IN PROGRESSSTAA | STAA | 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 | |
| Information on the status of an ep patent application or granted ep patentGrantedSTATUS: EXAMINATION IS IN PROGRESSSTAA | STAA | EP | |
| First examination report despatched17Q | 17Q | EP | |
| Designation fees paidAKX | AKX | EP | |
| Designated contracting statesAK | AK | EP | |
| Request for extension of the european patentAX | AX | EP | |
| Information provided on ipc code assigned before grantRIC1 | RIC1 | EP | |
| Information provided on ipc code assigned before grantRIC1 | RIC1 | EP | |
| Search report despatchedORIGINAL CODE: 0009013PUAL | PUAL | EP | |
| Information provided on ipc code assigned before grantRIC1 | RIC1 | EP | |
| Party data changed (applicant data changed or rights of an application transferred)RAP1 | RAP1 | EP | |
| Request for examination filed17P | 17P | EP | |
| Designated contracting statesAK | AK | EP | |
| Request for extension of the european patentAX | AX | 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
- 2015494
- Application
- 80126261
Titles3
- German
- Verfahren und Vorrichtung zur CRC-Berechnung für mehrere Kodeblöcke in einem Kommunikationssystem
- English
- Methods and apparatus to compute CRC for multiple code blocks in a communication system
- French
- Procédés et appareil pour calculer le CRC pour plusieurs blocs de signaux dans un système de communication
Classification
- CPC, 11
- H04L1/004
- H03M13/09
- H03M13/2906
- H03M13/2966
- H03M13/6306
- H03M13/6525
- H03M13/6561
- H04L1/0041
- H04L1/0061
- H04L1/0075
- H03M13/091
- IPC, 2
- H04L1 00
- H03M13 09
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