Patent application number | Description | Published |
20090103646 | Tiled-building-block trellis encoders - A first convolutional coder (building-block trellis coder) is used to establish a minimum squared Euclidian distance (MSED) between signal points within a coded constellation building block. A second convolutional encoder (tiling encoder) is designed to ensure that the building block's MSED is maintained between building blocks once they are tiled onto an integer lattice. When this approach is applied to the trellis code of the WiMAX standard, a 3 dB coding is realized. Recall that Wei's 16-state 4D code suffered from a 1.36 dB due to constellation expansion, resulting in a net 4.66 dB coding gain. Our building block approach recovers 1.33 dB of this loss with only a minor increase in coding complexity. We then use the building block approach to derive simpler and more powerful higher dimensional codes that provide further gains still over the Wei family of multidimensional codes. | 04-23-2009 |
20090135946 | Tiled-building-block trellis decoders - A multi-level encoded signal is encoded according to at least an upper-level code and a lower-level code. In a receiver, a modified type of a multistage decoder is deployed. The upper-level code is decoded to produce a sequence of tentative upper-level coding decisions independently of the lower-level code. The lower-level code is next decoded in such a way that the decoding is conditioned upon at least one of the tentative upper-level decisions. The lower-level decoder thereby produces a sequence of lower-level decisions. The upper-level code is then decoded a second time, this time conditioned upon at least one of the lower-level decisions, to produce a second, more reliable sequence of upper-level coding decisions. The lower-level decision sequence and the second upper-level decision sequence are delivered from the decoder as output sequences. | 05-28-2009 |
20090279422 | Single sideband and quadrature multiplexed continuous phase modulation - A class of bandwidth reduction techniques are used develop a broad class of modulation types collectively called SSB-FM. These signals can be used to construct communication systems that provide bandwidth-normalized performance gains of 10 dB or more when compared to popular prior art modulation methods. An aspect of the invention involves mapping trellis paths in a complex signal space onto corresponding real-valued trellis signals with desirable spectral properties. The invention can be used map continuous phase modulated (CPM) signals onto simpler amplitude-modulated trellis signals having double the channel capacity of prior art CPM signals. Multi-amplitude signaling and frequency division multiplexing may also be incorporated to further accommodate more information per symbol. | 11-12-2009 |
20110044398 | Hard iterative decoder for multilevel codes - Two decoding algorithms are introduced for the decoding of multi-level coded modulation and other types of coded modulation involving component codes and interleaving operations. An improved hard iterative decoding (IHID) algorithm is presented that improves upon a hard iteration decoding technique by adding a stopping criterion. Also, a list Viterbi hard iteration decoding (LV-IHID) algorithm is presented that employs list decoding in conjunction with the IHID algorithm. Both of these decoding algorithms improve upon conventional multi-stage decoding by reducing the effective error multiplicity that is observed at the lowest coding level. It is demonstrated that the LV-IHID algorithm performs close to soft iterative decoding. The computational and delay complexity of the proposed decoding algorithms compare favorably with soft iterative decoding strategies. Also, a novel labeling strategy for MLC design is presented. | 02-24-2011 |
20110044399 | List-viterbi hard iterative decoder for multilevel codes - Two decoding algorithms are introduced for the decoding of multi-level coded modulation and other types of coded modulation involving component codes and interleaving operations. An improved hard iterative decoding (IHID) algorithm is presented that improves upon a hard iteration decoding technique by adding a stopping criterion. Also, a list Viterbi hard iteration decoding (LV-IHID) algorithm is presented that employs list decoding in conjunction with the IHID algorithm. Both of these decoding algorithms improve upon conventional multi-stage decoding by reducing the effective error multiplicity that is observed at the lowest coding level. It is demonstrated that the LV-IHID algorithm performs close to soft iterative decoding. The computational and delay complexity of the proposed decoding algorithms compare favorably with soft iterative decoding strategies. Also, a novel labeling strategy for MLC design is presented. | 02-24-2011 |
20110116574 | Trellis coded modulation with periodically-reduced signal constellations - An family of improved trellis coded signaling schemes is provided that by vary the signal constellation to a smaller constellation periodically according to a pre-selected pattern. A set of specific embodiments involving periodically-reduced 4-PAM/2-PAM trellis coded schemes are disclosed that change their signal constellations periodically from 4-PAM to 2-PAM during selected intervals to improve performance. Similar periodically QAM and higher-dimensional coding schemes are also disclosed. Simplified receiver and decoder structures to decode the periodically-reduced trellis codes are also presented. The present invention allows embodiments to be produced that reduce coding complexity, reduce decoding complexity, and simplify symbol timing recovery and equalization. The cost is a moderate increase in the path memory length of the decoder. | 05-19-2011 |
20110188603 | Compact pulse shaping for QM-MSK and PAM/QAM transmission - Compact pulse shape partial response (CPS PR) signaling is developed for trellis based signals like QM-MSK, and for PAM/QAM type signals to improve the performance to bandwidth tradeoff. Compact pulse shaped signals are partial response signals that employ a very short pulse shaping filter and use Viterbi decoding to optimally detect the CPS signal in presence of its inherent inter-symbol interference. The CPS filters considered herein have much shorter impulse response than the well-known raised cosine (RC) filter. There is no need to equalize the received signal to eliminate ISI or to allow a fixed amount of ISI between received signal samples as sampled at the symbol rate as is common in partial response maximum likelihood (PRML) systems. Numerical results indicate that CPS QM-MSK and CPS QAM provides between several dB of gain, depending on constellation size, over PR-CPM and RC QAM, when compared at a given value of bandwidth, i.e., B | 08-04-2011 |
20110188613 | Compact pulse shaping for QM-MSK and PAM/QAM reception - Compact pulse shape partial response (CPS PR) signaling is developed for trellis based signals like QM-MSK, and for PAM/QAM type signals to improve the performance to bandwidth tradeoff. Compact pulse shaped signals are partial response signals that employ a very short pulse shaping filter and use Viterbi decoding to optimally detect the CPS signal in presence of its inherent inter-symbol interference. The CPS filters considered herein have much shorter impulse response than the well-known raised cosine (RC) filter. There is no need to equalize the received signal to eliminate ISI or to allow a fixed amount of ISI between received signal samples as sampled at the symbol rate as is common in partial response maximum likelihood (PRML) systems. Numerical results indicate that CPS QM-MSK and CPS QAM provides between several dB of gain, depending on constellation size, over PR-CPM and RC QAM, when compared at a given value of bandwidth, i.e., B | 08-04-2011 |
20120063533 | Encoding and decoding using constrained interleaving - Serially-concatenated codes are formed in accordance with the present invention using a constrained interleaver. The constrained interleaver cause the minimum distance of the serial concatenated code to increase above the minimum distance of the inner code alone by adding a constraint that forces some or all of the distance of the outer code onto the serially-concatenated code. This allows the serially-concatenated code to be jointly optimized in terms of both minimum distance and error coefficient to provide significant performance advantages. These performance advantages allow a noise margin target to be achieved using simpler component codes and a much shorter interleaver than was needed when using prior art codes such as Turbo codes. Decoders are also provided. Both encoding and decoding complexity can be lowered, and interleavers can be made much shorter, thereby shortening the block lengths needed in receiver elements such as equalizers and other decision-directed loops. Also, other advantages are provided such as the elimination of a error floor present in prior art serially-concatenated codes. That allows the present invention to achieve much higher performance at lower error rates such as are needed in optical communication systems. | 03-15-2012 |
20130058431 | Methods, apparatus, and systems for coding with constrained interleaving - Serially-concatenated codes are formed in accordance with the present invention using a constrained interleaver. The constrained interleaver cause the minimum distance of the serial concatenated code to increase above the minimum distance of the inner code alone by adding a constraint that forces some or all of the distance of the outer code onto the serially-concatenated code. This allows the serially-concatenated code to be jointly optimized in terms of both minimum distance and error coefficient to provide significant performance advantages. Constrained interleaving can be summarized in that it: 1) uses an outer code that is a block code or a non-recursive convolutional code, and as such, there are multiple codewords present in the constrained interleaver, 2) selects a desired MHD, 3) selects an interleaver size and a set of predefined interleaver constraints to prevent undesired (low-distance) error events so as to achieve the desired MHD, and 4) performs uniform interleaving among the allowable (non-constrained) positions, to thereby maximize or otherwise improve the interleaver gain subject to the constraints imposed to maintain the desired MHD. | 03-07-2013 |
20150039962 | Methods, apparatus, and systems for coding with constrained interleaving - Serially-concatenated codes are formed in accordance with the present invention using a constrained interleaver. The constrained interleaver cause the minimum distance of the serial concatenated code to increase above the minimum distance of the inner code alone by adding a constraint that forces some or all of the distance of the outer code onto the serially-concatenated code. This allows the serially-concatenated code to be jointly optimized in terms of both minimum distance and error coefficient to provide significant performance advantages. Constrained interleaving can be summarized in that it: 1) uses an outer code that is a block code or a non-recursive convolutional code, and as such, there are multiple codewords present in the constrained interleaver, 2) selects a desired MHD, 3) selects an interleaver size and a set of predefined interleaver constraints to prevent undesired (low-distance) error events so as to achieve the desired MHD, and 4) performs uniform interleaving among the allowable (non-constrained) positions, to thereby maximize or otherwise improve the interleaver gain subject to the constraints imposed to maintain the desired MHD. | 02-05-2015 |
20150039963 | Encoding and decoding using constrained interleaving - Serially-concatenated codes are formed in accordance with the present invention using a constrained interleaver. The constrained interleaver cause the minimum distance of the serial concatenated code to increase above the minimum distance of the inner code alone by adding a constraint that forces some or all of the distance of the outer code onto the serially-concatenated code. This allows the serially-concatenated code to be jointly optimized in terms of both minimum distance and error coefficient to provide significant performance advantages. These performance advantages allow a noise margin target to be achieved using simpler component codes and a much shorter interleaver than was needed when using prior art codes such as Turbo codes. Decoders are also provided. Both encoding and decoding complexity can be lowered, and interleavers can be made much shorter, thereby shortening the block lengths needed in receiver elements such as equalizers and other decision-directed loops. Also, other advantages are provided such as the elimination of a error floor present in prior art serially-concatenated codes. That allows the present invention to achieve much higher performance at lower error rates such as are needed in optical communication systems. | 02-05-2015 |
20150039964 | Methods, apparatus, and systems for coding with constrained interleaving - Serially-concatenated codes are formed in accordance with the present invention using a constrained interleaver. The constrained interleaver cause the minimum distance of the serial concatenated code to increase above the minimum distance of the inner code alone by adding a constraint that forces some or all of the distance of the outer code onto the serially-concatenated code. This allows the serially-concatenated code to be jointly optimized in terms of both minimum distance and error coefficient to provide significant performance advantages. Constrained interleaving can be summarized in that it: 1) uses an outer code that is a block code or a non-recursive convolutional code, and as such, there are multiple codewords present in the constrained interleaver, 2) selects a desired MHD, 3) selects an interleaver size and a set of predefined interleaver constraints to prevent undesired (low-distance) error events so as to achieve the desired MHD, and 4) performs uniform interleaving among the allowable (non-constrained) positions, to thereby maximize or otherwise improve the interleaver gain subject to the constraints imposed to maintain the desired MHD. | 02-05-2015 |
20150039965 | Methods, apparatus, and systems for coding with constrained interleaving - Serially-concatenated codes are formed in accordance with the present invention using a constrained interleaver. The constrained interleaver cause the minimum distance of the serial concatenated code to increase above the minimum distance of the inner code alone by adding a constraint that forces some or all of the distance of the outer code onto the serially-concatenated code. This allows the serially-concatenated code to be jointly optimized in terms of both minimum distance and error coefficient to provide significant performance advantages. Constrained interleaving can be summarized in that it: 1) uses an outer code that is a block code or a non-recursive convolutional code, and as such, there are multiple codewords present in the constrained interleaver, 2) selects a desired MHD, 3) selects an interleaver size and a set of predefined interleaver constraints to prevent undesired (low-distance) error events so as to achieve the desired MHD, and 4) performs uniform interleaving among the allowable (non-constrained) positions, to thereby maximize or otherwise improve the interleaver gain subject to the constraints imposed to maintain the desired MHD. | 02-05-2015 |
20150039966 | Encoding and decoding using constrained interleaving - Serially-concatenated codes are formed in accordance with the present invention using a constrained interleaver. The constrained interleaver cause the minimum distance of the serial concatenated code to increase above the minimum distance of the inner code alone by adding a constraint that forces some or all of the distance of the outer code onto the serially-concatenated code. This allows the serially-concatenated code to be jointly optimized in terms of both minimum distance and error coefficient to provide significant performance advantages. These performance advantages allow a noise margin target to be achieved using simpler component codes and a much shorter interleaver than was needed when using prior art codes such as Turbo codes. Decoders are also provided. Both encoding and decoding complexity can be lowered, and interleavers can be made much shorter, thereby shortening the block lengths needed in receiver elements such as equalizers and other decision-directed loops. Also, other advantages are provided such as the elimination of a error floor present in prior art serially-concatenated codes. That allows the present invention to achieve much higher performance at lower error rates such as are needed in optical communication systems. | 02-05-2015 |