Delay optimized zero-forcing channel shortening algorithm for wireless communication

In Orthogonal Frequency Division Multiplexing and Discrete Multitone transceivers, a guard interval called Cyclic Prefix (CP) is inserted to avoid inter-symbol interference. The length of the CP is usually greater than the impulse response of the channel resulting in a loss of useful data carriers. In order to avoid long CP, a time domain equalizer is used to shorten the channel. In this paper, we propose a method to include a delay in the zero-forcing equalizer and obtain an optimal value of the delay, based on the location of zeros of the channel. The performance of the algorithms is studied using numerical simulations.

Molecular Insights Revealing Interaction of Tim23 and Channel Subunits of Presequence Translocase

Tim23 is an essential channel-forming subunit of the presequence translocase recruiting multiple components for assembly of the core complex, thereby regulating the protein translocation process. However, understanding of the precise interaction of subunits associating with Tim23 remains largely elusive. Our findings highlight that transmembrane helix 1 (TM1) is required for homodimerization of Tim23, while, together with TM2, it is involved in preprotein binding within the channel. Based on our evidence, we predict that the TM1 and TM2 from each dimer are involved in the formation of the central translocation pore, aided by Tim17. Furthermore, TM2 is also involved in the recruitment of Tim21 and the presequence-associated motor (PAM) subcomplex to the Tim23 channel, while the matrix-exposed loop L1 generates specificity in their association with the core complex. Strikingly, our findings indicate that the C-terminal sequence of Tim23 is dispensable for growth and functions as an inhibitor for binding of Tim21. Our model conceptually explains the cooperative function between Tam41 and Pam17 subunits, while the antagonistic activity of Tim21 predominantly determines the bound and free forms of the PAM subcomplex during import.

Power-Controlled Reverse Channel Training in a Multiuser TDD-MIMO Spatial Multiplexing System With CSIR

This paper considers the design of a power-controlled reverse channel training (RCT) scheme for spatial multiplexing (SM)-based data transmission along the dominant modes of the channel in a time-division duplex (TDD) multiple-input and multiple-output (MIMO) system, when channel knowledge is available at the receiver. A channel-dependent power-controlled RCT scheme is proposed, using which the transmitter estimates the beamforming (BF) vectors required for the forward-link SM data transmission. Tight approximate expressions for 1) the mean square error (MSE) in the estimate of the BF vectors, and 2) a capacity lower bound (CLB) for an SM system, are derived and used to optimize the parameters of the training sequence. Moreover, an extension of the channel-dependent training scheme and the data rate analysis to a multiuser scenario with M user terminals is presented. For the single-mode BF system, a closed-form expression for an upper bound on the average sum data rate is derived, which is shown to scale as ((L-c - L-B,L- tau)/L-c) log logM asymptotically in M, where L-c and L-B,L- tau are the channel coherence time and training duration, respectively. The significant performance gain offered by the proposed training sequence over the conventional constant-power orthogonal RCT sequence is demonstrated using Monte Carlo simulations.

Scheduling for Fading Channels Under Partial Channel Information

We consider a scheduler for the downlink of a wireless channel when only partial channel-state information is available at the scheduler. We characterize the network stability region and provide two throughput-optimal scheduling policies. We also derive a deterministic bound on the mean packet delay in the network. Finally, we provide a throughput-optimal policy for the network under QoS constraints when real-time and rate-guaranteed data traffic may be present.

Channel quantization for physical layer network-coded two-way relaying

The design of modulation schemes for the physical layer network-coded two way relaying scenario is considered with the protocol which employs two phases: Multiple access (MA) Phase and Broadcast (BC) phase. It was observed by Koike-Akino et al. that adaptively changing the network coding map used at the relay according to the channel conditions greatly reduces the impact of multiple access interference which occurs at the relay during the MA phase. In other words, the set of all possible channel realizations (the complex plane) is quantized into a finite number of regions, with a specific network coding map giving the best performance in a particular region. We obtain such a quantization analytically for the case when M-PSK (for M any power of 2) is the signal set used during the MA phase. We show that the complex plane can be classified into two regions: a region in which any network coding map which satisfies the so called exclusive law gives the same best performance and a region in which the choice of the network coding map affects the performance, which is further quantized based on the choice of the network coding map which optimizes the performance. The quantization thus obtained analytically, leads to the same as the one obtained using computer search for 4-PSK signal set by Koike-Akino et al., for the specific value of M = 4.

