The Experts below are selected from a list of 528 Experts worldwide ranked by ideXlab platform
Faramarz Fekri - One of the best experts on this subject based on the ideXlab platform.
-
Finite-length rate-compatible LDPC codes: a novel Puncturing scheme - [transactions letters]
IEEE Transactions on Communications, 2009Co-Authors: Badri N. Vellambi, Faramarz FekriAbstract:In this paper, we study rate-compatible Puncturing of finite-length low-density parity-check (LDPC) codes. We present a novel rate-compatible Puncturing scheme that is easy to implement. Our scheme uses the idea that the degradation in performance is reduced by selecting a Puncturing Pattern wherein the punctured bits are far apart from each other in the Tanner graph of the code. Although the Puncturing scheme presented is tailored to regular codes, it is also directly applicable to irregular parent ensembles. By simulations, the proposed rate-compatible Puncturing scheme is shown to be superior to the existing Puncturing methods for both regular and irregular LDPC codes over the binary erasure channel (BEC) and the additive white Gaussian noise (AWGN) channel.
Per-arne Wiberg - One of the best experts on this subject based on the ideXlab platform.
-
Optimal type-II concatenated hybrid ARQ using single parity check codes
2003Co-Authors: Elisabeth Uhlemann, Lars K. Rasmussen, Alex Grant, Per-arne WibergAbstract:Abstract: We consider an incremental redundancy (IR) type-II hybrid ARQ scheme based on multidimensional single parity check (SPC) product codes. Random interleaving is applied between dimensions, resulting in equivalent systematic, parallel or serially concatenated SPC codes. This enables larger interleavers and a larger range of overall code rates. The Puncturing Pattern used for IR transmissions of the concatenated SPC codes is chosen specifically to reduce decoder complexity for the hybrid ARQ scheme, activating only those constituent decoders for which parity bits have been received. Given the proposed Puncturing Pattern and a maximum number of allowable transmissions, an approach for determining the optimal number of parity bits per IR transmission in terms o
-
Optimal type-II concatenated hybrid ARQ using single parity check codes
2003Co-Authors: Elisabeth Uhlemann, Lars K. Rasmussen, Alex Grant, Per-arne WibergAbstract:We consider an incremental redundancy (IR) type-II hybrid ARQ scheme based on multidimensional single parity check (SPC) product codes. Random interleaving is applied between dimensions, resulting in equivalent systematic, parallel or serially concatenated SPC codes. This enables larger interleavers and a larger range of overall code rates. The Puncturing Pattern used for IR transmissions of the concatenated SPC codes is chosen specifically to reduce decoder complexity for the hybrid ARQ scheme, activating only those constituent decoders for which parity bits have been received. Given the proposed Puncturing Pattern and a maximum number of allowable transmissions, an approach for determining the optimal number of parity bits per IR transmission in terms of maximizing the overall code rate, is suggested. With this strategy, each data frame is accepted following the transmission of a minimum number of parity bits.
-
Optimal Incremental-redundancy strategy for type-II hybrid ARQ
IEEE International Symposium on Information Theory 2003. Proceedings., 2003Co-Authors: Elisabeth Uhlemann, Lars K. Rasmussen, Alex Grant, Per-arne WibergAbstract:Given a type-II hybrid ARQ scheme, we propose a general solution to find the optimal partitioning of n-k parity bits over at most M transmissions. The solution is in terms of maximizing the average code rate for a given Puncturing Pattern.
Yeong-luh Ueng - One of the best experts on this subject based on the ideXlab platform.
-
VTC Spring - A Rate-Compatible Low-Density Parity-Check Convolutional Coding Scheme Using Informed Dynamic Scheduling
2017 IEEE 85th Vehicular Technology Conference (VTC Spring), 2017Co-Authors: Huang-chang Lee, Yeong-luh UengAbstract:Low-density parity-check convolutional codes (LDPC-CCs) are generally decoded using sliding- window based message passing decoding. Based on the sliding-window decoding, an informed dynamic scheduling (IDS) for LDPC-CC is proposed in this work, where the decoding convergence can be significantly accelerated. Since the number of processors required for a satisfactory performance can be reduced, the decoder can be simplified. A set of rate-compatible (RC) Puncturing Patterns is also proposed and is used to construct RC LDPC-CCs for the performance evaluation of the proposed IDS. Although the proposed Puncturing Pattern cannot be optimized for individual code rate owing to the rate-compatible constraint, they can still provide a comparable error rate performance compared to the codes defined in the IEEE 802.16m standard. It is worth noting that these standard codes are not rate-compatible.
Javier Garcia-frias - One of the best experts on this subject based on the ideXlab platform.
-
Rate-compatible low-density generator matrix codes
IEEE Transactions on Communications, 2008Co-Authors: Hanqing Lou, Javier Garcia-friasAbstract:We propose a family of rate-compatible codes based on the concatenation of two linear codes with low-density generator matrix, which are a special class of LDPC codes with low encoding complexity. The proposed scheme is characterized by its simplicity of construction, and does not require optimization of the Puncturing Pattern.
Badri N. Vellambi - One of the best experts on this subject based on the ideXlab platform.
-
Finite-length rate-compatible LDPC codes: a novel Puncturing scheme - [transactions letters]
IEEE Transactions on Communications, 2009Co-Authors: Badri N. Vellambi, Faramarz FekriAbstract:In this paper, we study rate-compatible Puncturing of finite-length low-density parity-check (LDPC) codes. We present a novel rate-compatible Puncturing scheme that is easy to implement. Our scheme uses the idea that the degradation in performance is reduced by selecting a Puncturing Pattern wherein the punctured bits are far apart from each other in the Tanner graph of the code. Although the Puncturing scheme presented is tailored to regular codes, it is also directly applicable to irregular parent ensembles. By simulations, the proposed rate-compatible Puncturing scheme is shown to be superior to the existing Puncturing methods for both regular and irregular LDPC codes over the binary erasure channel (BEC) and the additive white Gaussian noise (AWGN) channel.
