On data-selective learning

Adaptive filters are applied in several electronic and communication devices like smartphones, advanced headphones, DSP chips, smart antenna, and teleconference systems. Also, they have application in many areas such as system identification, channel equalization, noise reduction, echo cancellation, interference cancellation, signal prediction, and stock market. Therefore, reducing the energy consumption of the adaptive filtering algorithms has great importance, particularly in green technologies and in devices using battery. In this thesis, data-selective adaptive filters, in particular the set-membership (SM) adaptive filters, are the tools to reach the goal. There are well known SM adaptive filters in literature. This work introduces new algorithms based on the classical ones in order to improve their performances and reduce the number of required arithmetic operations at the same time. Therefore, firstly, we analyze the robustness of the classical SM adaptive filtering algorithms. Secondly, we extend the SM technique to trinion and quaternion systems. Thirdly, by combining SM filtering and partialupdating, we introduce a new improved set-membership affine projection algorithm with constrained step size to improve its stability behavior. Fourthly, we propose some new least-mean-square (LMS) based and recursive least-squares based adaptive filtering algorithms with low computational complexity for sparse systems. Finally, we derive some feature LMS algorithms to exploit the hidden sparsity in the parameters.Filtros adaptativos são aplicados em diversos aparelhos eletrônicos e de comunicação, como smartphones, fone de ouvido avançados, DSP chips, antenas inteligentes e sistemas de teleconferência. Eles também têm aplicação em várias áreas como identificação de sistemas, equalização de canal, cancelamento de eco, cancelamento de interferência, previsão de sinal e mercado de ações. Desse modo, reduzir o consumo de energia de algoritmos adaptativos tem importância significativa, especialmente em tecnologias verdes e aparelhos que usam bateria. Nesta tese, filtros adaptativos com seleção de dados, em particular filtros adaptativos da família set-membership (SM), são apresentados para cumprir essa missão. No presente trabalho objetivamos apresentar novos algoritmos, baseados nos clássicos, a fim de aperfeiçoar seus desempenhos e, ao mesmo tempo, reduzir o número de operações aritméticas exigidas. Dessa forma, primeiro analisamos a robustez dos filtros adaptativos SM clássicos. Segundo, estendemos o SM aos números trinions e quaternions. Terceiro, foram utilizadas também duas famílias de algoritmos, SM filtering e partial-updating, de uma maneira elegante, visando reduzir energia ao máximo possível e obter um desempenho competitivo em termos de estabilidade. Quarto, a tese propõe novos filtros adaptativos baseado em algoritmos least-mean-square (LMS) e mínimos quadrados recursivos com complexidade computacional baixa para espaços esparsos. Finalmente, derivamos alguns algoritmos feature LMS para explorar a esparsidade escondida nos parâmetros

Evolutionary and variable step size strategies for multichannel filtered-x affine projection algorithms

