Ground State of N Harmonically Bound Anyons in a Magnetic Field

The properties of the ground state of N anyons in an external magnetic field and a harmonic oscillator potential are computed in the large-N limit using the Thomas-Fermi approximation. The number of level crossings in the ground state as a function of the harmonic frequency, the strength and the direction of the magnetic field and N are also studied.

Bound states of two spin-1/2 fermions in a synthetic non-Abelian gauge field

We study the bound states of two spin-1/2 fermions interacting via a contact attraction (characterized by a scattering length) in the singlet channel in three-dimensional space in presence of a uniform non-Abelian gauge field. The configuration of the gauge field that generates a Rashba-type spin-orbit interaction is described by three coupling parameters (lambda(x),lambda(y),lambda(z)). For a generic gauge field configuration, the critical scattering length required for the formation of a bound state is negative, i.e., shifts to the ``BCS side'' of the resonance. Interestingly, we find that there are special high-symmetry configurations (e.g., lambda(x) = lambda(y) = lambda(z)) for which there is a two-body bound state for any scattering length however small and negative. Remarkably, the bound-state wave functions obtained for such configurations have nematic spin structure similar to those found in liquid He-3. Our results show that the BCS-BEC (Bose-Einstein condensation) crossover is drastically affected by the presence of a non-Abelian gauge field. We discuss possible experimental signatures of our findings both at high and low temperatures.

Reduced ML-Decoding Complexity, Full-Rate STBCs for 4 Transmit Antenna Systems

For an n(t) transmit, n(r) receive antenna system (n(t) x nr system), a full-rate space time block code (STBC) transmits min(n(t), n(r)) complex symbols per channel use. In this paper, a scheme to obtain a full-rate STBC for 4 transmit antennas and any n(r), with reduced ML-decoding complexity is presented. The weight matrices of the proposed STBC are obtained from the unitary matrix representations of a Clifford Algebra. By puncturing the symbols of the STBC, full rate designs can be obtained for n(r) < 4. For any value of n(r), the proposed design offers the least ML-decoding complexity among known codes. The proposed design is comparable in error performance to the well known Perfect code for 4 transmit antennas while offering lower ML-decoding complexity. Further, when n(r) < 4, the proposed design has higher ergodic capacity than the punctured Perfect code. Simulation results which corroborate these claims are presented.

On Network-Error Correcting Convolutional Codes under the BSC Edge Error Model

Convolutional network-error correcting codes (CNECCs) are known to provide error correcting capability in acyclic instantaneous networks within the network coding paradigm under small field size conditions. In this work, we investigate the performance of CNECCs under the error model of the network where the edges are assumed to be statistically independent binary symmetric channels, each with the same probability of error pe(0 <= p(e) < 0.5). We obtain bounds on the performance of such CNECCs based on a modified generating function (the transfer function) of the CNECCs. For a given network, we derive a mathematical condition on how small p(e) should be so that only single edge network-errors need to be accounted for, thus reducing the complexity of evaluating the probability of error of any CNECC. Simulations indicate that convolutional codes are required to possess different properties to achieve good performance in low p(e) and high p(e) regimes. For the low p(e) regime, convolutional codes with good distance properties show good performance. For the high p(e) regime, convolutional codes that have a good slope ( the minimum normalized cycle weight) are seen to be good. We derive a lower bound on the slope of any rate b/c convolutional code with a certain degree.

A Low-Complexity, Full-Rate, Full-Diversity 2 x 2 STBC with Golden Code's Coding Gain

This paper presents a low-ML-decoding-complexity, full-rate, full-diversity space-time block code (STBC) for a 2 transmit antenna, 2 receive antenna multiple-input multiple-output (MIMO) system, with coding gain equal to that of the best and well known Golden code for any QAM constellation. Recently, two codes have been proposed (by Paredes, Gershman and Alkhansari and by Sezginer and Sari), which enjoy a lower decoding complexity relative to the Golden code, but have lesser coding gain. The 2 x 2 STBC presented in this paper has lesser decoding complexity for non-square QAM constellations, compared with that of the Golden code, while having the same decoding complexity for square QAM constellations. Compared with the Paredes-Gershman-Alkhansari and Sezginer-Sari codes, the proposed code has the same decoding complexity for non-rectangular QAM constellations. Simulation results, which compare the codeword error rate (CER) performance, are presented.

