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

Charles R. Cahn

dblp:27/10570 · DBLP profile ↗
← Back
11ranked-venue papers
9as first author
0since 2021 · last 1980
—ORCID · none

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

Theory of computation · 8 · 6 first-authorComputer networks · 3 · 3 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
8 papers
Physical-layer communications · 100%
Theoretical computer science
1 paper
Information theory · 100%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications
signal processing for communications
0.051980
A sequential decoding algorithm for phase tracking with delay (Corresp.) · IEEE Trans. Inf. Theory 1980
Threshold reduction for demodulating a BPSK suppressed-carrier signal (Corresp.) · IEEE Trans. Inf. Theory 1978
Phase tracking and demodulation with delay · IEEE Trans. Inf. Theory 1974
Physical-layer communications › synchronization
carrier synchronization
0.031980
Digital Phase Sampling for Microcomputer Implementation of Carrier Acquisition and Coherent Tracking · IEEE Trans. Commun. 1980
Improving Frequency Acquisition of a Costas Loop · IEEE Trans. Commun. 1977
Simulation of Sequential Decoding with Phase-Locked Demodulation · IEEE Trans. Commun. 1973
Physical-layer communications › synchronization › phase synchronization
carrier phase tracking
0.021980
A sequential decoding algorithm for phase tracking with delay (Corresp.) · IEEE Trans. Inf. Theory 1980
Threshold reduction for demodulating a BPSK suppressed-carrier signal (Corresp.) · IEEE Trans. Inf. Theory 1978
Physical-layer communications › modulation
demodulation
0.041980
Threshold reduction for demodulating a BPSK suppressed-carrier signal (Corresp.) · IEEE Trans. Inf. Theory 1978
Phase tracking and demodulation with delay · IEEE Trans. Inf. Theory 1974
Digital Phase Sampling for Microcomputer Implementation of Carrier Acquisition and Coherent Tracking · IEEE Trans. Commun. 1980
Physical-layer communications › modulation › demodulation
BPSK demodulation
0.021980
Threshold reduction for demodulating a BPSK suppressed-carrier signal (Corresp.) · IEEE Trans. Inf. Theory 1978
Digital Phase Sampling for Microcomputer Implementation of Carrier Acquisition and Coherent Tracking · IEEE Trans. Commun. 1980
Physical-layer communications › synchronization › carrier synchronization
costas loop
0.011978
Threshold reduction for demodulating a BPSK suppressed-carrier signal (Corresp.) · IEEE Trans. Inf. Theory 1978
Physical-layer communications › synchronization › carrier recovery
carrier phase estimation
0.011974
Phase tracking and demodulation with delay · IEEE Trans. Inf. Theory 1974
Physical-layer communications › modulation › demodulation
FM demodulation
0.011974
Phase tracking and demodulation with delay · IEEE Trans. Inf. Theory 1974
Physical-layer communications
channel coding
0.011973
Simulation of Sequential Decoding with Phase-Locked Demodulation · IEEE Trans. Commun. 1973
Physical-layer communications › synchronization › phase-locked loop
costas loop tracking
0.011973
Simulation of Sequential Decoding with Phase-Locked Demodulation · IEEE Trans. Commun. 1973
Physical-layer communications › channel coding › convolutional decoding
sequential decoding
0.011973
Simulation of Sequential Decoding with Phase-Locked Demodulation · IEEE Trans. Commun. 1973
Physical-layer communications › signal detection
coherent detection
0.011971
Worst interference for coherent binary channel (Corresp.) · IEEE Trans. Inf. Theory 1971
Information theory › channel capacity
arbitrarily varying channel
0.011971
Worst interference for coherent binary channel (Corresp.) · IEEE Trans. Inf. Theory 1971
Information theory
channel capacity
0.011971
Worst interference for coherent binary channel (Corresp.) · IEEE Trans. Inf. Theory 1971
Physical-layer communications › receiver design
bandpass limiter
0.011961
A note on signal-to-noise ratio in band-pass limiters · IRE Trans. Inf. Theory 1961
Physical-layer communications
signal-to-interference ratio
0.011961
A note on signal-to-noise ratio in band-pass limiters · IRE Trans. Inf. Theory 1961
Physical-layer communications › signal detection
correlation detection
0.011961
A note on signal-to-noise ratio in band-pass limiters · IRE Trans. Inf. Theory 1961

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

