Multichannel Direction-Independent Speech Enhancement Using Spectral Amplitude Estimation

An effective noise reduction algorithm based on signal analysis in sub-bands is proposed. Speech signal is analyzed in sub-bands using analytic decomposition in hearing critical bands where the envelopes and phases of the analytic signals are used. Noise reduction uses minimum mean square error log-spectral amplitude estimation (MMSE LSAE) noise suppression rule which preserves speech components while producing less musical residual noise. Experiments show that the nature of the band analysis in this work results in less musical noise in comparison with Fourier transform based methods. Moreover noise estimation algorithm in this work is a minima tracking algorithm which significantly reduces the level of musical noise when used in combination with MMSE LSAE.

Dual-stream Noise and Speech Information Perception based Speech Enhancement

LMMSE and MAP estimators for reduction of multiplicative noise in the nonsubsampled contourlet domain

An antenna array on the transmit side provides the system with an extra spatial dimension that can be utilized for coding both in the spatial as well as the temporal domain. The recent development of such space time codes shows that there are ways of exploiting multiple transmit antennas while completely avoiding traditional beam-forming techniques need of accurate channel state information. In this project, we generate a framework for training based channel estimation under different channel and interference statistics. The minimum mean square error (MMSE) estimator for channel matrix estimation in Rician fading multi-antenna systems is analyzed, and exclusively the proposal of mean square error (MSE) minimizing training structures. By considering Kronecker-structured systems with a grouping of noise and interference and random training sequence length, we gather and simplify numerous earlier results in the framework. We simplify the circumstances for attaining the optimal training sequence structure and show when the spatial training power distribution can be explained unambiguously. We also prove that spatial correlation improves the estimation performance and establish how it determines the optimal training sequence length. The analytic results for Kronecker-structured systems are used to derive a heuristic training sequence under general unstructured statistics. The MMSE estimator of the squared Frobenius norm of the channel matrix is also derived and shown to provide far better gain estimates than other approaches. It is shown under which conditions training sequences that minimize the non-convex MSE can be derived explicitly or with low complexity. Numerical examples are used to evaluate the performance of the two estimators for different training classifications and system statistics. We also elucidate how the finest length of the training sequence often can be shorter than the number of transmit antennas. Keyword: mse, mmse estimator, kronecker-structured systems.

An antenna array on the transmit side provides the system with an extra spatial dimension that can be utilized for coding both in the spatial as well as the temporal domain.The recent development of such space time codes shows that there are ways of exploiting multiple transmit antennas while completely avoiding traditional beam-forming techniques need of accurate channel state information.In this project, we generate a framework for training based channel estimation under different channel and interference statistics.The minimum mean square error (MMSE) estimator for channel matrix estimation in Rician fading multi-antenna systems is analyzed, and exclusively the proposal of mean square error (MSE) minimizing training structures.By considering Kronecker-structured systems with a grouping of noise and interference and random training sequence length, we gather and simplify numerous earlier results in the framework.We simplify the circumstances for attaining the optimal training sequence structure and show when the spatial training power distribution can be explained unambiguously.We also prove that spatial correlation improves the estimation performance and establish how it determines the optimal training sequence length.The analytic results for Kronecker-structured systems are used to derive a heuristic training sequence under general unstructured statistics.The MMSE estimator of the squared Frobenius norm of the channel matrix is also derived and shown to provide far better gain estimates than other approaches.It is shown under which conditions training sequences that minimize the non-convex MSE can be derived explicitly or with low complexity.Numerical examples are used to evaluate the performance of the two estimators for different training classifications and system statistics.We also elucidate how the finest length of the training sequence often can be shorter than the number of transmit antennas.

