| 序号 | 专利名 | 申请号 | 申请日 | 公开（公告）号 | 公开（公告）日 | 发明人 |
|---|---|---|---|---|---|---|
| 121 | Memory controller supporting rate-compatible punctured codes | US14629228 | 2015-02-23 | US09442796B2 | 2016-09-13 | William H. Radke |
| Apparatus and methods store data in a non-volatile solid state memory device according to a rate-compatible code, such as a rate-compatible convolutional code (RPCC). An example of such a memory device is a flash memory device. Data can initially be block encoded for error correction and detection. The block-coded data can be further convolutionally encoded. Convolutional-coded data can be punctured and stored in the memory device. The puncturing decreases the amount of memory used to store the data. Depending on conditions, the amount of puncturing can vary from no puncturing to a relatively high amount of puncturing to vary the amount of additional error correction provided and memory used. The punctured data can be decoded when data is to be read from the memory device. | ||||||
| 122 | LENGTH AND RATE COMPATIBLE LDPC ENCODER AND DECODER | US15153086 | 2016-05-12 | US20160261287A1 | 2016-09-08 | Xingkai Bao |
| A method and apparatus for encoding data and for decoding data using LDPC (low density parity check) codes includes providing a mother LDPC matrix of a particular size. A data payload of a smaller size is encoded by shortening the mother matrix to a smaller daughter matrix corresponding in size to the data payload and using the smaller daughter matrix for the encoding. The portions of the mother matrix to be removed in the shortening are derived from a control signal. The encoded data is transmitted with the control signal so that the receiver can derive the portions of the mother matrix to be removed to obtain the daughter matrix. At the receiver, a mother matrix is shortened to a daughter matrix and is then used to decode the data. The data at the encoder may be further reduced by puncturing to remove selected information bits and selected parity bits. The decoder inserts the selected information bits and parity bits when decoding the data. | ||||||
| 123 | Apparatus for transmitting and receiving a signal and method of transmitting and receiving a signal | US13145921 | 2009-05-13 | US09350490B2 | 2016-05-24 | Woo Suk Ko; Sang Chul Moon |
| The present invention relates to a method of transmitting and a method of receiving signals and corresponding apparatus. One aspect of the present invention relates to an efficient layer 1 (L1) processing method for a transmitter and a receiver using data slices. | ||||||
| 124 | Puncture-aware low density parity check (LDPC) decoding | US14501719 | 2014-09-30 | US20160087648A1 | 2016-03-24 | Matthias Korb; Andrew John Blanksby |
| A communication device or device includes a processor that generates and interprets signals that are transmitted and received via a communication interface. The processor receives an LDPC coded signal, via the communication interface, that is generated by puncturing at least one parity bit from another LDPC coded signal that is generated based on an LDPC code characterized by a first LDPC matrix. The processor operates on the first LDPC matrix to generate a second LDPC matrix by excluding at least one column and at least one row from the first LDPC matrix. The number of columns and rows excluded from the first LDPC matrix is based on the number of bits punctured from the other LDPC coded signal to generate the LDPC coded signal. The processor then decodes the LDPC coded signal using the second LDPC matrix to make estimates of information bits encoded within the LDPC coded signal. | ||||||
| 125 | COMPUTATIONALLY EFFICIENT CONVOLUTIONAL CODING WITH RATE-MATCHING | US14940842 | 2015-11-13 | US20160072526A1 | 2016-03-10 | Jung-Fu Cheng |
| An error coding circuit comprises a non-systematic convolutional encoder for coding an input bit stream to produce two or more groups of parity bits, an interleaver circuit for interleaving parity bits within each group of parity bits, and a rate-matching circuit for outputting a selected number of the interleaved parity bits ordered by group to obtain a desired code rate. | ||||||
| 126 | Method of codifying data or generating a block of data based on matrix with a triple diagonal structure | US14270637 | 2014-05-06 | US09240806B2 | 2016-01-19 | Jorge Vicente Blasco Claret; Salvador Iranzo Molinero; Agustin Badenes Corella |
| A method including generating a matrix. The matrix includes first and second portions. The first portion includes data bits. The second portion includes parity bits and has a triple diagonal structure. The triple diagonal structure includes a first central diagonal, a second central diagonal, and a last row diagonal. Bits of the first central diagonal, the second central diagonal, and the last row diagonal are equal to 1 and a remainder of bits in the triple diagonal structure are equal to 0. The method further includes: determining parity bits based on the matrix; if the matrix is generated to codify data for transmission from a first device to a second device, transmitting the parity bits from the first device to the second device; and if the matrix is generated based on a vector of bits received from the second device, generating a block of data based on the parity bits. | ||||||
| 127 | QoE PROVISIONING METHOD AND APPARATUS FOR MOBILE VIDEO APPLICATION | US14689703 | 2015-04-17 | US20150304737A1 | 2015-10-22 | Antony FRANKLIN; Jungshin PARK; Cheolgi LEE |
| Disclosed are a network-based quality of experience (QoE) provisioning method and apparatus for mobile video applications. A QoE provisioning method of a policy and charging rules function (PCRF) in a network includes collecting, by the PCRF, information for QoE estimation of a data flow from a user equipment measurement apparatus and a network measurement apparatus in the network, transmitting, by the PCRF, a request for the QoE estimation for the data flow, to a QoE estimation unit in the network, the data flow including information used for the QoE estimation, and transmitting, by the PCRF, a request for QoE adjustment to a server that transmits the data flow, based on the QoE estimated by the QoE estimation unit and the QoE required for the data flow. | ||||||
| 128 | Method and apparatus with error correction for dimmable visible light communication | US13893808 | 2013-05-14 | US09136870B2 | 2015-09-15 | Sang Hyun Lee |
| An apparatus and method using error correcting for visible light communication are provided. The error correction includes generating an encoded message from an original message by using a predetermined coding method, puncturing the encoded message based on a determined dimming value or rate, and/or puncturing rate, generating a scrambled message by scrambling the punctured message, and providing the scrambled message to a visible light source. | ||||||
| 129 | MEMORY CONTROLLER SUPPORTING RATE-COMPATIBLE PUNCTURED CODES | US14629228 | 2015-02-23 | US20150234704A1 | 2015-08-20 | William H. Radke |
| Apparatus and methods store data in a non-volatile solid state memory device according to a rate-compatible code, such as a rate-compatible convolutional code (RPCC). An example of such a memory device is a flash memory device. Data can initially be block encoded for error correction and detection. The block-coded data can be further convolutionally encoded. Convolutional-coded data can be punctured and stored in the memory device. The puncturing decreases the amount of memory used to store the data. Depending on conditions, the amount of puncturing can vary from no puncturing to a relatively high amount of puncturing to vary the amount of additional error correction provided and memory used. The punctured data can be decoded when data is to be read from the memory device. | ||||||
| 130 | Method and apparatus for convolutional coding to support multiplexing in a wideband communications system | US13860960 | 2013-04-11 | US09088299B2 | 2015-07-21 | Mustafa Eroz; Yezdi Antia; Lin-Nan Lee |
| An approach for encoding a physical layer (PL) header of a PL data frame is provided. The PL header comprises sixteen information bits ui, (i=0, 1, 2, . . . , 15), and the encoding is based on a convolutional code, whereby, for each information bit, five associated parity bits pi,k, (k=0, 1, 2, 3, 4) are generated, resulting in 80 codebits. The resulting 80 codebits are punctured to form a (16,77) codeword (c0, c1, c2, . . . , c76). The codebits of the (16,77) codeword are repeated to generate a (16,154) physical layer signaling codeword (c0, c0, c1, c1, c2, c2, . . . , c76, c76) for transmission of the PL data frame over a channel of a communications network. Further, for each information bit, each of the associated five parity bits is generated based on a parity bit generator, as follows: pi,k=(ui*gk,0)⊕(S0*gk,1)⊕(S1*gk,2)⊕(S2*gk,3)⊕(S3*gk,4), where S0=ui-1, S1=ui-2, S2=i-3, S3=ui-4, and wherein generator polynomials for gk=(gk,0, gk,1, gk,2, gk,3, gk,4), are as follows: g0=(1, 0, 1, 0, 1); g1=(1, 0, 1, 1, 1); g2=(1, 1, 0, 1, 1); g3=(1, 1, 1, 1, 1); g4=(1, 1, 0, 0, 1). | ||||||
| 131 | System and method for communicating with low density parity check codes | US13596846 | 2012-08-28 | US08972834B2 | 2015-03-03 | Mustafa Eroz; Lin-Nan Lee |
| The present invention provides a low density parity check (LDPC) code system and method of using such a system. A transmitted LDPC code block size may be chosen such that the minimum transmitted block size is minimized. Further, the system provides for intermediate LDPC code block size support. Finally, a common decoder architecture may be used to decode different LDPC code rates and block sizes. | ||||||
| 132 | DETECTION, AVOIDANCE AND/OR CORRECTION OF PROBLEMATIC PUNCTURING PATTERNS IN PARITY BIT STREAMS USED WHEN IMPLEMENTING TURBO CODES | US14300734 | 2014-06-10 | US20140289592A1 | 2014-09-25 | Philip J. Pietraski; Gregory S. Sternberg |
| Detecting, avoiding and/or correcting problematic puncturing patterns in parity bit streams used when implementing punctured Turbo codes is achieved without having to avoid desirable code rates. This enables identification/avoidance of regions of relatively poor Turbo code performance. Forward error correction comprising Turbo coding and puncturing achieves a smooth functional relationship between any measure of performance and the effective coding rate resulting from combining the lower rate code generated by the Turbo encoder with puncturing of the parity bits. In one embodiment, methods to correct/avoid degradations due to Turbo coding are implemented by puncturing interactions when two or more stages of rate matching are employed. | ||||||
| 133 | METHOD AND APPARATUS FOR CONVOLUTIONAL CODING TO SUPPORT MULTIPLEXING IN A WIDEBAND COMMUNICATIONS SYSTEM | US13860960 | 2013-04-11 | US20140115429A1 | 2014-04-24 | Mustafa EROZ; Yezdi ANTIA; Lin-Nan LEE |
| An approach for encoding a physical layer (PL) header of a PL data frame is provided. The PL header comprises sixteen information bits ui, (i=0, 1, 2, . . . , 15), and the encoding is based on a convolutional code, whereby, for each information bit, five associated parity bits Pi,k, (k=0, 1, 2, 3, 4) are generated, resulting in 80 codebits. The resulting 80 codebits are punctured to form a (16,77) codeword (c0, c1, c2, . . . , c76). The codebits of the (16,77) codeword are repeated to generate a (16,154) physical layer signaling codeword (c0, c0, c1, c1, c2, c2, . . . , c76, c76) for transmission of the PL data frame over a channel of a communications network. Further, for each information bit, each of the associated five parity bits is generated based on a parity bit generator, as follows: pi,k=(ui*gk,0)⊕(s0*gk,1)⊕(S1*gk,2)⊕(S2*gk,3)⊕(S3*gk,4), where S0=ui-1, S1=ui-2, S2=i-3, S3=ui-4, and wherein generator polynomials for gk=(gk,0, gk,1, gk,2, gk,3, gk,4), are as follows: g0=(1, 0, 1, 0, 1); g1=(1, 0, 1, 1, 1) ; g2=(1, 1, 0, 1, 1); g3=(1, 1, 1, 1, 1); g4=(1, 1, 0, 0, 1). | ||||||
| 134 | COMPUTATIONALLY EFFICIENT CONVOLUTIONAL CODING WITH RATE-MATCHING | US14072524 | 2013-11-05 | US20140059410A1 | 2014-02-27 | Jung-Fu Cheng |
| An error coding circuit comprises a non-systematic convolutional encoder for coding an input bit stream to produce two or more groups of parity bits, an interleaver circuit for interleaving parity bits within each group of parity bits, and a rate-matching circuit for outputting a selected number of the interleaved parity bits ordered by group to obtain a desired code rate. | ||||||
| 135 | TRAINING SEQUENCES AND CHANNEL ESTIMATION METHOD FOR SPREAD SPECTRUM BASED SYSTEMS | US13964305 | 2013-08-12 | US20140056331A1 | 2014-02-27 | Jinesh P. NAIR; Sujit JOS |
| A method of a transmitter, includes multiplying a data sequence by a first code, and multiplying a training sequence by a second code that is orthogonal to the first code. The method further includes adding the multiplied data and training sequences, and transmitting, to a receiver, the added data and training sequences. | ||||||
| 136 | METHOD AND APPARATUS WITH ERROR CORRECTION FOR DIMMABLE VISIBLE LIGHT COMMUNICATION | US13893808 | 2013-05-14 | US20130308954A1 | 2013-11-21 | Sang Hyun LEE |
| An apparatus and method using error correcting for visible light communication are provided. The error correction includes generating an encoded message from an original message by using a predetermined coding method, puncturing the encoded message based on a determined dimming value or rate, and/or puncturing rate, generating a scrambled message by scrambling the punctured message, and providing the scrambled message to a visible light source. | ||||||
| 137 | APPARATUS AND METHOD FOR TRANSMITTING/RECEIVING DATA IN COMMUNICATION SYSTEM | US13755640 | 2013-01-31 | US20130198593A1 | 2013-08-01 | Hong-Sil JEONG; Ismael Gutierrez; Sung-Ryul Yun |
| An apparatus and method for generating a parity bit sequence to be transmitted or received over a plurality of frames in a communication system are provided. The method includes puncturing a first parity bit sequence by encoding, the first parity bit sequence with a first puncturing pattern; outputting, as a basic parity bit sequence, non-punctured parity bits that are remaining after the puncturing of the first parity bit sequence with the first puncturing pattern; puncturing a second parity bit sequence that is punctured by puncturing of the first parity bit sequence with the first puncturing pattern, the second parity bit sequence with a second puncturing pattern; and outputting, as an additional parity bit sequence, non-punctured parity bits that are remaining after the puncturing of the second parity bit sequence with the second puncturing pattern. | ||||||
| 138 | COMPUTATIONALLY EFFICIENT CONVOLUTIONAL CODING WITH RATE-MATCHING | US13687903 | 2012-11-28 | US20130091407A1 | 2013-04-11 | Jung-Fu Cheng |
| An error coding circuit comprises a non-systematic convolutional encoder for coding an input bit stream to produce two or more groups of parity bits, an interleaver circuit for interleaving parity bits within each group of parity bits, and a rate-matching circuit for outputting a selected number of the interleaved parity bits ordered by group to obtain a desired code rate. | ||||||
| 139 | Detection, avoidance and/or correction of problematic puncturing patterns in parity bit streams used when implementing turbo codes | US13309962 | 2011-12-02 | US08359520B2 | 2013-01-22 | Philip J. Pietraski; Gregory S. Sternberg |
| Detecting, avoiding and/or correcting problematic puncturing patterns in parity bit streams used when implementing punctured Turbo codes is achieved without having to avoid desirable code rates. This enables identification/avoidance of regions of relatively poor Turbo code performance. Forward error correction comprising Turbo coding and puncturing achieves a smooth functional relationship between any measure of performance and the effective coding rate resulting from combining the lower rate code generated by the Turbo encoder with puncturing of the parity bits. In one embodiment, methods to correct/avoid degradations due to Turbo coding are implemented by puncturing interactions when two or more stages of rate matching are employed. | ||||||
| 140 | DETECTION, AVOIDANCE AND/OR CORRECTION OF PROBLEMATIC PUNCTURING PATTERNS IN PARITY BIT STREAMS USED WHEN IMPLEMENTING TURBO CODES | US13309962 | 2011-12-02 | US20120079344A1 | 2012-03-29 | Philip J. Pietraski; Gregory S. Sternberg |
| Detecting, avoiding and/or correcting problematic puncturing patterns in parity bit streams used when implementing punctured Turbo codes is achieved without having to avoid desirable code rates. This enables identification/avoidance of regions of relatively poor Turbo code performance. Forward error correction comprising Turbo coding and puncturing achieves a smooth functional relationship between any measure of performance and the effective coding rate resulting from combining the lower rate code generated by the Turbo encoder with puncturing of the parity bits. In one embodiment, methods to correct/avoid degradations due to Turbo coding are implemented by puncturing interactions when two or more stages of rate matching are employed. | ||||||
QQ群二维码
意见反馈
意见反馈