scispace - formally typeset
Search or ask a question
Author

Andre Gustavo Degraf Uchoa

Bio: Andre Gustavo Degraf Uchoa is an academic researcher from University of York. The author has contributed to research in topics: Low-density parity-check code & Fading. The author has an hindex of 7, co-authored 18 publications receiving 317 citations. Previous affiliations of Andre Gustavo Degraf Uchoa include Federal University of Technology - Paraná & Pontifical Catholic University of Rio de Janeiro.

Papers
More filters
Journal ArticleDOI
TL;DR: A novel strategy to improve the bit error rate (BER) performance of IDD schemes is devised, which takes into account the soft a posteriori output of the decoder in a block-fading channel when root-check LDPC codes are used.
Abstract: We propose iterative detection and decoding (IDD) algorithms with low-density parity-check (LDPC) codes for multiple-input multiple-output (MIMO) systems operating in block-fading and fast Rayleigh fading channels. Soft-input–soft-output minimum-mean-square-error (MMSE) receivers with successive interference cancelation are considered. In particular, we devise a novel strategy to improve the bit error rate (BER) performance of IDD schemes, which takes into account the soft a posteriori output of the decoder in a block-fading channel when root-check LDPC codes are used. A MIMO IDD receiver with soft information processing that exploits the code structure and the behavior of the log-likelihood ratios is also developed. Moreover, we present a scheduling algorithm for decoding LDPC codes in block-fading channels. Simulations show that the proposed techniques result in significant gains in terms of BER for both block-fading and fast-fading channels.

95 citations

Journal ArticleDOI
TL;DR: In this article, an iterative detection and decoding (IDD) algorithm with Low-Density Parity-Check (LDPC) codes for MIMO systems operating in block-fading and fast Rayleigh fading channels is proposed.
Abstract: We propose iterative detection and decoding (IDD) algorithms with Low-Density Parity-Check (LDPC) codes for Multiple Input Multiple Output (MIMO) systems operating in block-fading and fast Rayleigh fading channels. Soft-input soft-output minimum mean-square error receivers with successive interference cancellation are considered. In particular, we devise a novel strategy to improve the bit error rate (BER) performance of IDD schemes, which takes into account the soft \textit{a posteriori} output of the decoder in a block-fading channel when Root-Check LDPC codes are used. A MIMO IDD receiver with soft information processing that exploits the code structure and the behavior of the log likelihood ratios is also developed. Moreover, we present a scheduling algorithm for decoding LDPC codes in block-fading channels. Simulations show that the proposed techniques result in significant gains in terms of BER for both block-fading and fast-fading channels.

82 citations

Journal ArticleDOI
TL;DR: A novel algorithm to design Root-Check LDPC codes based on Progressive Edge Growth techniques for block-fading channels outperform codes constructed by the existing methods by 0.5dB.
Abstract: A novel algorithm to design Root-Check LDPC codes based on Progressive Edge Growth (PEG) techniques for block-fading channels is proposed. The performance of the new codes is investigated in terms of the Frame Error Rate (FER) and the Bit Error Rate (BER). Numerical results show that the codes constructed by the proposed algorithm outperform codes constructed by the existing methods by 0.5dB.

65 citations

Proceedings ArticleDOI
25 Oct 2012
TL;DR: The proposed PEG-based algorithm for generalised Quasi-Cyclic Root-Check LDPC codes takes into account the specific structure, and designs a parity-check matrix with a reduced number of cycles.
Abstract: Generalised Quasi-Cyclic Root-Check LDPC codes based on Progressive Edge Growth (PEG) techniques for block-fading channels are proposed. The proposed Root-Check LDPC codes are suitable for channels under F= 3, 4 independent fadings per codeword which is a scenario that has not been previously considered. A generalised Quasi-Cyclic Root-Check structure is devised for F= 3, 4 independent fadings. The proposed PEG-based algorithm for generalised Quasi-Cyclic Root-Check LDPC codes takes into account the specific structure, and designs a parity-check matrix with a reduced number of cycles. The performance of the new codes is investigated in terms of the Frame Error Rate (FER). Numerical results show that the codes constructed by the proposed algorithm perform about 0.5dB from the theoretical limit.

29 citations

Proceedings ArticleDOI
01 Nov 2011
TL;DR: The codes generated by the proposed algorithm are shown to outperform the existing methods for generating Root-Check LDPC codes.
Abstract: We propose an algorithm to design Root-Check LDPC codes based on Progressive Edge Growth (PEG) techniques for block-fading channels. The proposed algorithm imposes some restrictions on the traditional PEG algorithm to ensure that the LDPC code generated is Root-Check with the largest possible girth. The performance is investigated by means of the outage probability. By doing so, the codes generated by our proposed algorithm are shown to outperform the existing methods for generating Root-Check LDPC codes.

