WO2010125355A1 - Systems and methods for communications - Google Patents
Systems and methods for communications Download PDFInfo
- Publication number
- WO2010125355A1 WO2010125355A1 PCT/GB2010/000867 GB2010000867W WO2010125355A1 WO 2010125355 A1 WO2010125355 A1 WO 2010125355A1 GB 2010000867 W GB2010000867 W GB 2010000867W WO 2010125355 A1 WO2010125355 A1 WO 2010125355A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- decoding
- decoder
- optimal
- sub
- applying
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/29—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
- H03M13/2957—Turbo codes and decoding
- H03M13/2975—Judging correct decoding, e.g. iteration stopping criteria
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/61—Aspects and characteristics of methods and arrangements for error correction or error detection, not provided for otherwise
- H03M13/612—Aspects specific to channel or signal-to-noise ratio estimation
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/63—Joint error correction and other techniques
- H03M13/6337—Error control coding in combination with channel estimation
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/65—Purpose and implementation aspects
- H03M13/6502—Reduction of hardware complexity or efficient processing
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/65—Purpose and implementation aspects
- H03M13/6508—Flexibility, adaptability, parametrability and configurability of the implementation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0045—Arrangements at the receiver end
- H04L1/0054—Maximum-likelihood or sequential decoding, e.g. Viterbi, Fano, ZJ algorithms
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/29—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes combining two or more codes or code structures, e.g. product codes, generalised product codes, concatenated codes, inner and outer codes
Definitions
- the present subject matter relates to techniques and equipment for communications systems. In more detail, it relates to techniques and equipment for decoding data.
- Serial concatenated decoding typically involves two decoders connected in series.
- the first decoder is typically called the inner decoder and the second decoder is called the outer decoder.
- Serial concatenated decoding lends itself to many uses. One example is recovering information bits from a code word.
- the digital video broadcast terrestrial standard uses serial concatenated encoding at the transmitter.
- the transmitter includes a non-binary block code (e.g., a Reed-Solomon (RS) code) followed by a punctured convolution code (often referred to as forward error correction).
- RS Reed-Solomon
- the receiver uses serial concatenated decoding.
- a typical implementation uses a Viterbi decoder as the inner decoder and a Reed-Solomon decoder as the outer decoder.
- a set-box or television includes the receiver functionality.
- manufactures are developing integrated circuits that can transform a personal computer into a dvb-t receiver.
- a consumer can purchase a USB attachable receiver that allows the consumer to receive and view terrestrial broadcasts on their personal computer.
- the processor of the personal computer is often leveraged to provide certain receiver functionality.
- the processor of the personal computer can be used to provide some or all of the decoding operations.
- the availability of the processor of the personal computer for performing other tasks is adversely impacted. Summary
- the present disclosure is directed to a system, method, and article of manufacture for performing serial concatenated decoding.
- Using a sub-optimal inner decoder reduces the processing load experienced by the processing element when compared to performing optimal inner decoding.
- the processor can perform additional tasks that may not be related to decoding.
- the disclosure is directed to a method of performing serial concatenated decoding having inner decoding and outer decoding.
- the method includes monitoring a measure of the number of corrections made to a plurality data blocks during outer decoding and determining whether applying sub-optimal inner decoding would reduce a computational load experienced by a processor performing the serial concatenated decoding when compared to the computation load experienced by the processor when optimal inner decoding is applied.
- the method also includes applying, by the processor, sub-optimal inner decoding on data being serially concatenated decoded when the determination indicates that the processing load experienced is reduced.
- the method can also include temporarily applying optimal inner decoding to a portion of the data blocks previously decoded with the sub-optimal decoding. This redecoding occurs in response to an indication that an output of the outer decoding contains an error.
- the method can also include monitoring the byte error rate of an output of the inner decoding. Deinterleaving the output of the inner decoder can also be included in the method.
- the outer decoder is a Reed-Solomon decoder implementing a Reed-Solomon decoding algorithm.
- Various optimal and sub-optimal inner decoding pairs can be implemented as part of the system and methods.
- the optimal inner decoding can include applying a sixty-four state Viterbi decoding while the sub-optimal inner decoding can include applying a thirty-two state Viterbi decoding.
- Another example includes an optimal inner decoding that applies log-MAP turbo decoding algorithm while the sub- optimal inner decoding includes applying a max-log-MAP turbo decoding algorithm.
- Yet another example includes having sub-optimal inner decoding that applying a LDPC decoding with a reduced number of iterations when compared to the number of iterations of optimal LDPC inner decoding
- the disclosure is directed to a system for performing serial concatenated decoding.
- the system includes a selector, an optimal inner decoder, a sub- optimal inner decoder, and an outer decoder.
- the selector has an input and a plurality of outputs.
- the optimal inner decoder has an output and an input in communication with a first selector output.
- the sub-optimal inner decoder has an output and an input in communication with a second selector output.
- the outer decoder is in communication with the output of each of the optimal inner decoder and sub-optimal inner decoder.
- the outer decoder has an output in communication with the selector that determines whether the optimal inner decoder or sub- optimal inner decoder receives data for decoding based on monitoring a measure of the number of corrections made to a plurality of blocks of data during operation of the outer decoder.
- the apparatus, system, and method of the present disclosure can be used to decode many types of signals and data. For example, audio signals can be decoded. Also, video signals can be decoded.
- a decoder includes a processor (e.g., located in a set-top box) and associated software being executed by the software.
- the processor is located in cellular telephone and that the associated software is executed by the telephone.
- radios can include a processor that executes the associated software.
- a software product in accord with this concept, includes at least one machine readable medium and information carried by the medium. The information carried by the medium may be executable program code.
- the disclosure relates to an article of manufacture.
- the article includes a machine readable storage medium and executable program instructions embodied in the machine readable storage medium that when executed by a programmable system causes the system to perform functions of serial concatenated decoding having inner decoding and outer decoding.
- the functions include monitoring a measure of the number of corrections made to a plurality data blocks during outer decoding and determining whether applying sub-optimal inner decoding would reduce a computational load experienced by a processor of the programmable system performing the serial concatenated decoding when compared to the computation load experienced by the processor when optimal inner decoding is applied.
- the functions also include applying, by the processor, sub-optimal inner decoding on data being serially concatenated decoded when the determination indicates that the processing load experienced is reduced.
- a control function uses RS output to decide whether the suboptimal inner decoder has failed and if yes, triggers a re-decoding by the optimal inner decoder.
- the control function may also determine which inner decoder is expected to result in a lower load in subsequent blocks. Such determination may be based for example on a statistical analysis done on the RS decoding results. If the optimal decoder is deemed to have a lower load under current channel conditions the suboptimal decoder won't be used in subsequent blocks until a future RS analysis concludes that channel conditions tend towards the use of the suboptimal decoder.
- the suboptimal inner decoder is not a sub-part of the optimal one and the two don't share information.
- the RS decoder in exemplary systems does not assist the decoding of the inner decoder. It is used as decoding verification in the suboptimal mode as well as for determination which decoder to run on the next block.
- FIG. I is a functional block diagram of an embodiment of a system for performing serial concatenated decoding.
- FIG. 2 is a flow chart depicting an embodiment of a method for performing serial concatenated decoding.
- FIG. 3 is a graph depicting the relationship between byte error rate (ByER) measurements for optimal and sub-optimal inner decoders.
- FIG. 4 is a graph depicting the computational cost for sub-optimal and optimal decoding versus ByER for optimal decoding.
- FIG. 5 is a graph depicting the computational cost for sub-optimal and optimal decoding versus ByER for sub-optimal decoding.
- FIG. 6 is a simplified functional block diagram of a computer that may be configured as a host or server.
- FIG. 7 is a simplified functional block diagram of a personal computer or other work station or terminal device.
- serial concatenated decoding described herein reduces, in some instances, the processing load experience by a processor when compared to other serial concatenated decoding systems. This reduction in load frees the processing resources to perform other tasks while decoding data.
- FIG. 1 depicts an embodiment of a system 10 for performing serial concatenated decoding.
- the system 10 includes a buffer 14, a selector 18, an optimal inner decoder 22, a sub-optimal inner decoder 26, a deinterleaver 30, and an outer decoder 34.
- the buffer 14 is in communication with a demodulator (not shown) and the selector 18.
- the buffer 14 is in essence memory that stores blocks of data received from the demodulator.
- the data blocks represent the received signals of television broadcast in one example.
- the buffer 14 can be located within the memory of the computing device (e.g., personal computer) as shown in FIG. 6 and FIG. 7 that is performing the decoding.
- the buffer 14 can be random access memory (RAM) and the like.
- the storage size of the buffer 14 is selected, in one example, to be equal to the sum of the delays (expressed in terms of decoding blocks) for deinterleaver 30 and inner decoder 22, 26.
- the buffer 14 can be larger or smaller depending on the application.
- the delay for the inner decoders 22, 26 is one data block. Storing the data blocks for a period of time allows for redecoding of certain data blocks as required. For example, if sub-optimal inner decoding is originally applied to a number of data blocks, it is possible that the output of the outer decoder will indicate an error. In such a case, all or some of the data blocks that were previously decoded using sub-optimal inner decoder 26 are retrieved from the buffer 14 and redecoded using the optimal inner decoder 22. Further details of redecoding are described below.
- the selector 18 is in communication with the buffer 14 and both the optimal inner decoder 22 and the sub-optimal inner decoder 26.
- the selector 18 provides a mechanism to select either optimal inner decoding be applied to the data blocks received from the buffer 14 or sub-optimal inner decoding be applied to the data blocks received from the buffer 14.
- the selector 18 operates as a switch to connect one of the inner decoders 22, 26 with the buffer 14.
- the selector 18 can take many forms including a flag in a software routine or a physical electronic circuit (e.g., a transistor or diode). Although the selector 18 is shown as having two states position 0 or position 1 , it should be understand that more states are possible depending on the number of inner decoders that are present.
- the optimal inner decoder 22 is in communication with the selector 18 and the deinterleaver 30.
- the connection to the selector 18 can be established periodically. Said another way, the connection to the selector 18 can be temporarily applied and removed as required. Further details of this operation are discussed below.
- optimal refers to decoding that places a greater load on the processing when compared to the sub-optimal inner decoder 26.
- optical as a modifier in no way connotes an absolute measure of perfection. It is merely used to indicate a degree of separation between the inner decoders.
- the optimal inner decoder 22 is a Viterbi decoder.
- the Viterbi decoder has a number of states (e.g., sixty-four).
- the optimal inner decoder 22 applies, in this example, a Viterbi decoding algorithm to the blocks of data received from the buffer 14.
- the optimal inner decoder 22 can be Low Density Parity
- LDPC LDPC Check
- the optimal inner decoder 22 can implement any of a number decoding algorithms. Examples include, but are not limited to, the belief propagation algorithm, the message passing algorithm and the sum-product algorithm. LDPC codes are also referred to as Gallagher codes.
- the optimal inner decoder 22 is a turbo code decoder.
- the optimal inner decoder 22 implements a log-MAP turbo decoding algorithm. Of course other known turbo code decoding algorithms can be used.
- the sub-optimal inner decoder 26 is in communication with the selector 18 and the deinterleaver 30. The connection to the selector 18 can be established periodically. Said another way, the connection to the selector 18 can be temporarily applied and removed as required. Further details of this operation are discussed below.
- sub-optimal refers to decoding that reduces that load on the processing when compared to the optimal inner decoder 22. The use of "sub-optimal" as a modifier in no way connotes an absolute measure.
- the sub-optimal inner decoder 26 is implemented in hardware. In other applications, the sub-optimal inner decoder 26 is implemented in software. Also, combinations of software and hardware can be used.
- the sub-optimal inner decoder 26 is selected as a compliment to the optimal inner decoder 22. For example, if a sixty-four state Viterbi decoder is the optimal decoder 22 the sub-optimal inner decoder 26 is a Viterbi decoder having fewer states (e.g., thirty-two). In another example, if the optimal inner decoder 22 is a thirty-two state Viterbi decoder the sub-optimal inner decoder 26 can have sixteen states. In another example, a LDPC decoding algorithm having a reduced number of decoding iterations when compared to the optimal decoder 26 is used.
- the sub-optimal inner decoder 26 can execute a max-log- MAP turbo decoding algorithm when the optimal inner decoder 22 is implementing a log-MAP turbo code decoding algorithm.
- various combinations of the optimal inner decoders 22 and sub-optimal inner decoders 26 can be used provided the sub-optimal inner decoder reduces the processing load experienced by the processor performing the decoding.
- the deinterleaver 30 is in communication with the optimal inner decoder 22 and the sub-optimal inner decoder 26. The deinterleaver 30 receives the inner-decoded data and randomizes the error pattern within the inner-decoded data. In some applications, the inner decoders 22, 26 operate on produce as output bits of data.
- the bits are converted to bytes prior to being operating on by the deinterleaver 30.
- the deinterleaver 30 is a convolutional deinterleaver have a delay of more than one decoding block.
- the outer decoder 34 is in communication with the deinterleaver 30.
- the outer decoder 34 is assumed to be able to correct a up to a specific number "B " of bytes. Said another way, the outer decoder 34 can accept an input having a maximum number of byte errors and successfully correct those errors. If the input to the outer decoder includes more than B errors, the output of the outer decoder 34 indicates a decoding failure.
- the outer decoder 34 is a Reed-Solomon (RS) decoder.
- the outer decoder 34 also indicates the number of corrections that it makes to the inner-decoded data. This measure of the number of corrections is used to determine whether optimal inner decoding or sub-optimal inner coding can be used by the system 10 without affecting the overall error performance of the system 10.
- Other decoders can be used as the outer decoder 34 provide it indicates, at a very high reliability, whether decoding failed or not.
- the output of the outer decoder 34 is decoded data.
- One goal of the system 10 is to obtain identical error performance within a device employing the optimal inner-decoder, however, when channel conditions allow the sub- optimal inner decoder is employed at a lower computational load. This can be achieved by monitoring the error statistics and accurately predicting in both modes of operations (i.e., optimal and sub-optimal) whether the other mode offers a lower computational load experienced by the processor. Fast switching between modes can respond to varying channel conditions. Thus, in either mode output error performance is substantially uncompromised.
- the above-described system 10 provides serial concatenated decoding of data blocks. As shown, the system can provide two modes of operation. The first mode is referred to as sub-optimal mode. And the second mode is referred to as the optimal mode. In optimal mode, the selector 18 remains in position 0 thus establishing a communications path that includes the buffer 14, the optimal inner decoder 22, the deinterleaver 30, and the outer decoder 34.
- the selector 18 In the sub-optimal mode, the selector 18 is usually in position 1; however, it switches to position 0 when re-decoding is activated as a result of an outer decoder 34 failure.
- a communications path is established between the buffer 14, the sub-optimal inner decoder 26, the deinterleaver 30 and outer decoder 34.
- the selector 18 temporarily transitions to position 0 to "switch in" the optimal inner decoder 22. This enables certain data blocks to be redecoded. After the certain data blocks are redecoded, the selector returns to position 1 and the sub-optimal inner decoder 26 is switched back into the processing path.
- the method 200 includes monitoring (step 210) a number of correction made by the outer decoder 34, determining (step 220) whether sub-optimal inner coding is acceptable, and applying (step 230) sub-optimal inner coding.
- the method also includes detecting (step 240) an error (e.g., a failure to decode) at the output of the outer decoder 34 and redecoding (step 250) a portion of the previously decoded data using optimal inner decoding.
- an error e.g., a failure to decode
- selector 18 begins in position 0 when decoding begins. After certain period of time, a measurement is taken based on the output of outer decoder 34 and a decision as to whether the selector should transition to position 1 is made. For example, if the corrected number of errors by outer decoder 34 during a period of time is less than a threshold, switch position can be changed to 1.
- sub-optimal inner decoder 26 can handle the decoding at a lower computation load when compared to the optimal inner decoder 22. Using the sub-optimal inner decoder 26 typically does not have an adverse affect on the output of the outer decoder 34. This is because the outer decoder can correct up to B errors.
- monitoring (step 210) the number of corrections made by the outer decoder 34 includes determining the byte error rate (ByER) measured at the input to the outer decoder 34.
- ByER byte error rate
- the outer decoder 34 can correct up to B bytes. If there are more than B byte errors at the input of outer decoder 34, the outer decoder would indicate a decoding failure. If decoding is successful, a number of corrected bytes is produced by outer decoder 34.
- the byte error rate (ByER) is estimated by monitoring the RS decoder feedback during the decoding of N blocks of data. Equation 1 depicts a measure of the ByER.
- N t denotes number of bytes in a decoding block after deinterleaver 30, and N/ denotes the number of failed decoding blocks. Also, b denotes the number of corrected bytes during the period.
- determining (step 220) whether sub-optimal inner coding is acceptable includes using the measured ByER to compute the computation cost (e.g., the load experienced by the processor of the computing element) associated with operating in that mode.
- the computational cost estimate is computed using a predetermined relationship between the byte error rates in each mode.
- FIG. 3 a relationship between ByER sw0 and ByER sw i is shown and described. As shown, the relationship between ByER sw o and ByER sw i is modulation and code-rate dependent. FIG. 3 shows this relation for modulation of 64QAM and an inner code- rate of 3/4. FIG. 3 is a plot of ByER sw i in sub-optimal mode versus ByER sw0 in optimal mode. The result relate to a simulations for different channels and the results are shown as markers "*" in FIG. 3. The solid line represents best fit 6th order polynomial g(ByER). Of course, other modulation and code-rate combinations result in other polynomials.
- a computational cost estimate "C” can be used to determine whether to operate in sub-optimal mode.
- the following equations describe one example of how to compute the computational cost for optimal mode C° and sub-optimal mode Cf°.
- a subscript of id refers to inner decoding.
- C o d(b) refers to the computational cost for outer decoder for b number of corrected byte errors.
- Cdemt denotes the computational cost of the deinterleaver 30.
- FIG. 4 presents the computational cost in sub-optimal mode, denoted by Cf°, and optimal mode, denoted by C°, versus byte error rate in optimal mode
- ByER sw o- FIG. 4 can be generated by calculating ByER 5W i from ByER sw0 using the polynomial P(ByER), and C? 0 is calculated from ByER sw i.
- FIG. 5 depicts (f° and C° versus ByER sw i. In both FIG. 4 and FIG. 5, the costs are normalized to Cr.
- the system 10 After determining that sub-optimal inner decoding is acceptable, the system 10 applies sub-optimal inner decoding to data received from the buffer 14.
- sub-optimal inner decoding For example, assume switch is in position 0 when the system 10 begin decoding. After a certain period of time, a measurement is taken based on the output of outer decoder 34 and a decision whether to transition the selector 18 position 1 is given. For example, if the corrected number of errors by outer decoder 34 during a period of time is less than a threshold, switch position can be changed to 1.
- the selector 18 is transitioned and sub-optimal inner decoding is applied to subsequent data.
- the method 200 also includes detecting (step 240) any errors at the output of the outer decoder 34.
- An error at the output of the outer decoder 34 can result when the number of corrections required of the outer decoder 34 exceeds a threshold. Said another way, when the output of the inner decoder 22, 26 results in a ByER that exceeds a specific number the outer decoder is unable to correctly decode the data.
- the RS decoder provides an indication of an error event which is recognizable by the processor performing the decoding.
- One cause of such performance degradation can be changes to the channel conditions between the transmitting and receiving parties.
- the method 200 recodes (step 250) the blocks of data that resulted in the error at the outer decoder 34.
- the buffer 14 is sized appropriately to account of the delay of certain components of the system 10.
- the size of the buffer 14, in one examples, is equal to the sum of the delays for deinterleaver 30 and inner decoder 22, 26. Convolutional deinterleavers with a delay of more than one decoding block are commonly used for these schemes.
- the total delay for deinterleaver 30 and sub-optimal inner decoder 26 is referenced by "D".
- the delay for inner decoder 22, 26 is commonly less than a block. Assume, for this example, and for the ease of implementation that the delay for inner decoder 22, 26 is one block.
- block number " «" at the input of outer decoder 34 has data from blocks numbered n-D+l to number n at the input of inner decoder 22, 26. Therefore, if a decoding failure is indicated by outer decoder 34 with selector 18 in position 1, the selector 18 position is changed to 0 and optimal inner decoder 22 runs for block numbers from n-D+ ⁇ to number n that reside in the buffer 14.
- the buffer 14 stores a certain number of data blocks for a specific time period.
- those blocks that caused the error can be retrieved from the buffer 14 and redecoded using the optimal inner decoder 22.
- This temporary shift to optimal decoding for the purposes of redecoding certain data blocks helps to ensure that the overall error performance is uncompromised.
- FIGS. 6 and 7 provide functional block diagram illustrations of general purpose computer hardware platforms.
- FIG. 6 illustrates a network or host computer platform, as may typically be used to implement a server.
- FIG. 7 depicts a computer with user interface elements, as may be used to implement a personal computer (PC) or other type of work station or terminal device, although the computer of FIG. 7 may also act as a server if appropriately programmed.
- PC personal computer
- Storage type media include any or all of the memory of the computers, processors or the like, or associated modules thereof, such as various semiconductor memories, tape drives, disk drives and the like, which may provide storage at any time for the software programming. All or portions of the software may at times be communicated through the Internet or various other telecommunication networks. Such communications, for example, may enable loading of the software from one computer or processor into another, for example, from a management server or host computer of the network operator or carrier into the computer platform of the data aggregator and/or the computer platform(s) that serve as the customer communication system.
- another type of media that may bear the software elements includes optical, electrical and electromagnetic waves, such as used across physical interfaces between local devices, through wired and optical landline networks and over various air-links.
- a machine readable medium may take many forms, including but not limited to, a tangible storage medium, a carrier wave medium or physical transmission medium.
- Non-volatile storage media include, for example, optical or magnetic disks, such as any of the storage devices in any computer(s) or the like, such as may be used to implement the data aggregator, the customer communication system, etc. shown in the drawings.
- Volatile storage media include dynamic memory, such as main memory of such a computer platform.
- Tangible transmission media include coaxial cables; copper wire and fiber optics, including the wires that comprise a bus within a computer system.
- Carrier-wave transmission media can take the form of electric or electromagnetic signals, or acoustic or light waves such as those generated during radio frequency (RF) and infrared (IR) data communications.
- RF radio frequency
- IR infrared
- Common forms of computer-readable media therefore include for example: a floppy disk, a flexible disk, hard disk, magnetic tape, any other magnetic medium, a CD-ROM, DVD or DVD-ROM, any other optical medium, punch cards paper tape, any other physical storage medium with patterns of holes, a RAM, a PROM and EPROM, a FLASH-EPROM, any other memory chip or cartridge, a carrier wave transporting data or instructions, cables or links transporting such a carrier wave, or any other medium from which a computer can read programming code and/or data.
- Many of these forms of computer readable media may be involved in carrying one or more sequences of one or more instructions to a processor for execution.
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Probability & Statistics with Applications (AREA)
- Theoretical Computer Science (AREA)
- Artificial Intelligence (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Error Detection And Correction (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
Description
Claims
Priority Applications (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP10719032A EP2425536A1 (en) | 2009-05-01 | 2010-04-29 | Systems and methods for communications |
JP2012507813A JP2012525753A (en) | 2009-05-01 | 2010-04-29 | Communication system and method |
BRPI1015201A BRPI1015201A2 (en) | 2009-05-01 | 2010-04-29 | method for performing serial concatenated decoding, serial concatenated documenting system, and article of manufacture. |
CN2010800194863A CN102439854A (en) | 2009-05-01 | 2010-04-29 | Systems and methods for communications |
Applications Claiming Priority (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US12/434,325 US8312346B2 (en) | 2009-05-01 | 2009-05-01 | Systems and methods for communications |
US12/434,325 | 2009-05-01 | ||
GB0919151A GB2469889B (en) | 2009-05-01 | 2009-11-02 | Systems and methods for communications |
GB0919151.1 | 2009-11-02 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2010125355A1 true WO2010125355A1 (en) | 2010-11-04 |
Family
ID=41434996
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/GB2010/000867 WO2010125355A1 (en) | 2009-05-01 | 2010-04-29 | Systems and methods for communications |
Country Status (8)
Country | Link |
---|---|
US (1) | US8312346B2 (en) |
EP (1) | EP2425536A1 (en) |
JP (1) | JP2012525753A (en) |
CN (1) | CN102439854A (en) |
BR (1) | BRPI1015201A2 (en) |
GB (1) | GB2469889B (en) |
TW (1) | TW201128963A (en) |
WO (1) | WO2010125355A1 (en) |
Families Citing this family (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP2710756A1 (en) * | 2011-05-18 | 2014-03-26 | Telefonaktiebolaget LM Ericsson (PUBL) | Joint processing in cooperative radio communications networks |
CN107506176B (en) * | 2016-06-14 | 2019-07-12 | 华为技术有限公司 | A kind of method and apparatus of determining decoding task |
DE102017109239A1 (en) * | 2017-04-28 | 2018-10-31 | Ilnumerics Gmbh | COMPUTER IMPLEMENTED PROCESS, COMPUTER READABLE MEDIA AND HETEROGICAL COMPUTER SYSTEM |
CN109379087B (en) * | 2018-10-24 | 2022-03-29 | 江苏华存电子科技有限公司 | Method for LDPC to modulate kernel coding and decoding rate according to error rate of flash memory component |
US20230193747A1 (en) * | 2021-12-16 | 2023-06-22 | Ms Directional, Llc | Telemetry Replay |
Family Cites Families (44)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US106652A (en) * | 1870-08-23 | Michael bee | ||
US276261A (en) * | 1883-04-24 | Urinal | ||
US217286A (en) * | 1879-07-08 | Improvement in coal-cars | ||
US67606A (en) * | 1867-08-06 | Seneca e | ||
IT1168840B (en) | 1983-09-15 | 1987-05-20 | Cselt Centro Studi Lab Telecom | PERFECT CYCLIC BINARY CODE DECODER |
DE3701533A1 (en) * | 1987-01-21 | 1988-08-04 | Medi System Gmbh | OSTEOSYNTHESIS TOOLS |
US4958349A (en) | 1988-11-01 | 1990-09-18 | Ford Aerospace Corporation | High data rate BCH decoder |
GB8922702D0 (en) | 1989-10-09 | 1989-11-22 | Videologic Ltd | Radio television receiver |
US5889823A (en) * | 1995-12-13 | 1999-03-30 | Lucent Technologies Inc. | Method and apparatus for compensation of linear or nonlinear intersymbol interference and noise correlation in magnetic recording channels |
SG64964A1 (en) | 1996-02-27 | 1999-05-25 | Thomson Consumer Electronics | Filter in a digital timing recovery system |
TW465234B (en) | 1997-02-18 | 2001-11-21 | Discovision Ass | Single chip VLSI implementation of a digital receiver employing orthogonal frequency division multiplexing |
JP3847908B2 (en) | 1997-07-23 | 2006-11-22 | キヤノン株式会社 | Signal processing device and clock generator |
US6263470B1 (en) | 1998-02-03 | 2001-07-17 | Texas Instruments Incorporated | Efficient look-up table methods for Reed-Solomon decoding |
US6925107B2 (en) * | 1998-03-06 | 2005-08-02 | Deutsche Telekom Ag | Decoding method and decoding device for a CDMA transmission system for demodulating a received signal available in serial code concatenation |
CA2474859C (en) | 1998-04-06 | 2007-06-19 | Nortel Networks Limited | Encoding and decoding methods and apparatus |
US7016308B1 (en) | 1999-03-19 | 2006-03-21 | Broadband Royalty Corporation | Digital return path for hybrid fiber/coax network |
GB9908863D0 (en) | 1999-04-20 | 1999-06-16 | Nds Ltd | Multiplexer |
AU6380300A (en) | 1999-08-20 | 2001-03-19 | Nogatech Inc. | Device, system and method for usb television and television integration with advertising and with internet browsing |
US6360348B1 (en) | 1999-08-27 | 2002-03-19 | Motorola, Inc. | Method and apparatus for coding and decoding data |
DE69923970T2 (en) * | 1999-09-14 | 2006-04-27 | Lucent Technologies Inc. | Channel decoder and method for channel decoding |
US6314447B1 (en) | 1999-10-04 | 2001-11-06 | Sony Corporation | System uses local registry and load balancing procedure for identifying processing capabilities of a remote device to perform a processing task |
US6529988B1 (en) | 1999-10-28 | 2003-03-04 | Matsushita Electrical Industrial | Method and apparatus for compression of universal serial bus data transmission |
EP1260028A2 (en) | 2000-01-24 | 2002-11-27 | Radioscape Limited | Digital wireless basestation |
US6810502B2 (en) * | 2000-01-28 | 2004-10-26 | Conexant Systems, Inc. | Iteractive decoder employing multiple external code error checks to lower the error floor |
US6967598B2 (en) * | 2004-02-20 | 2005-11-22 | Bae Systems Information And Electronic Systems Integration Inc | Reduced complexity multi-turbo multi-user detector |
JP2003296036A (en) | 2002-03-29 | 2003-10-17 | Yamaha Corp | Optical disk recorder and personal computer system |
US7123663B2 (en) * | 2002-06-04 | 2006-10-17 | Agence Spatiale Europeenne | Coded digital modulation method for communication system |
CN1269315C (en) * | 2002-07-02 | 2006-08-09 | 华为技术有限公司 | Method for raising performance of series cascade space time coding system |
US20040063425A1 (en) | 2002-09-30 | 2004-04-01 | Kabushiki Kaisha Toshiba | Wireless communication terminal |
EP1604464A2 (en) | 2003-03-10 | 2005-12-14 | Thomson Licensing S.A. | Receiver and method for concurrent receiving of multiple channels |
JP4284155B2 (en) | 2003-10-31 | 2009-06-24 | 株式会社東芝 | Video display system, broadcast signal processing unit, and video display device |
GB2412551A (en) | 2004-03-26 | 2005-09-28 | Sony Uk Ltd | Receiver |
JP2008511267A (en) | 2004-08-25 | 2008-04-10 | パッドコム ホールディングズ,インコーポレイテッド | Multi-network seamless roaming via software defined radio |
US7694107B2 (en) | 2005-08-18 | 2010-04-06 | Hewlett-Packard Development Company, L.P. | Dynamic performance ratio proportionate distribution of threads with evenly divided workload by homogeneous algorithm to heterogeneous computing units |
TWM288956U (en) | 2005-10-13 | 2006-03-21 | Animation Technologies Inc | TV card having PCMCIA interface |
TWM291165U (en) | 2005-12-16 | 2006-05-21 | Animation Technologies Inc | Television audio/video signal processing device |
US7813707B2 (en) | 2006-11-07 | 2010-10-12 | Microtune (Texas), L.P. | High-performance bipolar tuner solution systems and methods |
US7770087B2 (en) | 2007-01-19 | 2010-08-03 | Harris Corporation | Serial concatenated convolutional code decoder |
US8276164B2 (en) | 2007-05-03 | 2012-09-25 | Apple Inc. | Data parallel computing on multiple processors |
KR20090041224A (en) | 2007-10-23 | 2009-04-28 | 삼성전자주식회사 | Concatenated decoder and method of concatenated decoding |
US8332865B2 (en) | 2008-02-21 | 2012-12-11 | International Business Machines Corporation | Adjunct processor load balancing |
GB2460418B (en) | 2008-05-28 | 2010-04-14 | Mirics Semiconductor Ltd | Broadcast receiver system |
GB2460416B (en) | 2008-05-28 | 2010-07-07 | Mirics Semiconductor Ltd | Broadcast receiver system |
GB2460417B (en) | 2008-05-28 | 2011-04-06 | Mirics Semiconductor Ltd | Broadcast receiver system |
-
2009
- 2009-05-01 US US12/434,325 patent/US8312346B2/en not_active Expired - Fee Related
- 2009-11-02 GB GB0919151A patent/GB2469889B/en not_active Expired - Fee Related
-
2010
- 2010-04-29 BR BRPI1015201A patent/BRPI1015201A2/en not_active IP Right Cessation
- 2010-04-29 CN CN2010800194863A patent/CN102439854A/en active Pending
- 2010-04-29 EP EP10719032A patent/EP2425536A1/en not_active Withdrawn
- 2010-04-29 JP JP2012507813A patent/JP2012525753A/en active Pending
- 2010-04-29 WO PCT/GB2010/000867 patent/WO2010125355A1/en active Application Filing
- 2010-04-30 TW TW099113783A patent/TW201128963A/en unknown
Non-Patent Citations (1)
Title |
---|
G. KABATIANSKY ET AL: "Error Correcting Coding and security for data networks: Analysis of the Superchannel Concept", 2005, WILEY, XP002589874 * |
Also Published As
Publication number | Publication date |
---|---|
US8312346B2 (en) | 2012-11-13 |
US20100281334A1 (en) | 2010-11-04 |
TW201128963A (en) | 2011-08-16 |
GB0919151D0 (en) | 2009-12-16 |
JP2012525753A (en) | 2012-10-22 |
GB2469889A (en) | 2010-11-03 |
GB2469889B (en) | 2011-06-29 |
EP2425536A1 (en) | 2012-03-07 |
BRPI1015201A2 (en) | 2019-04-30 |
CN102439854A (en) | 2012-05-02 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US8010869B2 (en) | Method and device for controlling the decoding of a LDPC encoded codeword, in particular for DVB-S2 LDPC encoded codewords | |
RU2414077C2 (en) | Channel switching signal generating circuit and channel switching signal generating method | |
KR100881192B1 (en) | A method of detecting an error pattern, an error correction apparatus, and a method of encoding data | |
US8806309B2 (en) | Method for controlling message-passing algorithm based decoding operation by referring to statistics data of syndromes of executed iterations and related control apparatus thereof | |
US8312346B2 (en) | Systems and methods for communications | |
US8181081B1 (en) | System and method for decoding correlated data | |
KR20200127783A (en) | Appartus and method for decoding of low-density parity check codes in wireles communication system | |
US8843811B2 (en) | Apparatus and method for decoding in communication system | |
EP3713096B1 (en) | Method and device for decoding staircase code, and storage medium | |
KR20070084952A (en) | Apparatus and method for receiving signal in a communication system | |
WO2011154750A1 (en) | Decoding of reed - solomon codes using look-up tables for error detection and correction | |
US10122496B2 (en) | Method for dynamic and selective FD-DSDF transmission of a digital signal for a MARC system with a full-duplex relay, and corresponding program product and relay device | |
KR101569637B1 (en) | Method and Apparatus for Non-Iterative Soft-Decision BCH Decoding using Test Syndrome | |
KR102045438B1 (en) | Method and Apparatus for Decoding of Low-density parity-check | |
Lee | An efficient BCH decoder for WBAN applications | |
EP1511178A1 (en) | A method of decoding a data word | |
WO2000041328A1 (en) | Device and method for normalizing metric value of component decoder in mobile communication system | |
JP2008017001A (en) | Error correction apparatus | |
KR100318912B1 (en) | Method and apparatus for state value normalization of component decoder in mobile communication system | |
US20090138780A1 (en) | Method and device for decoding a received systematic code encoded block | |
Kim et al. | Error performance and decoder hardware comparison between EG-LDPC and BCH codes | |
US20230131991A1 (en) | Method and system for error checking in wireless communications | |
US20110307757A1 (en) | Systems and methods for error correction | |
US20120166905A1 (en) | Method and apparatus for controlling decoding in receiver | |
Condo et al. | Energy‐efficient multi‐standard early stopping criterion for low‐density‐parity‐check iterative decoding |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
WWE | Wipo information: entry into national phase |
Ref document number: 201080019486.3 Country of ref document: CN |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 10719032 Country of ref document: EP Kind code of ref document: A1 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2010719032 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2012507813 Country of ref document: JP |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
REG | Reference to national code |
Ref country code: BR Ref legal event code: B01A Ref document number: PI1015201 Country of ref document: BR |
|
ENP | Entry into the national phase |
Ref document number: PI1015201 Country of ref document: BR Kind code of ref document: A2 Effective date: 20111028 |