On the nature of meandering of the springtime western boundary current in the Bay of Bengal

We present evidence that the springtime western boundary current (WBC) in the Bay of Bengal is a continuous northward-flowing current from about 12 degrees N to 17 degrees N, which then separates from the coast at around 18 degrees N. We first revisit a hydrographic data set collected in 1987 from a potential vorticity perspective, and then analyze absolute dynamic height maps from satellite altimeters during the period 2000-2010. The altimetric maps suggest that the mean configuration of the WBC is that of an intense current with two anticyclonic eddies on the offshore side, which are part of the basin-wide anticyclonic circulation. The WBC consistently separates from the coast at around 18 degrees N in all years between 2000 and 2010. The path of the eastward-flowing mean stream after separation appears to be consistent with isolines of f/H and with Ertel's potential vorticity, based on an analysis of the hydrographic data from 1987.

Diversity order vs rate in an AWGN channel

We study the diversity order vs rate of an additive white Gaussian noise (AWGN) channel in the whole capacity region. We show that for discrete input as well as for continuous input, Gallager's upper bounds on error probability have exponential diversity in low and high rate region but only subexponential in the mid-rate region. For the best available lower bounds and for the practical codes one observes exponential diversity throughout the capacity region. However we also show that performance of practical codes is close to Gallager's upper bounds and the mid-rate subexponential diversity has a bearing on the performance of the practical codes. Finally we show that the upper bounds with Gaussian input provide good approximation throughout the capacity region even for finite constellation.

Channel estimation at the transmitter in a reciprocal MIMO spatial multiplexing system

This paper considers the problem of channel estimation at the transmitter in a spatial multiplexing-based Time Division Duplex (TDD) Multiple Input Multiple Output (MIMO) system with perfect CSIR. A novel channel-dependent Reverse Channel Training (RCT) sequence is proposed, using which the transmitter estimates the beamforming vectors for forward link data transmission. This training sequence is designed based on the following two metrics: (i) a capacity lower bound, and (ii) the mean square error in the estimate. The performance of the proposed training scheme is analyzed and is shown to significantly outperform the conventional orthogonal RCT sequence. Also, in the case where the transmitter uses water-filling power allocation for data transmission, a novel RCT sequence is proposed and optimized with respect to the MSE in estimating the transmit covariance matrix.

Achievable rate region of gaussian broadcast channel with finite input alphabet and quantized output

In this paper, we study the achievable rate region of two-user Gaussian broadcast channel (GBC) when the messages to be transmitted to both the users take values from finite signal sets and the received signal is quantized at both the users. We refer to this channel as quantized broadcast channel (QBC). We first observe that the capacity region defined for a GBC does not carry over as such to QBC. Also, we show that the optimal decoding scheme for GBC (i.e., high SNR user doing successive decoding and low SNR user decoding its message alone) is not optimal for QBC. We then propose an achievable rate region for QBC based on two different schemes. We present achievable rate region results for the case of uniform quantization at the receivers. We find that rotation of one of the user's input alphabet with respect to the other user's alphabet marginally enlarges the achievable rate region of QBC when almost equal powers are allotted to both the users.

Delay optimal scheduling of a discrete-time batch service queue for point-to-point channel code rate selection

We consider the problem of characterizing the minimum average delay, or equivalently the minimum average queue length, of message symbols randomly arriving to the transmitter queue of a point-to-point link which dynamically selects a (n, k) block code from a given collection. The system is modeled by a discrete time queue with an IID batch arrival process and batch service. We obtain a lower bound on the minimum average queue length, which is the optimal value for a linear program, using only the mean (λ) and variance (σ2) of the batch arrivals. For a finite collection of (n, k) codes the minimum achievable average queue length is shown to be Θ(1/ε) as ε ↓ 0 where ε is the difference between the maximum code rate and λ. We obtain a sufficient condition for code rate selection policies to achieve this optimal growth rate. A simple family of policies that use only one block code each as well as two other heuristic policies are shown to be weakly optimal in the sense of achieving the 1/ε growth rate. An appropriate selection from the family of policies that use only one block code each is also shown to achieve the optimal coefficient σ2/2 of the 1/ε growth rate. We compare the performance of the heuristic policies with the minimum achievable average queue length and the lower bound numerically. For a countable collection of (n, k) codes, the optimal average queue length is shown to be Ω(1/ε). We illustrate the selectivity among policies of the growth rate optimality criterion for both finite and countable collections of (n, k) block codes.

