A Combinatorial Family of Near Regular LDPC Codes

An elementary combinatorial Tanner graph construction for a family of near-regular low density parity check (LDPC) codes achieving high girth is presented. These codes are near regular in the sense that the degree of a left/right vertex is allowed to differ by at most one from the average. The construction yields in quadratic time complexity an asymptotic code family with provable lower bounds on the rate and the girth for a given choice of block length and average degree. The construction gives flexibility in the choice of design parameters of the code like rate, girth and average degree. Performance simulations of iterative decoding algorithm for the AWGN channel on codes designed using the method demonstrate that these codes perform better than regular PEG codes and MacKay codes of similar length for all values of Signal to noise ratio.

Combinatorial Representations of Block Codes

We look at graphical descriptions of block codes known as trellises, which illustrate connections between algebra and graph theory, and can be used to develop powerful decoding algorithms. Trellis sizes for linear block codes are known to grow exponentially with the code parameters. Of considerable interest to coding theorists therefore, are more compact descriptions called tail-biting trellises which in some cases can be much smaller than any conventional trellis for the same code . We derive some interesting properties of tail-biting trellises and present a new decoding algorithm.

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.

Achieving the D-MG and DMD Tradeoffs of MIMO fading channels

An overview of our recent results relating to the explicit construction of space-time block codes achieving the DMG tradeoff of the quasi-static fading channel is presented. The results include the explicit construction of D-MG optimal codes,generalization of perfect codes to any number of transmit antennas as well as optimal diversity-multiplexing-delay constructions for the MIMO ARQ Channel.

Tribological characteristics of A356 Al alloy-SiC(P) composite discs

The dry sliding wear and friction behaviour of A356 Al alloy and its composites containing 10 and 20 vol.% SiC(P) have been studied using pin-on-disc set up. In these tests, A356 Al alloy and its composites are used as disc whereas brake pad was used in the form of pins. Wear tests were carried out at a load of 192 N and the sliding speed was varied from 1 to 5 m/s. Tests were done for a sliding distance of 15 km. The effects of sliding velocity on the wear rate, coefficient of friction and nature of tribolayers formed on discs have been studied. Wear rates of composites as calculated by weight loss method, found to be negative at sliding speed of more than 2 m/s. Worn surfaces of pins and discs have been analyzed using scanning electron microscope. SEM and EDAX analysis of worn surfaces of composite discs showed formation of tribolayers, consisting of mixture of oxides of Al, Si, Cu, Ca, Ba, Mg, and Fe. In these layers, copper and barium content found to be increase with sliding speed in the case of composites. (C) 2011 Elsevier B.V. All rights reserved.

Substrate nitridation induced modulations in transport properties of wurtzite GaN/p-Si (100) heterojunctions grown by molecular beam epitaxy

Phase pure wurtzite GaN films were grown on Si (100) substrates by introducing a silicon nitride layer followed by low temperature GaN growth as buffer layers. GaN films grown directly on Si (100) were found to be phase mixtured, containing both cubic (beta) and hexagonal (alpha) modifications. The x-ray diffraction (XRD), scanning electron microscopy (SEM), photoluminescence (PL) spectroscopy studies reveal that the significant enhancement in the structural as well as in the optical properties of GaN films grown with silicon nitride buffer layer grown at 800 degrees C when compared to the samples grown in the absence of silicon nitride buffer layer and with silicon nitride buffer layer grown at 600 degrees C. Core-level photoelectron spectroscopy of Si(x)N(y) layers reveals the sources for superior qualities of GaN epilayers grown with the high temperature substrate nitridation process. The discussion has been carried out on the typical inverted rectification behavior exhibited by n-GaN/p-Si heterojunctions. Considerable modulation in the transport mechanism was observed with the nitridation conditions. The heterojunction fabricated with the sample of substrate nitridation at high temperature exhibited superior rectifying nature with reduced trap concentrations. Lowest ideality factors (similar to 1.5) were observed in the heterojunctions grown with high temperature substrate nitridation which is attributed to the recombination tunneling at the space charge region transport mechanism at lower voltages and at higher voltages space charge limited current conduction is the dominating transport mechanism. Whereas, thermally generated carrier tunneling and recombination tunneling are the dominating transport mechanisms in the heterojunctions grown without substrate nitridation and low temperature substrate nitridation, respectively. (C) 2011 American Institute of Physics. [doi:10.1063/1.3658867]

