A Low ML-Decoding Complexity, Full-Diversity, Full-Rate MIMO Precoder

Precoding for multiple-input multiple-output (MIMO) antenna systems is considered with perfect channel knowledge available at both the transmitter and the receiver. For two transmit antennas and QAM constellations, a real-valued precoder which is approximately optimal (with respect to the minimum Euclidean distance between points in the received signal space) among real-valued precoders based on the singular value decomposition (SVD) of the channel is proposed. The proposed precoder is obtainable easily for arbitrary QAM constellations, unlike the known complex-valued optimal precoder by Collin et al. for two transmit antennas which is in existence for 4-QAM alone and is extremely hard to obtain for larger QAM constellations. The proposed precoding scheme is extended to higher number of transmit antennas on the lines of the E - d(min) precoder for 4-QAM by Vrigneau et al. which is an extension of the complex-valued optimal precoder for 4-QAM. The proposed precoder's ML-decoding complexity as a function of the constellation size M is only O(root M)while that of the E - d(min) precoder is O(M root M)(M = 4). Compared to the recently proposed X- and Y-precoders, the error performance of the proposed precoder is significantly better while being only marginally worse than that of the E - d(min) precoder for 4-QAM. It is argued that the proposed precoder provides full-diversity for QAM constellations and this is supported by simulation plots of the word error probability for 2 x 2, 4 x 4 and 8 x 8 systems.

Charge Density Analysis of a Pentaborate Ion in an Ammonium Borate: Toward the Understanding of Topological Features in Borate Minerals

Structural and charge density distribution studies have been carried out on a single crystal data of an ammonium borate, [C(10)H(26)N(4)][B(5)O(6)(OH)(4)](2), synthesized by solvothermal method. Further, the experimentally observed geometry is used for the theoretical charge density calculations using the B3LYP/6-31G** level of theory, and the results are compared with the experimental values. Topological analysis of charge density based on the Atoms in Molecules approach for B-O bonds exhibit mixed covalent/ionic character. Detailed analysis of the hydrogen bonds in the crystal structure in the ammonium borate provides insights into the understanding of the reaction pathways that net atomic charges and electrostatic potential isosurfaces also give additional such systems. could result in the formation of borate minerals. The input to evaluate chemical and physical properties in such systems.

Low-Complexity Detection in Large-Dimension MIMO-ISI Channels Using Graphical Models

In this paper, we deal with low-complexity near-optimal detection/equalization in large-dimension multiple-input multiple-output inter-symbol interference (MIMO-ISI) channels using message passing on graphical models. A key contribution in the paper is the demonstration that near-optimal performance in MIMO-ISI channels with large dimensions can be achieved at low complexities through simple yet effective simplifications/approximations, although the graphical models that represent MIMO-ISI channels are fully/densely connected (loopy graphs). These include 1) use of Markov random field (MRF)-based graphical model with pairwise interaction, in conjunction with message damping, and 2) use of factor graph (FG)-based graphical model with Gaussian approximation of interference (GAI). The per-symbol complexities are O(K(2)n(t)(2)) and O(Kn(t)) for the MRF and the FG with GAI approaches, respectively, where K and n(t) denote the number of channel uses per frame, and number of transmit antennas, respectively. These low-complexities are quite attractive for large dimensions, i.e., for large Kn(t). From a performance perspective, these algorithms are even more interesting in large-dimensions since they achieve increasingly closer to optimum detection performance for increasing Kn(t). Also, we show that these message passing algorithms can be used in an iterative manner with local neighborhood search algorithms to improve the reliability/performance of M-QAM symbol detection.

Topological analysis of general linear networks

A new method of network analysis, a generalization in several different senses of existing methods and applicable to all networks for which a branch-admittance (or impedance) matrix can be formed, is presented. The treatment of network determinants is very general and essentially four terminal rather than three terminal, and leads to simple expressions based on trees of a simple graph associated with the network and matrix, and involving products of low-order, usually(2 times 2)determinants of tree-branch admittances, in addition to tree-branch products as in existing methods. By comparison with existing methods, the total number of trees and of tree pairs is usually considerably reduced, and this fact, together with an easy method of tree-pair sign determination which is also presented, makes the new method simpler in general. The method can be very easily adapted, by the use of infinite parameters, to accommodate ideal transformers, operational amplifiers, and other forms of network constraint; in fact, is thought to be applicable to all linear networks.

