Design and Analysis of a Wavelet Packet Modulation Based Differential Chaos Shift Keying Communication System

Wireless Personal Communications - In this paper, a new multicarrier based DCSK system that is combined a wavelet packet modulation (WPM) with differential chaos shift keying (DCSK) and named...     

Process simulation for HgCdTe infrared focal plane array flexible manufacturing

The strategy and status of a process simulator for the flexible manufacture of HgCdTe infrared focal plane arrays is described. It has capabilities to simulate Hg vacancy and interstitial effects and cation impurity diffusion, for various boundary conditions in one dimension. Numerical complexity of these problems stems from the necessity of solving diffusion equations for each defect that are coupled to each other via nonlinear interaction terms. The simulator has already led to the prediction of heretofore unexplained experimental data. Current extensions of the one-dimensional simulator planned over the next few years include the addition of Te antisites, antisite-Hg vacancy pairs, and In-Hg vacancy pairs, ion implantation, and various energetic processes (such as ion milling). The sequential effect of various processes will be possible with the input to the simulator looking much like a process run sheet.     

Synchronizable test sequences based on multiple UIO sequences

A test sequence generation method is proposed for testing the conformance of a protocol implementation to its specification in a remote testing system where both external synchronization and input/output operation costs are taken into consideration. The method consists of a set of transformation rules that constructs a duplexU digraph from a given finite state machine (FSM) representation of a protocol specification; and an algorithm that finds a rural postman tour in the duplexU digraph to generate a synchronizable test sequence utilizing multiple UIO sequences. If the protocol satisfies a specific property, namely, the transitions to be tested and the UIO sequences to be employed form a weakly-connected subgraph of the duplexU digraph, the proposed algorithm yields a minimum-cost test sequence. X.25 DTE and ISO Class 0 transport protocols are shown to possess this property. Otherwise, the algorithm yields a test sequence whose cost is within a bound from the cost of the minimum-cost test sequence. The bound for the test sequence generated from the Q.931 network-side protocol is shown to be the cost sum of an input/output operation pair and an external synchronization operation     

VLM Precoded SLM Technique for PAPR Reduction in OFDM Systems

Orthogonal frequency division multiplexing (OFDM) is perhaps the most spectrally efficient, robust transmission technique discovered so far for communication systems, and it also mitigates the problem of multipath environment. High peak-to-average power ratio (PAPR) has always been a major drawback of the OFDM systems. In this article, a new precoding technique has been proposed based on Vandermonde-like matrix (VLM) and selective mapping (SLM) to reduce PAPR in OFDM systems. VLM precoding reduces the autocorrelation of the input sequences while SLM takes an advantage of the fact that the PAPR is very sensitive to phase shifts of the signal. The main advantage of this proposed scheme is to achieve a significant reduction in PAPR without increasing the system complexity. Computer simulations show that, the proposed method outperforms the existing precoding techniques without degrading the error performance of the system.     

Design of Concentric Circular Antenna Array with Central Element Feeding Using Particle Swarm Optimization with Constriction Factor and Inertia Weight Approach and Evolutionary Programing Technique

In this paper the maximum sidelobe level (SLL) reductions without and with central element feeding in various designs of three-ring concentric circular antenna arrays (CCAA) are examined using a real-coded Evolutionary Programming (EP) to finally determine the global optimal three-ring CCAA design. Standard real-coded Particle Swarm Optimization (PSO) and real-coded Particle Swarm Optimization with Constriction Factor and Inertia Weight Approach (PSOCFIWA) are also employed for comparative optimization but both prove to be suboptimal. This paper assumes non-uniform excitation weights and uniform spacing of excitation elements in each three-ring CCAA design. Among the various CCAA designs, the design containing central element and 4, 6 and 8 elements in three successive concentric rings proves to be such global optimal design set with global minimum SLL (−39.66 dB) as determined by Evolutionary Programming.     

Hierarchical quantization indexing for wavelet and wavelet packet image coding

In this paper, we introduce the quantization index hierarchy, which is used for efficient coding of quantized wavelet and wavelet packet coefficients. A hierarchical classification map is defined in each wavelet subband, which describes the quantized data through a series of index classes. Going from bottom to the top of the tree, neighboring coefficients are combined to form classes that represent some statistics of the quantization indices of these coefficients. Higher levels of the tree are constructed iteratively by repeating this class assignment to partition the coefficients into larger subsets. The class assignments are optimized using a rate-distortion cost analysis. The optimized tree is coded hierarchically from top to bottom by coding the class membership information at each level of the tree. Context-adaptive arithmetic coding is used to improve coding efficiency. The developed algorithm produces PSNR results that are better than the state-of-art wavelet-based and wavelet packet-based coders in literature.     

Wireless distributed computing in cognitive radio networks

Individual cognitive radio nodes in an ad-hoc cognitive radio network (CRN) have to perform complex data processing operations for several purposes, such as situational awareness and cognitive engine (CE) decision making. In an implementation point of view, each cognitive radio (CR) may not have the computational and power resources to perform these tasks by itself. In this paper, wireless distributed computing (WDC) is presented as a technology that enables multiple resource-constrained nodes to collaborate in computing complex tasks in a distributed manner. This approach has several benefits over the traditional approach of local computing, such as reduced energy and power consumption, reduced burden on the resources of individual nodes, and improved robustness. However, the benefits are negated by the communication overhead involved in WDC. This paper demonstrates the application of WDC to CRNs with the help of an example CE processing task. In addition, the paper analyzes the impact of the wireless environment on WDC scalability in homogeneous and heterogeneous environments. The paper also proposes a workload allocation scheme that utilizes a combination of stochastic optimization and decision-tree search approaches. The results show limitations in the scalability of WDC networks, mainly due to the communication overhead involved in sharing raw data pertaining to delegated computational tasks.     

Scheme for reducing size of coefficient memory in FFT processor

Long fast Fourier transforms (FFTs) are required in applications such as orthogonal frequency division multiplexing, radars and sonars. It is highly desirable to reduce the size and power requirements of the FFT so as to realise single chip long FFT-based systems targeting portable applications. Presented here is a novel technique to reduce the coefficient memory almost by a factor of four by exploiting the relationships among the coefficient values thereby significantly reducing the area and power requirements of the hardware