Potential of IRNSS/NavIC L5 signals for ionospheric studies

Indian Space Research Organization (ISRO) has developed an indigenous system named Indian Regional Navigation Satellite System (IRNSS) or NavIC (Navigation with Indian Constellation), that consists of 7 satellites and transmits navigation signal in L and S bands. ISRO, for validation of the system, has installed many IGS (IRNSS/GPS/SBAS) receivers scattered over the Indian region. Using preliminary data from two geographically widely separated stations over India, this paper presents the results on studies on parameters of IRNSS signal quality and discusses how these parameters may be used to study the ionospheric behavior over the Indian region. The results show the importance and advantages of using IRNSS data for such studies.     

High Capacity: Low Delay Packet Broadcast Multiaccess

Demand assigned packet radio schemes using satellites can achieve high bandwidth utilizations but they generally exhibit relatively poor delay performance at low traffic when compared with random access schemes. A modified demand assigned scheme is proposed which improves delay performance at low traffic by allowing random access transmissions by users who are waiting for channel assignments. The proposed scheme provides low average delays at low traffic (comparable to slotted ALOHA) and bandwidth utilizations comparable to that of demand assigned schemes. The scheme has potential application in situations where the traffic loading tends to vary widely.     

Improved multi-target tracking in clutter by PDA smoothing

An algorithm is presented for the recursive tracking of multiple targets in cluttered environment by making use of the joint probabilistic data association fixed-lag smoothing (JPDAS) techniques. It is shown that a significant improvement in the accuracy of track estimation of both nonmaneuvering and maneuvering targets may be achieved by introducing a time lag of one or two sampling periods between the instants of estimation and latest measurement. Results of simulation experiments for a radar tracking problem that demonstrate the effects of fixed-lag smoothing are also presented     

Multitarget tracking in clutter: fast algorithms for dataassociation

Three fast algorithms have been developed to solve the problem of data association in multitarget tracking in clutter. In the first algorithm, the problem of data association is identified as an exhaustive search problem in general. Subsequently, a mathematical model is proposed for the problem of data association in the joint probabilistic data association filter (JPDAF). Based on the model, a depth-first search (DFS) approach is developed for the fast generation of data association hypotheses and the computation of the conditional probabilities of the hypotheses in the JPDAF. When the density of targets is moderate, a second algorithm is developed to directly compute a posteriori probabilities in the JPDAF without generating the data association hypotheses. In the third algorithm, the effect of interference due to closely spaced targets is simplified. An approach to approximately compute the a posteriori probabilities in the JPDAF is developed. The computational complexity of the algorithms is analyzed in the worst case, as well as in the average case     

Sequence CLEAN: a modified deconvolution technique for microwaveimages of contiguous targets

High resolution range profiles usually suffer from range sidelobe artifacts which cause reduction in the dynamic range. The sidelobes can be greatly reduced by a deconvolution technique called Coherent CLEAN. The Coherent CLEAN algorithm is based on the assumption that the scene consists of isolated and independent targets. However, many real-life targets are contiguous. Even if we approximate the contiguous targets by very closely spaced point sources, they can hardly be assumed to radiate independently. The sidelobes and the mainlobes of these closely spaced point sources can interact constructively and destructively causing spurious peaks and peak mislocations. These problems are studied and a variation in the existing Coherent CLEAN algorithm, called Sequence CLEAN, is proposed. Sequence CLEAN is found to work well with actual targets     

Optimum array detector for a weak signal in unknown noise

We study the design of constant false-alarm rate (CFAR) tests for detecting a rank-one signal in the presence of background Gaussian noise with unknown spatial covariance. We look at invariant tests, i.e., those tests whose performance is independent of the nuisance parameters, like the background noise covariance. Such tests are shown to have the desirable CFAR property. We characterize the class of all such tests by showing that any invariant decision statistic can be written as a function of two basic statistics which are in fact the adaptive matched filter (AMF) statistic and Kelly's generalized likelihood ratio statistic. Further, we establish an optimum test in the limit of low signal-to-noise ratio (SNR), the locally most powerful invariant (LMPI) test. We also derive the bound for the probability of detection of any invariant detector, at a fixed false-alarm rate, and compare the LMPI and the published detectors (Kelly and AMF) to it     

Terminal Seeker Pointing-Angle Error at Target Acquisition

Missile terminal guidance seekers that employ optical, infrared, or radar sensors to acquire, lock-on, and track their target are subject to a missile-to-target line-of-sight pointing error during the acquisition phase. The error is due primarily to missile navigation errors (attitude and position) and inaccuracies in predicting the target location. The computational process to obtain the seeker-to-target pointing vector is formulated. Linear perturbation ion of the pointing vector yields the pointing-angle error tions.quaons. A simple quantitative example is given.