Accelerating the convergence of the von Neumann-Halperin method of alternating projections

Benjamin G. Salomon, Hanach Ur

Research output: Contribution to conferencePaperpeer-review

Abstract

Orthogonal projections onto the intersection of subspaces are useful in signal processing algorithms including iterative decoding of linear dispersion codes for an unknown MIMO channels and equalization for wireless communication systems. The von Neumann-Halperin method of alternating projections (MAP) is an iterative algorithm for determining the orthogonal projection of a given vector in a Hilbert space onto the intersection of a finite number of given closed subspaces using orthogonal projections onto the given individual subspaces, The main practical drawback of the MAP is that it is often slowly convergent. We propose a method for accelerating the convergence of the MAP and demonstrate that the accelerated algorithm gives significant reduction in complexity and running time When the MAP converges slowly.

Original languageEnglish
Pages328-331
Number of pages4
DOIs
StatePublished - 2006
Event2006 IEEE 12th Digital Signal Processing Workshop and 4th IEEE Signal Processing Education Workshop, DSPWS - Moose, WY, United States
Duration: 24 Sep 200627 Sep 2006

Conference

Conference2006 IEEE 12th Digital Signal Processing Workshop and 4th IEEE Signal Processing Education Workshop, DSPWS
Country/TerritoryUnited States
CityMoose, WY
Period24/09/0627/09/06

Keywords

  • Acceleration method
  • Alternating projections
  • Intersection of sub-spaces

Fingerprint

Dive into the research topics of 'Accelerating the convergence of the von Neumann-Halperin method of alternating projections'. Together they form a unique fingerprint.

Cite this