High-Rate Space-Time Coded Large MIMO Systems: Low-Complexity Detection and Performance

Large MIMO systems with tens of antennas in each communication terminal using full-rate non-orthogonal space-time block codes (STBC) from Cyclic Division Algebras (CDA) can achieve the benefits of both transmit diversity as well as high spectral efficiencies. Maximum-likelihood (ML) or near-ML decoding of these large-sized STBCs at low complexities, however, has been a challenge. In this paper, we establish that near-ML decoding of these large STBCs is possible at practically affordable low complexities. We show that the likelihood ascent search (LAS) detector, reported earlier by us for V-BLAST, is able to achieve near-ML uncoded BER performance in decoding a 32x32 STBC from CDA, which employs 32 transmit antennas and sends 32(2) = 1024 complex data symbols in 32 time slots in one STBC matrix (i.e., 32 data symbols sent per channel use). In terms of coded BER, with a 16x16 STBC, rate-3/4 turbo code and 4-QAM (i.e., 24 bps/Hz), the LAS detector performs close to within just about 4 dB from the theoretical MIMO capacity. Our results further show that, with LAS detection, information lossless (ILL) STBCs perform almost as good as full-diversity ILL (FD-ILL) STBCs. Such low-complexity detectors can potentially enable implementation of high spectral efficiency large MIMO systems that could be considered in wireless standards.

Calcium/Calmodulin Dependent Protein Kinase II Bound to NMDA Receptor 2B Subunit Exhibits Increased ATP Affinity and Attenuated Dephosphorylation

Calcium/calmodulin dependent protein kinase II (CaMKII) is implicated to play a key role in learning and memory. NR2B subunit of N-methyl-D-aspartate receptor (NMDAR) is a high affinity binding partner of CaMKII at the postsynaptic membrane. NR2B binds to the T-site of CaMKII and modulates its catalysis. By direct measurement using isothermal titration calorimetry (ITC), we show that NR2B binding causes about 11 fold increase in the affinity of CaMKII for ATP gamma S, an analogue of ATP. ITC data is also consistent with an ordered binding mechanism for CaMKII with ATP binding the catalytic site first followed by peptide substrate. We also show that dephosphorylation of phospho-Thr(286)-alpha-CaMKII is attenuated when NR2B is bound to CaMKII. This favors the persistence of Thr(286) autophosphorylated state of CaMKII in a CaMKII/phosphatase conjugate system in vitro. Overall our data indicate that the NR2B- bound state of CaMKII attains unique biochemical properties which could help in the efficient functioning of the proposed molecular switch supporting synaptic memory.

Low-Complexity Detection and Performance in Multi-Gigabit High Spectral Efficiency Wireless Systems

Recently, we reported a low-complexity likelihood ascent search (LAS) detection algorithm for large MIMO systems with several tens of antennas that can achieve high spectral efficiencies of the order of tens to hundreds of bps/Hz. Through simulations, we showed that this algorithm achieves increasingly near SISO AWGN performance for increasing number of antennas in Lid. Rayleigh fading. However, no bit error performance analysis of the algorithm was reported. In this paper, we extend our work on this low-complexity large MIMO detector in two directions: i) We report an asymptotic bit error probability analysis of the LAS algorithm in the large system limit, where N-t, N-r -> infinity keeping N-t = N-r, where N-t and N-r are the number of transmit and receive antennas, respectively. Specifically, we prove that the error performance of the LAS detector for V-BLAST with 4-QAM in i.i.d. Rayleigh fading converges to that of the maximum-likelihood (ML) detector as N-t, N-r -> infinity keeping N-t = N-r ii) We present simulated BER and nearness to capacity results for V-BLAST as well as high-rate non-orthogonal STBC from Division Algebras (DA), in a more realistic spatially correlated MIMO channel model. Our simulation results show that a) at an uncoded BER of 10(-3), the performance of the LAS detector in decoding 16 x 16 STBC from DA with N-t = = 16 and 16-QAM degrades in spatially correlated fading by about 7 dB compared to that in i.i.d. fading, and 19) with a rate-3/4 outer turbo code and 48 bps/Hz spectral efficiency, the performance degrades by about 6 dB at a coded BER of 10(-4). Our results further show that providing asymmetry in number of antennas such that N-r > N-t keeping the total receiver array length same as that for N-r = N-t, the detector is able to pick up the extra receive diversity thereby significantly improving the BER performance.

