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

A. H. W. Zhang

dblp:80/3905 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2007
—ORCID · none

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

Computer networks · 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 · 65% Algorithmic game theory and mechanism design · 22% Information theory · 13%

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

TopicWeightPapersLastEvidence papers
Coding theory
channel coding
0.112007
Capacity-Approaching Turbo Coding For Half-Duplex Relaying · IEEE Trans. Commun. 2007
Algorithmic game theory and mechanism design › prediction markets
information aggregation
0.112007
Capacity-Approaching Turbo Coding For Half-Duplex Relaying · IEEE Trans. Commun. 2007
Coding theory › error-correcting codes › decoding
iterative decoding
0.112007
Capacity-Approaching Turbo Coding For Half-Duplex Relaying · IEEE Trans. Commun. 2007
Coding theory › channel coding
turbo codes
0.112007
Capacity-Approaching Turbo Coding For Half-Duplex Relaying · IEEE Trans. Commun. 2007
Information theory › network information theory › relay channel
half-duplex relaying
0.012007
Capacity-Approaching Turbo Coding For Half-Duplex Relaying · IEEE Trans. Commun. 2007
Information theory › network information theory
relay channel
0.012007
Capacity-Approaching Turbo Coding For Half-Duplex Relaying · IEEE Trans. Commun. 2007

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

partial decoding · 0.1information-theoretic optimization · 0.1
YearPublicationVenuePosition
2007 Capacity-Approaching Turbo Coding For Half-Duplex Relaying
abstract
In this paper, we develop capacity-approaching turbo-coding schemes for half-duplex relay systems as an extension of our previous work on coding for full-duplex relays. We consider the use of specific signal constellations (e.g., binary phase-shift keying) in transmission, develop practical coding schemes to be used at the source and the relay nodes, and describe a suitable information combining technique at the destination node. Unlike the full-duplex relay systems, the destination node does not perform joint decoding of multiple consecutive blocks; instead, it works with one frame at a time. Furthermore, for the half-duplex relaying scheme, the optimization of the length of the listening period for the relay node is an issue. By utilizing information theoretical tools, we perform this optimization and use it in the development of our capacity-approaching coding/decoding schemes. Specifically, when the fraction of time turns out to be less than the transmission rate, the relay node is unable to decode all the information bits transmitted, and a partial decoding approach has to be used. Through a comprehensive set of examples, we observe that the proposed scheme is promising to approach the corresponding information theoretical limits (bounds). In particular, for all the cases studied, we have obtained bit error rates of 10-5or lower within 1--1.5 dB (in most cases, almost within 1.2 dB) of the constrained capacity under a variety of channel conditions. Extensions of the proposed scheme to coded modulation and to multiple-input multiple-output systems are also described.
A. H. W. Zhang, R. Y. M. Duman
IEEE Trans. Commun.1