Channel Precoding for STBCs from Generalized Pseudo Orthogonal Designs

Statistical information about the wireless channel can be used at the transmitter side to enhance the performance of MIMO systems. This paper addresses how the concept of channel precoding can be used to enhance the performance of STBCs from Generalized Pseudo Orthogonal Designs which were first introduced by Zhu and Jafarkhani. Such designs include some important classes of STBCs that are directly derivable from Quasi-Orthogonal Designs and Co-ordinate Interleaved Orthogonal Designs.

Generalized Silver Codes

For an n(t) transmit, n(r) receive antenna system (n(t) x n(r) system), a full-rate space time block code (STBC) transmits at least n(min) = min(n(t), n(r))complex symbols per channel use. The well-known Golden code is an example of a full-rate, full-diversity STBC for two transmit antennas. Its ML-decoding complexity is of the order of M(2.5) for square M-QAM. The Silver code for two transmit antennas has all the desirable properties of the Golden code except its coding gain, but offers lower ML-decoding complexity of the order of M(2). Importantly, the slight loss in coding gain is negligible compared to the advantage it offers in terms of lowering the ML-decoding complexity. For higher number of transmit antennas, the best known codes are the Perfect codes, which are full-rate, full-diversity, information lossless codes (for n(r) >= n(t)) but have a high ML-decoding complexity of the order of M(ntnmin) (for n(r) < n(t), the punctured Perfect codes are considered). In this paper, a scheme to obtain full-rate STBCs for 2(a) transmit antennas and any n(r) with reduced ML-decoding complexity of the order of M(nt)(n(min)-3/4)-0.5 is presented. The codes constructed are also information lossless for >= n(t), like the Perfect codes, and allow higher mutual information than the comparable punctured Perfect codes for n(r) < n(t). These codes are referred to as the generalized Silver codes, since they enjoy the same desirable properties as the comparable Perfect codes (except possibly the coding gain) with lower ML-decoding complexity, analogous to the Silver code and the Golden code for two transmit antennas. Simulation results of the symbol error rates for four and eight transmit antennas show that the generalized Silver codes match the punctured Perfect codes in error performance while offering lower ML-decoding complexity.

Cramer-Rao bounds for source localization in shallow ocean with generalized Gaussian noise

Localization of underwater acoustic sources is a problem of great interest in the area of ocean acoustics. There exist several algorithms for source localization based on array signal processing.It is of interest to know the theoretical performance limits of these estimators. In this paper we develop expressions for the Cramer-Rao-Bound (CRB) on the variance of direction-of-arrival(DOA) and range-depth estimators of underwater acoustic sources in a shallow range-independent ocean for the case of generalized Gaussian noise. We then study the performance of some of the popular source localization techniques,through simulations, for DOA/range-depth estimation of underwater acoustic sources in shallow ocean by comparing the variance of the estimators with the corresponding CRBs.

Confinement-deconfinement transition and spin correlations in a generalized Kitaev model

We present a spin model, namely, the Kitaev model augmented by a loop term and perturbed by an Ising Hamiltonian, and show that it exhibits both confinement-deconfinement transitions from spin liquid to antiferromagnetic/spin-chain/ferromagnetic phases and topological quantum phase transitions between gapped and gapless spin-liquid phases. We develop a fermionic resonating-valence-bonds (RVB) mean-field theory to chart out the phase diagram of the model and estimate the stability of its spin-liquid phases, which might be relevant for attempts to realize the model in optical lattices and other spin systems. We present an analytical mean-field theory to study the confinement-deconfinement transition for large coefficient of the loop term and show that this transition is first order within such mean-field analysis in this limit. We also conjecture that in some other regimes, the confinement-deconfinement transitions in the model, predicted to be first order within the mean-field theory, may become second order via a defect condensation mechanism. Finally, we present a general classification of the perturbations to the Kitaev model on the basis of their effect on it's spin correlation functions and derive a necessary and sufficient condition, within the regime of validity of perturbation theory, for the spin correlators to exhibit a long-ranged power-law behavior in the presence of such perturbations. Our results reproduce those of Tikhonov et al. [Phys. Rev. Lett. 106, 067203 (2011)] as a special case.

Exact controllability of generalized Hammerstein type equation

