VLDB 2026 Research / reviewers in the wild / expert
Dung Ngoc Doan
dblp:197/0184
· DBLP profile ↗
3ranked-venue papers
3as first author
0since 2021 · last 2005
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 3 · 3 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% | |
| Computer networks
1 paper |
Physical-layer communications · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes
hybrid ARQ |
0.0 | 1 | 2002 | Iterative packet combining schemes for intersymbol interference channels · IEEE Trans. Commun. 2002 |
Coding theory › error-correcting codes › decoding
iterative decoding |
0.0 | 1 | 2002 | Iterative packet combining schemes for intersymbol interference channels · IEEE Trans. Commun. 2002 |
Coding theory
packet combining |
0.0 | 1 | 2002 | Iterative packet combining schemes for intersymbol interference channels · IEEE Trans. Commun. 2002 |
Coding theory › error-correcting codes › decoding › iterative decoding › iterative detection and decoding
turbo equalization |
0.0 | 1 | 2002 | Iterative packet combining schemes for intersymbol interference channels · IEEE Trans. Commun. 2002 |
Physical-layer communications › channel modeling › channel with memory
intersymbol interference channel |
0.0 | 1 | 2002 | Iterative packet combining schemes for intersymbol interference channels · IEEE Trans. Commun. 2002 |
Methods — techniques the papers use, named apart from their topics
precoding · 0.1maximum-likelihood combining · 0.1iterative equalization · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2005 | Design of good low-rate coding schemes for ISI channels based on spectral shapingabstractThis paper proposes two low-complexity coding schemes for intersymbol interference (ISI) channels that perform close to the channel capacity. The first scheme is a serial concatenation of an outer code and a spectral shaping inner code. The second scheme is a parallel concatenation of two component trellis codes that are designed to be spectrally matched to the channel. Analysis using extrinsic information transfer (EXIT) functions and bit-error-rate (BER) simulations shows that both schemes surpass the independent identically distributed (i.i.d.) channel capacity and outperform other existing schemes. Dung Ngoc Doan, Krishna Narayanan 0001 |
IEEE Trans. Wirel. Commun. | 1 |
| 2002 | Some new results on the design of codes for inter-symbol interference channels based on convergence of turbo equalizationabstractIt is well-known that iterative equalization/decoding offers good coding gains for intersymbol interference (ISI) channels. Recently, precoded ISI channels have been considered with turbo equalization which results in significant interleaving gains due to the recursive nature of precoded ISI channels. This paper presents new results pertaining to the design of codes for precoded ISI channels. An analytical proof is presented to show that precoding results in a loss in reliability during the first iteration for all 2-tap ISI channels. We compute the ratio of probability of error between nonprecoded and precoded ISI channels, which is closely related to the reliability, via a recursion. Based on this and the convergence properties of precoded and non-precoded channels, it is shown that by using a mixture of precoded and non-precoded parts, better performance can be achieved. Due to the recursiveness introduced from precoding, the codes required to achieve good performance are very simple codes and, hence, the resulting schemes provide good bit error rate performance at low receiver complexity. Dung Ngoc Doan, Krishna Narayanan 0001 |
ICC | 1 |
| 2002 | Iterative packet combining schemes for intersymbol interference channelsabstractWe study packet combining techniques for retransmission schemes over intersymbol interference (ISI) channels. Two types of combining schemes are investigated, namely, maximum-likelihood combining (MLC) and iterative combining (IC). By first employing a precoding technique and then by interpreting the ISI channel as a trellis code, the transmissions of the same data packet at different times through the channel can be treated as the parallel concatenation of recursive trellis codes. If interleavers are used in between retransmissions, "turbo" coding gains can be achieved by iterative equalization. It is shown that IC provides excellent performance and outperforms other forms of combining in terms of frame error rate performance both analytically and through simulations. Dung Ngoc Doan, Krishna Narayanan 0001 |
IEEE Trans. Commun. | 1 |