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

Alex Glinowiecki

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

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 · 100%
Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › hardware impairments
clipping
0.012000
Level clipped high-order OFDM · IEEE Trans. Commun. 2000
Physical-layer communications › modulation
multicarrier modulation
0.012000
Level clipped high-order OFDM · IEEE Trans. Commun. 2000
Physical-layer communications › modulation › multicarrier modulation
OFDM
0.012000
Level clipped high-order OFDM · IEEE Trans. Commun. 2000
Physical-layer communications › modulation › multicarrier modulation › OFDM
peak-to-average power ratio reduction
0.012000
Level clipped high-order OFDM · IEEE Trans. Commun. 2000
Physical-layer communications
signal processing for communications
0.012000
Level clipped high-order OFDM · IEEE Trans. Commun. 2000
Coding theory › error-correcting codes
error probability analysis
0.012000
Level clipped high-order OFDM · IEEE Trans. Commun. 2000

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

asymptotic analysis · 0.1
YearPublicationVenuePosition
2000 Level clipped high-order OFDM
abstract
The asymptotic behavior of level clipped orthogonal frequency-division multiplexing when its order N approaches infinity is analyzed. It is shown that if the clipping level approaches infinity faster than /spl radic/lnN, then a zero bit-error rate penalty and arbitrarily large peak to-average power ratio (PAPR) gain are asymptotically obtained. Moreover, the expression for the probability of clipping is found, and using it, the upper bound of the probability of error is derived. This upper bound can be used to analyze the tradeoff between PAPR and probability of error.
Dov Wulich, Nati Dinur, Alex Glinowiecki
IEEE Trans. Commun.3