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

James L. Melsa

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

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

Graphics, computer vision, multimedia, augmented reality and games · 11 · 3 first-authorComputer networks · 3Systems, architecture and hardware · 2Theory 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
Content delivery and video streaming · 91% Physical-layer communications · 9%
Computer graphics and multimedia
2 papers
Audio and music processing · 62% Image and video coding · 38%
Theoretical computer science
2 papers
Coding theory · 70% Mathematical optimization · 30%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Storage systems · 56% Integrated circuit design · 28% Performance modeling and evaluation · 17%

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

TopicWeightPapersLastEvidence papers
Content delivery and video streaming › source coding › speech coding
adaptive differential pulse code modulation
0.011990
Performance improvements using synchronous code correction in ADPCM/PCM tandem connections · IEEE Trans. Commun. 1990
Content delivery and video streaming › source coding
speech coding
0.011990
Performance improvements using synchronous code correction in ADPCM/PCM tandem connections · IEEE Trans. Commun. 1990
Content delivery and video streaming › video coding
transcoding
0.011990
Performance improvements using synchronous code correction in ADPCM/PCM tandem connections · IEEE Trans. Commun. 1990
Audio and music processing
speech coding
0.021975
The Residual Encoder-An Improved ADPCM System for Speech Digitization · IEEE Trans. Commun. 1975
Sequentially Adaptive Prediction and Coding of Speech Signals · IEEE Trans. Commun. 1974
Audio and music processing › speech coding
adaptive differential pulse code modulation
0.011975
The Residual Encoder-An Improved ADPCM System for Speech Digitization · IEEE Trans. Commun. 1975
Coding theory › source coding › quantization
adaptive quantization
0.011975
The relationship between an adaptive quantizer and a variance estimator (Corresp.) · IEEE Trans. Inf. Theory 1975
Coding theory › source coding
quantization
0.011975
The relationship between an adaptive quantizer and a variance estimator (Corresp.) · IEEE Trans. Inf. Theory 1975
Mathematical optimization › statistical estimation › point estimation
variance estimation
0.011975
The relationship between an adaptive quantizer and a variance estimator (Corresp.) · IEEE Trans. Inf. Theory 1975
Image and video coding › predictive coding
adaptive prediction
0.011974
Sequentially Adaptive Prediction and Coding of Speech Signals · IEEE Trans. Commun. 1974
Image and video coding › predictive coding
residual coding
0.011974
Sequentially Adaptive Prediction and Coding of Speech Signals · IEEE Trans. Commun. 1974
Storage systems
magnetic storage
0.011971
Two Approaches for Increasing Storage Density in Modern Digital Computing Systems · IEEE Trans. Computers 1971
Storage systems › storage device technology
storage density
0.011971
Two Approaches for Increasing Storage Density in Modern Digital Computing Systems · IEEE Trans. Computers 1971
Coding theory
source coding
0.011975
The Residual Encoder-An Improved ADPCM System for Speech Digitization · IEEE Trans. Commun. 1975
Performance modeling and evaluation
simulation
0.011971
Optimization and Simulation of Two Classes of Nonresetting Data Reconstructors · IEEE Trans. Computers 1971

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

