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

Industry

  • CPC
  • H03M13/00
This industry / category may be too specific. Please go to a parent level for more data

Sub Industries

H03M13/005using punctured codes H03M13/01Coding theory basic assumptions Coding bounds Error probability evaluation methods Channel models Simulation or testing of codes H03M13/015Simulation or testing of codes H03M13/03Error detection or forward error correction by redundancy in data representation H03M13/033Theoretical methods to calculate these checking codes H03M13/036Heuristic code construction methods H03M13/05using block codes H03M13/07Arithmetic codes H03M13/09Error detection only H03M13/091Parallel or block-wise CRC computation H03M13/093CRC update after modification of the information word H03M13/095Error detection codes other than CRC and single parity bit codes H03M13/096Checksums H03M13/098using single parity bit H03M13/11using multiple parity bits H03M13/1102Codes on graphs and decoding on graphs H03M13/1105Decoding H03M13/1108Hard decision decoding H03M13/1111Soft-decision decoding H03M13/1114Merged schedule message passing algorithm with storage of sums of check-to-bit node messages or sums of bit-to-check node messages H03M13/1117using approximations for check node processing H03M13/112with correction functions for the min-sum rule H03M13/1122storing only the first and second minimum values per check node H03M13/1125using different domains for check node and bit node processing, wherein the different domains include probabilities, likelihood ratios, likelihood differences, log-likelihood ratios or log-likelihood difference pairs H03M13/1128Judging correct decoding and iterative stopping criteria other than syndrome check and upper limit for decoding iterations H03M13/1131Scheduling of bit node or check node processing H03M13/1134Full parallel processing H03M13/1137Partly parallel processing H03M13/114Shuffled, staggered, layered or turbo decoding schedules H03M13/1142using trapping sets H03M13/1145Pipelined decoding at code word level H03M13/1148Structural properties of the code parity-check or generator matrix H03M13/1151Algebraically constructed LDPC codes H03M13/1154Low-density parity-check convolutional codes [LDPC-CC] H03M13/1157Low-density generator matrices [LDGM] H03M13/116Quasi-cyclic LDPC [QC-LDPC] codes H03M13/1162Array based LDPC codes H03M13/1165QC-LDPC codes as defined for the digital video broadcasting [DVB] specifications H03M13/1168wherein the sub-matrices have column and row weights greater than one H03M13/1171Parity-check or generator matrices with non-binary elements H03M13/1174Parity-check or generator matrices built from sub-matrices representing known block codes such as H03M13/1177Regular LDPC codes with parity-check matrices wherein all rows and columns have the same row weight and column weight, respectively H03M13/118Parity check matrix structured for simplifying encoding H03M13/1182wherein the structure of the parity-check matrix is obtained by reordering of a random parity-check matrix H03M13/1185wherein the parity-check matrix comprises a part with a double-diagonal H03M13/1188wherein in the part with the double-diagonal at least one column has an odd column weight equal or greater than three H03M13/1191Codes on graphs other than LDPC codes H03M13/1194Repeat-accumulate [RA] codes H03M13/1197Irregular repeat-accumulate [IRA] codes H03M13/13Linear codes H03M13/132Algebraic geometric codes H03M13/134Non-binary linear block codes not provided for otherwise H03M13/136Reed-Muller [RM] codes H03M13/138Codes linear in a ring H03M13/15Cyclic codes, i.e. cyclic shifts of codewords produce other codewords H03M13/1505Golay Codes H03M13/151using error location or error correction polynomials H03M13/1515Reed-Solomon codes H03M13/152Bose-Chaudhuri-Hocquenghem [BCH] codes H03M13/1525Determination and particular use of error location polynomials H03M13/153using the Berlekamp-Massey algorithm H03M13/1535using the Euclid algorithm H03M13/154Error and erasure correction H03M13/1545Determination of error locations H03M13/155Shortening or extension of codes H03M13/1555Pipelined decoder implementations H03M13/156Encoding or decoding using time-frequency transformations H03M13/1565Decoding beyond the bounded minimum distance [BMD] H03M13/157Polynomial evaluation H03M13/1575Direct decoding H03M13/158Finite field arithmetic processing H03M13/1585Determination of error values H03M13/159Remainder calculation H03M13/1595Parallel or block-wise remainder calculation H03M13/17Burst error correction H03M13/175Error trapping or Fire codes H03M13/19Single error correction without using particular properties of the cyclic codes H03M13/21Non-linear codes H03M13/23using convolutional codes H03M13/235Encoding of convolutional codes H03M13/25Error detection or forward error correction by signal space coding, i.e. adding redundancy in the signal constellation H03M13/251with block coding H03M13/253with concatenated codes H03M13/255with Low Density Parity Check [LDPC] codes H03M13/256with trellis coding H03M13/258with turbo codes H03M13/27using interleaving techniques H03M13/2703the interleaver involving at least two directions H03M13/2707Simple row-column interleaver H03M13/271Row-column interleaver with permutations H03M13/2714Turbo interleaver for 3rd generation partnership project [3GPP] universal mobile telecommunications systems [UMTS] H03M13/2717the interleaver involves 3 or more directions H03M13/2721the interleaver involves a diagonal direction H03M13/2725Turbo interleaver for 3rd generation partnership project 2 [3GPP2] mobile telecommunication systems H03M13/2728Helical type interleaver H03M13/2732Convolutional interleaver; Interleavers using shift-registers or delay lines like H03M13/2735Interleaver using powers of a primitive element H03M13/2739Permutation polynomial interleaver H03M13/2742Irregular interleaver wherein the permutation pattern is not obtained by a computation rule H03M13/2746S-random interleaver H03M13/275Interleaver wherein the permutation pattern is obtained using a congruential operation of the type y=ax+b modulo c H03M13/2753Almost regular permutation [ARP] interleaver H03M13/2757Interleaver with an interleaving rule not provided for in the subgroups H03M13/2703 - H03M13/2753 H03M13/276Interleaving address generation H03M13/2764Circuits therefore H03M13/2767Interleaver wherein the permutation pattern or a portion thereof is stored H03M13/2771Internal interleaver for turbo codes H03M13/2775Contention or collision free turbo code internal interleaver H03M13/2778Interleaver using block-wise interleaving H03M13/2782Interleaver implementations, which reduce the amount of required interleaving memory H03M13/2785Interleaver using in-place interleaving H03M13/2789Interleaver providing variable interleaving H03M13/2792Interleaver wherein interleaving is performed jointly with another technique such as puncturing, multiplexing or routing H03M13/2796Two or more interleaving operations are performed jointly H03M13/29combining two or more codes or code structures H03M13/2903Methods and arrangements specifically for encoding H03M13/2906using block codes H03M13/2909Product codes H03M13/2912omitting parity on parity H03M13/2915with an error detection code in one dimension H03M13/2918with error correction codes in three or more dimensions H03M13/2921wherein error correction coding involves a diagonal direction H03M13/2924Cross interleaved Reed-Solomon codes [CIRC] H03M13/2927Decoding strategies H03M13/293with erasure setting H03M13/2933using a block and a convolutional code H03M13/2936comprising an outer Reed-Solomon code and an inner convolutional code H03M13/2939using convolutional codes H03M13/2942wherein a block of parity bits is computed only from combined information bits or only from parity bits H03M13/2945using at least three error correction codes H03M13/2948Iterative decoding H03M13/2951using iteration stopping criteria H03M13/2954using Picket codes or other codes providing error burst detection capabilities H03M13/2957Turbo codes and decoding H03M13/296Particular turbo code structure H03M13/2963Turbo-block codes, i.e. turbo codes based on block codes H03M13/2966Turbo codes concatenated with another code H03M13/2969Non-binary turbo codes H03M13/2972Serial concatenation using convolutional component codes H03M13/2975Judging correct decoding H03M13/2978Particular arrangement of the component decoders H03M13/2981using as many component decoders as component codes H03M13/2984using less component decoders than component codes H03M13/2987using more component decoders than component codes H03M13/299Turbo codes with short blocks H03M13/2993Implementing the return to a predetermined state H03M13/2996Tail biting H03M13/31combining coding for error detection or correction and efficient use of the spectrum H03M13/33Synchronisation based on error coding or decoding H03M13/333Synchronisation on a multi-bit block basis H03M13/336Phase recovery H03M13/35Unequal or adaptive error protection H03M13/353Adaptation to the channel H03M13/356Unequal error protection [UEP] H03M13/37Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35 H03M13/3707Adaptive decoding and hybrid decoding H03M13/3715Adaptation to the number of estimated errors or to the channel state H03M13/3723using means or methods for the initialisation of the decoder H03M13/373with erasure correction and erasure determination H03M13/3738with judging correct decoding H03M13/3746with iterative decoding H03M13/3753using iteration stopping criteria H03M13/3761using code combining, i.e. using combining of codeword portions which may have been transmitted separately H03M13/3769using symbol combining H03M13/3776using a re-encoding step during the decoding process H03M13/3784for soft-output decoding of block codes H03M13/3792for decoding of real number codes H03M13/39Sequence estimation H03M13/3905Maximum a posteriori probability [MAP] decoding and approximations thereof based on trellis or lattice decoding H03M13/3911Correction factor H03M13/3916for block codes using a trellis or lattice H03M13/3922Add-Compare-Select [ACS] operation in forward or backward recursions H03M13/3927Log-Likelihood Ratio [LLR] computation by combination of forward and backward metrics into LLRs H03M13/3933Decoding in probability domain H03M13/3938Tail-biting H03M13/3944for block codes, especially trellis or lattice decoding thereof H03M13/395using a collapsed trellis H03M13/3955using a trellis with a reduced state space complexity H03M13/3961Arrangements of methods for branch or transition metric calculation H03M13/3966based on architectures providing a highly parallelized implementation H03M13/3972using sliding window techniques or parallel windows H03M13/3977using sequential decoding H03M13/3983for non-binary convolutional codes H03M13/3988for rate k/n convolutional codes, with k>1, obtained by convolutional encoders with k inputs and n outputs H03M13/3994using state pinning or decision forcing H03M13/41using the Viterbi algorithm or Viterbi processors H03M13/4107implementing add, compare, select [ACS] operations H03M13/4115list output Viterbi decoding H03M13/4123implementing the return to a predetermined state H03M13/413tail biting Viterbi decoding H03M13/4138soft-output Viterbi algorithm based decoding H03M13/4146soft-output Viterbi decoding according to Battail and Hagenauer in which the soft-output is determined using path metric differences along the maximum-likelihood path H03M13/4153two-step SOVA decoding H03M13/4161implementing path management H03M13/4169using traceback H03M13/4176using a plurality of RAMs H03M13/4184using register-exchange H03M13/4192using combined traceback and register-exchange H03M13/42MAP decoding or approximations thereof based on trellis or lattice decoding H03M13/43Majority logic or threshold decoding H03M13/45Soft decoding H03M13/451using a set of candidate code words H03M13/453wherein the candidate code words are obtained by an algebraic decoder H03M13/455using a set of erasure patterns or successive erasure decoding H03M13/456wherein all the code words of the code or its dual code are tested H03M13/458by updating bit probabilities or hard decisions in an iterative fashion for convergence to a final decoding result H03M13/47Error detection, forward error correction or error protection, not provided for in groups H03M13/01 - H03M13/37 H03M13/49Unidirectional error detection or correction H03M13/51Constant weight codes n-out-of-m codes Berger codes H03M13/53Codes using Fibonacci numbers series H03M13/61Aspects and characteristics of methods and arrangements for error correction or error detection, not provided for otherwise H03M13/611Specific encoding aspects H03M13/612Aspects specific to channel or signal-to-noise ratio estimation H03M13/613Use of the dual code H03M13/615Use of computational or mathematical techniques H03M13/616Matrix operations, especially for generator matrices or check matrices H03M13/617Polynomial operations H03M13/618Shortening and extension of codes H03M13/63Joint error correction and other techniques H03M13/6306Error control coding in combination with Automatic Repeat reQuest [ARQ] and diversity transmission H03M13/6312Error control coding in combination with data compression H03M13/6318using variable length codes H03M13/6325Error control coding in combination with demodulation H03M13/6331Error control coding in combination with equalisation H03M13/6337Error control coding in combination with channel estimation H03M13/6343Error control coding in combination with techniques for partial response channels H03M13/635Error control coding in combination with rate matching H03M13/6356by repetition or insertion of dummy data H03M13/6362by puncturing H03M13/6368using rate compatible puncturing or complementary puncturing H03M13/6375Rate compatible punctured convolutional [RCPC] codes H03M13/6381Rate compatible punctured turbo [RCPT] codes H03M13/6387Complementary punctured convolutional [CPC] codes H03M13/6393Rate compatible low-density parity check [LDPC] codes H03M13/65Purpose and implementation aspects H03M13/6502Reduction of hardware complexity or efficient processing H03M13/6505Memory efficient implementations H03M13/6508Flexibility, adaptability, parametrability and configurability of the implementation H03M13/6511Support of multiple decoding rules H03M13/6513Support of multiple code types H03M13/6516Support of multiple code parameters H03M13/6519Support of multiple transmission or communication standards H03M13/6522Intended application H03M13/65253GPP LTE including E-UTRA H03M13/6527IEEE 802.11 [WLAN] H03M13/6533GPP HSDPA H03M13/6533ITU 992.X [ADSL] H03M13/6536GSM GPRS H03M13/6538ATSC VBS systems H03M13/6541DVB-H and DVB-M H03M13/6544IEEE 802.16 (WIMAX and broadband wireless access) H03M13/6547TCP, UDP, IP and associated protocols H03M13/655UWB OFDM H03M13/6552DVB-T2 H03M13/6555DVB-C2 H03M13/65583GPP2 H03M13/6561Parallelized implementations H03M13/6563Implementations using multi-port memories H03M13/6566Implementations concerning memory access contentions H03M13/6569Implementation on processors H03M13/6572Implementations using a tree structure H03M13/6575Implementations based on combinatorial logic H03M13/6577Representation or format of variables, register sizes or word-lengths and quantization H03M13/658Scaling by multiplication or division H03M13/6583Normalization other than scaling H03M13/6586Modulo/modular normalization H03M13/6588Compression or short representation of variables H03M13/6591Truncation, saturation and clamping H03M13/6594Non-linear quantization H03M13/6597Implementations using analogue techniques for coding or decoding

Patents Grantslast 30 patents

Patents Applicationslast 30 patents