This study is focused on the necessity to improve the performance of the affine projection (AP) algorithm for active noise control (ANC) applications. The proposed algorithms are evaluated regarding their steady-state behaviour, their convergence speed and their computational complexity. To this end, different strategies recently applied to the AP for channel identification are proposed for multichannel ANC. These strategies are based either on a variable step size, an evolving projection order, or the combination of both strategies. The developed efficient versions of the AP algorithm use the modified filtered-x structure, which exhibits faster convergence than other filtering schemes. Simulation results show that the proposed approaches exhibit better performance than the conventional AP algorithm and represent a meaningful choice for practical multichannel ANC applications.This work was supported by a grant of the Romanian National Authority for Scientific Research, CNCS-UEFISCDI, project number PN-II-ID-PCE-2011-3-0097, Spanish Ministerio de Ciencia e Innovacion TEC2009-13741 and Generalitat Valenciana PROMETEO 2009/2013.Gonzalez, A.; Albu, F.; Ferrer Contreras, M.; Diego Antón, MD. (2013). Evolutionary and variable step size strategies for multichannel filtered-x affine projection algorithms. IET Signal Processing. 7(6):471-476. https://doi.org/10.1049/iet-spr.2012.0213S47147676Shin, H.-C., Sayed, A. H., & Song, W.-J. (2004). Variable Step-Size NLMS and Affine Projection Algorithms. IEEE Signal Processing Letters, 11(2), 132-135. doi:10.1109/lsp.2003.821722Paleologu, C., Benesty, J., & Ciochina, S. (2008). A Variable Step-Size Affine Projection Algorithm Designed for Acoustic Echo Cancellation. IEEE Transactions on Audio, Speech, and Language Processing, 16(8), 1466-1478. doi:10.1109/tasl.2008.2002980Shin, H.-C., & Sayed, A. H. (2004). Mean-Square Performance of a Family of Affine Projection Algorithms. IEEE Transactions on Signal Processing, 52(1), 90-102. doi:10.1109/tsp.2003.820077Kong, S.-J., Hwang, K.-Y., & Song, W.-J. (2007). An Affine Projection Algorithm With Dynamic Selection of Input Vectors. IEEE Signal Processing Letters, 14(8), 529-532. doi:10.1109/lsp.2007.891325Seong-Eun Kim, Se-Jin Kong, & Woo-Jin Song. (2009). An Affine Projection Algorithm With Evolving Order. IEEE Signal Processing Letters, 16(11), 937-940. doi:10.1109/lsp.2009.2027638Kim, K.-H., Choi, Y.-S., Kim, S.-E., & Song, W.-J. (2011). An Affine Projection Algorithm With Periodically Evolved Update Interval. IEEE Transactions on Circuits and Systems II: Express Briefs, 58(11), 763-767. doi:10.1109/tcsii.2011.2168023Bouchard, M. (2003). Multichannel affine and fast affine projection algorithms for active noise control and acoustic equalization systems. IEEE Transactions on Speech and Audio Processing, 11(1), 54-60. doi:10.1109/tsa.2002.805642Kong, N., Shin, J., & Park, P. (2011). A two-stage affine projection algorithm with mean-square-error-matching step-sizes. Signal Processing, 91(11), 2639-2646. doi:10.1016/j.sigpro.2011.06.003MoonSoo Chang, NamWoong Kong, & PooGyeon Park. (2010). An Affine Projection Algorithm Based on Reuse Time of Input Vectors. IEEE Signal Processing Letters, 17(8), 750-753. doi:10.1109/lsp.2010.2053355Arablouei, R., & Doğançay, K. (2012). Affine projection algorithm with selective projections. Signal Processing, 92(9), 2253-2263. doi:10.1016/j.sigpro.2012.02.018Gonzalez, A., Ferrer, M., de Diego, M., & Piñero, G. (2012). An affine projection algorithm with variable step size and projection order. Digital Signal Processing, 22(4), 586-592. doi:10.1016/j.dsp.2012.03.00

Sparse nonlinear optimization for signal processing and communications

This dissertation proposes three classes of new sparse nonlinear optimization algorithms for network echo cancellation (NEC), 3-D synthetic aperture radar (SAR) image reconstruction, and adaptive turbo equalization in multiple-input multiple-output (MIMO) underwater acoustic (UWA) communications, respectively. For NEC, the proposed two proportionate affine projection sign algorithms (APSAs) utilize the sparse nature of the network impulse response (NIR). Benefiting from the characteristics of l₁-norm optimization, affine projection, and proportionate matrix, the new algorithms are more robust to impulsive interferences and colored input than the conventional adaptive algorithms. For 3-D SAR image reconstruction, the proposed two compressed sensing (CS) approaches exploit the sparse nature of the SAR holographic image. Combining CS with the range migration algorithms (RMAs), these approaches can decrease the load of data acquisition while recovering satisfactory 3-D SAR image through l₁-norm optimization. For MIMO UWA communications, a robust iterative channel estimation based minimum mean-square-error (MMSE) turbo equalizer is proposed for large MIMO detection. The MIMO channel estimation is performed jointly with the MMSE equalizer and the maximum a posteriori probability (MAP) decoder. The proposed MIMO detection scheme has been tested by experimental data and proved to be robust against tough MIMO channels. --Abstract, page iv