The authors consider the role of noise cancellation and low bit rate speech coding in mobile radio systems. They discuss the reduction of acoustic noise in speech signals, and consider speech-channel coding. Diagrams ...
详细信息
The authors consider the role of noise cancellation and low bit rate speech coding in mobile radio systems. They discuss the reduction of acoustic noise in speech signals, and consider speech-channel coding. Diagrams of signal spectrum are given.< >
Given finite samples of a stationary, perhaps noisy, nonGaussian r-variate moving-average, MA(q) process, the authors study cumulant based identifiability conditions, under which the MA coefficient matrices, the input...
详细信息
Given finite samples of a stationary, perhaps noisy, nonGaussian r-variate moving-average, MA(q) process, the authors study cumulant based identifiability conditions, under which the MA coefficient matrices, the input statistics, and the order q, can be uniquely determined. The selection of a unique representative from the equivalence class corresponding to a given cumulant structure involves less restrictions than that corresponding to a given covariance structure. They derive two algorithms for estimating the (possibly) nonminimum phase MA coefficient matrices.< >
Data from statistically unknown sources is generally difficult to compress with significant ratios. The compression scheme should have the ability to gather context information of the source in an adaptive manner. Ari...
详细信息
Data from statistically unknown sources is generally difficult to compress with significant ratios. The compression scheme should have the ability to gather context information of the source in an adaptive manner. Arithmetic coding has that capability and can be made to outperform many other compression schemes known. The sliding dictionary, on the other hand, is a compression algorithm which is best suitable for hardware implementation on systolic-array parallel processors, but due to the statistical properties of its information context, it results in inferior compression ratios. A string dictionary structure is proposed that combines the advantages of both algorithms, offering the possibility of hardware implementation on VLSI, avoidance of encoding almost random information, and encoding with arithmetic codes.< >
The author presents a scheme and its polyphase FIR (finite-impulse-response) filter implementation for the demodulation of chrominance signal into in-phase and quadrature-phase components. The scheme applies to any sy...
详细信息
The author presents a scheme and its polyphase FIR (finite-impulse-response) filter implementation for the demodulation of chrominance signal into in-phase and quadrature-phase components. The scheme applies to any system whose sampling frequency is related to the color subcarrier frequency by a rational factor. The authors presents the criteria for choosing a sampling frequency for the digitization of a TV studio signal and addresses the issue of digital demodulation of the chrominance component in a composite video signal.< >
Pulsewidth-constrained signals are developed for use on the degraded direct-detection optical channel. A two-dimensional representation for these signals is obtained and used to design a trellis-coded-modulation (TCM)...
详细信息
Pulsewidth-constrained signals are developed for use on the degraded direct-detection optical channel. A two-dimensional representation for these signals is obtained and used to design a trellis-coded-modulation (TCM) system for use on the optical channel. The theoretical advantage of optical TCM is shown, through use of the cutoff rate, to range from 7.5 to 9 dB, depending on the throughput rate of the system. The practical potential is shown, through the actual design of a TCM system, to be as high as 6.7 dB.< >
Combinations of convolutional codes and tamed frequency modulation (TFM) are optimized as one entity for rate 1/2 and decoder complexities of up to 256 states. It is concluded that the best codes found so far belong t...
详细信息
Combinations of convolutional codes and tamed frequency modulation (TFM) are optimized as one entity for rate 1/2 and decoder complexities of up to 256 states. It is concluded that the best codes found so far belong to a class of codes called matched codes, which have the property of minimizing the complexity of the optimal Viterbi decoder. Coding gains of up to 7.68 dB are reported. The reported codes are the best codes for use with TFM in a Gaussian noise channel and assuming Viterbi decoding. Some of these codes are found to be catastrophic, yet the coded TFM scheme is free of this problem. The codes obtained are found to be superior to those obtained with traditional optimization techniques.< >
A novel broadband beamformer based on space-integrating, interferometric multichannel acousto-optic correlators was proposed. Both analysis and experiments were carried out to validate the concept. Simultaneous beamfo...
详细信息
The authors consider the application of eigenvector techniques to the solution of interference problems. The conventional minimum-variance signal-to-noise-ratio criteria are extended to a case in which the eigenstruct...
详细信息
The authors consider the application of eigenvector techniques to the solution of interference problems. The conventional minimum-variance signal-to-noise-ratio criteria are extended to a case in which the eigenstructure of the array correlation matrix is used to cancel directional interference sources. It is shown that while the method has good interference cancellation properties, it results in higher pattern distortion than conventional arrays.< >
Due to VLSI technological progress, algorithm- oriented array architectures, such as systolic arrays, appear to be very effective, feasible, and economic. This paper discusses how to design systolic arrays for the tra...
详细信息
Due to VLSI technological progress, algorithm- oriented array architectures, such as systolic arrays, appear to be very effective, feasible, and economic. This paper discusses how to design systolic arrays for the transitive closure and the shortest path problems. We shall focus on the Warshall algorithm for the transitive closure problem and the Floyd algorithm for the shortest path problem. These two algorithms share exactly the same structural formulation; therefore, they lead to the same systolic array design. In this paper, we first present a general method for mapping algorithms to systolic arrays. Using this methodology, two new systolic designs for the Warshall-Floyd algorithm will be derived. The first one is a spiral array, which is easy to derive and can be further simplified to a hexagonal array. The other is an orthogonal systolic array which is optimal in terms of pipelining rate, block pipelining rate, and the number of input/output connections.
The common practice of applying the theory of stationary stochastic processes to a cyclostationary process by introducing random phase(s) into the probabilistic model in order to stationarize the process can lead to e...
详细信息
The common practice of applying the theory of stationary stochastic processes to a cyclostationary process by introducing random phase(s) into the probabilistic model in order to stationarize the process can lead to erroneous results, such as incorrect formulas for power spectral density. This is illustrated by showing that commonly used formulas for signals that have undergone frequency conversion or time sampling can be incorrect. The source of error is shown to be inappropriate phase-randomization procedures. The correct procedure is described, and corrected formulas are given. The problem is further illustrated by showing that commonly used resolution and reliability (mean and variance) formulas for spectrum analyzers must be corrected for cyclostationary signals. It is explained that all corrections to formulas reflect the effects of spectral correlation. These effects are inappropriately averaged out by inappropriate phase-randomization procedures. It is further explained that these inappropriate procedures destroy the important property of ergodicity of the probabilistic model.
暂无评论