Non-unitary-weight Space-Time Block Codes with Minimum Decoding Complexity

Space-Time Block Codes (STBCs) from Complex Orthogonal Designs (CODs) are single-symbol decodable/symbol-by-symbol decodable (SSD); 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). The class of CIODs have non-unitary weight matrices when written as a Linear Dispersion Code (LDC) proposed by Hassibi and Hochwald, whereas the other class of SSD codes including CODs have unitary weight matrices. In this paper, we construct a large class of SSD codes with nonunitary weight matrices. Also, we show that the class of CIODs is a special class of our construction.

Approximate linear time ML decoding on tail-biting trellises in two rounds

A linear time approximate maximum likelihood decoding algorithm on tail-biting trellises is presented, that requires exactly two rounds on the trellis. This is an adaptation of an algorithm proposed earlier with the advantage that it reduces the time complexity from O(m log m) to O(m) where m is the number of nodes in the tail-biting trellis. A necessary condition for the output of the algorithm to differ from the output of the ideal ML decoder is deduced and simulation results on an AWGN channel using tail-biting trellises for two rate 1/2 convolutional codes with memory 4 and 6 respectively, are reported.

Guessing under source uncertainty with side information

We study the problem of guessing the realization of a finite alphabet source, when some side information is provided, in a setting where the only knowledge the guesser has about the source and the correlated side information is that the joint source is one among a family. We define a notion of redundancy, identify a quantity that measures this redundancy, and study its properties. We then identify good guessing strategies that minimize the supremum redundancy (over the family). The minimum value measures the richness of the uncertainty class.

Stability of scheduled message communication over degraded broadcast channels

We develop a multi-class discrete-time processor-sharing queueing model for scheduled message communication over a discrete memoryless degraded broadcast channel. The framework we consider here models both the random message arrivals and the subsequent reliable communication by suitably combining techniques from queueing theory and information theory. Requests for message transmissions are assumed to arrive according to i.i.d. arrival processes. Then, (i) we derive an outer bound to the stability region of message arrival rate vectors achievable by the class of stationary scheduling policies, (ii) we show for any message arrival rate vector that satisfies the outer bound, that there exists a stationary "state-independent" policy that results in a stable system for the corresponding message arrival processes, and (iii) under an asymptotic regime, we show that the stability region of information arrival rate vectors is the information-theoretic capacity region of a degraded broadcast channel.

Laser Surface Alloying of a Creep Resistant Magnesium Alloy MRI 230D with Al and Al2O3

A creep resistant permanent mould cast Mg alloy MRI 230D was laser surface alloyed with Al and a mixture of Al and Al2O3 using pulsed Nd:YAG laser irradiation at four different scan speeds in order to improve the corrosion and wear resistance. The microstructure, corrosion and wear behavior of the laser surface alloyed material is reported in this manuscript. The coating comprised of a featureless microstructure with cellular-dendritic microstructure near the interface and exhibited good interfacial bonding. A few solidification cracks reaching down to substrate were also observed. The two step coating with Al followed by a mixture of Al and Al2O3 exhibited a slightly better corrosion resistance than the single step coating with Al. In the long run, however, corrosion resistance of both the coatings became comparable to the as-cast alloy. The corroded surface of the laser surface alloyed specimens revealed a highly localized corrosion. The laser surface alloyed specimens exhibited an improvement in wear resistance. The laser scan speed did not exhibit a monotonic trend either in corrosion or wear resistance.

A low power, process invariant keeper design for high speed dynamic logic circuits

A low power keeper circuit using the concept of rate sensing has been proposed. The proposed technique reduces the amount of short circuit power dissipation in the domino gate by 70% compared to the conventional keeper technique. Also the total power-delay product is 26% lower compared to the previously reported techniques. The process tracking capability of the design enables the domino gate to achieve uniform delay across different process corners. This reduces the amount of short circuit power dissipation that occurs in the cascaded domino gates by 90%. The use of the proposed technique in the read path of a register file reduces the energy requirement by 26% as compared to the other keeper techniques. The proposed technique has been prototyped in 130nm CMOS technology.

Optimizing deployment of multiple decoys to enhance ship survivability

In this paper we model a scenario where a ship uses decoys to evade a hostile torpedo. We address the problem of enhancing ship survivability against enemy torpedoes by using single and multiple decoy deployments. We incorporate deterministic ship maneuvers and realistic constraints on turn rates, field of view, etc in the model. We formulate the objective function to quantify and maximize the survivability of the ship in terms of maximizing the intercept time. We introduce the concept of optimal deployment regions, same side deployment, and zig-zag deployment strategies. Finally, we present simulation results.

A family of Runge-Kutta based explicit methods for rotational dynamics

