Cyclostationarity-Based Robust Algorithms for QAM Signal Identification
نویسندگان
چکیده
منابع مشابه
Pilot Induced Cyclostationarity Based Method for Dvb System Identification
This paper presents an approach that enables the receiver to identify the DVB standard among different systems employing the OFDM technique (Orthogonal Frequency Division Multiplexing) consisting of large number of mutually orthogonal sub carriers. This characteristic provides high robustness against multi-path effects. The pilot induced cyclostationarity (PIC) approach is one of the new algori...
متن کاملBlind signal extraction based on higher-order cyclostationarity properties
The paper deals with signal extraction performed by processing data received by an array of sensors. The proposed method is blind, i.e., it does not require any a priori knowledge of directional information associated with the signals of interest (SOI's). Such information is obtained directly from the received data by exploiting the higher-order cyclostationarity (HOCS) properties exhibited by ...
متن کاملCyclostationarity Based Signal Detection in Cognitive Radio Networks
The inefficient usage of the existing frequency spectrum and the ever increasing need for spectrum for communication has demanded means of opportunistic access to the licensed bands without interfering with the licensed primary users. Cognitive radio nodes have the capability of dynamic spectrum access and can provide a solution for the increasing spectral demand. Several spectrum sensing techn...
متن کاملChannel blind identification based on cyclostationarity and group delay
ew approach for channel blind identification based on second order cyclostationary statistics and the group delay een proposed. In this, two methods are proposed. In both the methods, the correction is applied to the basic phase ate for both the poles and zeros, in the group delay domain. The basic phase estimate is derived from the spectral lation density (SCD) of the system output. In the fir...
متن کاملRobust Quantum Algorithms for Oracle Identification
The oracle identification problem (OIP) was introduced by Ambainis et al. [4]. It is given as a set S of M oracles and a blackbox oracle f . Our task is to figure out which oracle in S is equal to the blackbox f by making queries to f . OIP includes several problems such as the Grover Search as special cases. In this paper, we improve the algorithms in [4] by providing a mostly optimal upper bo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Communications Letters
سال: 2012
ISSN: 1089-7798
DOI: 10.1109/lcomm.2011.112311.112006