Development of fast two-dimensional high-resolution direction-finding techniques
Explore this paper's citation graph
Summary
A fast separable approach based on a cross array is presented, which has coarsegrained parallelism and in order to compensate for the performance degradation due to separable processing, two postprocessing schemes are also proposed.
- Type
- article
- Published
- 1994-01-01
- Cited by
- 1
- References
- 3
- OpenAlex
- https://openalex.org/W40507263
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:59652806
Keywords
Separable space, Computer science, Parallelism (grammar), Resolution (logic), Algorithm
References
Cited by
Related papers
- Remarks on Algorithm 2, Algorithm 3, Algorithm 15, Algorithm 25 and Algorithm 26
- Remarks on Algorithm 332: Jacobi polynomials: Algorithm 344: student's t-distribution: Algorithm 351: modified Romberg quadrature: Algorithm 359: factoral analysis of variance
- Some Topological Properties of the Space of Probability Measures
- Function spaces and d-separability
- “ A battle between lust and loathing ” : The interplay between masculinity and femininity in Zakes Mda ’ s The Madonna of Excelsior
- Medical image registration algorithm based on Powell algorithm and improved genetic algorithm: Medical image registration algorithm based on Powell algorithm and improved genetic algorithm
- Sequential + separable vs sequentially separable and another variation on selective separability
- Parallelism in G. V. Mona's UVulindlela
- Exploiting Large Grain Parallelism in a Sparse Direct Linear System Solver