In this article, we study the exact controllability of an abstract model described by the controlled generalized Hammerstein type integral equation $$ x(t) = int_0^t h(t,s)u(s)ds+ int_0^t k(t,s,x)f(s,x(s))ds, quad 0 leq t leq T less than infty, $$ where, the state $x(t)$ lies in a Hilbert space $H$ and control $u(t)$ lies another Hilbert space $V$ for each time $t in I=[0,T]$, $T$ greater than 0. We establish the controllability result under suitable assumptions on $h, k$ and $f$ using the monotone operator theory.

Generalized distributive law for ML decoding of STBCs

The Generalized Distributive Law (GDL) is a message passing algorithm which can efficiently solve a certain class of computational problems, and includes as special cases the Viterbi's algorithm, the BCJR algorithm, the Fast-Fourier Transform, Turbo and LDPC decoding algorithms. In this paper GDL based maximum-likelihood (ML) decoding of Space-Time Block Codes (STBCs) is introduced and a sufficient condition for an STBC to admit low GDL decoding complexity is given. Fast-decoding and multigroup decoding are the two algorithms used in the literature to ML decode STBCs with low complexity. An algorithm which exploits the advantages of both these two is called Conditional ML (CML) decoding. It is shown in this paper that the GDL decoding complexity of any STBC is upper bounded by its CML decoding complexity, and that there exist codes for which the GDL complexity is strictly less than the CML complexity. Explicit examples of two such families of STBCs is given in this paper. Thus the CML is in general suboptimal in reducing the ML decoding complexity of a code, and one should design codes with low GDL complexity rather than low CML complexity.

The generalized Onsager model for the secondary flow in a high-speed rotating cylinder

The generalizations of the Onsager model for the radial boundary layer and the Carrier-Maslen model for the end-cap axial boundary layer in a high-speed rotating cylinder are formulated for studying the secondary gas flow due to wall heating and due to insertion of mass, momentum and energy into the cylinder. The generalizations have wider applicability than the original Onsager and Carrier-Maslen models, because they are not restricted to the limit A >> 1, though they are restricted to the limit R e >> 1 and a high-aspect-ratio cylinder whose length/diameter ratio is large. Here, the stratification parameter A = root m Omega(2)R(2)/2k(B)T). This parameter A is the ratio of the peripheral speed, Omega R, to the most probable molecular speed, root 2k(B)T/m, the Reynolds number Re = rho w Omega R(2)/mu, where m is the molecular mass, Omega and R are the rotational speed and radius of the cylinder, k(B) is the Boltzmann constant, T is the gas temperature, rho(w) is the gas density at wall, and mu is the gas viscosity. In the case of wall forcing, analytical solutions are obtained for the sixth-order generalized Onsager equations for the master potential, and for the fourth-order generalized Carrier-Maslen equation for the velocity potential. For the case of mass/momentum/energy insertion into the flow, the separation-of-variables procedure is used, and the appropriate homogeneous boundary conditions are specified so that the linear operators in the axial and radial directions are self-adjoint. The discrete eigenvalues and eigenfunctions of the linear operators (sixth-order and second-order in the radial and axial directions for the Onsager equation, and fourth-order and second-order in the axial and radial directions for the Carrier-Maslen equation) are determined. These solutions are compared with direct simulation Monte Carlo (DSMC) simulations. The comparison reveals that the boundary conditions in the simulations and analysis have to be matched with care. The commonly used `diffuse reflection' boundary conditions at solid walls in DSMC simulations result in a non-zero slip velocity as well as a `temperature slip' (gas temperature at the wall is different from wall temperature). These have to be incorporated in the analysis in order to make quantitative predictions. In the case of mass/momentum/energy sources within the flow, it is necessary to ensure that the homogeneous boundary conditions are accurately satisfied in the simulations. When these precautions are taken, there is excellent agreement between analysis and simulations, to within 10 %, even when the stratification parameter is as low as 0.707, the Reynolds number is as low as 100 and the aspect ratio (length/diameter) of the cylinder is as low as 2, and the secondary flow velocity is as high as 0.2 times the maximum base flow velocity. The predictions of the generalized models are also significantly better than those of the original Onsager and Carrier-Maslen models, which are restricted to thin boundary layers in the limit of high stratification parameter.

A generalized network alignment for three-source three-destination multiple unicast networks with delays