The present paper develops a family of explicit algorithms for rotational dynamics and presents their comparison with several existing methods. For rotational motion the configuration space is a non-linear manifold, not a Euclidean vector space. As a consequence the rotation vector and its time derivatives correspond to different tangent spaces of rotation manifold at different time instants. This renders the usual integration algorithms for Euclidean space inapplicable for rotation. In the present algorithms this problem is circumvented by relating the equation of motion to a particular tangent space. It has been accomplished with the help of already existing relation between rotation increments which belongs to two different tangent spaces. The suggested method could in principle make any integration algorithm on Euclidean space, applicable to rotation. However, the present paper is restricted only within explicit Runge-Kutta enabled to handle rotation. The algorithms developed here are explicit and hence computationally cheaper than implicit methods. Moreover, they appear to have much higher local accuracy and hence accurate in predicting any constants of motion for reasonably longer time. The numerical results for solutions as well as constants of motion, indicate superior performance by most of our algorithms, when compared to some of the currently known algorithms, namely ALGO-C1, STW, LIEMID[EA], MCG, SUBCYC-M.

Spreading Sequences for Asynchronous Spectrally Phase Encoded Optical CDMA

In phase encoding optical CDMA (OCDMA) the spreading is achieved by encoding the phase of signal spectrum. In this paper we first derive a mathematical model for the output of phase encoding OCDMA systems. Based on this model we introduce a metric to design spreading sequences for asynchronous transmission. Then we connect the phase encoding sequence design problem to OFDM PMEPR (peak to mean envelope power ratio) problem. Using this connection we conclude that designing sequences with good properties for samples of timing delay guarantees that the same sequence to be good for all timing delays. Finally using generalized bent function we manage to construct a family of sequences which are good for asynchronous phase encoding OCDMA systems and using these sequences we introduce an M-ary modulation scheme for phase encoding OCDMA

OOCs, Partial Relative Difference Families and a Conjecture of Golomb

The cyclic difference sets constructed by Singer are also examples of perfect distinct difference sets (DDS). The Bose construction of distinct difference sets, leads to a relative difference set. In this paper we introduce the concept of partial relative DDS and prove that an optical orthogonal code (OOC) construction due to Moreno et. al., is a partial relative DDS. We generalize the concept of ideal matrices previously introduced by Kumar and relate it to the concepts of this paper. Another variation of ideal matrices is introduced in this paper: Welch ideal matrices of dimension n by (n - 1). We prove that Welch ideal matrices exist only for n prime. Finally, we recast an old conjecture of Golomb on the Welch construction of Costas arrays using the concepts of this paper. This connection suggests that our construction of partial relative difference sets is in a sense, unique

Asymptotically optimal cooperative wireless networks without constellation expansion

In this work, we construct a unified family of cooperative diversity coding schemes for implementing the orthogonal amplify-and-forward and the orthogonal selection-decode-and-forward strategies in cooperative wireless networks. We show that, as the number of users increases, these schemes meet the corresponding optimal high-SNR outage region, and do so with minimal order of signaling complexity. This is an improvement over all outage-optimal schemes which impose exponential increases in signaling complexity for every new network user. Our schemes, which are based on commutative algebras of normal matrices, satisfy the outage-related information theoretic criteria, the duplex-related coding criteria, and maintain reduced signaling, encoding and decoding complexities

Microstructure and mechanical properties of squeeze-cast copper

Demand for cost-effective manufacturing techniques led to the development of near-net-shape processes. Squeeze casting is one such established effort. This process enjoys the combined merits of casting and forging. Squeeze casting imparts soundness comparable to that of wrought products while maintaining isotropic nature. Aluminum alloys and zinc alloys have been successfully processed through squeeze casting, but copper and copper alloys do not seem to have been attempted. Considering the capability of squeeze casting process, it is reasonable to expect properties different from that of conventionally cast copper. This paper presents the details of a systematic investigation wherein optimum process parameters for the squeeze casting of pure copper were established. Microstructure of squeeze-cast copper has been found to be significantly different from that of conventionally cast copper, and the dendrite arm spacing is much smaller. In addition to the room temperature mechanical properties, elevated temperature properties of copper are also appreciably improved by squeeze casting.

Flow from T-spout ladles

The ladle constitutes a crucial element in the pouring system for developing process consistency and quality in the manufacture of castings. Flow of molten metal from T-spout ladles, with the spout projecting at an angle from the shell of the ladle, was investigated by simulation, modeling and analysis. This was followed by experimental validation for water flow in translucent models, and verification in a cast iron foundry. Key parameters in the design of a ladle (for its geometry) have been identified as the ladle size, spout diameter and its angle. Velocity and flow rate from a T-spout ladle are governed by and increase with increase in angle of tilt apart from the aforementioned design parameters. Cross section and profile of the issuing jet displaying a stable twisting pattern, during its free-fall of model fluid water and molten metal iron, are notable aspects in the design of the ladle, particularly the spout exit.

Scientific rationale toward cupola design

Numerous improvements in cupola design and operation have been made in the past to increase productivity, spout temperature and fuel efficiency. However, these improvements have been based on practice and experience. The present work establishes a scientific rationale for cupola design and operation using a mathematical model. The improved performance of a divided-blast cupola over the conventional one has been successfully explained by the model. Performance of a cupola, as influenced by the important design parameter--the distance of separation between the two rows of tuyeres and operational parameters, such as size of coke and metallic charge, blast rate and charge level--was analyzed. For a divided-blast cupola, an optimum distance of 800-900 mm separation between the two rows of tuyeres was found to be ideal, irrespective of the size of cupola.