viterbi algorithm · 0.0simulation · 0.0sequential decoding · 0.0microprogramming · 0.0experimental validation · 0.0recursive estimation · 0.0maximum likelihood estimation · 0.0linearized analysis · 0.0delayed-bit estimation · 0.0computer simulation · 0.0minimax analysis · 0.0correlation detection · 0.0
YearPublicationVenuePosition
1980 Digital Phase Sampling for Microcomputer Implementation of Carrier Acquisition and Coherent Tracking
abstract
By sampling zero crossings at the Nyquist rate (i.e., the predetection bandwidth) the phase of a narrow-band signal may be extracted directly with respect to an arbitrary, stable reference. Analysis, simulation, and experimental results are presented validating this all-digital technique for acquisition and coherent tracking of a Doppler-shifted carrier at a low carrier/noise ratio and a large percentage bandwidth. The key advantage of this scheme for microcomputer-based implementation is that phase comparison is accomplished by arithmetic subtraction, without the coordinaterotation transformation which is necessary for conventionalI,Qsampling. Also, the phase-sampling process is independent of the phase error, which exists only as a numerical representation in the digital tracking algorithm. The technique is applicable to Costas suppressed-carrier tracking and to BPSK bit synchronization and demodulation, by programming the appropriate digital algorithms.
Charles R. Cahn, Donald K. Leimer
IEEE Trans. Commun.1
1980 A sequential decoding algorithm for phase tracking with delay (Corresp.)
abstract
Casting phase tracking into a binary decoding problem, as in a previous paper, a sequential decoding algorithm is applied to a third-order system. The goal is to reduce the "tracking threshold" below that of a phase-locked loop. Simulation results are obtained by microprogramming the algorithm for a HP-2100A minicomputer.
Charles R. Cahn, Donald K. Leimer
IEEE Trans. Inf. Theory1
1978 Threshold reduction for demodulating a BPSK suppressed-carrier signal (Corresp.)
abstract
If a Costas loop is forced to have a relatively wide bandwidth, for example, to track phase variation due to platform motion, binary phase-shift keying (BPSK) demodulator performance is significantly degraded. However, if the data bits were known, the Costas loop would become equivalent to a phase-locked loop, which has approximately a 6-dB lower tracking threshold for the same loop bandwidth. A delayed-bit estimation algorithm with a recursive structure similar to the Viterbi algorithm is described. The memory in the tracking loop is exploited to correct preliminary bit decisions, as a means of realizing most of this theoretical threshold reduction. Experimental results for a practical digital implementation of the new algorithm for a 50-bit/s data rate and a 20-Hz loop noise bandwidth show a 4-dB improvement in demodulator threshold.
Charles R. Cahn, Donald K. Leimer
IEEE Trans. Inf. Theory1
1977 Improving Frequency Acquisition of a Costas Loop
abstract
A Costas loop for tracking a BPSK signal does not acquire when the initial frequency error is comparable to the loop bandwidth. This paper describes methods for deriving control proportional to frequency error so as to improve the frequency acquisition capability by an AFC augmentation. A composite AFC/Costas loop is realized by combining the individual loops. Pull-in from a frequency error much greater than the Costas loop bandwidth is now feasible. The increase in phase error due to the AFC capability is evaluated by a linearized analysis. If the bandwidth of the AFC portion is sufficiently narrow, the degradation is negligible. Improved frequency acquisition can also be realized by a simple modification of the Costas loop to remove the low-pass filter on the quadrature phase detector channel, with negligible degradation to phase tracking.
Charles R. Cahn
IEEE Trans. Commun.1
1974 Phase tracking and demodulation with delay
abstract
Algorithms are described for estimating carrier phase by a maximum-likelihood procedure similar to the Viterbi algorithm for decoding a digital sequence. These algorithms avoid the constraint of physical realizability imposed by a phase-locked loop and allow a processing lag in estimation. An approximate analysis suggests that threshold extension can be achieved thereby. Computer simulations demonstrate the improved performance for demodulation of FM and for tracking of phase modulation due to dynamic maneuvers.
Charles R. Cahn
IEEE Trans. Inf. Theory1
1973 Simulation of Sequential Decoding with Phase-Locked Demodulation
abstract
Convolutional encoding with biphase modulation is an attractive combination of modulation/coding for the Gaussian channel, but a means of tracking carrier phase must be provided. The performance of combined sequential decoding and suppressed carrier (Costas loop) tracking in the receiver is difficult to analyze but can be obtained by computer simulations. Results of such simulations are presented in the form of a Pareto fit to the computation distributions for various tracking loop bandwidths and demodulator quantization (soft decisions). These distributions are applied to predict probability of error performance for typical decoder parameters (buffer size, speed factor). The anticipated advantage of quantized demodulation is observed. However, narrow tracking bandwidths are required, with sufficient interleaving to overcome effects of correlated phase perturbations due to noise.
Charles R. Cahn, Gaylord K. Huth, C. R. Moore
IEEE Trans. Commun.1
1973 Review of 'Synchronization Systems in Communication and Control' (Lindsey, W. C.; 1972)
Charles R. Cahn
IEEE Trans. Inf. Theory1
1971 Worst interference for coherent binary channel (Corresp.)
abstract
For a coherent channel transmitting binary digits, a worst distribution under an average power constraint can be defined. A solution for the very noisy channel is found to be Gaussian, and the minimax demodulator utilizes correlation detection to guarantee an exponential bound on probability of error.
Charles R. Cahn
IEEE Trans. Inf. Theory1
1961 A note on signal-to-noise ratio in band-pass limiters
abstract
A simplified analysis is presented to explain physically the change of signal-to-interference ratio which occurs in a band-pass limiter. The analysis utilizes the concept of sideband resolution into symmetric and anti-symmetric parts and considers only the asymptotic case where the signal-to-interference ratio is small in comparison with unity. Wide-band correlation-detection systems are discussed, as well as ordinary band-pass systems. The important conclusion is reached that the degradation is highly dependent on the statistics of the interference amplitude fluctuations. However, when the signal is weak compared to the interference, the maximum possible degradation is 6 db and occurs for constant-amplitude interference. Degradation with noise interference in a wide-band correlation-detection system has been obtained for arbitrary signal and noise bandwidths. It is found that the degradation ranges between 0.6 db and 1.0 db, the latter figure being for the case where the signal bandwidth is greater than approximately three times the noise bandwidth.
Charles R. Cahn
IRE Trans. Inf. Theory1
1960 A relation between zero-crossings and Fourier coefficients for bandwidth-limited functions (Corresp.)
Frederick E. Bond, Charles R. Cahn, John C. Hancock
IRE Trans. Inf. Theory2
1958 On the sampling the zeros of bandwidth limited signals
abstract
The sampling theorem enables a band-limited signal to be expressed in terms of a set of sample point values, which occur at the Nyquist rate. The sampling theorem has been generalized to include nonuniform sampling and the use of derivatives of the signal. In the present paper, a sampling theorem has been developed which utilizes information related to the zeros of the signal. The concept of complex zeros is introduced to show that the zeros occur at the Nyquist rate. This sampling theorem can be of use for enabling the transmission of binary signals, such as facsimile and infinitely-clipped speech, over a continuous band-limited channel. The result indicates the desirability of developing a completely general theory of sampling applicable to the various situations which may arise in practice.
Frederick E. Bond, Charles R. Cahn
IRE Trans. Inf. Theory2