Showing papers on "Orthogonal array published in 1981"
12 May 1981
TL;DR: A new approach to pattern matching by dynamic time warp that is based on an orthogonal array of simple processing elements is presented, using parallel computation and pipelined data flow to achieve extremely high throughput.
Abstract: Pattern matching by dynamic time warp has recently been widely applied in the fields of speech and visual pattern recognition. A new approach to this technique that is based on an orthogonal array of simple processing elements is presented. The approach emphasizes using parallel computation and pipelined data flow to achieve extremely high throughput. The internal architecture of the basic processing element and an integrated CMOS implementation are described. Simulation estimates indicate performance gains of up to 200:1 over existing techniques.
28 citations
TL;DR: A general recursive construction for group-divisible designs is described and several well-known combinatorial constructions are obtained, including Wilson's fundamental construction, Wilson's construction for mutually orthogonal Latin squares, and an ''indirect'' construction for adding on subdesigns.
22 citations
TL;DR: In this paper, the problem of finding an orthogonal transformation of an arbitrary factor solution that would lead to a least square fit of a partially specified target matrix is addressed. But the problem is not addressed in this paper.
Abstract: This paper addresses the problem of finding an orthogonal transformation of an arbitrary factor solution that would lead to a least squares fit of a partially specified target matrix. An iterative computing procedure is presented. Key words: orthogonal rotations, factor analysis, least squares, partially specified target, procrustes problem.
15 citations
TL;DR: In this paper, the authors give a general procedure for constructing orthogonal F-squares of order n from an O(n, k, s, 2) and an OL(s, t) set, where n is not necessarily a prime or prime power.
12 citations
TL;DR: Equivalence classes of Latin squares induced by row and column permutations are considered and an expression for the number of such classes for an n th order Latin square is obtained in terms of Latin rectangles with n rows.
6 citations
01 Jan 1981
1 citations
01 Aug 1981
TL;DR: This paper concen t r a t e s on the m icro pro cesso r com putat ion, c o n t r o l , d i s p l a y , p r i n t o u t and convenience f e a t u r e s is presented.
Abstract: A broadband orthogonal array antenna system and a s s o c i a t e d c o n tr o l c i r c u i t r y have been d es ig ned t o r e duce the man hours req uired when making spectrum occupancy s t u d i e s . E f f e c t i v e o m n id ir ec t io n a l c o v e r age i s o b ta ined by r a p i d l y s w i t c h in g among arrays o f convent iona l antennas; r e s u l t a n t f i e l d s t r e n g t h s are c a l c u l a t e d and recorded us in g a m icr o p r o ce ss o r . The sys tem i s man pack p o r t a b l e , c o v ers from 10 kHz to 18 GHz and i s capable o f record ing f i e l d s up to 100 V/meter. The system has demonstrated a f a c t o r o f 50 t o 1 r ed u c t io n in man hours required t o c a r e f u l l y measure and rec ord spectrum occupancy over conven t i o n a l non-automated s e a r c h in g . This paper concen t r a t e s on the m icro pro cesso r com putat ion, c o n t r o l , d i s p l a y , p r i n t o u t and convenience f e a t u r e s .
1 citations