A Bayesian estimation approach for enhancing speech signals which have been degraded by statistically independent additive noise is motivated and developed. In particular, minimum mean square error (MMSE) and maximum a posteriori (MAP) signal estimators are developed using hidden Markov models (HMMs) for the clean signal and the noise process. It is shown that the MMSE estimator comprises a weighted sum of conditional mean estimators for the composite states of the noisy signal, where the weights equal the posterior probabilities of the composite states given the noisy signal. The estimation of several spectral functionals of the clean signal such as the sample spectrum and the complex exponential of the phase is also considered. A gain-adapted MAP estimator is developed using the expectation-maximization algorithm. The theoretical performance of the MMSE estimator is discussed, and convergence of the MAP estimator is proved. Both the MMSE and MAP estimators are tested in enhancing speech signals degraded by white Gaussian noise at input signal-to-noise ratios of from 5 to 20 dB. >

Iterative turbo processing between detection and decoding shows near-capacity performance on a multiple-antenna system. Combining iterative processing with optimum front-end detection is particularly challenging because the front-end maximum a posteriori (MAP) algorithm has a computational complexity that is exponential in the throughput. Sub-optimum detector such as the soft interference cancellation linear minimum mean square error (SIC-LMMSE) detector with near front-end MAP performance has been proposed. The asymptotic computational complexity of SIC-LMMSE remains O(nt2nr+ntnr3+ntMc2Mc) per detection-decoding cycle where nt is number of transmit antenna, nr is number of receive antenna, and Mc is modulation size. A lower complexity detector is the hard interference cancellation LMMSE (HIC-LMMSE) detector. HIC-LMMSE has asymptotic complexity of O(nt2nr+ntMc2Mc)but suffers exta performance degradation. In this paper, we introduce a frontend detection algorithm that achieves asymptotic computational complexity of O(ntMc2Mc). Simulation results demonstrate that the proposed low complexity detection algorithm offers exactly same performance as their full complexity counterpart in an iterative receiver while being computational more efficient.

In this paper, we propose a distributed source localization algorithm based on the Maximum A Posteriori (MAP) criterion, where the observations generated by each of the distributed sensors are quantized before being transmitted to a fusion node for localization. If the source signal energy is known, each quantized sensor reading corresponds to a region in which the source can be located. Aggregating the information obtained from multiple sensors corresponds to generating intersections between the regions. In our previous work we developed quantizer design techniques aimed at optimizing localization accuracy for a given aggregate rate. In this paper we develop localization algorithms based on estimating the likelihood of each of the intersection regions. This likelihood can incorporate uncertainty about the source signal energy as well as measurement noise. We show that the computational complexity of the algorithm can be significantly reduced by taking into account the correlation of the received quantized data. We also propose a technique, based on a weighted average of estimators, to address the case when the signal energy is unknown. Our simulation results show that our localization algorithm achieves good performance with reasonable complexity as compared with Minimum Mean Square Error (MMSE) estimation.

The estimation of noise Power spectral density (PSD) is a very crucial issue for speech enhancement as a result of its significant effiect on the quality and intelligibility of the enhanced speech. Most of the existing estimators for noise PSD try to employ Gaussian speech priors, which, however, have been proven inconsistent with the reality. We derived an effiective solution to this problem of estimating noise PSD in the Minimum mean square error (MMSE) sense when the speech component is modeled by a Laplacian distribution. Meanwhile, the soft decision technique instead of the hard Voice activity detection (VAD) is evolved into our algorithm, which can automatically makes the estimation unbiased without requiring a bias compensation. The performance of the proposed method is tested by several objective and subjective measures under various stationary and nonstationary noise environments. The results confirm that our method achieves good performance for all the noise conditions and Signalnoise-ratio (SNR) settings.

