Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Thuy Van Nguyen

dblp:43/10800 · DBLP profile ↗
← Back
5ranked-venue papers
5as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 4 · 4 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
LDPC codes
0.112012
The Design of Rate-Compatible Protograph LDPC Codes · IEEE Trans. Commun. 2012
Coding theory › error-correcting codes › LDPC codes
protograph LDPC codes
0.112012
The Design of Rate-Compatible Protograph LDPC Codes · IEEE Trans. Commun. 2012
Coding theory › error-correcting codes › forward error correction
rate-compatible codes
0.112012
The Design of Rate-Compatible Protograph LDPC Codes · IEEE Trans. Commun. 2012
Coding theory › error-correcting codes
hybrid ARQ
0.012012
The Design of Rate-Compatible Protograph LDPC Codes · IEEE Trans. Commun. 2012

Methods — techniques the papers use, named apart from their topics

puncturing · 0.1protograph extension · 0.1
YearPublicationVenuePosition
2013 Bilayer Protograph Codes for Half-Duplex Relay Channels
abstract
Despite encouraging advances in the design of relay codes, several important challenges remain. Many of the existing LDPC relay codes are tightly optimized for fixed channel conditions and not easily adapted without extensive re-optimization of the code. Some have high encoding complexity and some need long block lengths to approach capacity. This paper presents a high-performance protograph-based LDPC coding scheme for the half-duplex relay channel that addresses simultaneously several important issues: structured coding that permits easy design, low encoding complexity, embedded structure for convenient adaptation to various channel conditions, and performance close to capacity with a reasonable block length. The application of the coding structure to multi-relay networks is demonstrated. Finally, a simple new methodology for evaluating the end-to-end error performance of relay coding systems is developed and used to highlight the performance of the proposed codes.
Thuy Van Nguyen, Aria Nosratinia, Dariush Divsalar
IEEE Trans. Wirel. Commun.1
2012 Protograph-based LDPC codes for partial response channels
abstract
This paper addresses the design of a protograph-based LDPC code which can approach the independent and uniformly distributed (i.u.d.) capacity of partial response channels. We propose a method to calculate the iterative decoding threshold of a joint graph between a protograph and the state structure of a partial response channel using the extrinsic information transfer (EXIT) chart. We then describe a simple method to search for a protograph code whose threshold is close to the i.u.d. capacity limit. This new class of codes is needed because experiments show a protograph that is capacity approaching in the AWGN channel may not perform well in partial response channels. In particular, protographs with punctured nodes are often used to produce good AWGN codes, but they perform poorly with the BCJR equalizer. Numerical results support our analysis.
Thuy Van Nguyen, Aria Nosratinia, Dariush Divsalar
ICC1
2012 The Design of Rate-Compatible Protograph LDPC Codes
abstract
This paper presents a simple yet effective method for designing nested families of LDPC codes. Rate compatible codes are essential for many communication applications, e.g. hybrid automatic repeat request (HARQ) systems, and their design is nontrivial due to the difficulty of simultaneously guaranteeing the quality of several related codes. Puncturing can be used to generate rate-compatible LDPC codes, but it produces a gap to capacity that, in practice, often significantly exceeds the gap of the mother code. We propose an alternative method based on successively extending a high-rate protograph. The resulting codes not only inherit the advantages of protograph codes, namely low encoding complexity and efficient decoding algorithms, but also cover a wide range of rates and have very good performance with iterative decoding thresholds that are within 0.2 dB of their capacity limits.
Thuy Van Nguyen, Aria Nosratinia, Dariush Divsalar
IEEE Trans. Commun.1
2011 Threshold of Protograph-Based LDPC Coded BICM for Rayleigh Fading
abstract
Protograph-based bit-interleaved coded modulation (BICM) provides an elegant way of designing coded modulation over Rayleigh faded channels, however, to date the available designs have been limited to specific modulations and the corresponding decoding thresholds have not been known for Rayleigh faded channels. In this work, we present a simple method for designing protograph-based BICM that is general and applies to any modulation, and furthermore we calculate the iterative decoding thresholds of the protograph codes while mapped to higher order modulations. This general coding framework can support not only multiple rates but also adaptive modulation. We report that certain families of protograph codes achieve a threshold within a gap of approximately 0.2 - 0.4 dB of BICM capacity limit across a wide range of rates and modulations.
Thuy Van Nguyen, Aria Nosratinia, Dariush Divsalar
GLOBECOM1
2010 Bilayer protograph codes for half-duplex relay channels
abstract
This paper presents a high-performing LDPC code for the relay channel that addresses simultaneously two important issues: a code structure that allows low encoding complexity, and a flexible rate-compatible code that allows matching to various channel conditions. Most of the previous high-performance LDPC codes for the relay channel are tightly optimized for a given channel quality and are not easily adapted, without extensive re-optimization, for various channel conditions. This paper presents a code for the relay channel that combines structured design and easy encoding with rate compatibility to allow adaptation to the three links involved in the relay channel, and furthermore offers very good performance. The proposed code is constructed by synthesizing a bilayer structure with a protograph. In addition to the contribution to relay encoding, we also produce an improved family of protograph codes for the point-to-point AWGN channel whose high-rate members enjoy thresholds that are within 0.07 dB of capacity.
Thuy Van Nguyen, Aria Nosratinia, Dariush Divsalar
ISIT1