Low complexity joint estimation of synchronization impairments in sparse channel for MIMO-OFDM system

Low complexity joint estimation of synchronization impairments and channel in a single-user MIMO-OFDM system is presented in this paper. Based on a system model that takes into account the effects of synchronization impairments such as carrier frequency offset, sampling frequency offset, and symbol timing error, and channel, a Maximum Likelihood (ML) algorithm for the joint estimation is proposed. To reduce the complexity of ML grid search, the number of received signal samples used for estimation need to be reduced. The conventional channel estimation techniques using Least-Squares (LS) or Maximum a posteriori (MAP) methods fail for the reduced sample under-determined system, which results in poor performance of the joint estimator. The proposed ML algorithm uses Compressed Sensing (CS) based channel estimation method in a sparse fading scenario, where the received samples used for estimation are less than that required for an LS or MAP based estimation. The performance of the estimation method is studied through numerical simulations, and it is observed that CS based joint estimator performs better than LS and MAP based joint estimator. (C) 2013 Elsevier GmbH. All rights reserved.

The upper Bay of Bengal salinity structure in a high-resolution model

Salinity in the Bay of Bengal is highly heterogeneous, with extremely fresh waters found at the surface in the Northern part of the basin, and saltier waters at subsurface as well as to the south. This paper investigates the seasonal structure of sea surface salinity of the Bay in a regional high-resolution model forced by ERA-Interim reanalysis and various precipitation products. Surface circulation is believed to drive the spreading of northern Bay of Bengal fresh waters to the rest of the Indian Ocean. We first present a series of experiments to infer the sensitivity of modeled circulation to various numerical choices. Surface circulation is found to be sensitive to the horizontal resolution of the model, with the 1/12 degrees version appearing much more realistic than the 1/4 degrees version. The sidewall boundary condition is also drastically influencing the characteristics of the western boundary current simulated. We then investigate the sensitivity of the salinity response to the various precipitation products. We observe that ERA-Interim excess precipitation induces a fresh bias in the surface salinity response. Spaceborne precipitation products are more satisfactory. We then identify the pathways of the northern Bay freshwater mass, based on passive tracers experiments. Our model suggests that over timescales of a few months, vertical exchanges between the upper fresh layer and the underlying saltier layer appear to be the main export pathway for the freshwater. The horizontal circulation within the mixed layer also acts to convey fresh waters out of the Bay at these timescales, but in a lesser quantity compared to the vertical export. Beyond its intrinsic interest for the understanding of Bay of Bengal physics, this study highlights the need for a careful design of any realistic numerical model, in three key aspects: the choice of the resolution of the model, the choice of the sub-grid scale parameterizations, and the choice of the forcing fluxes. (C) 2013 Elsevier Ltd. All rights reserved.

On 2-D Non-Adjacent-Error Channel Models

In this work, we consider two-dimensional (2-D) binary channels in which the 2-D error patterns are constrained so that errors cannot occur in adjacent horizontal or vertical positions. We consider probabilistic and combinatorial models for such channels. A probabilistic model is obtained from a 2-D random field defined by Roth, Siegel and Wolf (2001). Based on the conjectured ergodicity of this random field, we obtain an expression for the capacity of the 2-D non-adjacent-errors channel. We also derive an upper bound for the asymptotic coding rate in the combinatorial model.

Suppression of air bubble in microfluidic channel using electro-acoustic excitation

A simple method to study the air bubble dynamics and to burst the air bubbles formed on the electrode– electrolyte interface in a parallel gate electrode fluidic channel is demonstrated. Upon application of a voltage across the electrodes,volume of water contained between them begins to electrolyzing depending on the conductivity, as well as it boils due to heating effect. This results in bubble formation within. These bubbles grow in radius with higher potential difference applied across the electrodes. As an approach towards removing these bubbles, an alternating current is applied at low potential difference of a 5 volts and high frequency at few megahertz. The alternating electric field had a heating effect on the bubbles where the energy input due to current heats up water and bursts the bubble. The bubbles of size up to 480μm were burst at 2500 V/m using this approach.