Spectral Sensing for Cognitive Radio: Estimation of Adaptive Frequency Hopping Signal

The issue of dynamic spectrum scene analysis in any cognitive radio network becomes extremely complex when low probability of intercept, spread spectrum systems are present in environment. The detection and estimation become more complex if frequency hopping spread spectrum is adaptive in nature. In this paper, we propose two phase approach for detection and estimation of frequency hoping signals. Polyphase filter bank has been proposed as the architecture of choice for detection phase to efficiently detect the presence of frequency hopping signal. Based on the modeling of frequency hopping signal it can be shown that parametric methods of line spectral analysis are well suited for estimation of frequency hopping signals if the issues of order estimation and time localization are resolved. An algorithm using line spectra parameter estimation and wavelet based transient detection has been proposed which resolves above issues in computationally efficient manner suitable for implementation in cognitive radio. The simulations show promising results proving that adaptive frequency hopping signals can be detected and demodulated in a non cooperative context, even at a very low signal to noise ratio in real time.

Three-User Cognitive Channels with Cumulative Message Sharing: An Achievable Rate Region

In this paper, an achievable rate region for the three-user discrete memoryless interference channel with asymmetric transmitter cooperation is derived. The three-user channel facilitates different ways of message sharing between the transmitters. We introduce a manner of noncausal (genie aided) unidirectional message-sharing, which we term cumulative message sharing. We consider receivers with predetermined decoding capabilities, and define a cognitive interference channel. We then derive an achievable rate region for this channel by employing a coding scheme which is a combination of superposition and Gel'fand-Pinsker coding techniques.

N-(7-Nitrobenz-2-oxa-1,3-diazol-4-yI)colcemid, a probe for different classes of colchincine-binding site on tubulin

The nature of binding of 7-nitrobenz-2-oxa-1,3-diazol-4-yl-colcemid (NBD-colcemid), an environment-sensitive fluorescent analogue of colchicine, to tubulin was tested. This article reports the first fluorometric study where two types of binding site of colchincine analogue on tubulin were detected. Binding of NBD-colcemid to one of these sites equilibrates slsowly. NBD-colcemid competes with colchicine for this site. Binding of NBD-colcemid to this site also causes inhibition of tubulin self-assembly. In contrast, NBD-colcemid binding to the other site is characterised by rapid equilibration and lack of competition with colchicine. Nevertheless, binding to this site is highly specific for the cholchicine nucleus, as alkyl-NBD analogues have no significant binding activity. Fast-reaction-kinetic studies gave 1.76 × 105 M–1 s–1 for the association and 0.79 s–1 for the dissociation rate constants for the binding of NBD-colcemid to the fast site of tubulin. The association rate constants for the two phases of the slow site are 0.016 × 10–4 M–1 s–1 and 3.5 × 10–4 M–1 respectively. These two sites may be related to the two sites of colchicine reported earlier, with binding characteristics altered by the increased hydrophobic nature of NBD-colcemid.

Equivalence conditions for classes of linear and non-linear distributed parameter systems

Equivalence of certain classes of second-order non-linear distributed parameter systems and corresponding linear third-order systems is established through a differential transformation technique. As linear systems are amenable to analysis through existing techniques, this study is expected to offer a method of tackling certain classes of non-linear problems which may otherwise prove to be formidable in nature.

Maximum compatible classes from compatibility matrices

A fast algorithm for the computation of maximum compatible classes (mcc) among the internal states of an incompletely specified sequential machine is presented in this paper. All the maximum compatible classes are determined by processing compatibility matrices of progressingly diminishing order, whose total number does not exceed (p + m), where p is the largest cardinality among these classes, and m is the number of such classes. Consequently the algorithm is specially suitable for the state minimization of very large sequential machines as encountered in vlsi circuits and systems.

Information Theoretic Results for Three-User Cognitive Channels

In this paper, we introduce the three-user cognitive radio channels with asymmetric transmitter cooperation, and derive achievable rate regions under several scenarios depending on the type of cooperation and decoding capability at the receivers. Two of the most natural cooperation mechanisms for the three-user channel are considered here: cumulative message sharing (CMS) and primary-only message sharing (PMS). In addition to the message sharing mechanism, the achievable rate region is critically dependent on the decoding capability at the receivers. Here, we consider two scenarios for the decoding capability, and derive an achievable rate region for each one of them by employing a combination of superposition and Gel'fand-Pinsker coding techniques. Finally, to provide a numerical example, we consider the Gaussian channel model to plot the rate regions. In terms of achievable rates, CMS turns out to be a better scheme than PMS. However, the practical aspects of implementing such message-sharing schemes remain to be investigated.

