Scholars' Mine
Missouri S&T
Research Repository
Curtis Laws Wilson Library
400 W. 14th Street
Rolla, MO 65409-0060
scholarsmine@mst.edu
| Title: | Adaptive beamforming using affine projection algorithms |
| Author (s): | Zheng, Y. Rosa Goubran, R.A. |
| Department/Lab Affiliations: | Electrical and Computer Engineering Wireless Communications Lab |
| Keywords: | NLMS algorithm adaptive LCMV beamformer adaptive beamforming array signal processing computational complexity convergence of numerical methods convergence speed decorrelation fast affine projection algorithm least mean squares methods linear constrained minimum variance low convergence rate normalized LMS algorithm spatial smoothing algorithm |
| Issue Date: | 2000 |
| Publisher: | Institute of Electrical and Electronics Engineers |
| Citation: | Zheng, Y.R.; Goubran, R.A., "Adaptive beamforming using affine projection algorithms" WCCC-ICSP 2000. 5th International Conference on Signal Processing Proceedings, 2000. vol.3, pp.1929-1932 vol.3, 2000 |
| Abstract: | The dynamic adaptive linear constrained minimum variance (LCMV) beamformer generally uses the normalized LMS (NLMS) algorithm for its robustness and simplicity, but it suffers from a low convergence rate. This paper proposes an alternative beamformer incorporating a simplified fast affine projection (FAP) algorithm, which provides fast convergence speed and low computational complexity. The family of affine projection (AP) algorithms improves its convergence speed significantly due to its decorrelation property. We compare the decorrelation properly of the AP algorithms to that of the spatial smoothing algorithm. The fundamental difference between the two decorrelation properties is clarified |
| Type: | Article - Conference proceedings text |
| Copyright Notice: | This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. FULL COPYRIGHT INFORMATION: |
| Publisher URL: | |
| Link to this page: |
| title | Adaptive beamforming using affine projection algorithms |
| contributor.author | Zheng, Y. Rosa |
| contributor.author | Goubran, R.A. |
| contributor.deptlab | Electrical and Computer Engineering |
| contributor.deptlab | Wireless Communications Lab |
| subject | NLMS algorithm |
| subject | adaptive LCMV beamformer |
| subject | adaptive beamforming |
| subject | array signal processing |
| subject | computational complexity |
| subject | convergence of numerical methods |
| subject | convergence speed |
| subject | decorrelation |
| subject | fast affine projection algorithm |
| subject | least mean squares methods |
| subject | linear constrained minimum variance |
| subject | low convergence rate |
| subject | normalized LMS algorithm |
| subject | spatial smoothing algorithm |
| date.issued | 2000 |
| date.submitted | 2007 |
| publisher | Institute of Electrical and Electronics Engineers |
| identifier.citation | Zheng, Y.R.; Goubran, R.A., "Adaptive beamforming using affine projection algorithms" WCCC-ICSP 2000. 5th International Conference on Signal Processing Proceedings, 2000. vol.3, pp.1929-1932 vol.3, 2000 |
| identifier.pub.URI | |
| description.abstract | The dynamic adaptive linear constrained minimum variance (LCMV) beamformer generally uses the normalized LMS (NLMS) algorithm for its robustness and simplicity, but it suffers from a low convergence rate. This paper proposes an alternative beamformer incorporating a simplified fast affine projection (FAP) algorithm, which provides fast convergence speed and low computational complexity. The family of affine projection (AP) algorithms improves its convergence speed significantly due to its decorrelation property. We compare the decorrelation properly of the AP algorithms to that of the spatial smoothing algorithm. The fundamental difference between the two decorrelation properties is clarified |
| type | Article - Conference proceedings |
| type.DCMIType | text |
| type.status | Final version |
| rights | This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder. |
| rights.URI | |
| date.accessioned | 2007-04-05T14:09:19Z |
| date.available | 2007-04-05T14:09:18Z |
| identifier.persist.URI |