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

Cheng-Kun Wang

dblp:119/4705 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1995
—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 · 100%
Theoretical computer science
1 paper
Information theory · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › modulation
bandwidth-efficient signaling
0.011995
Practically realizable digital transmission significantly below the Nyquist bandwidth · IEEE Trans. Commun. 1995
Physical-layer communications
modulation
0.011995
Practically realizable digital transmission significantly below the Nyquist bandwidth · IEEE Trans. Commun. 1995
Physical-layer communications › modulation › pulse modulation
pulse amplitude modulation
0.011995
Practically realizable digital transmission significantly below the Nyquist bandwidth · IEEE Trans. Commun. 1995
Information theory
channel capacity
0.011995
Practically realizable digital transmission significantly below the Nyquist bandwidth · IEEE Trans. Commun. 1995

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

signal construction · 0.0iterative procedure · 0.0
YearPublicationVenuePosition
1995 Practically realizable digital transmission significantly below the Nyquist bandwidth
abstract
Proposes a practically realizable digital signaling scheme that requires a bandwidth significantly below the Nyquist limit, and at the same time achieves the same asymptotic performance as memoryless PAM. A five-step iterative procedure for constructing such schemes is presented, and examples that occupy down to about 60 percent of the Nyquist bandwidth are demonstrated using this simple procedure. Practical receiver structures are also briefly discussed.>
Cheng-Kun Wang, Lin-Shan Lee
IEEE Trans. Commun.1