Low ML Decoding Complexity STBCs via Codes Over the Klein Group

In this paper, we give a new framework for constructing low ML decoding complexity space-time block codes (STBCs) using codes over the Klein group K. Almost all known low ML decoding complexity STBCs can be obtained via this approach. New full- diversity STBCs with low ML decoding complexity and cubic shaping property are constructed, via codes over K, for number of transmit antennas N = 2(m), m >= 1, and rates R > 1 complex symbols per channel use. When R = N, the new STBCs are information- lossless as well. The new class of STBCs have the least knownML decoding complexity among all the codes available in the literature for a large set of (N, R) pairs.

Raman signatures of pressure induced electronic topological and structural transitions in Bi2Te3

We report Raman signatures of electronic topological transition (ETT) at 3.6 GPa and rhombohedral (alpha-Bi2Te3) to monoclinic (beta-Bi2Te3) structural transition at similar to 8 GPa. At the onset of ETT, a new Raman mode appears near 107 cm(-1) which is dispersionless with pressure. The structural transition at similar to 8 GPa is marked by a change in pressure derivative of A(1g) and E-g mode frequencies as well as by appearance of new modes near 115 cm(-1) and 135 cm(-1). The mode Grilneisen parameters are determined in both the alpha and beta-phases. (C) 2011 Elsevier Ltd. All rights reserved.

Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance

We present two online algorithms for maintaining a topological order of a directed n-vertex acyclic graph as arcs are added, and detecting a cycle when one is created. Our first algorithm handles m arc additions in O(m(3/2)) time. For sparse graphs (m/n = O(1)), this bound improves the best previous bound by a logarithmic factor, and is tight to within a constant factor among algorithms satisfying a natural locality property. Our second algorithm handles an arbitrary sequence of arc additions in O(n(5/2)) time. For sufficiently dense graphs, this bound improves the best previous bound by a polynomial factor. Our bound may be far from tight: we show that the algorithm can take Omega(n(2)2 root(2lgn)) time by relating its performance to a generalization of the k-levels problem of combinatorial geometry. A completely different algorithm running in Theta (n(2) log n) time was given recently by Bender, Fineman, and Gilbert. We extend both of our algorithms to the maintenance of strong components, without affecting the asymptotic time bounds.

Junction between surfaces of two topological insulators

We study the properties of a line junction which separates the surfaces of two three-dimensional topological insulators. The velocities of the Dirac electrons on the two surfaces may be unequal and may even have opposite signs. For a time-reversal invariant system, we show that the line junction is characterized by an arbitrary parameter alpha which determines the scattering from the junction. If the surface velocities have the same sign, we show that there can be edge states which propagate along the line junction with a velocity and spin orientation which depend on alpha and the ratio of the velocities. Next, we study what happens if the two surfaces are at an angle phi with respect to each other. We study the scattering and differential conductance through the line junction as functions of phi and alpha. We also find that there are edge states which propagate along the line junction with a velocity and spin orientation which depend on phi. Finally, if the surface velocities have opposite signs, we find that the electrons must transmit into the two-dimensional interface separating the two topological insulators.

Synchronous and asynchronous Mott transitions in topological insulator ribbons

We address how the nature of linearly dispersing edge states of two-dimensional (2D) topological insulators evolves with increasing electron-electron correlation engendered by a Hubbard-like on-site repulsion U in finite ribbons of two models of topological band insulators. Using an inhomogeneous cluster slave-rotor mean-field method developed here, we show that electronic correlations drive the topologically nontrivial phase into a Mott insulating phase via two different routes. In a synchronous transition, the entire ribbon attains a Mott insulating state at one critical U that depends weakly on the width of the ribbon. In the second, asynchronous route, Mott localization first occurs on the edge layers at a smaller critical value of electronic interaction, which then propagates into the bulk as U is further increased until all layers of the ribbon become Mott localized. We show that the kind of Mott transition that takes place is determined by certain properties of the linearly dispersing edge states which characterize the topological resilience to Mott localization.

Low complexity adaptation for SISO channel shortening equalizers

