序号 | 专利名 | 申请号 | 申请日 | 公开(公告)号 | 公开(公告)日 | 发明人 |
---|---|---|---|---|---|---|
121 | IN-PLACE TRANSFORMATIONS WITH APPLICATIONS TO ENCODING AND DECODING VARIOUS CLASSES OF CODES | EP06772990 | 2006-06-12 | EP1894376A4 | 2011-11-16 | LUBY MICHAEL G; SHOKROLLAHI M AMIN |
122 | System and method for decoding a message using a priori information | EP09175425.9 | 2009-11-09 | EP2337227A1 | 2011-06-22 | Snow, Christopher Harris; Abdel-Samad, Ayman Ahmed Mahmoud |
Methods and systems are disclosed for decoding digital data received by a correspondent device (154) over a communication channel (156). The data includes a component corresponding to a plurality of values unknown to the correspondent device (154) and a component corresponding to one or more values known a priori by the correspondent device (154). To perform decoding, the correspondent device (154) retrieves from memory (162) at least one of the one or more known values. The correspondent device (154) then applies a statistical measure using the known value(s) to estimate the location of the component corresponding to the one or more known values. The one or more known values and the estimated location of the component corresponding to the one or more known values are then used by a decoder (160) to assist in decoding the data. |
||||||
123 | Method and system for implicit user equipment identification | EP10179475.8 | 2002-05-08 | EP2302801A1 | 2011-03-30 | Bolourchi, Nader; Terry, Stephen, E.; Dick, Stephen G. |
A user equipment (UE) comprising means for receiving a first wireless signal of a control channel, wherein the first wireless signal comprises an N bit field and control information and the N bit field comprises an N bit cyclic redundancy check (CRC) modulo two added to an N bit UE identity; means for determining whether criteria is met wherein the criteria includes the CRC is correct and the UE identity is any one of a plurality of UE identities associated with the UE; and means for using the control information to process a downlink shared channel on a condition that the criteria is met, |
||||||
124 | Method and system for UMTS HSDPA shared control channel processing | EP07012849.1 | 2007-06-29 | EP1928094B1 | 2011-01-26 | Li Fung, Chang; Hongwei, Kong |
125 | RECEIVER WITH IMPROVED DECODER | EP00989952.7 | 2000-12-05 | EP1157473B1 | 2010-02-24 | KOPPELAAR, Arie, G., C. |
A receiver for receiving digital signals comprises a front end (18) for receiving RF signals and converting them into an input signal for a de-interleaver 22 for obtaining a de-interleaved signal. The output of the de-interleaver is connected to a decoder (24) which can be a Reed-Solomon decoder. The decoder (24) is able to use erasure information which indicates possible positions of errors in the de-interleaved signal for increasing the number of errors the decoder (24) can correct. In order to improve the error correcting capabilities of the receiver, this receiver comprises error prediction means (26) which predict the position of errors in the next codewords due to error bursts from the errors found in the present codeword. Such a predicted error is handled as an erasure by the decoder (24). To prevent that more erasures are presented to the decoder (24) than it can handle, it is proposed to determine a probability measure for all predicted errors and to present only those errors to the decoder (24) having the largest probability. | ||||||
126 | SYSTEMS AND METHODS FOR DECODING FORWARD ERROR CORRECTING CODES | EP06770218.3 | 2006-05-11 | EP1880472A2 | 2008-01-23 | CONWAY, Adrian, Evans |
Systems and methods are disclosed that can improve the performance of decoders of forward error correcting codes by using the information contained in late packet arrivals to update (26) (or recompute) the state of the decoder (24) The systems and methods of the disclosed embodiments are generally applicable to decoders that maintain state information in decoding successive bits or information frames The systems and methods disclosed herein can improve the performance (ι e, the bit error rate) of the decoder since the recomputed state is exactly the state that the decoder would have had if the information contained in the late packet had originally arrived on time and been decoded in a usual manner In effect, the updating of the decoder (24) state following a late packet arrival (26) terminates the propagation in time of the effect of the late packet erasure on the state of the decoder | ||||||
127 | Procédé d'optimisation, sous contrainte de ressources, de la taille de blocs de données codées | EP02290594.7 | 2002-03-08 | EP1249940B1 | 2006-05-17 | Gueguen, Arnaud, Mitsubishi Electricité, Immeuble |
128 | ERASURE-AND-SINGLE-ERROR CORRECTION DECODER FOR LINEAR BLOCK CODES | EP02794135.0 | 2002-12-03 | EP1464121B1 | 2005-09-28 | BUTLER, Brian, K.; WOLF, Jack, K.; MILNE, Ryan |
129 | Wlan receiver having an iterative decoder | EP05002190.6 | 2005-02-02 | EP1566912A2 | 2005-08-24 | Hansen, Christopher James; Trachewsky, Jason A.; Bhargave, Ashish |
An iterative decoder for use in a WLAN includes an inner decoder/detector, a first subtraction module, a deinterleaving module, an outer decoder, a second subtraction module, an interleaving module, and a determining module. The inner decoder/detector determines inner coded bits and extrinsic information of the inner coded bits from symbol vector based on a channel matrix and inner extrinsic information feedback. The first subtraction module subtracts the inner extrinsic information feedback from the extrinsic information of the inner coded bits. The deinterleaving module deinterleaves the output of the first subtraction module to produce deinterleaved inner extrinsic information. The outer decoder determines outer coded bits and extrinsic information of the outer coded bits from the deinterleaved inner extrinsic information. The second subtraction module subtracts the deinterleaved inner extrinsic information from the extrinsic information of the outer coded bits. The interleaving module interleaves the output of the second subtraction module to produce the inner extrinsic information feedback. The determining module produces decoded bits based on the outer coded bits. |
||||||
130 | MULTI-CARRIER TRANSMITTING APPARATUS AND MULTI-CARRIER TRANSMITTING METHOD | EP03748632.1 | 2003-10-01 | EP1551121A1 | 2005-07-06 | SUDO, Hiroaki |
A coding section 101 turbo-codes transmit data and outputs parity bit data, and systematic bit data for which good quality is required. A modulation section 102 modulates the parity bit data and systematic bit data. A subcarrier allocation section 103 rearranges the transmit data so that systematic bit data is allocated to subcarriers in the vicinity of the center frequency and parity bit data is allocated to subcarriers in the vicinity of both ends. An OFDM section 104 performs orthogonal frequency division multiplexing of the transmit data, and allocates parity bit data and systematic bit data to respective subcarriers. By this means, it is possible to improve significantly the error rate characteristics of transmit data for which good quality is required, and prevent degradation of the quality of transmit data for which good quality is required. |
||||||
131 | METHOD FOR DECODING DATA USING WINDOWS OF DATA | EP02785868.7 | 2002-12-20 | EP1461869A1 | 2004-09-29 | CHARPENTIER, Sebastien |
The present invention relates to a method using windows of data, a window (w) comprising data to be written and to be read and having a size. It is characterized in that it comprises:* A step of writing a current window of data into a unique buffer (BUF) in a first address direction, said first address direction being at an opposite direction from an address direction of the writing of a preceding window of data, said writing of said current window beginning at an address where no data of the preceding window of data have been written, said buffer (BUF) having a length greater than the maximum size of the windows of data, and* A step of reading the data of said preceding window of data from said unique buffer (BUF), from a reading address equal to a last written address of the same preceding window of data, said reading being made simultaneously to said writing of the current window of data and in the same first address direction. | ||||||
132 | VERFAHREN ZUM ANPASSEN DER EINEM TURBO-CODIERER ZUZUFÜHRENDEN DATENBLÖCKE UND ENTSPRECHENDE KOMMUNIKATIONSVORRICHTUNG | EP01913506.0 | 2001-01-12 | EP1258085B1 | 2004-09-01 | WIEDMANN, Ralf; RAAF, Bernhard; LOBINGER, Andreas |
133 | Optimized parallel in parallel out GF(2M) multiplier for FEC decoder | EP01128379.3 | 2001-12-03 | EP1217751A3 | 2003-07-30 | Lei, Mike |
The present invention achieves technical advantages as a multiplier circuit. The multiplier circuit multiplies GF (213) vectors to implement sigma calculations and a Chien search. This multiplier takes two inputs to be multiplied and outputs the resulting multiplication in GF (213) vectors in only one clock cycle. The multiplier circuit is customized to operate with OC-48 and OC-192 data, and is operable to meet the SONET Standard T1X1.5/99-218R3 and the SDH Standard ITU-T.G.707/Y.1322. |
||||||
134 | Method and apparatus for reducing the average number of iterations in iterative decoding | EP02102040.9 | 2002-07-18 | EP1280280A1 | 2003-01-29 | JEONG, Gibong; KOON, Der-Chieh |
A method and apparatus for reducing the average number of iterations in an iterative decoding technique includes the step of at the end of each decoding iteration or sub-iteration estimating the transmitted bit sequence by processing the available information. A signature for the estimation is then generated of reach iteration or sub-iteration. If this signature is the first signature generated, the decoder proceeds to the next process. When there exists a signature generated for the previous decoding iteration or sub-iteration step, the new signature for the current iteration is compared with the signature (old signature) for this previous iteration. If the two signatures match, the decoding iteration stops. Otherwise, the decoding iteration process continues. |
||||||
135 | VERFAHREN ZUM ANPASSEN DER EINEM TURBO-CODIERER ZUZUFÜHRENDEN DATENBLÖCKE UND ENTSPRECHENDE KOMMUNIKATIONSVORRICHTUNG | EP01913506.0 | 2001-01-12 | EP1258085A1 | 2002-11-20 | WIEDMANN, Ralf; RAAF, Bernhard; LOBINGER, Andreas |
The invention relates to a data block to be supplied to a turbo coder (2) of a communications device, especially a mobile radiotelephone transmitter, for coding the data bits of the data block. Additional bits having a known value are added to said data block in such a way that the thus resulting extended data block comprises a number of bits, whereby said number is the minimum required by the turbo coder (2) for coding. The additional bits are arranged upstream in relation to the data block. The invention can especially be used in a UMTS communications system. | ||||||
136 | In-band FEC error performance monitoring module for SONET | EP01128377.7 | 2001-12-03 | EP1217749A2 | 2002-06-26 | Baroncelli, Clara; Lei, Mike |
The present invention achieves technical advantages as a sigma calculation circuit for in-band FEC decoding. The present invention includes discrete mathematics units using parallel structure to accomplish the computation with low latency. A custom multiplier and squarer are utilized to do the multiplications, squaring, and cubing. Addition is done using XOR GATES. The sigma calculation circuit is customized to operate with OC-48 and OC-192 data, and is operable to meet both the SONET Standard T1X1.5/99-218R3 and the SDH Standard. |
||||||
137 | RECEIVER WITH IMPROVED DECODER | EP00989952.7 | 2000-12-05 | EP1157473A1 | 2001-11-28 | KOPPELAAR, Arie, G., C. |
A receiver for receiving digital signals comprises a front end (18) for receiving RF signals and converting them into an input signal for a de-interleaver 22 for obtaining a de-interleaved signal. The output of the de-interleaver is connected to a decoder (24) which can be a Reed-Solomon decoder. The decoder (24) is able to use erasure information which indicates possible positions of errors in the de-interleaved signal for increasing the number of errors the decoder (24) can correct. In order to improve the error correcting capabilities of the receiver, this receiver comprises error prediction means (26) which predict the position of errors in the next codewords due to error bursts from the errors found in the present codeword. Such a predicted error is handled as an erasure by the decoder (24). To prevent that more erasures are presented to the decoder (24) than it can handle, it is proposed to determine a probability measure for all predicted errors and to present only those errors to the decoder (24) having the largest probability. | ||||||
138 | Single-cycle, soft decision, compare-select operation using dual-add processor | EP98309384.0 | 1998-11-17 | EP0920137A1 | 1999-06-02 | Simanapalli, Sivanand; Tate, Larry R. |
In accordance with the invention, a method of generating a soft symbol confidence level for use in decoding a received digital signal includes calculating a difference between two potential next state accumulated costs (PNS00, PNS01) to provide a soft symbol confidence level. Simultaneously with calculating the difference between two potential next state accumulated costs, performing a compare-select operation to identify one of the two potential next state accumulated costs as an extremum of the two present state accumulated costs. The invention also teaches a circuit for generating a soft symbol confidence level such as in a decoder. The circuit includes first and second adders for receiving first and second potential next state accumulated costs. Simultaneously the potential next state accumulated costs are compared in one of the adders while the difference is taken in the other adder as a soft symbol confidence level. A selector selects one of the first and second potential next state accumulated costs as an extremum based on a flag set by one of the adders. The circuit may also provide a register in which to store one or more traceback bits, and a shift register for packing multiple traceback bits into a register or word. |
||||||
139 | HIGH SPEED CYCLICAL REDUNDANCY CHECK SYSTEM USING A PROGRAMMABLE ARCHITECTURE | EP95944609.0 | 1995-12-08 | EP0830741A1 | 1998-03-25 | THOMANN, Mark, R.; VO, Huy, Thanh; INGALLS, Charles, L. |
A high speed cyclical redundancy check system for use in digital systems. The high speed cyclical redundancy check system providing programmable error correction functions for different data protocols. The high speed cyclical redundancy check system providing programmable data paths for minimizing overhead and maximizing throughput. The system supporting multiple operations in a single cycle. | ||||||
140 | Advanced code error detection apparatus and system using maximal-length pseudorandom binary sequence | EP92111828.7 | 1992-07-10 | EP0523571B1 | 1996-10-16 | Ajima, Hiroyuki; Ishiyama, Nobuki; Hattori, Tsukasa |