Muharrem A. Tunc

dblp:134/5339 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2013
—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 · 70% Network optimization and economics · 30%

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

TopicWeightPapersLastEvidence papers
Network optimization and economics › resource allocation
bit and power loading
0.212013
Optimal LPTV-Aware Bit Loading in Broadband PLC · IEEE Trans. Commun. 2013
Physical-layer communications › modulation
multicarrier modulation
0.212013
Optimal LPTV-Aware Bit Loading in Broadband PLC · IEEE Trans. Commun. 2013
Physical-layer communications › modulation › multicarrier modulation
OFDM
0.212013
Optimal LPTV-Aware Bit Loading in Broadband PLC · IEEE Trans. Commun. 2013
Physical-layer communications › digital transmission systems › wireline communication
power line communication
0.012013
Optimal LPTV-Aware Bit Loading in Broadband PLC · IEEE Trans. Commun. 2013

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

power clipping · 0.2matroid optimization · 0.2greedy algorithm · 0.2
YearPublicationVenuePosition
2013 Optimal LPTV-Aware Bit Loading in Broadband PLC
abstract
This paper focuses on the problem of optimal bit and power allocation in linear periodically time varying (LPTV) channels in broadband (BB) power line communication (PLC). Previous work has demonstrated that improvements in bit loading can be achieved with LPTV channel adaptation via so-called microslots in time for an orthogonal frequency division multiplexing (OFDM) system. In this paper, we present that the application of a power constraint that is averaged over many microslots can be exploited for further performance improvements through loading. Due to the matroid structure of the optimization problem, greedy-type algorithms are proven to be optimal for the new LPTV-aware bit and power loading. Significant gains are attained especially at reduced transmit-power levels, where the energy per bit-transmission is also low, and for poor (i.e. high attenuation) channel conditions. Furthermore, two mechanisms are utilized to reduce the complexity of the optimal LPTV-aware bit loading and peak microslot power levels: (i) employing representative values from microslot transfer functions, and (ii) power clipping. Our results indicate that the reduced complexity LPTV-aware bit loading with power clipping performs very close to the optimal LPTV-aware bit loading, which makes it an attractive option in a practical setting.
Muharrem A. Tunc, Erik Perrins, Lutz Lampe
IEEE Trans. Commun.1