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

John B. Bodie

dblp:99/10924 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2001
—ORCID · none

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

Computer networks · 1Theory of computation · 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 · 81% Wireless networking · 19%
Theoretical computer science
1 paper
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Wireless networking › medium access control
carrier sensing
0.012001
Carrier detection of PSK signals · IEEE Trans. Commun. 2001
Physical-layer communications › spread spectrum
direct-sequence spread spectrum
0.012001
Carrier detection of PSK signals · IEEE Trans. Commun. 2001
Physical-layer communications
modulation
0.012001
Carrier detection of PSK signals · IEEE Trans. Commun. 2001
Physical-layer communications › modulation
phase-shift keying
0.012001
Carrier detection of PSK signals · IEEE Trans. Commun. 2001
Physical-layer communications
spread spectrum
0.012001
Carrier detection of PSK signals · IEEE Trans. Commun. 2001
Physical-layer communications
signal detection
0.012001
Carrier detection of PSK signals · IEEE Trans. Commun. 2001
Coding theory › source coding › predictive coding
delta modulation
0.011975
Tree encoding of speech · IEEE Trans. Inf. Theory 1975
Coding theory
source coding
0.011975
Tree encoding of speech · IEEE Trans. Inf. Theory 1975
Coding theory › source coding › lossy source coding
speech coding
0.011975
Tree encoding of speech · IEEE Trans. Inf. Theory 1975
Coding theory › source coding
tree coding
0.011975
Tree encoding of speech · IEEE Trans. Inf. Theory 1975
Coding theory › source coding › rate-distortion theory
autoregressive source
0.011975
Tree encoding of speech · IEEE Trans. Inf. Theory 1975
Coding theory › source coding
rate-distortion theory
0.011975
Tree encoding of speech · IEEE Trans. Inf. Theory 1975

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

nonlinear device analysis · 0.0analytical SNR derivation · 0.0simulation · 0.0m-algorithm · 0.0
YearPublicationVenuePosition
2001 Carrier detection of PSK signals
abstract
This paper reports on a theoretical study of the detection of the 2f and 4f carrier components of phase-shift keying (PSK) signals produced by passing signal and noise through a nonlinear device. Unbalanced quadrature PSK (QPSK) signals, i.e., QPSK signals with unequal power in the two channels, are studied. The complete range of channel power ratio is covered, with equal emphasis on the general unbalanced case and the two limiting cases of binary PSK and (balanced) QPSK. Analytic expressions are derived for the detected SNR of carrier harmonics 2f and 4f as a function of SNR, channel power ratio, and normalized input bandwidth. The results apply equally well to PSK data signals and direct-sequence spread-spectrum signals. Measurements confirm every aspect of the theory. The least detectable signal type is balanced QPSK, which is detectable (at 4f) at a threshold SNR ranging from -2 to -13 dB as the detection process gain (chip or data rate/detection bandwidth) is varied from 40 to 80 dB.
Douglas A. Hill, John B. Bodie
IEEE Trans. Commun.2
1975 Tree encoding of speech
abstract
Recently developed methods of tree source coding with a fidelity criterion are applied to speech coding. We first demonstrate that tree codes are inherent in A-D speech convertors of the waveform following type and point to ordinary and adaptive delta modulation and differential pulse code modulation (DPCM) as examples. Insights of coding theory improve these trees at low rates; we offer two new code classes, one obtained by smoothing the DPCM tree and one using the rate-distortion theory of autoregressive sources. Using these codes, we study the performance of a simple synchronous tree searching algorithm called theM-algorithm that maintains a small fixed number of paths in contention. 1 and 2 bit/sample code trees, used to encode actual speech at 8, 10, and 16 kbits/s, yield improved dynamic range and channel error resistance, and 4-8 dB improvement in mean-square error (mse) over ordinary single-path searched DPCM. These improvements in excess of analytical estimates suggest that tree coding methods perform better with real-life sources than previously thought.
John B. Anderson, John B. Bodie
IEEE Trans. Inf. Theory2