Queueing delay - error probability tradeoff for point-to-point channels with fixed length block codes

We study the tradeoff between the average error probability and the average queueing delay of messages which randomly arrive to the transmitter of a point-to-point discrete memoryless channel that uses variable rate fixed codeword length random coding. Bounds to the exponential decay rate of the average error probability with average queueing delay in the regime of large average delay are obtained. Upper and lower bounds to the optimal average delay for a given average error probability constraint are presented. We then formulate a constrained Markov decision problem for characterizing the rate of transmission as a function of queue size given an average error probability constraint. Using a Lagrange multiplier the constrained Markov decision problem is then converted to a problem of minimizing the average cost for a Markov decision problem. A simple heuristic policy is proposed which approximately achieves the optimal average cost.

Verification of Masonry Building Code to Flexural Behavior of Cement-Stabilized Soil Block

Most studies involving cement-stabilized soil blocks (CSSB) concern material properties, such as the characteristics of erosion and strength and how the composition of the block affects these properties. Moreover, research has been conducted on the performance of various mortars, investigating their material properties and the tensile bond strength between CSSB units and mortar. In contrast, very little is currently known about CSSB masonry structural behavior. Because structural design codes of traditional masonry buildings were well developed over the past century, many of the same principles may be applicable to CSSB masonry buildings. This paper details the topic of flexural behavior of CSSB masonry walls and whether the Masonry Standards Joint Committee (MSJC) code can be applied to this material for improved safety of such buildings. DOI: 10.1061/(ASCE)MT.1943-5533.0000566. (C) 2013 American Society of Civil Engineers.

Generalized distributive law for ML decoding of space-time block codes

The problem of designing good space-time block codes (STBCs) with low maximum-likelihood (ML) decoding complexity has gathered much attention in the literature. All the known low ML decoding complexity techniques utilize the same approach of exploiting either the multigroup decodable or the fast-decodable (conditionally multigroup decodable) structure of a code. We refer to this well-known technique of decoding STBCs as conditional ML (CML) decoding. In this paper, we introduce a new framework to construct ML decoders for STBCs based on the generalized distributive law (GDL) and the factor-graph-based sum-product algorithm. We say that an STBC is fast GDL decodable if the order of GDL decoding complexity of the code, with respect to the constellation size, is strictly less than M-lambda, where lambda is the number of independent symbols in the STBC. We give sufficient conditions for an STBC to admit fast GDL decoding, and show that both multigroup and conditionally multigroup decodable codes are fast GDL decodable. For any STBC, whether fast GDL decodable or not, we show that the GDL decoding complexity is strictly less than the CML decoding complexity. For instance, for any STBC obtained from cyclic division algebras which is not multigroup or conditionally multigroup decodable, the GDL decoder provides about 12 times reduction in complexity compared to the CML decoder. Similarly, for the Golden code, which is conditionally multigroup decodable, the GDL decoder is only half as complex as the CML decoder.

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.

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.

Neoarchean continental growth through arc magmatism in the Nilgiri Block, southern India

The formation and growth of continental crust in the Archean have been evaluated through models of subduction-accretion and mantle plume. The Nilgiri Block in southern India exposes exhumed Neoarchean lower crust, uplifted to heights of 2500 m above sea level along the north western margin of the Peninsula. Major lithologies in this block include charnockite with or without garnet, anorthosite-gabbro suite, pyroxenite, amphibolite and hornblende-biotite gneiss (TTG). All these rock types are closely associated as an arc magmatic suite, with diffuse boundaries and coeval nature. The charnockite and hornblende-biotite gneisses (TTG) show SiO2 content varying from 64 to 73 wt.%. The hornblende-biotite gneisses (TTG) are high-Al type with Al2O3 >15 wt.% whereas the charnockites show Al2O3 <15 wt.%. The composition of charnockite is mainly magnesian and calcic to calc-alkaline. The mafic-ultramafic rocks show composition close to that of tholeiitic series. The low values of K(2)o (<3 wt.%), (K/Rb)/K2O (<500), Zr/Ti, and trace element ratios like (La/Yb)n/(Sr/Y), (Y/Nb), (Y + Nb)/Rb, (Y+Ta)/Rb, Yb/Ta indicate a volcanic arc signature for these rocks. The geochemical signature is consistent with arc magmatic rocks generated through oceanic plate subduction. The primitive mantle normalized trace element patterns of these rocks display enrichment in large ion lithophile elements (LILE) and comparable high field strength elements (HFSE) in charnockite and hornblende-biotite gneisses (TTG) consistent with subduction-related origin. Primitive mantle normalized REE pattern displays an enrichment in LREE in the chamockite and hornblende-biotite gneisses (TTG) as compared to a flat pattern for the mafic rocks. The chondrite normalized REE patterns of zircons of all the rock types reveal cores with high HREE formed at ca. 2700 Ma and rims with low HREE formed at 2500-2450 Ma. Log-transformed La/Th-Nb/Th-Sm/Th-Yb/Th discrimination diagram for the mafic and ultramafic rocks from Nilgiri displays a transition from mid-oceanic ridge basalt (MORB) to island arc basalt (IAB) suggesting a MORB source. The U-Pb zircon data from the charnockites, mafic granulites and hornblende-biotite gneisses (TTG) presented in our study show that the magma generation during subduction and accretion events in this block occurred at 2700-2500 Ma. Together with the recent report on Neoarchean supra-subduction zone ophiolite suite at its southern margin, the Nilgiri Block provides one of the best examples for continental growth through vertical stacking and lateral accretion in a subduction environment during the Neoarchean. (c) 2014 Elsevier B.V. All rights reserved.

