Adaptive Algorithms for Intelligent Acoustic Interfaces

Modern speech communications are evolving towards a new direction which involves users in a more perceptive way. That is the immersive experience, which may be considered as the “last-mile” problem of telecommunications. One of the main feature of immersive communications is the distant-talking, i.e. the hands-free (in the broad sense) speech communications without bodyworn or tethered microphones that takes place in a multisource environment where interfering signals may degrade the communication quality and the intelligibility of the desired speech source. In order to preserve speech quality intelligent acoustic interfaces may be used. An intelligent acoustic interface may comprise multiple microphones and loudspeakers and its peculiarity is to model the acoustic channel in order to adapt to user requirements and to environment conditions. This is the reason why intelligent acoustic interfaces are based on adaptive filtering algorithms. The acoustic path modelling entails a set of problems which have to be taken into account in designing an adaptive filtering algorithm. Such problems may be basically generated by a linear or a nonlinear process and can be tackled respectively by linear or nonlinear adaptive algorithms. In this work we consider such modelling problems and we propose novel effective adaptive algorithms that allow acoustic interfaces to be robust against any interfering signals, thus preserving the perceived quality of desired speech signals. As regards linear adaptive algorithms, a class of adaptive filters based on the sparse nature of the acoustic impulse response has been recently proposed. We adopt such class of adaptive filters, named proportionate adaptive filters, and derive a general framework from which it is possible to derive any linear adaptive algorithm. Using such framework we also propose some efficient proportionate adaptive algorithms, expressly designed to tackle problems of a linear nature. On the other side, in order to address problems deriving from a nonlinear process, we propose a novel filtering model which performs a nonlinear transformations by means of functional links. Using such nonlinear model, we propose functional link adaptive filters which provide an efficient solution to the modelling of a nonlinear acoustic channel. Finally, we introduce robust filtering architectures based on adaptive combinations of filters that allow acoustic interfaces to more effectively adapt to environment conditions, thus providing a powerful mean to immersive speech communications

Adaptive Algorithms for Intelligent Acoustic Interfaces

Modern speech communications are evolving towards a new direction which involves users in a more perceptive way. That is the immersive experience, which may be considered as the “last-mile” problem of telecommunications. One of the main feature of immersive communications is the distant-talking, i.e. the hands-free (in the broad sense) speech communications without bodyworn or tethered microphones that takes place in a multisource environment where interfering signals may degrade the communication quality and the intelligibility of the desired speech source. In order to preserve speech quality intelligent acoustic interfaces may be used. An intelligent acoustic interface may comprise multiple microphones and loudspeakers and its peculiarity is to model the acoustic channel in order to adapt to user requirements and to environment conditions. This is the reason why intelligent acoustic interfaces are based on adaptive filtering algorithms. The acoustic path modelling entails a set of problems which have to be taken into account in designing an adaptive filtering algorithm. Such problems may be basically generated by a linear or a nonlinear process and can be tackled respectively by linear or nonlinear adaptive algorithms. In this work we consider such modelling problems and we propose novel effective adaptive algorithms that allow acoustic interfaces to be robust against any interfering signals, thus preserving the perceived quality of desired speech signals. As regards linear adaptive algorithms, a class of adaptive filters based on the sparse nature of the acoustic impulse response has been recently proposed. We adopt such class of adaptive filters, named proportionate adaptive filters, and derive a general framework from which it is possible to derive any linear adaptive algorithm. Using such framework we also propose some efficient proportionate adaptive algorithms, expressly designed to tackle problems of a linear nature. On the other side, in order to address problems deriving from a nonlinear process, we propose a novel filtering model which performs a nonlinear transformations by means of functional links. Using such nonlinear model, we propose functional link adaptive filters which provide an efficient solution to the modelling of a nonlinear acoustic channel. Finally, we introduce robust filtering architectures based on adaptive combinations of filters that allow acoustic interfaces to more effectively adapt to environment conditions, thus providing a powerful mean to immersive speech communications

Developing an Enhanced Adaptive Antenna Beamforming Algorithm for Telecommunication Applications

As a key enabler for advanced wireless communication technologies, smart antennas have become an intense field of study. Smart antennas use adaptive beamforming algorithms which allow the antenna system to search for specific signals even in a background of noise and interference. Beamforming is a signal processing technique used to shape the antenna array pattern according to prescribed criteria. In this thesis, a comparative study is presented for various adaptive antenna beamforming algorithms. Least mean square (LMS), normalized least mean square (NLMS), recursive least square (RLS), and sample matrix inversion (SMI) algorithms are studied and analyzed. The study also considers some possible adaptive filter combinations and variations, such as: LMS with SMI weights initialization, and combined NLMS filters with a variable mixing parameter. Furthermore, a new adaptive variable step-size normalized least mean square (VSS-NLMS) algorithm is proposed. Sparse adaptive algorithms, are also studied and analyzed, and two-channel estimations sparse algorithms are applied to an adaptive beamformer, namely: proportionate normalized least-mean-square (PNLMS), and lp norm PNLMS (LP-PNLMS) algorithms. Moreover, a variable step size has been applied to both of these algorithms for improved performance. These algorithms are simulated for antenna arrays with different geometries and sizes, and results are discussed in terms of their convergence speed, max side lobe level (SLL), null depths, steady-state error, and sensitivity to noise. Simulation results confirm the superiority of the proposed VSS-NLMS algorithms over the standard NLMS without the need of using combined filters. Results also show an improved performance for the sparse algorithms after applying the proposed variable step size

