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

S. E. Nader

dblp:272/1879 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1978
—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%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › modulation
pulse shaping
0.011978
On Designing PAM Pulses Optimally Tolerant to Timing Jitter · IEEE Trans. Commun. 1978
Physical-layer communications › synchronization
jitter tolerance
0.011978
On Designing PAM Pulses Optimally Tolerant to Timing Jitter · IEEE Trans. Commun. 1978

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

poisson sum formula · 0.0maximally flat design · 0.0
YearPublicationVenuePosition
1978 On Designing PAM Pulses Optimally Tolerant to Timing Jitter
abstract
This paper deals with the design of bandlimited baseband PAM pulses that are optimally tolerant to timing jitter in a maximally flat sense. In this design the bandwidth can be chosen arbitrarily. The resulting time responses are relatively insensitive to small amounts of timing jitter and so represent an optimal solution for this type of impairment. Analytic results are derived in the frequency domain after translating conditions on maximal flatness from the time domain into the frequency domain by means of the Poisson sum formula.
L. F. Lind, S. E. Nader
IEEE Trans. Commun.2