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 N. O. Sadiku

dblp:66/2363 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2006
—ORCID · unresolved

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

Computer networks · 1

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 · 92% Network optimization and economics · 8%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › transmission design › adaptive transmission
bit loading
0.112006
A new parallel greedy bit-loading algorithm with fairness for multiple users in a DMT system · IEEE Trans. Commun. 2006
Physical-layer communications › digital subscriber line
discrete multitone
0.112006
A new parallel greedy bit-loading algorithm with fairness for multiple users in a DMT system · IEEE Trans. Commun. 2006
Physical-layer communications
modulation
0.112006
A new parallel greedy bit-loading algorithm with fairness for multiple users in a DMT system · IEEE Trans. Commun. 2006
Physical-layer communications › multiuser systems
multiuser communication
0.012006
A new parallel greedy bit-loading algorithm with fairness for multiple users in a DMT system · IEEE Trans. Commun. 2006
Network optimization and economics
resource allocation
0.012006
A new parallel greedy bit-loading algorithm with fairness for multiple users in a DMT system · IEEE Trans. Commun. 2006

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

greedy algorithm · 0.1
YearPublicationVenuePosition
2006 A new parallel greedy bit-loading algorithm with fairness for multiple users in a DMT system
abstract
This letter first reviews the multiuser bit-loading algorithms for discrete multitone systems. Then an improved algorithm is proposed, which allows several users to get additional bits in parallel. It reduces the number of iterations dramatically. A new fairness coefficient is also introduced to reduce the variance of the data rate among users
Cajetan M. Akujuobi, Matthew N. O. Sadiku
IEEE Trans. Commun.3