Exhaustive Search for Costas-Type Sequences for Multi-Target Recognition

نویسندگان

  • Oscar Moreno
  • Dorothy Bollman
  • Li Yuchun
چکیده

Costas and sonar sequences were respectively introduced in [2] and [10] to deal with the following problem: “An object is moving towards (or away) from an observer, who wants to know effectively the distance to the object and its velocity.” The solution to the problem makes use of the Doppler effect, which states the following: when a signal bounces off a moving target its frequency changes in direct proportion to the velocity of the object relative to the observer. In other words, if the observer sends out a signal towards a moving target, the change between the frequency of the outgoingand that of the returning signal will allow him to determine the velocity of the target, and the time it took to make the round trip will allow him to determine the distance. In a frequency hopping radar or sonar system, the signal consists of one or more frequencies being chosen from a set ff f fmg of available frequencies, for transmission at each of a set ft t tng of consecutive time intervals. For modeling purposes, it is reasonable to consider the situation in whichm n, and where

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algebraic Symmetries of Generic Multidimensional Periodic Costas Arrays and their importance in the enumeration of Multidimensional Periodic Sonar Arrays

We present two symmetries of the generic multidimensional periodic Costas arrays over elementary abelian groups. Through exhaustive search, we observe that these two symmetries generate the Costas arrays for the enumeration up to p = 5 (5x5x24). Following the results, we conjecture that these generators characterize the group of symmetries of the generic (m+1)-dimensional periodic Costas arrays...

متن کامل

A Recursive Method for Enumeration of Costas Arrays

In this paper, we propose a recursive method for finding Costas arrays that relies on a particular formation of Costas arrays from similar patterns of smaller size. By using such an idea, the proposed algorithm is able to dramatically reduce the computational burden (when compared to the exhaustive search), and at the same time, still can find all possible Costas arrays of given size. Similar t...

متن کامل

The Design of the Best Heat Integrated Separation Systems Using Harmony Search Algorithm

The synthesis of heat integrated multi-component distillation systems is complex due to its huge search space for structural combination and optimization computation. To provide a systematic approach and tools for the synthesis design of distillation systems, a new method for modeling heat integrated columns is presented, and the operating cost objective function is minimized by improved harmon...

متن کامل

Molecular analysis of AbOmpA type-1 as immunogenic target for therapeutic interventions against MDR Acinetobacter baumannii infection

Introduction: Acinetobacter baumannii is associated with hospital-acquired infections. Outer membrane protein A of A.baumannii (AbOmpA) is a well-characterized virulence factor which has important roles in pathogenesis of this bacterium. Methods: Based on our PCR-sequencing of ompA gene in the clinical isolates, AbOmpA protein can be categorized into two types, named here type-1 and type-2. We ...

متن کامل

Algebraic symmetries of generic $(m+1)$ dimensional periodic Costas arrays

Abstract—In this work we present two generators for the group of symmetries of the generic (m+1) dimensional periodic Costas arrays over elementary abelian (Zp)m groups: one that is defined by multiplication on m dimensions and the other by shear (addition) on m dimensions. Through exhaustive search we observe that these two generators characterize the group of symmetries for the examples we we...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003