A rate-one full-diversity low-complexity space-time-frequency block code (STFBC) for 4-Tx MIMO-OFDM

It is known that by employing space-time-frequency codes (STFCs) to frequency selective MIMO-OFDM systems, all the three diversity viz spatial, temporal and multipath can be exploited. There exists space-time-frequency block codes (STFBCs) designed using orthogonal designs with constellation precoder to get full diversity (Z.Liu, Y.Xin and G.Giannakis IEEE Trans. Signal Processing, Oct. 2002). Since orthogonal designs of rate one exists only for two transmit antennas, for more than two transmit antennas STFBCs of rate-one and full-diversity cannot be constructed using orthogonal designs. This paper presents a STFBC scheme of rate one for four transmit antennas designed using quasi-orthogonal designs along with co-ordinate interleaved orthogonal designs (Zafar Ali Khan and B. Sundar Rajan Proc: ISIT 2002). Conditions on the signal sets that give full-diversity are identified. Simulation results are presented to show the superiority of our codes over the existing ones.

A systematic design of high-rate full-diversity space-frequency codes for MIMO-OFDM systems

This paper presents a systematic construction of high-rate and full-diversity space-frequency block codes for MIMO-OFDM systems. While all prior constructions offer only a maximum rate of one complex symbol per channel use, our construction yields rate equal to the number of transmit antennas and simultaneously achieves full-diversity. The proposed construction works for arbitrary number of transmit antennas and arbitrary channel power delay profile. A key step in this construction is the generalization of the stacked matrix code design criteria given by Bolcskei et.al., (IEEE WCNC 2000). Explicit equivalence of our generalized code design criteria with the Hadamard-product based criteria of W. Su et.al., (lEEE Trans. Sig. Proc. Nov 2003) is established and new high-rate codes are constructed using our criteria.

A unified construction of space-time codes with optimal rate-diversity tradeoff

The problem of constructing space-time (ST) block codes over a fixed, desired signal constellation is considered. In this situation, there is a tradeoff between the transmission rate as measured in constellation symbols per channel use and the transmit diversity gain achieved by the code. The transmit diversity is a measure of the rate of polynomial decay of pairwise error probability of the code with increase in the signal-to-noise ratio (SNR). In the setting of a quasi-static channel model, let n(t) denote the number of transmit antennas and T the block interval. For any n(t) <= T, a unified construction of (n(t) x T) ST codes is provided here, for a class of signal constellations that includes the familiar pulse-amplitude (PAM), quadrature-amplitude (QAM), and 2(K)-ary phase-shift-keying (PSK) modulations as special cases. The construction is optimal as measured by the rate-diversity tradeoff and can achieve any given integer point on the rate-diversity tradeoff curve. An estimate of the coding gain realized is given. Other results presented here include i) an extension of the optimal unified construction to the multiple fading block case, ii) a version of the optimal unified construction in which the underlying binary block codes are replaced by trellis codes, iii) the providing of a linear dispersion form for the underlying binary block codes, iv) a Gray-mapped version of the unified construction, and v) a generalization of construction of the S-ary case corresponding to constellations of size S-K. Items ii) and iii) are aimed at simplifying the decoding of this class of ST codes.

Sequence design for symbol-asynchronous CDMA with power or rate constraints

Sequence design and resource allocation for a symbol-asynchronous chip-synchronous code division multiple access (CDMA) system is considered in this paper. A simple lower bound on the minimum sum-power required for a non-oversized system, based on the best achievable for a non-spread system, and an analogous upper bound on the sum rate are first summarised. Subsequently, an algorithm of Sundaresan and Padakandla is shown to achieve the lower bound on minimum sum power (upper bound on sum rate, respectively). Analogous to the synchronous case, by splitting oversized users in a system with processing gain N, a system with no oversized users is easily obtained, and the lower bound on sum power (upper bound on sum rate, respectively) is shown to be achieved by using N orthogonal sequences. The total number of splits is at most N - 1.

Extraordinary high strain rate superplasticity in electrodeposited nano-nickel and alloys

