LLMS Adaptive Beamforming Algorithm Implemented with Finite Precision - ENSTA Bretagne - École nationale supérieure de techniques avancées Bretagne Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

LLMS Adaptive Beamforming Algorithm Implemented with Finite Precision

Jalal Abdulsayed Srar
  • Fonction : Auteur
Kah-Seng Chung
  • Fonction : Auteur
Ali Mansour

Résumé

This paper studies the influence of the use of finite wordlength on the operation of the LLMS adaptive beamforming algorithm. The convergence behavior of LLMS algorithm, based on the minimum mean square error (MSE), is analyzed for operation with finite precision. Computer simulation results verify that a wordlength of eight bits is sufficient for the LLMS algorithm to achieve performance close to that provided by full precision. Based on the simulation results, it is shown that the LLMS algorithm outperforms least mean square (LMS) in addition to other earlier algorithms, such as, modified robust variable step size (MRVSS) and constrained stability LMS (CSLMS).

Domaines

Electronique
Fichier non déposé

Dates et versions

hal-00773658 , version 1 (14-01-2013)

Identifiants

  • HAL Id : hal-00773658 , version 1

Citer

Jalal Abdulsayed Srar, Kah-Seng Chung, Ali Mansour. LLMS Adaptive Beamforming Algorithm Implemented with Finite Precision. TELFOR 2012, Nov 2012, Belgrade, Serbia. ⟨hal-00773658⟩
115 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More