Abstract
This paper presents a novel and efficient extrema-mapping algorithm, which we call the roller-coaster algorithm. Two versions of the algorithm, the one-dimensional (1-D) and the two-dimensional (2-D) roller-coaster, are developed. Its applicability to array signal processing is demonstrated. We use it to solve a multiple source direction finding problem using multiple signal classification (MUSIC), beamformer, and minimum variance methods, and for antenna array design. The algorithm is based on heuristic assumptions and its properties are not proved. Yet, its performance was tested in many simulated experiments, yielding favorable results.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have