24 citations


Cited by
More filters
Journal ArticleDOI
TL;DR: A linear low-resolution-aware minimum mean square error detector for soft multiuser interference mitigation and a quasi-uniform quantizer with scaling factors is devised to lower the error floor of low-density parity-check codes.
Abstract: We present a novel iterative detection and decoding scheme for uplink large-scale multiuser multiple-antenna systems. In order to reduce the receiver’s energy consumption and computational complexity, 1-bit analog-to-digital converters are used in the front-end. The performance loss due to the 1-bit quantization can be mitigated by using large-scale antenna arrays. We propose a linear low-resolution-aware minimum mean square error detector for soft multiuser interference mitigation. Moreover, short block length low-density parity-check codes are considered for avoiding high latency. In the channel decoder, a quasi-uniform quantizer with scaling factors is devised to lower the error floor of low-density parity-check codes. Simulations show good performance of the system in terms of bit error rate as compared to prior work.

102 citations

Journal ArticleDOI
TL;DR: A novel strategy to improve the bit error rate (BER) performance of IDD schemes is devised, which takes into account the soft a posteriori output of the decoder in a block-fading channel when root-check LDPC codes are used.
Abstract: We propose iterative detection and decoding (IDD) algorithms with low-density parity-check (LDPC) codes for multiple-input multiple-output (MIMO) systems operating in block-fading and fast Rayleigh fading channels. Soft-input–soft-output minimum-mean-square-error (MMSE) receivers with successive interference cancelation are considered. In particular, we devise a novel strategy to improve the bit error rate (BER) performance of IDD schemes, which takes into account the soft a posteriori output of the decoder in a block-fading channel when root-check LDPC codes are used. A MIMO IDD receiver with soft information processing that exploits the code structure and the behavior of the log-likelihood ratios is also developed. Moreover, we present a scheduling algorithm for decoding LDPC codes in block-fading channels. Simulations show that the proposed techniques result in significant gains in terms of BER for both block-fading and fast-fading channels.

95 citations

Journal ArticleDOI
TL;DR: This paper presents cost-effective low-rank techniques for designing robust adaptive beamforming algorithms based on the exploitation of the cross-correlation between the array observation data and the output of the beamformer, resulting in the proposed orthogonal Krylov subspace projection mismatch estimation (OKSPME) method.
Abstract: This paper presents cost-effective low-rank techniques for designing robust adaptive beamforming (RAB) algorithms. The proposed algorithms are based on the exploitation of the cross-correlation between the array observation data and the output of the beamformer. First, we construct a general linear equation considered in large dimensions whose solution yields the steering vector mismatch. Then, we employ the idea of the full orthogonalization method (FOM), an orthogonal Krylov subspace based method, to iteratively estimate the steering vector mismatch in a reduced-dimensional subspace, resulting in the proposed orthogonal Krylov subspace projection mismatch estimation (OKSPME) method. We also devise adaptive algorithms based on stochastic gradient (SG) and conjugate gradient (CG) techniques to update the beamforming weights with low complexity and avoid any costly matrix inversion. The main advantages of the proposed low-rank and mismatch estimation techniques are their cost-effectiveness when dealing with high-dimension subspaces or large sensor arrays. Simulations results show excellent performance in terms of the output signal-to-interference-plus-noise ratio (SINR) of the beamformer among all the compared RAB methods.

84 citations

Journal ArticleDOI
TL;DR: In this article, an iterative detection and decoding (IDD) algorithm with Low-Density Parity-Check (LDPC) codes for MIMO systems operating in block-fading and fast Rayleigh fading channels is proposed.
Abstract: We propose iterative detection and decoding (IDD) algorithms with Low-Density Parity-Check (LDPC) codes for Multiple Input Multiple Output (MIMO) systems operating in block-fading and fast Rayleigh fading channels. Soft-input soft-output minimum mean-square error receivers with successive interference cancellation are considered. In particular, we devise a novel strategy to improve the bit error rate (BER) performance of IDD schemes, which takes into account the soft \textit{a posteriori} output of the decoder in a block-fading channel when Root-Check LDPC codes are used. A MIMO IDD receiver with soft information processing that exploits the code structure and the behavior of the log likelihood ratios is also developed. Moreover, we present a scheduling algorithm for decoding LDPC codes in block-fading channels. Simulations show that the proposed techniques result in significant gains in terms of BER for both block-fading and fast-fading channels.

82 citations