Reduced complexity null subspace channel impulse response based blind identification
| Autor: | Alexandre Christophe, Michel Terre, Rabah Maoudj, Juan Medeiros |
|---|---|
| Přispěvatelé: | CEDRIC. Traitement du signal et architectures électroniques (CEDRIC - LAETITIA), Centre d'études et de recherche en informatique et communications (CEDRIC), Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise (ENSIIE)-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise (ENSIIE)-Conservatoire National des Arts et Métiers [CNAM] (CNAM), Universidade Federal do Ceará = Federal University of Ceará (UFC) |
| Jazyk: | angličtina |
| Rok vydání: | 2020 |
| Předmět: |
Optimization problem
Computer science media_common.quotation_subject Null (mathematics) 020206 networking & telecommunications 02 engineering and technology Ambiguity Viterbi algorithm Regularization (mathematics) 03 medical and health sciences Identification (information) symbols.namesake [SPI]Engineering Sciences [physics] 0302 clinical medicine Dimension (vector space) 0202 electrical engineering electronic engineering information engineering symbols Electrical and Electronic Engineering Algorithm [SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing 030217 neurology & neurosurgery Subspace topology ComputingMilieux_MISCELLANEOUS media_common |
| Zdroj: | AEÜ-International Journal of Electronics and Communications / Archiv für Elektronik und Übertragungstechnik AEÜ-International Journal of Electronics and Communications / Archiv für Elektronik und Übertragungstechnik, Elsevier, 2020, 115, pp.153024. ⟨10.1016/j.aeue.2019.153024⟩ |
| ISSN: | 1434-8411 |
| DOI: | 10.1016/j.aeue.2019.153024⟩ |
| Popis: | High order statistics blind identification algorithms proposed in Terre et al. (2014) and based on the Viterbi & Viterbi Algorithm which suffers on the 2 π / 2 p ambiguity when the order of used statistics is p. In order to remedy this problem, we propose the null subspace channel impulse response algorithm. However, the complexity of this algorithm is relatively high, then a method to reduce this complexity is proposed. It consists on splitting a large size optimization problem to some parallel low dimension ones. Furthermore, a novel regularization method is proposed and this method gives results globally comparable to that obtained with the subspace method and specifically higher at low SNR, as we will give an application hereafter. In spite of its relatively high complexity, a parallel architecture can be applied to this algorithm, if one wants a rapid execution to meet real-time constraints. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect