Space–Time Power Schedule for Distributed MIMO Links Without Instantaneous Channel State Information at the Transmitting Nodes

A space-time optimal power schedule for multiple distributed multiple-input multiple-output (MIMO) links without the knowledge of the instantaneous channel state information (CSI) at the transmitting nodes is proposed. A readily computable expression for the ergodic sum capacity of the MIMO links is derived. Based on this expression, which is a non-convex function of power allocation vectors, a projected gradient algorithm is developed to optimize the power allocation. For a symmetric set of MIMO links with independent identically distributed channels, it is observed that the space-time optimal power schedule reduces to a uniform isotropic power schedule when nominal interference is low, or to an orthogonal isotropic power schedule when nominal interference is high. Furthermore, the transition region between the latter two schedules is seen to be very sharp in terms of nominal interference-to-noise ratio (INR). For MIMO links with correlated channels, the corresponding space-time optimal power schedule is developed based on the knowledge of the channel correlation matrices. It is shown that the channel correlation has a great impact on the ergodic capacity and the optimality of different power scheduling approaches.     

Cumulant-based approach to harmonic retrieval and related problems

A frequently encountered problem in signal processing is that of estimating the frequencies and amplitudes of harmonics observed in additive colored Gaussian noise. In practice, the observed signals are contaminated with spatially and temporally colored noise of unknown power spectral density. A cumulant-based approach to these problems is proposed. The cumulants of complex processes are defined, and it is shown that specific 1-D slices of the fourth-order cumulant of the noisy signal for the direction of arrival (DOA) and retrieval of harmonics in noise (RHN) problems are identical to the autocorrelation of a related noiseless signal. Hence correlation-based high-resolution methods may be used with fourth-order cumulants as well. The effectiveness of the proposed methods is demonstrated through standard simulation examples     

Certain Investigation on Healthcare Monitoring for Enhancing Data Transmission in WSN

International Journal of Wireless Information Networks - Wireless Sensor Networks are often to perform autonomous sensing and controlling the real world objects through the sensor nodes across the...     

Algorithms for computing diffuse reflection paths in polygons

Let s be a point source of light inside a polygon P of n vertices. A polygonal path from s to some point t inside P is called a diffuse reflection path if the turning points of the path lie on edges of?P. A?diffuse reflection path is said to be optimal if it has the minimum number of reflections on the path. The problem of computing a diffuse reflection path from s to t inside P has not been considered explicitly in the past. We present three different algorithms for this problem which produce suboptimal paths. For constructing such a path, the first algorithm uses a greedy method, the second algorithm uses a transformation of a minimum link path, and the third algorithm uses the edge–edge visibility graph of?P. The first two algorithms are for polygons without holes, and they run in O(n+klogn) time, where k denotes the number of reflections in the constructed path. The third algorithm is for polygons with or without holes, and it runs in O(n ²) time. The number of reflections in the path produced by this third algorithm can be at most three times that of an optimal diffuse reflection path. Though the combinatorial approach used in the third algorithm gives a better bound on the number of reflections on the path, the first and the second algorithms stand on the merit of their elegant geometric approaches based on local geometric information.     

Effect of High Pressure Pretreatments on Structural and Dehydration Characteristics of Aloe Vera (Aloe barbadensis Miller) Cubes

The effect of high-pressure (HP) pretreatments (300–500 MPa for 5–15 min) on dehydration characteristics of aloe vera cubes (AVC), dried at 50–70°C and air velocity of 1–2 m/s, was studied. Pretreatments resulted in higher drying rates, leading to a reduction in drying time compared to untreated ones. The drying rate and drying time were most significantly affected (p < 0.05) by the drying temperature, followed by air velocity, pressure level, and dwell time. HPP enhanced the firmness of AVC with a maximum of up to 21% for the sample treated at 500 MPa for 15 min. Microstructural analysis using scanning electron microscopy (SEM) indicated non-uniform structures in the pretreated and dried AVC samples. Semi-quantitative elemental detection (EDS) confirmed the presence of a considerable amount (14%) of calcium in aloe vera.     

Noncoherent Ultra-Wideband (De)Modulation

Ultra-wideband (UWB) radios have received increasing attention recently for their potential to overlay legacy systems, their low-power consumption and low-complexity implementation. Because of the pulsed or duty-cycled nature of the ultra-short transmitted waveforms, timing synchronization and channel estimation pose major, and often conflicting, challenges and requirements. In order to address (or in fact bypass) both tasks, we design and test noncoherent UWB (de)modulation schemes, which remain operational even without timing and channel information. Relying on integrate-and-dump operations of what we term "dirty templates," we first derive a maximum likelihood (ML) optimal noncoherent UWB demodulator. We further establish a conditional ML demodulator with lower complexity. Analysis and simulations show that both can also be applied after (possibly imperfect) timing acquisition. Under the assumption of perfect timing, our noncoherent UWB scheme reduces to a differential UWB system. Our approach can also be adapted to a transmitted reference (TR) UWB system. We show that the resultant robust-to-timing TR (RTTR) approach considerably improves performance of the original TR system in the presence of timing offsets or residual timing acquisition errors     

Decentralized cognitive MAC for opportunistic spectrum access in ad hoc networks: A POMDP framework

We propose decentralized cognitive MAC protocols that allow secondary users to independently search for spectrum opportunities without a central coordinator or a dedicated communication channel. Recognizing hardware and energy constraints, we assume that a secondary user may not be able to perform full-spectrum sensing or may not be willing to monitor the spectrum when it has no data to transmit. We develop an analytical framework for opportunistic spectrum access based on the theory of partially observable Markov decision process (POMDP). This decision-theoretic approach integrates the design of spectrum access protocols at the MAC layer with spectrum sensing at the physical layer and traffic statistics determined by the application layer of the primary network. It also allows easy incorporation of spectrum sensing error and constraint on the probability of colliding with the primary users. Under this POMDP framework, we propose cognitive MAC protocols that optimize the performance of secondary users while limiting the interference perceived by primary users. A suboptimal strategy with reduced complexity yet comparable performance is developed. Without additional control message exchange between the secondary transmitter and receiver, the proposed decentralized protocols ensure synchronous hopping in the spectrum between the transmitter and the receiver in the presence of collisions and spectrum sensing errors     

Optimal Feature Extraction Using Greedy Approach for Random Image Components and Subspace Approach in Face Recognition

An innovative and uniform framework based on a combination of Gabor wavelets with principal component analysis (PCA) and multiple discriminant analysis (MDA) is presented in this paper. In this framework, features are extracted from the optimal random image components using greedy approach. These feature vectors are then projected to subspaces for dimensionality reduction which is used for solving linear problems. The design of Gabor filters, PCA and MDA are crucial processes used for facial feature extraction. The FERET, ORL and YALE face databases are used to generate the results. Experiments show that optimal random image component selection (ORICS) plus MDA outperforms ORICS and subspace projection approach such as ORICS plus PCA. Our method achieves 96.25%, 99.44% and 100% recognition accuracy on the FERET, ORL and YALE databases for 30% training respectively. This is a considerably improved performance compared with other standard methodologies described in the literature.     

Effects of charge temperature and exhaust gas re-circulation on combustion and emission characteristics of an acetylene fuelled HCCI engine

In this work, experiments were conducted on a homogeneous charge compression ignition (HCCI) engine with acetylene as the sole fuel at different power outputs. Initially, the intake air was heated to different temperatures in order to determine the optimum level at every output. Charge temperatures needed were in the range of 40-110 °C from no load to a BMEP (Brake Mean Effective Pressure) of 4 bar. Subsequently, exhaust gas re-circulation (EGR) was done at the identified charge temperatures and brake thermal efficiency was found to improve. At high BMEPs, use of EGR led to knocking. Thus, fine control over charge temperature and EGR quantity is needed at these conditions. Nitric oxide and smoke levels were very low. However, HC levels were high at about 1700-2700 ppm. Brake thermal efficiencies were comparable to or even better than the compression ignition mode of operation.