Imprints of Archean to Neoproterozoic crustal processes in the Madurai Block, Southern India

Madurai Block, the largest crustal block in the Southern Granulite Terrane (SGT) of Peninsular India, preserves the imprints of multistage tectonic evolution. Here, we present U-Pb and Hf isotope data on zircons from a charnockite-granite suite in the north-western part of this block. The oscillatory zoning, and the LREE to HREE enriched patterns of the zircons with positive Ce and negative Eu anomalies suggest that the zircon cores are of magmatic origin, with ages in the range of 2634-2435 Ma implying Neoarchean-Paleoproterozoic magmatism followed by subsequent metamorphism and protocontinent formation in the north-western part of the Madurai Block. A regional 550-500 Ma metamorphic overprint is also preserved in the zircons coinciding with the final amalgamation of the Gondwana supercontinent. The Hf isotopic data suggest that the granite and charnockite were derived from isotopically heterogeneous juvenile crustal domains and the charnockites show a significant contribution of mantle-derived components. Therefore, the Hf isotopic data reflect mixing of crustal and mantle-derived sources for the generation of Neoarchean crust in the north-western Madurai Block, possibly in a suprasubduction zone setting during continent building processes. (c) 2014 Elsevier Ltd. All rights reserved.

NESTED SPARSE BAYESIAN LEARNING FOR BLOCK-SPARSE SIGNALS WITH INTRA-BLOCK CORRELATION

In this work, we address the recovery of block sparse vectors with intra-block correlation, i.e., the recovery of vectors in which the correlated nonzero entries are constrained to lie in a few clusters, from noisy underdetermined linear measurements. Among Bayesian sparse recovery techniques, the cluster Sparse Bayesian Learning (SBL) is an efficient tool for block-sparse vector recovery, with intra-block correlation. However, this technique uses a heuristic method to estimate the intra-block correlation. In this paper, we propose the Nested SBL (NSBL) algorithm, which we derive using a novel Bayesian formulation that facilitates the use of the monotonically convergent nested Expectation Maximization (EM) and a Kalman filtering based learning framework. Unlike the cluster-SBL algorithm, this formulation leads to closed-form EMupdates for estimating the correlation coefficient. We demonstrate the efficacy of the proposed NSBL algorithm using Monte Carlo simulations.

Layered Exact-Repair Regenerating Codes via Embedded Error Correction and Block Designs

A new class of exact-repair regenerating codes is constructed by stitching together shorter erasure correction codes, where the stitching pattern can be viewed as block designs. The proposed codes have the help-by-transfer property where the helper nodes simply transfer part of the stored data directly, without performing any computation. This embedded error correction structure makes the decoding process straightforward, and in some cases the complexity is very low. We show that this construction is able to achieve performance better than space-sharing between the minimum storage regenerating codes and the minimum repair-bandwidth regenerating codes, and it is the first class of codes to achieve this performance. In fact, it is shown that the proposed construction can achieve a nontrivial point on the optimal functional-repair tradeoff, and it is asymptotically optimal at high rate, i.e., it asymptotically approaches the minimum storage and the minimum repair-bandwidth simultaneously.

Adaptive executions of hyperbolic block-structured AMR applications on GPU systems

A block-structured adaptive mesh refinement (AMR) technique has been used to obtain numerical solutions for many scientific applications. Some block-structured AMR approaches have focused on forming patches of non-uniform sizes where the size of a patch can be tuned to the geometry of a region of interest. In this paper, we develop strategies for adaptive execution of block-structured AMR applications on GPUs, for hyperbolic directionally split solvers. While effective hybrid execution strategies exist for applications with uniform patches, our work considers efficient execution of non-uniform patches with different workloads. Our techniques include bin-packing work units to load balance GPU computations, adaptive asynchronism between CPU and GPU executions using a knapsack formulation, and scheduling communications for multi-GPU executions. Our experiments with synthetic and real data, for single-GPU and multi-GPU executions, on Tesla S1070 and Fermi C2070 clusters, show that our strategies result in up to a 3.23 speedup in performance over existing strategies.

Seismic response of reduced-scale modular block and rigid faced reinforced walls through shaking table tests

This paper focuses on understanding the seismic response of geosynthetic reinforced retaining walls through shaking table tests on models of modular block and rigid faced reinforced retaining walls. Reduced-scale models of retaining walls reinforced with geogrid layers were constructed in a laminar box mounted on a uniaxial shaking table and subjected to various levels of sinusoidal base shaking. Models were instrumented with ultrasonic displacement sensors, earth pressure sensors and accelerometers. Effects of backfill density, number of reinforcement layers and reinforcement type on the performance of rigid faced and modular block walls were studied through different series of model tests. Performances of the walls were assessed in terms of face deformations, crest settlement and acceleration amplification at different elevations and compared. Modular block walls performed better than the rigid faced walls for the same level of base shaking because of the additional support derived by stacking the blocks with an offset. Type and quantity of reinforcement has significant effect on the seismic performance of both the types of walls. Displacements are more sensitive to relative density of the backfill and decrease with increasing relative density, the effect being more pronounced in case of unreinforced walls compared to the reinforced ones. Acceleration amplifications are not affected by the wall facing and inclusion of reinforcement. (C) 2015 Elsevier Ltd. All rights reserved.