Block Sparse Estimator for Grid Matching in Single Snapshot DoA Estimation

In this work, the grid mismatch problem for a single snapshot direction of arrival estimation problem is studied. We derive a Bayesian Cramer-Rao bound for the grid mismatch problem with the errors in variables model and propose a block sparse estimator for grid matching and sparse recovery.

Taming of large diameter triaxial setup

Triaxial tests are essential to estimate the shear strength properties of the soil or rock. Normally triaxial tests are carried out on samples of 38 mm diameter and 76 mm height. Granular materials, predominantly used in base/sub-base construction of pavements or in railways have size range of 60-75 mm. Determination of shear strength parameters of those materials can be made possible only through triaxial tests on large diameter samples. This paper describes a large diameter cyclic triaxial testing facility set up in the Geotechnical Engineering lab of Indian Institute of Science. This setup consists of 100 kN capacity dynamic loading frame, which facilitates testing of samples of up to 300 mm diameter and 600 mm height. The loading ram can be actuated up to a maximum frequency of 10 Hz, with maximum amplitude of 100 mm. The setup is capable of carrying out static as well as dynamic triaxial tests under isotropic, anisotropic conditions with a maximum confining pressure of 1 MPa. Working with this setup is a difficult task because of the size of the sample. In this paper, a detailed discussion on the various problems encountered during the initial testing using the equipment, the ideas and solutions adopted to solve them are presented. Pilot experiments on granular sub-base material of 53 mm down size are also presented.

New rock salt-related oxides Li3M2RuO6 (M=Co, Ni): Synthesis, structure, magnetism and electrochemistry

We describe the synthesis, crystal structure, magnetic and electrochemical characterization of new rock salt-related oxides of formula, Li3M2RuO6 (M=Co, Ni). The M=Co oxide adopts the LiCoO2 (R-3m) structure, where sheets of LiO6 and (Co-2/Ru)O-6 octahedra are alternately stacked along the c-direction. The M=Ni oxide also adopts a similar layered structure related to Li2TiO3, where partial mixing of Li and Ni/Ru atoms lowers the symmetry to monoclinic (C2/c). Magnetic susceptibility measurements reveal that in Li3Co2RuO6, the oxidation states of transition metal ions are Co3+ (S=0), Co2+ (S=1/2) and Ru4+ (S=1), all of them in low-spin configuration and at 10 K, the material orders antiferromagnetically. Analogous Li3Ni2RuO6 presents a ferrimagnetic behavior with a Curie temperature of 100 K. The differences in the magnetic behavior have been explained in terms of differences in the crystal structure. Electrochemical studies correlate well with both magnetic properties and crystal structure. Li-transition metal intermixing may be at the origin of the more impeded oxidation of Li3Ni2RuO6 when compared to Li3CO2RuO6. Interestingly high first charge capacities (between ca. 160 and 180 mAh g(-1)) corresponding to ca. 2/3 of theoretical capacity are reached albeit, in both cases, capacity retention and cyclability are not satisfactory enough to consider these materials as alternatives to LiCoO2. (C) 2013 Elsevier Inc. All rights reserved.

Construction of Block Orthogonal STBCs and Reducing Their Sphere Decoding Complexity

Construction of high rate Space Time Block Codes (STBCs) with low decoding complexity has been studied widely using techniques such as sphere decoding and non Maximum-Likelihood (ML) decoders such as the QR decomposition decoder with M paths (QRDM decoder). Recently Ren et al., presented a new class of STBCs known as the block orthogonal STBCs (BOSTBCs), which could be exploited by the QRDM decoders to achieve significant decoding complexity reduction without performance loss. The block orthogonal property of the codes constructed was however only shown via simulations. In this paper, we give analytical proofs for the block orthogonal structure of various existing codes in literature including the codes constructed in the paper by Ren et al. We show that codes formed as the sum of Clifford Unitary Weight Designs (CUWDs) or Coordinate Interleaved Orthogonal Designs (CIODs) exhibit block orthogonal structure. We also provide new construction of block orthogonal codes from Cyclic Division Algebras (CDAs) and Crossed-Product Algebras (CPAs). In addition, we show how the block orthogonal property of the STBCs can be exploited to reduce the decoding complexity of a sphere decoder using a depth first search approach. Simulation results of the decoding complexity show a 30% reduction in the number of floating point operations (FLOPS) of BOSTBCs as compared to STBCs without the block orthogonal structure.

Burst error correction using partial fourier matrices and block sparse representation