The concept of interference alignment when extended to three-source three-destination instantaneous multiple unicast network for the case where, each source-destination pair has a min-cut of 1 and zero-interference conditions are not satisfied, is known to achieve a rate of half for every source-destination pair under certain conditions [6]. This was called network alignment. We generalize this concept of network alignment to three-source three-destination multiple unicast (3S-3D-MU) networks with delays, without making use of memory at the intermediate nodes (i.e., nodes other than the sources and destinations) and using time varying Local Encoding Kernels (LEKs). This achieves half the rate corresponding to the individual source-destination min-cut for some classes of 3S-3D-MU network with delays which do not satisfy the zero-interference conditions.

A Generalized Enthalpy Update Scheme for Solidification of a Binary Alloy with Solid Phase Movement

A generalized enthalpy update scheme is presented for evaluating solid and liquid fractions during the solidification of binary alloys, taking solid movement into consideration. A fixed-grid, enthalpy-based method is developed such that the scheme accounts for equilibrium as well as for nonequilibrium solidification phenomena, along with solid phase movement. The effect of solid movement on the solidification interface shape and macrosegregation is highlighted.

On Generalized Reed-Muller Expansions

The generalized Reed-Muller expansions of a switching function are generated using a single Boolean matrix and step-by-step shifting of the principal column.

Noncommutative vortices and instantons from generalized Bose operators

Generalized Bose operators correspond to reducible representations of the harmonic oscillator algebra. We demonstrate their relevance in the construction of topologically non-trivial solutions in noncommutative gauge theories, focusing our attention to flux tubes, vortices, and instantons. Our method provides a simple new relation between the topological charge and the number of times the basic irreducible representation occurs in the reducible representation underlying the generalized Bose operator. When used in conjunction with the noncommutative ADHM construction, we find that these new instantons are in general not unitarily equivalent to the ones currently known in literature.

Generalized method for assessment of compressibility of rockfill material

Examination of experimental data of the modelled rockfill materials using parallel gradation technique has revealed that the plots of logarithm of strain at failure against logarithm of confining pressure are linear. Also, a trend of increase in failure strain with increase in confining pressure and maximum size of the particle have been observed. The approach presented in this paper highlights the prediction of volume change properties of rockfill materials over a range of confining pressures and particle sizes based on the results of only two tests carried out at two different confining pressures for a maximum particle size of modelled material with the use of parallel gradation technique. Two test approach and its application in modelling of rockfill materials to estimate its volume change behaviour is illustrated by means of a selected experimental data available in the literature.

Generalized frequent episodes in Event Sequences

Discovering patterns in temporal data is an important task in Data Mining. A successful method for this was proposed by Mannila et al. [1] in 1997. In their framework, mining for temporal patterns in a database of sequences of events is done by discovering the so called frequent episodes. These episodes characterize interesting collections of events occurring relatively close to each other in some partial order. However, in this framework(and in many others for finding patterns in event sequences), the ordering of events in an event sequence is the only allowed temporal information. But there are many applications where the events are not instantaneous; they have time durations. Interesting episodesthat we want to discover may need to contain information regarding event durations etc. In this paper we extend Mannila et al.’s framework to tackle such issues. In our generalized formulation, episodes are defined so that much more temporal information about events can be incorporated into the structure of an episode. This significantly enhances the expressive capability of the rules that can be discovered in the frequent episode framework. We also present algorithms for discovering such generalized frequent episodes.

Statistical properties of entropy-consuming fluctuations in jammed states of laponite suspensions: Fluctuation relations and generalized Gumbel distribution

We report a universal large deviation behavior of spatially averaged global injected power just before the rejuvenation of the jammed state formed by an aging suspension of laponite clay under an applied stress. The probability distribution function (PDF) of these entropy consuming strongly non-Gaussian fluctuations follow an universal large deviation functional form described by the generalized Gumbel (GG) distribution like many other equilibrium and nonequilibrium systems with high degree of correlations but do not obey the Gallavotti-Cohen steady-state fluctuation relation (SSFR). However, far from the unjamming transition (for smaller applied stresses) SSFR is satisfied for both Gaussian as well as non-Gaussian PDF. The observed slow variation of the mean shear rate with system size supports a recent theoretical prediction for observing GG distribution.