| 序号 | 专利名 | 申请号 | 申请日 | 公开（公告）号 | 公开（公告）日 | 发明人 |
|---|---|---|---|---|---|---|
| 161 | LDPC (low density parity check) coded modulation symbol decoding | US12957238 | 2010-11-30 | US08301991B2 | 2012-10-30 | Ba-Zhong Shen; Hau Thien Tran; Kelly Brian Cameron |
| LDPC (Low Density Parity Check) coded modulation symbol decoding. Symbol decoding is supported by appropriately modifying an LDPC tripartite graph to eliminate the bit nodes thereby generating an LDPC bipartite graph (such that symbol nodes are appropriately mapped directly to check nodes thereby obviating the bit nodes). The edges that communicatively couple the symbol nodes to the check nodes are labeled appropriately to support symbol decoding of the LDPC coded modulation signal. The iterative decoding processing may involve updating the check nodes as well as estimating the symbol sequence and updating the symbol nodes. In some embodiments, an alternative hybrid decoding approach may be performed such that a combination of bit level and symbol level decoding is performed. This LDPC symbol decoding out-performs bit decoding only. In addition, it provides comparable or better performance of bit decoding involving iterative updating of the associated metrics. | ||||||
| 162 | Distributed turbocoder for block-fading channels | US12581075 | 2009-10-16 | US08301966B2 | 2012-10-30 | Emilio Calvanese Strinati; Antonio De Domenico |
| A cooperative communications system comprising a source terminal, at least one relay terminal and a destination terminal. The system also comprises a distributed turbocoder over the source terminal and at least the relay terminal. The first part of the turbocoder residing on the source terminal and/or the second part of the turbocoder residing on the relay terminal is(are) equipped with a frequency scheduler (FSr,FSs) allocating the deeper-fading carriers to the systematic information data and the weaker-fading carriers to the parity data. | ||||||
| 163 | Packet encoding method to provide unequal error protection to users and/or applications data | US13212757 | 2011-08-18 | US08219875B2 | 2012-07-10 | Sudhanshu Gaur |
| Embodiments of the invention provide a packet encoding scheme to ensure unequal error protection to different bits in a packet or in multiple packets. In one embodiment, a method to process bits in a bit stream comprises scrambling the bit stream; separating the scrambled bit stream into a high priority bit stream with an order of high priority bits from left to right and a low priority bit stream with an order of low priority bits from left to right; rearranging the bits by embedding the high priority bits in the low priority bit stream while preserving the two orders, the rearranged bit stream including blocks of bits, each block including one or more high priority bits disposed left of corresponding one or more low priority bits to provide protection for the high priority bits against noise which is at least equal to protection for the low priority bits; and modulating the rearranged bit stream using Gray encoding method to produce an encoded bit stream. | ||||||
| 164 | Transmitting apparatus with bit arrangement method | US12948341 | 2010-11-17 | US08213535B2 | 2012-07-03 | Tetsuya Yano; Kazuhisa Obuchi; Shunji Miyazaki |
| A method of transmitting data by transmitting apparatus, that includes controlling generation of bit sequences to adjust an occupation rate of systematic bits in a first data block including systematic bits and parity bits, which is obtained by encoding first data in a first encoding process, and is equal or closer to an occupation rate of systematic bits in a second data block including systematic bits and parity bits, which is obtained by encoding second data in a second encoding process, and to adjust an occupation rate of parity bits in the first data block that is closer to an occupation rate of parity bits in the second data block, in regard to first bit positions of the bit sequences generated using bits included in the first and second data blocks and performs multi-level modulation for transmission based on the generated bit sequences. | ||||||
| 165 | Method, Apparatus and Computer Program Product for Providing Improved Gray Mapping | US13347962 | 2012-01-11 | US20120106654A1 | 2012-05-03 | Mahbod Eyvazkhani |
| An apparatus for providing improved gray mapping may include a processor. The processor may be configured to divide gray value byte data into high priority portions and low priority portions distributed as constellation points in a constellation matrix and to provide separation between each of the constellation points by assigning a unique mapping code to a plurality of the constellation points. | ||||||
| 166 | LIKELIHOOD VALUE CALCULATION DEVICE, LIKELIHOOD VALUE CALCULATION METHOD, AND RADIO SYSTEM | US13321905 | 2010-05-12 | US20120069890A1 | 2012-03-22 | Hiroyuki Igura |
| A likelihood value calculation device includes: likelihood value calculation unit 201 that takes as input an equalization signal of a modulated signal, that, in accordance with a first control signal, calculates from the equalization signal that was received as input a provisional likelihood value for which the bit value of each signal point is “0” for each bit position; arithmetic inversion unit 202 that, in accordance with a second control signal, supplies for each bit position a provisional likelihood value without alteration that was supplied from likelihood value calculation unit 201 or subjects the provisional likelihood value that was supplied from likelihood value calculation unit 201 to arithmetic inversion and supplies the likelihood value following inversion; and operation control unit 200 that holds, for each combination of a radio mode and modulation mode, a control pattern that is used to control the operations of at least likelihood value calculation unit 201 and arithmetic inversion unit 202 and that generates the first and second control signals in accordance with the control pattern that is designated from among these control patterns. | ||||||
| 167 | Method, apparatus and computer program product for providing improved gray mapping | US11873861 | 2007-10-17 | US08116386B2 | 2012-02-14 | Mahbod Eyvazkhani |
| An apparatus for providing improved gray mapping may include a processor. The processor may be configured to divide gray value byte data into high priority portions and low priority portions distributed as constellation points in a constellation matrix and to provide separation between each of the constellation points by assigning a unique mapping code to a plurality of the constellation points. | ||||||
| 168 | Variable modulation with LDPC (Low Density Parity Check) coding | US13116403 | 2011-05-26 | US20110258518A1 | 2011-10-20 | Ba-Zhong Shen; Hau Thien Tran; Kelly Brian Cameron |
| Variable modulation within combined LDPC (Low Density Parity Check) coding and modulation coding systems. A novel approach is presented for variable modulation encoding of LDPC coded symbols. In addition, LDPC encoding, that generates an LDPC variable code rate signal, may also be performed as well. The encoding can generate an LDPC variable code rate and/or modulation signal whose code rate and/or modulation may vary as frequently as on a symbol by symbol basis. Some embodiments employ a common constellation shape for all of the symbols of the signal sequence, yet individual symbols may be mapped according different mappings of the commonly shaped constellation; such an embodiment may be viewed as generating a LDPC variable mapped signal. In general, any one or more of the code rate, constellation shape, or mapping of the individual symbols of a signal sequence may vary as frequently as on a symbol by symbol basis. | ||||||
| 169 | PACKET ENCODING METHOD TO PROVIDE UNEQUAL ERROR PROTECTION TO USERS AND/OR APPLICATIONS DATA | US12727553 | 2010-03-19 | US20110231728A1 | 2011-09-22 | Sudhanshu GAUR |
| Embodiments of the invention provide a packet encoding scheme to ensure unequal error protection to different bits in a packet or in multiple packets. In one embodiment, a method to process bits in a bit stream comprises scrambling the bit stream; separating the scrambled bit stream into a high priority bit stream with an order of high priority bits from left to right and a low priority bit stream with an order of low priority bits from left to right; rearranging the bits by embedding the high priority bits in the low priority bit stream while preserving the two orders, the rearranged bit stream including blocks of bits, each block including one or more high priority bits disposed left of corresponding one or more low priority bits to provide protection for the high priority bits against noise which is at least equal to protection for the low priority bits; and modulating the rearranged bit stream using Gray encoding method to produce an encoded bit stream. | ||||||
| 170 | Packet encoding method to provide unequal error protection to users and/or applications data | US12727553 | 2010-03-19 | US08020065B1 | 2011-09-13 | Sudhanshu Gaur |
| Embodiments of the invention provide a packet encoding scheme to ensure unequal error protection to different bits in a packet or in multiple packets. In one embodiment, a method to process bits in a bit stream comprises scrambling the bit stream; separating the scrambled bit stream into a high priority bit stream with an order of high priority bits from left to right and a low priority bit stream with an order of low priority bits from left to right; rearranging the bits by embedding the high priority bits in the low priority bit stream while preserving the two orders, the rearranged bit stream including blocks of bits, each block including one or more high priority bits disposed left of corresponding one or more low priority bits to provide protection for the high priority bits against noise which is at least equal to protection for the low priority bits; and modulating the rearranged bit stream using Gray encoding method to produce an encoded bit stream. | ||||||
| 171 | RADIO COMMUNICATION SYSTEM, RADIO COMMUNICATION METHOD, AND COMMUNICATION DEVICE | US13063093 | 2009-09-11 | US20110158333A1 | 2011-06-30 | Hiroshi Nakano; Kazunari Yokomakura; Yasuhiro Hamaguchi |
| A reception device (200a) transmits reception device state information indicating a modulation scheme with which the reception device is compatible, and a channel encoding method. Based on the reception device state information received, a transmission device determines a mapping method for a downlink signal to be transmitted to the reception device (200a). When the reception device (200a) is compatible with BICM-ID, the reception device (200a) transmits reception device state information indicating that the reception device (200a) is compatible with the BICM-ID. Accordingly, the backward compatibility with a communication system using gray mapping can be maintained, and the BICM-ID can be applied. | ||||||
| 172 | TRANSMITTING APPARATUS WITH BIT ARRANGEMENT METHOD | US13033715 | 2011-02-24 | US20110142167A1 | 2011-06-16 | Tetsuya YANO; Kazuhisa OBUCHI; Shunji MIYAZAKI |
| A transmitting apparatus, that includes a means for generating bit sequences to adjust an occupation rate occupied with predetermined bits included in a first data block, which is obtained by encoding first data in a first encoding process, to be equal or closer to an occupation rate occupied with predetermined bits included in a second data block, which is obtained by encoding second data in a second encoding process, in regard to first bit positions of the bit sequences generated using bits included in the first and second data blocks and a modulator for performing multi-level modulation for transmission based on the generated bit sequences. | ||||||
| 173 | Systems and methods for providing unequal error protection using embedded coding | US12210082 | 2008-09-12 | US07907070B2 | 2011-03-15 | Huaming Wu; Lizhong Zheng |
| A method for embedded encoding of at least two types of information. A first message and a second message are received. The types of a first encoder and a second encoder are determined. The rates of the first encoder and the second encoder are determined. A first codeword and a second codeword are generated. A mapping rule for the second codeword and a coding rule for the first codeword are determined. The second codeword is mapped into a plurality of symbols using the mapping rule. A third codeword is determined using the first codeword, the plurality of symbols, and the coding rule. The third codeword is then transmitted. The third codeword includes at least two types of information. | ||||||
| 174 | APPARATUS AND METHOD FOR MAPPING SYMBOL | US12922083 | 2009-03-10 | US20110026628A1 | 2011-02-03 | Dong Seung Kwon; Byung-Jae Kwak; Bum-Soo Park; Choong Il Yeh; Seung Joon Lee; Ji Hyung Kim |
| In a symbol mapping method, transmission data is encoded to generate information bits and redundancy bits. An average LLR value of bits on which the information bits are mapped is different from an average LLR value of bits on which the redundancy bits are mapped. | ||||||
| 175 | Parallel concatenated code with soft-in soft-out interactive turbo decoder | US12534604 | 2009-08-03 | US07715503B2 | 2010-05-11 | Kelly B. Cameron; Hau Thien Tran; Ba-Zhong Shen; Christopher R. Jones |
| A method for parallel concatenated (Turbo) encoding and decoding. Turbo encoders receive a sequence of input data tuples and encode them. The input sequence may correspond to a sequence of an original data source, or to an already coded data sequence such as provided by a Reed-Solomon encoder. A turbo encoder generally comprises two or more encoders separated by one or more interleavers. The input data tuples may be interleaved using a modulo scheme in which the interleaving is according to some method (such as block or random interleaving) with the added stipulation that the input tuples may be interleaved only to interleaved positions having the same modulo-N (where N is an integer) as they have in the input data sequence. If all the input tuples are encoded by all encoders then output tuples can be chosen sequentially from the encoders and no tuples will be missed. If the input tuples comprise multiple bits, the bits may be interleaved independently to interleaved positions having the same modulo-N and the same bit position. This may improve the robustness of the code. A first encoder may have no interleaver or all encoders may have interleavers, whether the input tuple bits are interleaved independently or not. Modulo type interleaving also allows decoding in parallel. | ||||||
| 176 | DISTRIBUTED TURBOCODER FOR BLOCK-FADING CHANNELS | US12581075 | 2009-10-16 | US20100115373A1 | 2010-05-06 | Emilio CALVANESE STRINATI; Antonio DE DOMENICO |
| A cooperative communications system comprising a source terminal, at least one relay terminal and a destination terminal. The system also comprises a distributed turbocoder over the source terminal and at least the relay terminal. The first part of the turbocoder residing on the source terminal and/or the second part of the turbocoder residing on the relay terminal is(are) equipped with a frequency scheduler (FSr,FSs) allocating the deeper-fading carriers to the systematic information data and the weaker-fading carriers to the parity data. | ||||||
| 177 | SYSTEMS AND METHODS FOR PROVIDING UNEQUAL ERROR PROTECTION USING EMBEDDED CODING | US12210082 | 2008-09-12 | US20100066573A1 | 2010-03-18 | Huaming Wu; Lizhong Zheng |
| A method for embedded encoding of at least two types of information is described. A first message and a second message are received. The types of a first encoder and a second encoder are determined. The rates of the first encoder and the second encoder are determined. A first codeword and a second codeword are generated. A mapping rule for the second codeword and a coding rule for the first codeword are determined. The second codeword is mapped into a plurality of symbols using the mapping rule. A third codeword is determined using the first codeword, the plurality of symbols, and the coding rule. The third codeword is then transmitted. The third codeword includes at least two types of information. | ||||||
| 178 | Parallel concatenated code with soft-in soft-out interactive turbo decoder | US12534604 | 2009-08-03 | US20090285320A1 | 2009-11-19 | Kelly B. Cameron; Hau Thien Tran; Ba-Zhong Shen; Christopher R. Jones |
| A method for parallel concatenated (Turbo) encoding and decoding. Turbo encoders receive a sequence of input data tuples and encode them. The input sequence may correspond to a sequence of an original data source, or to an already coded data sequence such as provided by a Reed-Solomon encoder. A turbo encoder generally comprises two or more encoders separated by one or more interleavers. The input data tuples may be interleaved using a modulo scheme in which the interleaving is according to some method (such as block or random interleaving) with the added stipulation that the input tuples may be interleaved only to interleaved positions having the same modulo-N (where N is an integer) as they have in the input data sequence. If all the input tuples are encoded by all encoders then output tuples can be chosen sequentially from the encoders and no tuples will be missed. If the input tuples comprise multiple bits, the bits may be interleaved independently to interleaved positions having the same modulo-N and the same bit position. This may improve the robustness of the code. A first encoder may have no interleaver or all encoders may have interleavers, whether the input tuple bits are interleaved independently or not. Modulo type interleaving also allows decoding in parallel. | ||||||
| 179 | Reception of a signal modulated according to a multilevel coding technique | US10529570 | 2003-10-01 | US07609787B2 | 2009-10-27 | Bruno Jahan; Pierrick Louin |
| A method for receiving a signal modulated according to a multilevel coding technique, comprising at least two coding levels each having different noise robustness, said signal including a plurality of symbols each comprising at least one bit, assigned to one of said coding levels, said method comprising at least one decoding iteration including successive steps of decoding each of said received bits, at least one of said decoding steps integrated the result of at least one possible previous decoding step. The invention is characterized in that it consists in decoding said bits according to a predetermined sequence taking into account the robustness of said levels, the bit(s) assigned to the decoding level having the higher noise robustness, called most robust level, being decoded first. | ||||||
| 180 | Apparatus and method for receiving signal in a communication system | US11450815 | 2006-06-09 | US07594160B2 | 2009-09-22 | Hyung-Sang Cho; Yun-Sang Park; Bong-Gee Song |
| Provided is an apparatus and method for receiving a signal in communication system. The apparatus and method includes generating a particular log-likelihood ratio (LLR) value by demapping an input signal according to a particular demapping scheme among a plurality of demapping schemes; performing a control operation of buffering the particular LLR value in a particular LLR sub-buffer for buffering an LLR value generated according to the particular demapping scheme among the plurality of LLR sub-buffers for buffering an LLR value generated according to each of the plurality of demapping schemes; and performing a control operation of reading an LLR value buffered in an LLR buffer including the plurality of LLR sub-buffers. | ||||||
QQ群二维码
意见反馈
意见反馈