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.

M. G. Pelchat

dblp:271/5560 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 1981
—ORCID · none

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

Computer networks · 3 · 2 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
Coding theory · 87% Information theory · 13%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › spread spectrum
direct-sequence spread spectrum
0.011981
Comments on "Optimization of the Processing Gain of an M-ary Direct Sequence Spread Spectrum Communication System" · IEEE Trans. Commun. 1981
Physical-layer communications › spread spectrum
processing gain optimization
0.011981
Comments on "Optimization of the Processing Gain of an M-ary Direct Sequence Spread Spectrum Communication System" · IEEE Trans. Commun. 1981
Physical-layer communications
spread spectrum
0.011981
Comments on "Optimization of the Processing Gain of an M-ary Direct Sequence Spread Spectrum Communication System" · IEEE Trans. Commun. 1981
Coding theory › constrained coding
line codes
0.011975
Surprising Properties of Two-Level "Bandwidth Compaction" Codes · IEEE Trans. Commun. 1975
Coding theory › constrained coding
runlength-limited codes
0.011975
Surprising Properties of Two-Level "Bandwidth Compaction" Codes · IEEE Trans. Commun. 1975
Information theory
channel capacity
0.011975
Surprising Properties of Two-Level "Bandwidth Compaction" Codes · IEEE Trans. Commun. 1975

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

signal-to-noise ratio analysis · 0.0PAM comparison · 0.0
YearPublicationVenuePosition
1981 Comments on "Optimization of the Processing Gain of an M-ary Direct Sequence Spread Spectrum Communication System"
John M. Geist, M. G. Pelchat, R. E. Totty
IEEE Trans. Commun.2
1976 Correction to "Surprising Properties of Two-Level ́Bandwidth Compactioń Codes"
M. G. Pelchat, John M. Geist
IEEE Trans. Commun.1
1975 Surprising Properties of Two-Level "Bandwidth Compaction" Codes
abstract
This paper investigates some of the properties of a class of two-level codes with constrained run length, whose use has been proposed for purposes of bandwidth compression. It is shown that such codes can indeed reduce the bandwidth containing a given percentage of the transmitted power. To communicate information, however, different transmitted codewords must be distinguishable at the receiver, and this requires that the channel bandwidth be sufficiently wide to allow the difference waveform to propagate. It is demonstrated that decreasing theX-percent bandwidth using these codes leads to a rapid increase in the difference waveform bandwidth, and hence in the channel bandwidth necessary to maintain error rate performance. Thus, these codes are bandwidth expansion codes in disguise. Signal-to-noise ratio and channel bandwidth requirements for these codes are discussed and compared with those ofM-level codes [pulse-amplitude modulation (PAM)] for two kinds of receivers.
M. G. Pelchat, John M. Geist
IEEE Trans. Commun.1