Adaptive beamforming and switching in smart antenna systems

The ever increasing requirement for providing large bandwidth and seamless data access to commuters has prompted new challenges to wireless solution providers. The communication channel characteristics between mobile clients and base station change rapidly with the increasing traveling speed of vehicles. Smart antenna systems with adaptive beamforming and switching technology is the key component to tackle the challenges. As a spatial filter, beamformer has long been widely used in wireless communication, radar, acoustics, medical imaging systems to enhance the received signal from a particular looking direction while suppressing noise and interference from other directions. The adaptive beamforming algorithm provides the capability to track the varying nature of the communication channel characteristics. However, the conventional adaptive beamformer assumes that the Direction of Arrival (DOA) of the signal of interest changes slowly, although the interference direction could be changed dynamically. The proliferation of High Speed Rail (HSR) and seamless wireless communication between infrastructure ( roadside, trackside equipment) and the vehicles (train, car, boat etc.) brings a unique challenge for adaptive beamforming due to its rapid change of DOA. For a HSR train with 250km/h, the DOA change speed can be up to 4⁰ per millisecond. To address these unique challenges, faster algorithms to calculate the beamforming weight based on the rapid-changing DOA are needed. In this dissertation, two strategies are adopted to address the challenges. The first one is to improve the weight calculation speed. The second strategy is to improve the speed of DOA estimation for the impinging signal by leveraging on the predefined constrained route for the transportation market. Based on these concepts, various algorithms in beampattern generation and adaptive weight control are evaluated and investigated in this thesis. The well known Generalized Sidelobe Cancellation (GSC) architecture is adopted in this dissertation. But it faces serious signal cancellation problem when the estimated DOA deviates from the actual DOA which is severe in high mobility scenarios as in the transportation market. Algorithms to improve various parts of the GSC are proposed in this dissertation. Firstly, a Cyclic Variable Step Size (CVSS) algorithm for adjusting the Least Mean Square (LMS) step size with simplicity for implementation is proposed and evaluated. Secondly, a Kalman filter based solution to fuse different sensor information for a faster estimation and tracking of the DOA is investigated and proposed. Thirdly, to address the DOA mismatch issue caused by the rapid DOA change, a fast blocking matrix generation algorithm named Simplifized Zero Placement Algorithm (SZPA) is proposed to mitigate the signal cancellation in GSC. Fourthly, to make the beam pattern robust against DOA mismatch, a fast algorithm for the generation of at beam pattern named Zero Placement Flat Top (ZPFT) for the fixed beamforming path in GSC is proposed. Finally, to evaluate the effectiveness and performance of the beamforming algorithms, wireless channel simulation is needed. One of the challenging aspects for wireless simulation is the coupling between Probability Density Function (PDF) and Power Spectral Density (PSD) for a random variable. In this regard, a simplified solution to simulate Non Gaussian wireless channel is proposed, proved and evaluated for the effectiveness of the algorithm. With the above optimizations, the controlled simulation shows that the at top beampattern can be generated 380 times faster than iterative optimization method and blocking matrix can be generated 9 times faster than normal SVD method while the same overall optimum state performance can be achieved

An Adaptive Approach for the Joint Antenna Selection and Beamforming Optimization

Adaptive beamforming techniques are widely known for their capability of leveraging the performance of antenna arrays. The effectiveness of such techniques typically increases as the number of antennas grows. In contrast, computational and hardware costs very often limit the deployment of beamforming in large-scale arrays. To circumvent this problem, antenna selection strategies have been developed aiming to maintain much of the performance gain obtained by using a large array while keeping computational and hardware costs at acceptable levels. In this context, the present paper is dedicated to the development of two new adaptive algorithms for solving the problem of joint antenna selection and beamforming for uplink reception in mobile communication systems. Both algorithms are based on an alternating optimization strategy and are designed to operate with a limited number of radio-frequency chains. The main difference between the proposed algorithms is that the first is formulated by considering the minimum mean-square error (MMSE) criterion, while the second is based on the minimum-variance distortionless-response (MVDR) approach. The numerical simulation results confirm the effectiveness of the proposed algorithms