distortion analysis · 0.0adaptive quantization · 0.0adaptive prediction · 0.0stochastic approximation · 0.0kalman filtering · 0.0exponential averaging · 0.0error combat method · 0.0simulation · 0.0signal detection · 0.0optimization · 0.0error rate analysis · 0.0
YearPublicationVenuePosition
1990 Performance improvements using synchronous code correction in ADPCM/PCM tandem connections
abstract
A sufficient condition for the existence of tandem distortion accumulation is described. The distortion for a sample time at which the sufficient condition is satisfied is studied. It is shown that the transcoding distortion is greater than the adaptive differential pulse code modulation (ADPCM) distortion when synchronous code correction is not used and less than the ADPCM distortion when synchronous code correction is used. These results are combined to show that when synchronous code correction is used, the upper bound of the single transcoding distortion is determined by the single transcoding distortion when synchronous code correction is not used. This bound cannot be generalized for multiple tandem cases.>
James D. Mills, James L. Melsa
IEEE Trans. Commun.2
1988 Multiply occupied cells [speech codecs]
abstract
Introduces the concept of multiply occupied cells which occur in the concatenation of codecs. The existence of a single multiply occupied cell of cardinality two is shown to imply that an alternative codec exists that results in lower end-to-end distortion and that eliminates the multiply occupied cell. The results are extended to the general case of multiple multiply occupied cells of any cardinality.>
James D. Mills, James L. Melsa
ICASSP2
1987 Custom VLSI design of a single chip multi-channel ADPCM processor
abstract
This paper details the development of a single chip VLSI processor which provides fully compatible CCITT 32kbps ADPCM transcoding. The chip is designed for multi-channel systems and is capable of processing eight independent channels in a 125 microsecond frame. To achieve this processing power, a specialized microcoded architecture for the ADPCM algorithm is implemented using a full custom two micron VLSI design methodology.
James D. Beatty, Richard D. Calder Jr., Perry Farazi, Daniel P. Kelly, James L. Melsa
ICASSP5
1986 A simple phase-reversal tone disabler
abstract
This paper describes the design and implementation of a phase-reversal, tone disabler for a multichannel digital echo canceller. The algorithm employs a fixed sample delay unit, an adaptive phase corrector, two low-pass filters for energy estimation and a simple phase discriminator. The algorithm has been implemented in a multichannel form using the NEC 7720 DSP chip. Results from both computer simulations and real-time implementation are presented for both noise-free and noisy conditions.
James L. Melsa, Roderick J. Ragland
ICASSP1
1983 Real time implementation of a speech coding algorithm using time-domain harmonic scaling and adaptive residual coding
abstract
This paper presents a real time implementation of a speech coder at 16 kbs. The compression algorithm is a combination of two previously reported techniques: Time Domain Harmonic Scaling and Adaptive Residual Coding. Several modifications are made to reduce the hardware complexity with minimal loss in speech quality, even in the presence of channel errors at a BER of 10-3. A single-board, real-time, full-duplex implementation is achieved using an NEC7720 signal processing chip and an 8085 microcomputer for transmission over an RS-423 digital interface.
Arvind Arora, James L. Melsa, James D. Mills
ICASSP2
1982 Mediumband speech encoding using time-domain harmonic scaling and adaptive residual coding for noisy channels
abstract
This paper describes the study of an approach to speech digitization at mediumband bit rates of 9.6 kb/s to 16 kb/s for the noisy channels. The technique is based on a combination of Time Domain Harmonic Scaling and an Adaptive Residual Coding. The use of fixed wordsize codewords and the absence of any side information transmission makes the system structure quite simple. Simulation studies have shown that this technique produces communication quality speech at 9.6 kb/s and excellent quality speech at 16 kb/s with a channel bit-error-rate as high as 1%.
James L. Melsa, Arun Pande
ICASSP1
1981 Practical considerations for variable length source coding
abstract
Variable length source coding schemes offer substantial improvements in data rate for a wide variety of data compression techniques. Unfortunately, practical considerations have limited their use. This paper describes several techniques which allow these powerful codes to be effectively applied. In particular, the problem of loss of code word synchronization due to channel errors is addressed. It is shown how self-synchronizing codes limit error propagation. Also, variable delay and the associated difficulties of buffer synchronization and buffer overflow are considered. The variable delay at the transmitter can be coupled with a variable delay at the receiver to give a fixed system delay. Buffer control then becomes the allocation of this delay between transmitter and receiver. Finally, a switching property of variable length codes to better match the bimodal operation of the source is presented.
David L. Cohn, James L. Melsa, Arvind Arora, James M. Kresse, Arun Pande
ICASSP2
1981 Mediumband speech encoding using time domain harmonic scaling and adaptive residual coding
abstract
This paper describes the study of a new approach to speech digitization at mediumband bit rates of 9.6 to 16 Kb/s. The technique is based on a combination of Time Domain Harmonic Scaling and an Adaptive Residual Coder. Computer simulation studies have shown that this technique is able to produce excellent quality speech at the bit rates in question.
James L. Melsa, Arun Pande
ICASSP1
1980 A single chip speech codec and filter
abstract
A simplified combination speech codec (coder/ decoder) and filter structure is described. It uses adaptive delta modulation followed by digital processing to produce a filtered log-PCM representation of a speech signal. The simplification results from combining the delta modulation step-size expansion, integration and low-pass filtering into one operation. All multiplications are eliminated and replaced by one-bit shift-and-add operations. The resulting structure is amenable to a single chip implementation using conventional, all-digital technologies while satisfying established filter standards.
Michael J. McLane, James L. Melsa, David L. Cohn
ICASSP2
1980 CVSD to LPC conversion using noise tolerant analysis
abstract
Due to the increasing sophisitication and decreasing cost of digital hardware, an all-digital speech communication network is being considered for implementation. Subject to bandwidth limitations, present plans call for both 16 Kilobit Continuously Variable Slope Delta Modulation (CVSD) as well as 2.4 Kilobit Linear Predictive Coding (LPC) terminals. Hence the conversion of CVSD to LPC and vice versa arises naturally in this environment. This paper will focus on the CVSD to LPC conversion problem. After a brief discussion of the component system environments, a structure for the format conversion system will be proposed. Since previous work has shown that pitch and voicing decisions can be made on the CVSD observations, the presentation will focus on the identification of LPC predictor coefficients from the noisily observed CVSD data. The remainder of the paper centers on this and the coefficient correction problem, and a new class of linear estimators is shown to yield conditionally unbiased estimates of the LPC coefficients in both noisy and noiseless environments.
J. D. Tomcik, James L. Melsa
ICASSP2
1979 A new configuration for speech digitization at 9600 bits per second
abstract
A speech coding algorithm for digital transmission of speech at a rate of 9600 bits per second which can be implemented on a speech processing system is described. The algorithm combines the following: a pitch extraction loop, a pitch compensating adaptive quantizer, a sequentially adaptive linear predictor, an adaptive source coding, and a multipath tree searching to generate very high quality speech output. Although each of these elements has been previously applied to speech coding, the combination of all five of these elements has not been discussed before. Preliminary simulation studies of the algorithm have yielded a signal-to-noise ratio which is indicative of very high quality speech.
David L. Cohn, James L. Melsa
ICASSP2
1976 A pitch compensating quantizer
abstract
A new adaptive quantizer for speech digitization has been derived. It is similar to known adaptive quantizers in that it adjusts its dynamic range to match that of the speech waveform. In addition, it further adjusts its range to compensate for the increased signal strength that follows a pitch pulse. The new quantizer bases its adaptation on its own output and no side information is required. When combined with a variable length source coding scheme, the new quantizer offers a significant improvement in signal-to-noise ratio and in subjective speech quality. The technique is applicable to a broad range of digitization methods including adaptive delta modulation and various forms of ADPCM.
David L. Cohn, James L. Melsa
ICASSP2
1975 The Residual Encoder-An Improved ADPCM System for Speech Digitization
abstract
An improved system for speech digitization using adaptive differential pulse-code modulation (ADPCM) is described. The system uses an adaptive predictor, an adaptive quantizer, and a variable length source coding scheme to achieve a 4-5 dB increase in signal-to-noise ratio over previous ADPCM. The increase can be used to improve speech quality at moderate data rates on the order of 16 kbits/s or to retain the same quality and reduce the data rate to 9.6 kbits/s. The latter alternative permits the use of narrow-band channels. The implementation complexity is on the same order as other ADPCM systems.
David L. Cohn, James L. Melsa
IEEE Trans. Commun.2
1975 The relationship between an adaptive quantizer and a variance estimator (Corresp.)
abstract
In this correspondence, it is shown that an adaptive quantizer with a one word memory can be viewed as one that estimates the variance of its input and normalizes the input by the square root of the estimate. It is shown that, even though the estimate is an exponential average, the effect of transmission errors does not die out. Finally, a method of combating the effect of such errors is described.
David L. Cohn, James L. Melsa
IEEE Trans. Inf. Theory2
1974 Sequentially Adaptive Prediction and Coding of Speech Signals
abstract
A new method of speech digitization called residual encoding is introduced, and its application to the speech digitization problem is studied. The residual encoding system is a form of differential pulse code modulation which utilizes both an adaptive quantizer and an adaptive predictor. The residual encoder differs from previous systems in two ways. First, a sequential estimation method is used to continuously update the predictor coefficients, and second, the predictor coefficients are not transmitted, but are extracted from the estimate of the speech signal at both the transmitter and receiver. No form of pitch extraction is employed. The residual encoding system with a Kalman filter or a stochastic approximation algorithm for identifying the predictor coefficients has produced good quality speech at a data rate of 16 kbit/s.
Jerry D. Gibson, Stephen K. Jones, James L. Melsa
IEEE Trans. Commun.3
1971 Optimization and Simulation of Two Classes of Nonresetting Data Reconstructors
abstract
This paper explores some new solutions to the problem of high-speed data reconstruction in real time. Two types of nonresetting data reconstructors are developed. Both types are simpler than the classical extrapolative hold circuits and when optimized give better performance. The optimization procedure is given and results of simulation studies are included.
Stephen K. Jones, James L. Melsa
IEEE Trans. Computers2
1971 Two Approaches for Increasing Storage Density in Modern Digital Computing Systems
abstract
Modern digital computing systems are primarily limited in how densely information may be recorded on the magnetic storage elements by the manner in which the information is retrieved (detected) from these storage facilities. Current systems store information at a density around 1000 bits per inch (bit/in); system elements, other than the detection process, could easily handle densities in excess of 3000 bit/in. This paper describes the signal present at the output of the read-write head and suggests two systems by which detection at high bit densities may be accomplished. The error rate associated with each system is given and the results are applied to a computer system using a magnetic disk file as the storage element. It is demonstrated that these detection procedures can meet the widely accepted standard of one error in one billion bits at reasonable signal-to-noise ratios.
Neil M. Schmitt, James L. Melsa
IEEE Trans. Computers2