This paper focuses on utilizing the associative capabilities of the Hopfield neural net in processing digitized speech and recovering erroneous speech segments and reconstructing noisy speech. The scope of this study ...
详细信息
ISBN:
(纸本)0819436763
This paper focuses on utilizing the associative capabilities of the Hopfield neural net in processing digitized speech and recovering erroneous speech segments and reconstructing noisy speech. The scope of this study is limited and the tests conducted are exploratory in nature. However, with a limited vocabulary that fits many practical applications, this study shows that digitized speech can be enhanced using properly trained recurrent networks such as the Hopfield neural net. The results indicate that a Hopfield neural network with sufficient associative memory can be used in a limited vocabulary context to reconstruct digitized speech with noisy, erroneous, and occluded or silenced segments.
An N x K (N greater than or equal to K) ambiguity resistant (AR) matrix G(z) is an irreducible polynomial matrix of size N x K over a field F such that the equation EG(z) = G(z) V(z) with E an unknown constant matrix ...
详细信息
An N x K (N greater than or equal to K) ambiguity resistant (AR) matrix G(z) is an irreducible polynomial matrix of size N x K over a field F such that the equation EG(z) = G(z) V(z) with E an unknown constant matrix and V(z) an unknown polynomial matrix has only the trivial solution E = alpha I-N, V(z) = alpha I-K, where alpha is an element of F. AR matrices have been introduced and applied in modern digital communications as errorcontrol codes defined over the complex field. In this paper we systematically study AR matrices over an infinite field F. We discuss the classification of AR matrices, define their normal forms, find their simplest canonical forms, and characterize all (K + 1) x K AR matrices that are the most interesting matrices in the applications. (C) 1999 Elsevier Science Inc. All rights reserved.
We describe two different proposals for implementing mathematically reversible and dissipationless logic in nanoelectronic systems. Both are amenable to quantum computation and use interacting single electrons housed ...
详细信息
We describe two different proposals for implementing mathematically reversible and dissipationless logic in nanoelectronic systems. Both are amenable to quantum computation and use interacting single electrons housed in quantum dots to elicit logic functions. In these systems, qubit errors accruing from decoherence events can be partially remedied by quantum error control coding. We present some new results on burst-correcting quantum codes that can address correlated errors in nanostructures. (C) 1998 Academic Press Limited.
In this paper, receiver design and performance analysis for coded asynchronous code-division multiple access (CDMA) systems is considered. The receiver front-end consists of the near-far resistant multiuser detector k...
详细信息
In this paper, receiver design and performance analysis for coded asynchronous code-division multiple access (CDMA) systems is considered. The receiver front-end consists of the near-far resistant multiuser detector known as the projection receiver (PR), The PR performs multiple-access interference resolution and is followed by error-control decoding. The output of the projection receiver yields the appropriate metric (i.e., soft information) for decoding of the coded sequences, An expression for the metric is derived that allows the use of a standard sequence decoder (e.g., Viterbi algorithm, M-algorithm) for the error-control code. It is then shown that the metric computer has an elegant adaptive implementation based on an extension of the familiar recursive least squares (RLS) algorithm. The adaptive PR operates on a single sample per chip and achieves a performance virtually identical to the algebraic PR, but with significantly less complexity. The receiver performance is studied for CDMA systems,vith fixed and random spreading sequences, and theoretical performance degradations with regard to the single-user bound are derived. The near-far resistance of the PR is also proven, and demonstrated by simulation.
An approach is introduced towards generalised threshold decoding, in which the threshold value is not necessarily a majority element. This approach can help extend the threshold decoding method to more types of code i...
详细信息
An approach is introduced towards generalised threshold decoding, in which the threshold value is not necessarily a majority element. This approach can help extend the threshold decoding method to more types of code in order to benefit from having low decoding complexities. With the motivation of finding codes decodable by applying the general threshold decoding rule, a class of block codes, called parity-check-based codes? is investigated. The method of constructing this class of codes differs from traditional approaches, i.e. the encoding procedure is based on the given parity-check symbols, instead of information symbols, with the aim of having a simple decoding algorithm. Better code performance can be achieved with some of these codes than those using similar decoding methods.
We show that the minimum squared Euclidean distance for a synchronous multiuser system using convolutional codes is no less than the product of the free distance of the code and the minimum Euclidean distance for the ...
详细信息
We show that the minimum squared Euclidean distance for a synchronous multiuser system using convolutional codes is no less than the product of the free distance of the code and the minimum Euclidean distance for the corresponding uncoded synchronous multiuser system. When all users use an identical convolutional code, equality holds. Thus the relationship can be used to compute the minimum squared Euclidean distance for a coded system. The results also indicate that in terms of maximizing the minimum squared Euclidean distance, it is better if all users use nonidentical errorcontrol codes.
In this paper, we present a method to classify hyperplastic and adenomatous polyps of large intestine semiautomatically. First, Doctors locate the contour of the original polyp images by using other software package. ...
详细信息
ISBN:
(纸本)0819427837
In this paper, we present a method to classify hyperplastic and adenomatous polyps of large intestine semiautomatically. First, Doctors locate the contour of the original polyp images by using other software package. We determine if there are gores on the polyp by using modified Sobel operator on eliminating specular reflection pixels of original color images. We then get the polyp's texture by summing the gradient magnitude of pixels within the polyps. After detecting the actual contour of the polyps, we can determine if the polyp's contour is obvious or not (i.e. if the polyp bulges smoothly or not). We then observe whether the polyp's color is redder than or whiter than its neighbors. Finally, we classify the polyp of the intestine by applying the above steps. The flow chart of classification is as shown in Figure 1. We apply our method on 77 color images with polyps of the intestine and compare the results with a doctor's diagnosis.
A new method for data integrity on ATM protocol is proposed. The algorithm represents image data via a new transform called the Mojette, The transform and its inverse are in order of complexity of the Fast Fourier Tra...
详细信息
ISBN:
(纸本)0819424463
A new method for data integrity on ATM protocol is proposed. The algorithm represents image data via a new transform called the Mojette, The transform and its inverse are in order of complexity of the Fast Fourier Transform. An Object Oriented Model for image acid sequence are presented. The method is tested on videoendoscopic sequences. This source-channel coding avoid any additional protocol over ATM to secure data and provide real-lime possibilities.
A new multiuser receiver for synchronous code-division multiple-access (CDMA) systems with error control coding is proposed. The receiver achieves interference cancellation by projecting the undesired users onto the s...
详细信息
A new multiuser receiver for synchronous code-division multiple-access (CDMA) systems with error control coding is proposed. The receiver achieves interference cancellation by projecting the undesired users onto the space spanned by the desired users' signal vectors. The detector calculates the least squares (LS) estimate of the interfering users data, that is used to yield an adjusted metric for maximum likelihood sequence estimation (MLSE) for the desired users' sequences. Simulation results indicate that close to optimal performance can be achieved when all but one of the users are projected using only a single user decoder for the desired user. Further, an adaptive receiver structure based on the recursive LS update is presented that is well-suited for DSP implementation due to it's computational efficiency.
In this paper we propose a probabilistic measure for self-checking (SC) circuits that is analogous to reliability of fault-tolerant systems. This measure is defined as the probability to achieve totally self-checking ...
详细信息
In this paper we propose a probabilistic measure for self-checking (SC) circuits that is analogous to reliability of fault-tolerant systems. This measure is defined as the probability to achieve totally self-checking (TSC) goal at the tth cycle: TSCG(I). TSCG provides insight to the worst case dynamic behavior of SC circuits with respect to the application environment and component failure rates. TSCG surpasses the TSC definitions in determining the applicability of a circuit in a given application environment. An SC circuit achieves TSC goal when no erroneous information or data is propagated beyond the boundary of this circuit. TSCG is therefore the probability that this fault confinement mechanism is intact. The SC properties are obtained through adding hardware redundancy to the original digital design. Which means that an SC circuit has a higher failure rate than the original circuit. Further, there are tradeoffs between the level of hardware redundancy, the reliability, and the TSCG. We give several examples in this paper to clearly demonstrate these tradeoffs for different design environments. The proposed probability measure allows designers to choose from cost-effective SC designs that are suitable for their specifications. We emphasize that the TSCG is intended to provide a mean of dynamic error handling performance evaluation of SC designs. The TSC definitions and alike are still intact, since a cost-effective SC circuit must begin with a TSC circuit. The TSCG gives confidence in the use of cost-efficient errorcontrol codes and/or reduction in error handling capability. Analogous to reliability, the TSCG can be used in product specifications. This is a crucial step toward the practical applications of TSC or CED circuits.
暂无评论