There is a strong relation between sparse signal recovery and error control coding. It is known that burst errors are block sparse in nature. So, here we attempt to solve burst error correction problem using block sparse signal recovery methods. We construct partial Fourier based encoding and decoding matrices using results on difference sets. These constructions offer guaranteed and efficient error correction when used in conjunction with reconstruction algorithms which exploit block sparsity.

Grassmannian fusion frames and its use in block sparse recovery

Tight fusion frames which form optimal packings in Grassmannian manifolds are of interest in signal processing and communication applications. In this paper, we study optimal packings and fusion frames having a specific structure for use in block sparse recovery problems. The paper starts with a sufficient condition for a set of subspaces to be an optimal packing. Further, a method of using optimal Grassmannian frames to construct tight fusion frames which form optimal packings is given. Then, we derive a lower bound on the block coherence of dictionaries used in block sparse recovery. From this result, we conclude that the Grassmannian fusion frames considered in this paper are optimal from the block coherence point of view. (C) 2013 Elsevier B.V. All rights reserved.

Improved perfect space-time block codes

Perfect space-time block codes (STBCs) are based on four design criteria-full-rateness, nonvanishing determinant, cubic shaping, and uniform average transmitted energy per antenna per time slot. Cubic shaping and transmission at uniform average energy per antenna per time slot are important from the perspective of energy efficiency of STBCs. The shaping criterion demands that the generator matrix of the lattice from which each layer of the perfect STBC is carved be unitary. In this paper, it is shown that unitariness is not a necessary requirement for energy efficiency in the context of space-time coding with finite input constellations, and an alternative criterion is provided that enables one to obtain full-rate (rate of complex symbols per channel use for an transmit antenna system) STBCs with larger normalized minimum determinants than the perfect STBCs. Further, two such STBCs, one each for 4 and 6 transmit antennas, are presented and they are shown to have larger normalized minimum determinants than the comparable perfect STBCs which hitherto had the best-known normalized minimum determinants.

Asymptotically-good, multigroup decodable space-time block codes

For a family of Space-Time Block Codes (STBCs) C-1, C-2,..., with increasing number of transmit antennas N-i, with rates R-i complex symbols per channel use, i = 1, 2,..., we introduce the notion of asymptotic normalized rate which we define as lim(i ->infinity) R-i/N-i, and we say that a family of STBCs is asymptotically-good if its asymptotic normalized rate is non-zero, i. e., when the rate scales as a non-zero fraction of the number of transmit antennas. An STBC C is said to be g-group decodable, g >= 2, if the information symbols encoded by it can be partitioned into g groups, such that each group of symbols can be ML decoded independently of the others. In this paper we construct full-diversity g-group decodable codes with rates greater than one complex symbol per channel use for all g >= 2. Specifically, we construct delay-optimal, g-group decodable codes for number of transmit antennas N-t that are a multiple of g2left perpendicular(g-1/2)right perpendicular with rate N-t/g2(g-1) + g(2)-g/2N(t). Using these new codes as building blocks, we then construct non-delay-optimal g-group decodable codes with rate roughly g times that of the delay-optimal codes, for number of antennas N-t that are a multiple of 2left perpendicular(g-1/2)right perpendicular, with delay gN(t) and rate Nt/2(g-1) + g-1/2N(t). For each g >= 2, the new delay-optimal and non-delay- optimal families of STBCs are both asymptotically-good, with the latter family having the largest asymptotic normalized rates among all known families of multigroup decodable codes with delay T <= gN(t). Also, for g >= 3, these are the first instances of g-group decodable codes with rates greater than 1 reported in the literature.

Low embodied energy cement stabilised rammed earth building-A case study

Rammed earth is a monolithic construction and the construction process involves compaction of processed soil in progressive layers in a rigid formwork. Durable and thinner load bearing walls can be built using stabilised rammed earth. Use of inorganic additives such as cement for rammed earth walls has been in practice since the last 5-6 decades and cement stabilised rammed earth (CSRE) buildings can be seen across the world. The paper deals with the construction aspects, structural design and embodied energy analysis of a three storey load bearing school building complex. The CSRE school complex consists of 15 classrooms, an open air theatre and a service block. The complex has a built-up area of 1691.3 m(2) and was constructed employing manual construction techniques. This case study shows low embodied energy of 1.15 GJ/m(2) for the CSRE building as against 3-4 GJ/m(2) for conventional burnt clay brick load bearing masonry buildings. (C) 2013 Elsevier B.V. All rights reserved.