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

David H. Sargrad

dblp:123/8800 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1990
—ORCID · none

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

Computer networks · 2 · 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.

Theoretical computer science
2 papers
Information theory · 54% Coding theory · 46%
Computer networks
2 papers
Physical-layer communications · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
digital subscriber line
0.021990
Use of coding to combat impulse noise on digital subscriber loops · IEEE Trans. Commun. 1988
Errors-and-erasures coding to combat impulse noise on digital subscriber loops · IEEE Trans. Commun. 1990
Information theory › signal processing › denoising
impulse noise mitigation
0.011990
Errors-and-erasures coding to combat impulse noise on digital subscriber loops · IEEE Trans. Commun. 1990
Physical-layer communications › interference
crosstalk
0.011988
Use of coding to combat impulse noise on digital subscriber loops · IEEE Trans. Commun. 1988
Coding theory › error-correcting codes
convolutional codes
0.011988
Use of coding to combat impulse noise on digital subscriber loops · IEEE Trans. Commun. 1988
Information theory › communication channels › channel models
impulsive noise
0.011988
Use of coding to combat impulse noise on digital subscriber loops · IEEE Trans. Commun. 1988
Coding theory › error-correcting codes › convolutional codes › convolutional code decoding
viterbi decoding
0.011988
Use of coding to combat impulse noise on digital subscriber loops · IEEE Trans. Commun. 1988
Physical-layer communications › modulation
line coding
0.011988
Use of coding to combat impulse noise on digital subscriber loops · IEEE Trans. Commun. 1988

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

computer simulation · 0.0numerical analysis · 0.0
YearPublicationVenuePosition
1990 Errors-and-erasures coding to combat impulse noise on digital subscriber loops
abstract
The issue addressed is how closely ideal performance can be approached using a practical erasure declaration mechanism. A description is given of a specific practical erasure declaration mechanism, and the resulting coded system performance is investigated on the digital subscriber loop. Results indicate that, by appropriate choice of system parameters, it is possible to closely approach the ideal performance.>
David H. Sargrad, James W. Modestino
IEEE Trans. Commun.1
1988 Use of coding to combat impulse noise on digital subscriber loops
abstract
The authors describe an approach to combatting impulse noise (IN) on digital subscriber loops using short-constraint length convolutional codes and Viterbi decoding operating in hard-decision-and-erasure mode. Attention is restricted to time-compression-multiplexing transmission schemes using bipolar, or alternate-mark inversion (AMI), line coding, and a rather idealized IN model, although the approach and general conclusions are more broadly applicable. They discuss the tradeoffs in choosing the channel encoding rate to yield an optimum compromise between error-control protection and the combined effects of intersymbol interference and crosstalk. Numerical results are demonstrated for selected typical line configurations.>
James W. Modestino, David H. Sargrad, Robert E. Bollen
IEEE Trans. Commun.2