Since the days of Digital Subscriber Links (DSL), time domain equalizers (TEQ's) have been used to combat time dispersive channels in Multicarrier Systems. In this paper, we propose computationally inexpensive techniques to recompute TEQ weights in the presence of changes in the channel, especially over fast fading channels. The techniques use no extra information except the perturbation to the channel itself, and provide excellent approximations to the new TEQ weights. Adaptation methods for two existing Channel shortening algorithms are proposed and their performance over randomly varying, randomly perturbed channels is studied. The proposed adaptation techniques are shown to perform admirably well for small changes in channels for OFDM systems. (C) 2012 Elsevier GmbH. All rights reserved.

The fifth solvatomorph of gallic acid with a supramolecular channel structure: Structural complexity and phase transitions

A new solvatomorph of gallic acid was generated using chiral additive technique and characterized by single crystal and powder X-ray diffraction, C-13 NMR, IR spectroscopic techniques and thermal analysis. The supramolecular channels formed by hexameric motifs of gallic acid and solvent molecules contain highly disordered solvent molecules with fractional occupancies. © 2012 Elsevier B.V.

Continuum theory of edge states of topological insulators: variational principle and boundary conditions

We develop a continuum theory to model low energy excitations of a generic four-band time reversal invariant electronic system with boundaries. We propose a variational energy functional for the wavefunctions which allows us to derive natural boundary conditions valid for such systems. Our formulation is particularly suited for developing a continuum theory of the protected edge/surface excitations of topological insulators both in two and three dimensions. By a detailed comparison of our analytical formulation with tight binding calculations of ribbons of topological insulators modelled by the Bernevig-Hughes-Zhang (BHZ) Hamiltonian, we show that the continuum theory with a natural boundary condition provides an appropriate description of the low energy physics.

Topological electron density analysis and electrostatic properties of aspirin: an experimental and theoretical study

The topological and the electrostatic properties of the aspirin drug molecule were determined from high-resolution X-ray diffraction data at 90 K, and the corresponding results are compared with the theoretical calculations. The electron density at the bond critical point of all chemical bonds induding the intermolecular interactions of aspirin has been quantitatively described using Bader's quantum theory of ``Atoms in Molecules''. The electrostatic potential of the molecule emphasizes the preferable binding sites of the drug and the interaction features of the molecule, which are crucial for drug-receptor recognition. The topological analysis of hydrogen bonds reveals the strength of intermolecular interactions.

Spin injection into a metal from a topological insulator

We study a junction of a topological insulator with a thin two-dimensional nonmagnetic or partially polarized ferromagnetic metallic film deposited on a three-dimensional insulator. We show, by deriving generic boundary conditions applicable to electrons traversing the junction, that there is a finite spin-current injection into the film whose magnitude can be controlled by tuning a voltage V applied across the junction. For ferromagnetic films, the direction of the component of the spin current along the film magnetization can also be tuned by tuning the barrier potential V-0 at the junction. We point out the role of the chiral spin-momentum locking of the Dirac electrons behind this phenomenon and suggest experiments to test our theory.

Complexity of distance paired-domination problem in graphs

Suppose G = (V, E) is a simple graph and k is a fixed positive integer. A subset D subset of V is a distance k-dominating set of G if for every u is an element of V. there exists a vertex v is an element of D such that d(G)(u, v) <= k, where d(G)(u, v) is the distance between u and v in G. A set D subset of V is a distance k-paired-dominating set of G if D is a distance k-dominating set and the induced subgraph GD] contains a perfect matching. Given a graph G = (V, E) and a fixed integer k > 0, the MIN DISTANCE k-PAIRED-DOM SET problem is to find a minimum cardinality distance k-paired-dominating set of G. In this paper, we show that the decision version of MIN DISTANCE k-PAIRED-DOM SET iS NP-complete for undirected path graphs. This strengthens the complexity of decision version Of MIN DISTANCE k-PAIRED-DOM SET problem in chordal graphs. We show that for a given graph G, unless NP subset of DTIME (n(0)((log) (log) (n)) MIN DISTANCE k-PAIRED-Dom SET problem cannot be approximated within a factor of (1 -epsilon ) In n for any epsilon > 0, where n is the number of vertices in G. We also show that MIN DISTANCE k-PAIRED-DOM SET problem is APX-complete for graphs with degree bounded by 3. On the positive side, we present a linear time algorithm to compute the minimum cardinality of a distance k-paired-dominating set of a strongly chordal graph G if a strong elimination ordering of G is provided. We show that for a given graph G, MIN DISTANCE k-PAIRED-DOM SET problem can be approximated with an approximation factor of 1 + In 2 + k . In(Delta(G)), where Delta(G) denotes the maximum degree of G. (C) 2012 Elsevier B.V All rights reserved.