Fast-Group-Decodable STBCs via Codes over GF(4): Further Results

Recently in, a framework was given to construct low ML decoding complexity Space-Time Block Codes (STBCs) via codes over the finite field F4. In this paper, we construct new full-diversity STBCs with cubic shaping property and low ML decoding complexity via codes over F4 for number of transmit antennas N = 2m, m >; 1, and rates R >; 1 complex symbols per channel use. The new codes have the least ML decoding complexity among all known codes for a large set of (N, R) pairs. The new full-rate codes of this paper (R = N) are not only information-lossless and fully diverse but also have the least known ML decoding complexity in the literature. For N ≥ 4, the new full-rate codes are the first instances of full-diversity, information-lossless STBCs with low ML decoding complexity. We also give a sufficient condition for STBCs obtainable from codes over F4 to have cubic shaping property, and a sufficient condition for any design to give rise to a full-diversity STBC when the symbols are encoded using rotated square QAM constellations.

Constant weight codes based on ideals of commutative rings

We present a construction of constant weight codes based on the prime ideals of a Noetherian commutative ring. The coding scheme is based on the uniqueness of the primary decomposition of ideals in Noetherian rings. The source alphabet consists of a set of radical ideals constructed from a chosen subset of the prime spectrum of the ring. The distance function between two radical ideals is taken to be the Hamming metric based on the symmetric distance between sets. As an application we construct codes for random networks employing SAF routing.

Analysis of LDPC Codes for Compression of Nonuniform Sources with Side Information Using Density Evolution

In this paper, we explore the use of LDPC codes for nonuniform sources under distributed source coding paradigm. Our analysis reveals that several capacity approaching LDPC codes indeed do approach the Slepian-Wolf bound for nonuniform sources as well. The Monte Carlo simulation results show that highly biased sources can be compressed to 0.049 bits/sample away from Slepian-Wolf bound for moderate block lengths.

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.

Band alignment studies in InN/p-Si(100) heterojunctions by x-ray photoelectron spectroscopy

The band offsets in InN/p-Si heterojunctions are determined by high resolution x-ray photoemission spectroscopy. The valence band of InN is found to be 1.39 eV below that of Si. Given the bandgap of 0.7 eV for InN, a type-III heterojunction with a conduction band offset of 1.81 eV was found. Agreement between the simulated and experimental data obtained from the heterojunction spectra was found to be excellent, establishing that the method of determination was accurate. The charge neutrality level (CNL) model provided a reasonable description of the band alignment of the InN/p-Si interface and a change in the interface dipole by 0.06 eV was observed for InN/p-Si interface.

Elerctron Transport Coefficients in N2 in Crossed Fields at Low E/p

The numerical solutions of Boltzmann transpott equation for the energy distribution of electrons moving in crossed fields in nitrogen have been obtained for 100 ÿ E/p ÿ 1000 V M-1 Torr-1 and for 0ÿ B/p ÿ 0.02 Tesla Torr-1 using the concept of energy dependent effective field intensity. From the derived distribution functions the electron mean energy, the tranaverse and perpendicular drift velocities and the averaged effective field intensity (Eavef) which signifies the average field intensity experienced by electron swarms in E àB field have been derived. The maximum difference between the electron mean energy for a given E ÃÂB field and that corresponding to Eavef/p (p is the gas pressure) is found to be within ñ3.5%.

Performance Analysis of a Cooperative System with Rateless Codes and Buffered Relays

In a cooperative relay-assisted communication system that uses rateless codes, packets get transmitted from a source to a destination at a rate that depends on instantaneous channel states of the wireless links between nodes. When multiple relays are present, the relay with the highest channel gain to the source is the first to successfully decode a packet from the source and forward it to the destination. Thus, the unique properties of rateless codes ensure that both rate adaptation and relay selection occur without the transmitting source or relays acquiring instantaneous channel knowledge. In this paper, we show that in such cooperative systems, buffering packets at relays significantly increases throughput. We develop a novel analysis of these systems that combines the communication-theoretic aspects of cooperation over fading channels with the queuing-theoretic aspects associated with buffering. Closed-form expressions are derived for the throughput and end-to-end delay for the general case in which the channels between various nodes are not statistically identical. Corresponding results are also derived for benchmark systems that either do not exploit spatial diversity or do not buffer packets. Altogether, our results show that buffering - a capability that will be commonly available in practical deployments of relays - amplifies the benefits of cooperation.