Rudiments of complexity theory for scientists and engineers

Complexity theory is an important and growing area in computer science that has caught the imagination of many researchers in mathematics, physics and biology. In order to reach out to a large section of scientists and engineers, the paper introduces elementary concepts in complexity theory in a informal manner, motivating the reader with many examples.

A polynomial bound on the number of light cycles in an undirected graph

Let G be an undirected graph with a positive real weight on each edge. It is shown that the number of minimum-weight cycles of G is bounded above by a polynomial in the number of edges of G. A similar bound holds if we wish to count the number of cycles with weight at most a constant multiple of the minimum weight of a cycle of G.

Structure of basic winged-bean lectin and a comparison with its saccharide-bound form

The crystal structure of the saccharide-free form of the basic form of winged-bean agglutinin (WBAI) has been solved by the molecular-replacement method and refined at 2.3 Angstrom resolution The final R factor is 19.74b for all data in the resolution range 8.0-2.3 Angstrom. The asymmetric unit contains two half-dimers, each located on a crystallographic twofold axis. The structure of the saccharide-free form is compared with that of the complex of WBAI wi th methyl-alpha-D-galactoside. The complex is composed of two dimers in the asymmetric unit. The intersubunit interactions in the dimer are nearly identical in the two structures The binding site of the saccharide-free structure contains three ordered water molecules at positions similar to those of the hydroxyl groups of the carbohydrate which an hydrogen bonded to the protein. Superposition of the saccharide-binding sites of the two structures shows that the major changes involve expulsion of these ordered water molecules and a shift of about 0.6 Angstrom of the main-chain atoms of the variable loop.

A New Full-diversity Criterion and Low-complexity STBCs with Partial Interference Cancellation Decoding

Recently, Guo and Xia gave sufficient conditions for an STBC to achieve full diversity when a PIC (Partial Interference Cancellation) or a PIC-SIC (PIC with Successive Interference Cancellation) decoder is used at the receiver. In this paper, we give alternative conditions for an STBC to achieve full diversity with PIC and PIC-SIC decoders, which are equivalent to Guo and Xia's conditions, but are much easier to check. Using these conditions, we construct a new class of full diversity PIC-SIC decodable codes, which contain the Toeplitz codes and a family of codes recently proposed by Zhang, Xu et. al. as proper subclasses. With the help of the new criteria, we also show that a class of PIC-SIC decodable codes recently proposed by Zhang, Shi et. al. can be decoded with much lower complexity than what is reported, without compromising on full diversity.

On the diversity and complexity of Zero Forcing receivers for MIMO Zero Padded systems

Zero padded systems with linear receivers are shown to be robust and amenable to fast implementations in single antenna scenarios. In this paper, properties of such systems are investigated when multiple antennas are present at both ends of the communication link. In particular, their diversity and complexity are evaluated for precoded transmissions. The linear receivers are shown to exploit multipath and receive diversities, even in the absence of any coding at the transmitter. Use of additional redundancy to improve performance is considered and the effect of transmission rate on diversity order is analyzed. Low complexity implementations of Zero Forcing receivers are devised to further enhance their applicability.