The development of an efficient ground sampling strategy is critical to assess uncertainties associated with moderate- or coarse-resolution remote-sensing products. This work presents a comparison of estimating spatial means from fine spatial resolution images using spatial random sampling (SRS), Block Kriging (BK), and Means of Surface with Nonhomogeneity (MSN) at 1 km2 spatial scale. Towards this goal, we focus on the sampling strategies for ground data measurements and provide an assessment of the MODIS LAI product validated by the spatial means estimated by the above-mentioned three methods. The results of this study indicate that: (1) for its effective stratification strategies and its criteria of minimum mean square estimation error, MSN demonstrates the lowest mean squared estimation error for estimating the means of stratified nonhomogeneous surface; (2) BK is efficient in estimating the means of homogeneous surfaces without bias and with minimum mean squared estimation errors. The MODIS LAI product is assessed using the means estimated by SRS, BK, and MSN based on Landsat 8 OLI and SPOT HRV fine-resolution LAI maps. For heterogeneous surfaces, MSN results in low RMSE and high accuracy of MODIS LAI product compared with BK and SRS, whereas for homogeneous surfaces, the statistical parameters outputted by these three methods are similar. These results reveal that MSN is an effective method for estimating the spatial means for heterogeneous surfaces. There are differences in the accuracies of MODIS LAI product assessed by these three methods.

Linear minimum mean square filter for discrete-time linear systems with Markov jumps and multiplicative noises

We present algorithms to suppress the asynchronous co-channel interference (CCI) in MIMO OFDM systems. The key challenge is that the cyclic prefix of the interference signal does not line up with that of the intended signal due to the asynchronous transmission in WLAN. Therefore, the orthogonality across the tones of the interference signal is destroyed and the conventional frequency domain minimum mean square error (MMSE) cancelation techniques that employ the interference channel response per tone can not work effectively. To suppress the asynchronous interference, we design an efficient estimator for the spatial covariance matrix of the interference using Cholesky decomposition and low-pass smoothing. Both a MMSE and a maximum a posteriori (MAP) receiver are derived based on the estimated interference statistics. Simulation results demonstrate the effectivity of our solution.

A turbo receiver combined with CFO compensation in frequency-domain for OFDMA uplink

Orthogonal frequency division multiplexing (OFDM) system suffers extra performance degradation in fast fading channels due to intercarrier interference (ICI). Combining frequency domain equalization and bit-interleaved coded modulation (BICM), the iterative receiver is able to harvest both temporal and frequency diversity. Realizing that ICI channels are intrinsically ISI channels, this paper proposes a soft-in soft-out (SISO) maximum a posteriori (MAP) equalizer by extending Ungerboeck's maximum likelihood sequence estimator (MLSE) formulation to ICI channels. The SISO MAP equalizer employs BCJR algorithm and computes the bit log-likelihood ratios (LLR) for the entire received sequence by efficiently constructing a trellis that takes into account of the ICI channel structure. A reduced state (RS) formulation of the SISO MAP equalizer which provides good performance/complexity tradeoff is also described. Utilizing the fact that ICI energy is clustered in adjacent subcarriers, frequency domain equalization is made localized. This paper further proposes two computational efficient linear minimum mean square error (LMMSE) based equalization methods: recursive q-tap SIC-LMMSE equalizer and recursive Sliding-Window (SW) SIC-LMMSE equalizer respectively. Simulations results demonstrate that the iterative SISO RS-MAP equalizer achieves the performance of no ICI with normalized Doppler frequency f <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">d</sub> T <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">s</sub> up to 20.46% in realistic mobile WiMAX environment.

Monostatic ground penetrating radar (GPR) has proven to be a useful technique in pavement profiling. In road and highway pavements, layer thickness and permittivity of asphalt and concrete can be estimated by using an inverse scattering approach. Layer-stripping inversion refers to the iterative estimation of layer properties from amplitude and time of delay (TOD) of echoes after their detection. This method is attractive for real-time implementation, in that accuracy is improved by reducing false alarms. To make layer stripping useful, a multitarget detection/tracking (D/T) algorithm is proposed. It exploits the lateral continuity of echoes arising from a multilayered medium. Interface D/T means that both detection and tracking are employed simultaneously (not sequentially). For each scan, both detection of the target and tracking of the corresponding TOD of the backscattered echoes are based on the evaluated a posteriori probability density. The TOD is then estimated by using the maximum a posteriori (MAP) or the minimum mean square error (MMSE) criterion. The statistical properties of a scan are related to those of the neighboring ones by assuming, for the interface, a first-order Markov model.