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.

Michel M. Goutmann

dblp:02/6454 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 1978
—ORCID · none

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

Computer networks · 2 · 1 first-authorTheory of computation · 2 · 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
3 papers
Physical-layer communications · 100%
Theoretical computer science
3 papers
Coding theory · 60% Information theory · 35% Algorithms and data structures · 4%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › modulation
delta modulation
0.011978
The Space Shuttle Ground Terminal Delta Modulation System · IEEE Trans. Commun. 1978
Physical-layer communications
modulation
0.011978
The Space Shuttle Ground Terminal Delta Modulation System · IEEE Trans. Commun. 1978
Coding theory › error-correcting codes
convolutional codes
0.011972
Intersymbol Interference as a Natural Code · IEEE Trans. Commun. 1972
Physical-layer communications
channel coding
0.011969
Transmission of Information in Networks of Erasure Channels · Inf. Control. 1969
Physical-layer communications
speech processing
0.011978
The Space Shuttle Ground Terminal Delta Modulation System · IEEE Trans. Commun. 1978
Information theory
network information theory
0.011969
Transmission of Information in Networks of Erasure Channels · Inf. Control. 1969
Coding theory
channel coding
0.011967
Chernoff bound for channels with infinite memory · IEEE Trans. Inf. Theory 1967
Information theory › probability theory › large deviations
chernoff bound
0.011967
Chernoff bound for channels with infinite memory · IEEE Trans. Inf. Theory 1967
Coding theory › channel coding
error probability bounds
0.011967
Chernoff bound for channels with infinite memory · IEEE Trans. Inf. Theory 1967
Physical-layer communications
equalization
0.011972
Intersymbol Interference as a Natural Code · IEEE Trans. Commun. 1972
Physical-layer communications › channel modeling
time-dispersive channel
0.011972
Intersymbol Interference as a Natural Code · IEEE Trans. Commun. 1972
Algorithms and data structures
markov chains
0.011967
Chernoff bound for channels with infinite memory · IEEE Trans. Inf. Theory 1967

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

information decoding · 0.0computer simulation · 0.0
YearPublicationVenuePosition
1978 The Space Shuttle Ground Terminal Delta Modulation System
abstract
Shuttle voice processing uses a Variable Slope Delta Modulation scheme which is a variant of the ABATE algorithm. This paper summarizes the ground terminal subsystem which processes the multiplexed voice and telemetry data digital sequence in the downlink processing and digitizes the voice signal in the uplink processing. The Delta Modulation System (DMS) performance characteristics are given in terms of an intelligibility test score and in terms of time and frequency responses measured on a production system developed for NASA Goddard Space Flight Center. Implementation details of the encoder and decoder algorithms are given in terms of the circuit logic used to implement them.
Robert L. Auger, Michael W. Glancy, Michel M. Goutmann, Alan L. Kirsch
IEEE Trans. Commun.3
1972 Intersymbol Interference as a Natural Code
abstract
The classical approach of considering intersymbol interference as a modulation problem is replaced by less conventional information decoding considerations. We present the concept of viewing time-dispersive channels as natural convolutional encoders. Several channels are presented as examples and computer simulations exhibit some of the benefits.
Michel M. Goutmann
IEEE Trans. Commun.1
1969 Transmission of Information in Networks of Erasure Channels
Michel M. Goutmann
Inf. Control.1
1967 Chernoff bound for channels with infinite memory
abstract
The problem of Chernoff bounding is analyzed for symmetric channels with input alphabet of arbitrary finite size or erasure channels with no crossover errors whose memory may be described in terms of the noise sequences by an infinite ergodic irreducible aperiodic Markov chain. Necessary and sufficient conditions are described which guarantee the existence of an exponential upper bound to the probability of error for block coding. These conditions are given in terms of the transition matrix of the Markov chain. It will be observed that, although their application involves merely an inspection of the transition matrix, they are based on the topology of the Markov chain and the convergence of sequences of transition probabilities.
Michel M. Goutmann
IEEE Trans. Inf. Theory1