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

Matthew D. Dorrance

dblp:88/8814 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2010
—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.

Computer networks
1 paper
Physical-layer communications · 83% Network optimization and economics · 17%
Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › modulation
adaptive modulation and coding
0.112010
Adaptive Discrete-Rate MIMO Communications with Rate-Compatible LDPC Codes · IEEE Trans. Commun. 2010
Physical-layer communications
MIMO
0.112010
Adaptive Discrete-Rate MIMO Communications with Rate-Compatible LDPC Codes · IEEE Trans. Commun. 2010
Physical-layer communications › channel coding › error control coding › block codes › LDPC codes
rate-compatible LDPC codes
0.112010
Adaptive Discrete-Rate MIMO Communications with Rate-Compatible LDPC Codes · IEEE Trans. Commun. 2010
Coding theory › error-correcting codes › hybrid ARQ
incremental redundancy
0.112010
Adaptive Discrete-Rate MIMO Communications with Rate-Compatible LDPC Codes · IEEE Trans. Commun. 2010
Coding theory › error-correcting codes
LDPC codes
0.112010
Adaptive Discrete-Rate MIMO Communications with Rate-Compatible LDPC Codes · IEEE Trans. Commun. 2010
Coding theory › error-correcting codes › forward error correction
rate-compatible codes
0.112010
Adaptive Discrete-Rate MIMO Communications with Rate-Compatible LDPC Codes · IEEE Trans. Commun. 2010
Network optimization and economics › resource allocation
bit and power loading
0.012010
Adaptive Discrete-Rate MIMO Communications with Rate-Compatible LDPC Codes · IEEE Trans. Commun. 2010
Network optimization and economics
resource allocation
0.012010
Adaptive Discrete-Rate MIMO Communications with Rate-Compatible LDPC Codes · IEEE Trans. Commun. 2010

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

water-filling algorithm · 0.2adaptive coding and modulation · 0.2
YearPublicationVenuePosition
2010 Adaptive Discrete-Rate MIMO Communications with Rate-Compatible LDPC Codes
abstract
By using rate-compatible (RC) low density parity-check (LDPC) codes with adaptive modulation, we propose an adaptive, discrete-rate multiple-input multiple-output (MIMO) communications system. Given the high spectral efficiency of MIMO and the flexibility of an incremental redundancy (IR) protocol, combined with adaptive coding and modulation (ACM), the designed communications system is capable of achieving high data rates, for a low amount of overhead. A novel ACM power- and bit-allocation protocol is proposed to implement this system. We adapt the existing water-filling algorithm (WFA) to the discrete and finite bit rate constraints inherent in any communications system. This constrained WFA is shown to significantly improve the throughput performance of the communications system, over the case where a regular WFA is used. The results given in this paper show that the combination of IR and ACM with MIMO creates a wireless communications system that can easily adapt to channel fluctuations and provide high-data rates.
Matthew D. Dorrance, Ian D. Marsland
IEEE Trans. Commun.1