CHITRA: Cognitive handprinted input-trained recursively analyzing system for recognition of alphanumeric characters

A novel system for recognition of handprinted alphanumeric characters has been developed and tested. The system can be employed for recognition of either the alphabet or the numeral by contextually switching on to the corresponding branch of the recognition algorithm. The two major components of the system are the multistage feature extractor and the decision logic tree-type catagorizer. The importance of ldquogoodrdquo features over sophistication in the classification procedures was recognized, and the feature extractor is designed to extract features based on a variety of topological, morphological and similar properties. An information feedback path is provided between the decision logic and the feature extractor units to facilitate an interleaved or recursive mode of operation. This ensures that only those features essential to the recognition of a particular sample are extracted each time. Test implementation has demonstrated the reliability of the system in recognizing a variety of handprinted alphanumeric characters with close to 100% accuracy.

A Multi frequency study of Radio Intensity Variations For Active Galactic Nuclei of Different Optical Classes

A study of radio intensity variations at seven frequencies in the range 0.3 to 90 GHz for compact extragalactic radio sources classified as BL Lacs and high- and low-optical polarization quasars (HPQs and LPQs) is presented. This include the results of flux-density monitoring of 33 compact sources for three years at 327 MHz with the Ooty Synthesis Radio Telescope. The degrees of 'short-term' (tau less than about 1 yr) variability for the three optical types are found to be indistinguishable at low frequencies (less than 1 GHz), pointing to an extrinsic origin for the low-frequency variability. At high frequencies, a distinct dependence on optical type is present, the variability increasing from LPQs, through HPQs to BL Lacs. This trend persists even when only sources with ultra-flat radio spectra (alpha greater than -0.2) are considered. Implications of this for the phenomenon of high-frequency variability and the proposed unification schemes for different optical types of active galactic nuclei are discussed.

Bayesian Decentralized Spectrum Sensing in Cognitive Radio Networks

This paper considers the problem of spectrum sensing, i.e., the detection of whether or not a primary user is transmitting data by a cognitive radio. The Bayesian framework is adopted, with the performance measure being the probability of detection error. A decentralized setup, where N sensors use M observations each to arrive at individual decisions that are combined at a fusion center to form the overall decision is considered. The unknown fading channel between the primary sensor and the cognitive radios makes the individual decision rule computationally complex, hence, a generalized likelihood ratio test (GLRT)-based approach is adopted. Analysis of the probabilities of false alarm and miss detection of the proposed method reveals that the error exponent with respect to M is zero. Also, the fusion of N individual decisions offers a diversity advantage, similar to diversity reception in communication systems, and a tight bound on the error exponent is presented. Through an analysis in the low power regime, the number of observations needed as a function of received power, to achieve a given probability of error is determined. Monte-Carlo simulations confirm the accuracy of the analysis.

Spectral Sensing of Adaptive Frequency Hopping Signal for Cognitive Radio

The issue of dynamic spectrum scene analysis in any cognitive radio network becomes extremely complex when low probability of intercept, spread spectrum systems are present in environment. The detection and estimation become more complex if frequency hopping spread spectrum is adaptive in nature. In this paper, we propose two phase approach for detection and estimation of frequency hoping signals. Polyphase filter bank has been proposed as the architecture of choice for detection phase to efficiently detect the presence of frequency hopping signal. Based on the modeling of frequency hopping signal it can be shown that parametric methods of line spectral analysis are well suited for estimation of frequency hopping signals if the issues of order estimation and time localization are resolved. An algorithm using line spectra parameter estimation and wavelet based transient detection has been proposed which resolves above issues in computationally efficient manner suitable for implementation in cognitive radio. The simulations show promising results proving that adaptive frequency hopping signals can be detected and demodulated in a non cooperative context, even at a very low signal to noise ratio in real time.

Hierarchies of circuit classes that are closed under complement

We examine three hierarchies of circuit classes and show they are closed under complementation. (1) The class of languages recognized by a family of polynomial size skew circuits with width O(w), are closed under complement. (2) The class of languages recognized by family of polynomial size circuits with width O(w) and polynomial tree-size, are closed under complement. (3) The class of languages recognized by a family of polynomial size, O(log(n)) depth, bounded AND fan-in with OR fan-in f (f⩾log(n)) circuits are closed under complement. These improve upon the results of (i) Immerman (1988) and Szelepcsenyi (1988), who show that 𝒩L𝒪𝒢 is closed under complementation, and (ii) Borodin et al. (1989), who show that L𝒪𝒢𝒞ℱL is closed under complement

The goals of cognitive science

In this paper cognitive science is defined as the study of intelligence as a computational process. The several disciplines which contribute to the study of cognitive science are briefly described so as to glean a birds-eye view of the subject of cognitive science.