Superplastic materials exhibit very large elongations to failure,typically >500%, and this enables commercial forming of complex shaped components at slow strain rates of similar to 10(-4) s(-1). We report extraordinary record superplastic elongations to failure of up to 5300% at both high strain rates and low temperature in electrodeposited nanocrystalline Ni and some Ni alloys. Superplasticity is not related to the presence of sulfur or a low melting phase at grain boundaries. (C) 2010 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

An evaluation of rate-controlling obstacles for low-temperature deformation of zirconium

The low-temperature plastic flow of alpha-zirconium was studied by employing constantrate tensile tests and differential-stress creep experiments. The activation parameters, enthalpy and area, have been obtained as a function of stress for pure, as well as commercial zirconium. The activation area is independent of grain size and purity and falls to about 9b2 at high stresses. The deformation mechanism below about 700° K is found to be controlled by a single thermally activated process, and not a two-stage activation mechanism. Several dislocation mechanisms are examined and it is concluded that overcoming the Peierls energy humps by the formation of kink pairs in a length of dislocation is the rate-controlling mechanism. The total energy needed to nucleate a double kink is about 0.8 eV in pure zirconium and 1 eV in commercial zirconium

High Rate Capability of Porous LiNi1/3Co1/3Mn1/3O2 Synthesized by Polymer Template Route

Layered LiNi1/3Co1/3Mn1/3O2, which is isostructural with LiCoO2, is considered as a potential cathode material for Li-ion batteries. Submicrometer sized porous particles are useful for high discharge rates. The present work involves a synthesis of submicrometer sized porous particles of LiNi1/3Co1/3Mn1/3O2 using a triblock copolymer as a soft template. The precursor obtained from the reaction is heated at different temperatures between 600 and 900 degrees C for 6 h to get the final product samples. The compound attains increased crystallinity with an increase in the temperature of preparation. However, there is a decrease in the surface area and also in the porosity of the sample. Nevertheless, the LiNi1/3Co1/3Mn1/3O2 sample prepared at 900 degrees C exhibits a high rate capability and stable capacity retention on cycling. The electrochemical performance of LiNi1/3Co1/3Mn1/3O2 prepared in the absence of the polymer template is inferior to that of the sample prepared in the presence of the polymer template. (C) 2010 The Electrochemical Society. [DOI: 10.1149/1.3364944] All rights reserved.

Solution-Combustion Synthesized Nanocrystalline Li4Ti5O12 As High-Rate Performance Li-Ion Battery Anode

Nanocrystalline Li4Ti5O12 (LTO) crystallizing in cubic spinel-phase has been synthesized by single-step-solution-combustion method in less than one minute. LTO particles thus synthesized are flaky and highly porous in nature with a surface area of 12 m(2)/g. Transmission electron micrographs indicate the primary particles to be agglomerated crystallites of varying size between 20 and 50 nm with a 3-dimensional interconnected porous network. During their galvanostatic charge-discharge at varying rates, LTO electrodes yield a capacity value close to the theoretical value of 175 mA h/g at C/2 rate. The electrodes also exhibit promising capacity retention with little capacity loss over 100 cycles at varying discharge rates together with attractive discharge-rate capabilities yielding capacity values of 140 mA h/g and 70 mA h/g at 10 and 100 C discharge rates, respectively. The ameliorated electrode-performance is ascribed to nano and highly porous morphology of the electrodes that provide short diffusion-paths for Li in conjunction with electrolyte percolation through the electrode pores ensuring a high flux of Li.

On the maximal rate of (n+1) x n and (n+2) x n complex orthogonal designs

For p x n complex orthogonal designs in k variables, where p is the number of channels uses and n is the number of transmit antennas, the maximal rate L of the design is asymptotically half as n increases. But, for such maximal rate codes, the decoding delay p increases exponentially. To control the delay, if we put the restriction that p = n, i.e., consider only the square designs, then, the rate decreases exponentially as n increases. This necessitates the study of the maximal rate of the designs with restrictions of the form p = n+1, p = n+2, p = n+3 etc. In this paper, we study the maximal rate of complex orthogonal designs with the restrictions p = n+1 and p = n+2. We derive upper and lower bounds for the maximal rate for p = n+1 and p = n+2. Also for the case of p = n+1, we show that if the orthogonal design admit only the variables, their negatives and multiples of these by root-1 and zeros as the entries of the matrix (other complex linear combinations are not allowed), then the maximal rate always equals the lower bound.

