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

Robert D. Maddock

dblp:83/289 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2006
—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 · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › coded modulation
bit-interleaved coded modulation
0.112006
Reliability-based coded modulation with low-density parity-check codes · IEEE Trans. Commun. 2006
Coding theory › channel coding › turbo codes
interleaver design
0.112006
Reliability-based coded modulation with low-density parity-check codes · IEEE Trans. Commun. 2006
Coding theory › error-correcting codes › decoding
iterative decoding
0.112006
Reliability-based coded modulation with low-density parity-check codes · IEEE Trans. Commun. 2006
Coding theory › error-correcting codes
LDPC codes
0.112006
Reliability-based coded modulation with low-density parity-check codes · IEEE Trans. Commun. 2006
Coding theory › error-correcting codes › decoding › decoding algorithms
reliability-based decoding
0.112006
Reliability-based coded modulation with low-density parity-check codes · IEEE Trans. Commun. 2006

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

search algorithm · 0.1density evolution · 0.1
YearPublicationVenuePosition
2006 Reliability-based coded modulation with low-density parity-check codes
abstract
In this letter, we consider the interleaver design in bit-interleaved coded modulation (BICM) with low-density parity-check (LDPC) codes. The design paradigm is to provide more coding protection through iterative decoding to bits that are less protected by modulation (and are thus less reliable at the output of the demodulator). The design is carried out by an ad hoc search algorithm over the column permutations of the parity-check matrix. Our simulations show that the proposed reliability-based coded modulation scheme can improve the error-rate performance of conventional BICM schemes based on regular LDPC codes by a few tenths of a decibel, with no added complexity.
Robert D. Maddock, Amir H. Banihashemi
IEEE Trans. Commun.1