Sciweavers

898 search results - page 3 / 180
» An Analysis of Permutations in Arrays
Sort
View
ARSCOM
2008
78views more  ARSCOM 2008»
14 years 9 months ago
Three challenges in Costas arrays
We present 3 open challenges in the field of Costas arrays. They are: a) the determination of the number of dots on the main diagonal of a Welch array, and especially the maximal ...
Konstantinos Drakakis
ICASSP
2011
IEEE
14 years 1 months ago
Resolving FD-BSS permutation for arbitrary array in presence of spatial aliasing
This paper presents a novel method for solving the permutation problem inherent to frequency domain blind signal separation of multiple simultaneous speakers. As conventional meth...
Jani Even, Norihiro Hagita
IPPS
1999
IEEE
15 years 1 months ago
Optimally Scaling Permutation Routing on Reconfigurable Linear Arrays with Optical Buses
We present an optimal and scalable permutation routing algorithm for three reconfigurable models based on linear arrays that allow pipelining of information through an optical bus...
Jerry L. Trahan, Anu G. Bourgeois, Ramachandran Va...
81
Voted
CISS
2008
IEEE
15 years 4 months ago
Costas array generator polynomials in finite fields
—Permutations of order N are generated using polynomials in a Galois field GF(q) where q > N+1, which can be written as a linear transformation on a vector of polynomial coeff...
James K. Beard