Minimum-Decoding-Complexity, maximum-rate Space-Time Block Codes from Clifford algebras

It is well known that Alamouti code and, in general, Space-Time Block Codes (STBCs) from complex orthogonal designs (CODs) are single-symbol decodable/symbolby-symbol decodable (SSD) and are obtainable from unitary matrix representations of Clifford algebras. However, SSD codes are obtainable from designs that are not CODs. Recently, two such classes of SSD codes have been studied: (i) Coordinate Interleaved Orthogonal Designs (CIODs) and (ii) Minimum-Decoding-Complexity (MDC) STBCs from Quasi-ODs (QODs). In this paper, we obtain SSD codes with unitary weight matrices (but not CON) from matrix representations of Clifford algebras. Moreover, we derive an upper bound on the rate of SSD codes with unitary weight matrices and show that our codes meet this bound. Also, we present conditions on the signal sets which ensure full-diversity and give expressions for the coding gain.

Design and analysis of rate aware ad hoc 802.11 networks

802.11 WLANs are characterized by high bit error rate and frequent changes in network topology. The key feature that distinguishes WLANs from wired networks is the multi-rate transmission capability, which helps to accommodate a wide range of channel conditions. This has a significant impact on higher layers such as routing and transport levels. While many WLAN products provide rate control at the hardware level to adapt to the channel conditions, some chipsets like Atheros do not have support for automatic rate control. We first present a design and implementation of an FER-based automatic rate control state machine, which utilizes the statistics available at the device driver to find the optimal rate. The results show that the proposed rate switching mechanism adapts quite fast to the channel conditions. The hop count metric used by current routing protocols has proven itself for single rate networks. But it fails to take into account other important factors in a multi-rate network environment. We propose transmission time as a better path quality metric to guide routing decisions. It incorporates the effects of contention for the channel, the air time to send the data and the asymmetry of links. In this paper, we present a new design for a multi-rate mechanism as well as a new routing metric that is responsive to the rate. We address the issues involved in using transmission time as a metric and presents a comparison of the performance of different metrics for dynamic routing.

A Novel Construction of Complex Orthogonal Designs with Maximal Rate and Low-PAPR

Space-time block codes based on orthogonal designs are used for wireless communications with multiple transmit antennas which can achieve full transmit diversity and have low decoding complexity. However, the rate of the square real/complex orthogonal designs tends to zero with increase in number of antennas, while it is possible to have a rate-1 real orthogonal design (ROD) for any number of antennas.In case of complex orthogonal designs (CODs), rate-1 codes exist only for 1 and 2 antennas. In general, For a transmit antennas, the maximal rate of a COD is 1/2 + l/n or 1/2 + 1/n+1 for n even or odd respectively. In this paper, we present a simple construction for maximal-rate CODs for any number of antennas from square CODs which resembles the construction of rate-1 RODs from square RODs. These designs are shown to be amenable for construction of a class of generalized CODs (called Coordinate-Interleaved Scaled CODs) with low peak-to-average power ratio (PAPR) having the same parameters as the maximal-rate codes. Simulation results indicate that these codes perform better than the existing maximal rate codes under peak power constraint while performing the same under average power constraint.

High-Rate,2-Group ML-Decodable STBCs for 2(m) Transmit Antennas

A Space-Time Block Code (STBC) in K-variables is said to be g-Group ML-Decodable (GMLD) if its Maximum-Likelihood (ML) decoding metric can be written as a sum of g independent terms, with each term being a function of a subset of the K variables. In this paper, a construction method to obtain high-rate, 2-GMLD STBCs for 2(m) transmit antennas, m > 1, is presented. The rate of the STBC obtained for 2(m) transmit antennas is 2(m-2) + 1/2(m), complex symbols per channel use. The design method is illustrated for the case of 4 and 8 transmit antennas. The code obtained for 4 transmit antennas is equivalent to the rate-5/4 Quasi-Orthogonal design (QOD) proposed by Yuen, Guan and Tjung.