The complexity of certain incremental code generation problems

This paper looks at the complexity of four different incremental problems. The following are the problems considered: (1) Interval partitioning of a flow graph (2) Breadth first search (BFS) of a directed graph (3) Lexicographic depth first search (DFS) of a directed graph (4) Constructing the postorder listing of the nodes of a binary tree. The last problem arises out of the need for incrementally computing the Sethi-Ullman (SU) ordering [1] of the subtrees of a tree after it has undergone changes of a given type. These problems are among those that claimed our attention in the process of our designing algorithmic techniques for incremental code generation. BFS and DFS have certainly numerous other applications, but as far as our work is concerned, incremental code generation is the common thread linking these problems. The study of the complexity of these problems is done from two different perspectives. In [2] is given the theory of incremental relative lower bounds (IRLB). We use this theory to derive the IRLBs of the first three problems. Then we use the notion of a bounded incremental algorithm [4] to prove the unboundedness of the fourth problem with respect to the locally persistent model of computation. Possibly, the lower bound result for lexicographic DFS is the most interesting. In [5] the author considers lexicographic DFS to be a problem for which the incremental version may require the recomputation of the entire solution from scratch. In that sense, our IRLB result provides further evidence for this possibility with the proviso that the incremental DFS algorithms considered be ones that do not require too much of preprocessing.

A New Full-diversity Criterion and Low-complexity STBCs with Partial Interference Cancellation Decoding

Recently, Guo and Xia gave sufficient conditions for an STBC to achieve full diversity when a PIC (Partial Interference Cancellation) or a PIC-SIC (PIC with Successive Interference Cancellation) decoder is used at the receiver. In this paper, we give alternative conditions for an STBC to achieve full diversity with PIC and PIC-SIC decoders, which are equivalent to Guo and Xia's conditions, but are much easier to check. Using these conditions, we construct a new class of full diversity PIC-SIC decodable codes, which contain the Toeplitz codes and a family of codes recently proposed by Zhang, Xu et. al. as proper subclasses. With the help of the new criteria, we also show that a class of PIC-SIC decodable codes recently proposed by Zhang, Shi et. al. can be decoded with much lower complexity than what is reported, without compromising on full diversity.

On the diversity and complexity of Zero Forcing receivers for MIMO Zero Padded systems

Zero padded systems with linear receivers are shown to be robust and amenable to fast implementations in single antenna scenarios. In this paper, properties of such systems are investigated when multiple antennas are present at both ends of the communication link. In particular, their diversity and complexity are evaluated for precoded transmissions. The linear receivers are shown to exploit multipath and receive diversities, even in the absence of any coding at the transmitter. Use of additional redundancy to improve performance is considered and the effect of transmission rate on diversity order is analyzed. Low complexity implementations of Zero Forcing receivers are devised to further enhance their applicability.

X-Codes: A Low Complexity Full-Rate High-Diversity Achieving Precoder for TDD MIMO Systems

We consider a time division duplex multiple-input multiple-output (nt × nr MIMO). Using channel state information (CSI) at the transmitter, singular value decomposition (SVD) of the channel matrix is performed. This transforms the MIMO channel into parallel subchannels, but has a low overall diversity order. Hence, we propose X-Codes which achieve a higher diversity order by pairing the subchannels, prior to SVD preceding. In particular, each pair of information symbols is encoded by a fixed 2 × 2 real rotation matrix. X-Codes can be decoded using nr very low complexity two-dimensional real sphere decoders. Error probability analysis for X-Codes enables us to choose the optimal pairing and the optimal rotation angle for each pair. Finally, we show that our new scheme outperforms other low complexity precoding schemes.

Quantum theoretical study of molecular mechanisms of mutation and cancer - A review

Several endogenous and exogenous chemical species, particularly the so-called reactive oxygen species (ROS) and reactive nitrogen oxide species (RNOS), attack deoxyribonucleic acid (DNA) in biological systems producing DNA lesions which hamper normal cell functioning and cause various diseases including mutation and cancer. The guanine (G) base of DNA among all the bases is most susceptible and certain modified guanines get involved in mispairing with other bases during DNA replication. The biological system repairs the abnormal base pairs, but those that are still left cause mutation and cancer. Anti-oxidants present in biological systems can scavenge the ROS and RNOS. Thus three types of molecular events occur in biological media: (i) DNA damage, (ii) DNA repair, and (iii) prevention of DNA damage by scavenging ROS and RNOS. Quantum mechanical methods may be used to unravel molecular mechanisms of such phenomena. Some recent quantum theoretical results obtained on these problems are reviewed here.

Developments in quantum information processing by nuclear magnetic resonance: Use of quadrupolar and dipolar couplings

Use of dipolar and quadrupolar couplings for quantum information processing (QIP) by nuclear magnetic resonance (NMR) is described. In these cases, instead of the individual spins being qubits, the 2(n) energy levels of the spin-system can be treated as an n-qubit system. It is demonstrated that QIP in such systems can be carried out using transition-selective pulses, in (CHCN)-C-3, (CH3CN)-C-13, Li-7 (I = 3/2) and Cs-133 (I = 7/2), oriented in liquid crystals yielding 2 and 3 qubit systems. Creation of pseudopure states, implementation of logic gates and arithmetic operations (half-adder and subtractor) have been carried out in these systems using transition-selective pulses.

Implementation of conditional phase-shift gate for quantum information processing by NMR, using transition-selective pulses

Experimental realization of quantum information processing in the field of nuclear magnetic resonance (NMR) has been well established. Implementation of conditional phase-shift gate has been a significant step, which has lead to realization of important algorithms such as Grover's search algorithm and quantum Fourier transform. This gate has so far been implemented in NMR by using coupling evolution method. We demonstrate here the implementation of the conditional phase-shift gate using transition selective pulses. As an application of the gate, we demonstrate Grover's search algorithm and quantum Fourier transform by simulations and experiments using transition selective pulses. (C) 2002 Elsevier Science (USA). All rights reserved.

Quantum spin models with exact dimer ground states

Inspired by the exact solution of the Majumdar-Ghosh model, a family of one-dimensional, translationally invariant spin Hamiltonians is constructed. The exchange coupling in these models is antiferromagnetic, and decreases linearly with the separation between the spins. The coupling becomes identically zero beyond a certain distance. It is rigorously proved that the dimer configuration is an exact, superstable ground-state configuration of all the members of the family on a periodic chain. The ground state is twofold degenerate, and there exists an energy gap above the ground state. The Majumdar-Ghosh Hamiltonian with a twofold degenerate dimer ground state is just the first member of the family. The scheme of construction is generalized to two and three dimensions, and illustrated with the help of some concrete examples. The first member in two dimensions is the Shastry-Sutherland model. Many of these models have exponentially degenerate, exact dimer ground states.

Quantum phenomena in magnetic nano clusters

One of the fascinating fields of study in magnetism in recent years has been the study of quantum phenomena in nanosystems. While semiconductor structures have provided paradigms of nanosystems from the stand point of electronic phenomena the synthesis of high nuclearity transition metal complexes have provided examples of nano magnets. The range and diversity of the properties exhibited by these systems rivals its electronic counterparts. Qualitative understanding of these phenomena requires only a knowledge of basic physics, but quantitative study throws up many challenges that are similar to those encountered in the study of correlated electronic systems. In this article, a brief overview of the current trends in this area arc highlighted and some of the efforts of our group in developing a quantitative understanding of this field are outlined.

Simultaneous MultiStreaming for complexity-effective VLIW architectures

Very Long Instruction Word (VLIW) architectures exploit instruction level parallelism (ILP) with the help of the compiler to achieve higher instruction throughput with minimal hardware. However, control and data dependencies between operations limit the available ILP, which not only hinders the scalability of VLIW architectures, but also result in code size expansion. Although speculation and predicated execution mitigate ILP limitations due to control dependencies to a certain extent, they increase hardware cost and exacerbate code size expansion. Simultaneous multistreaming (SMS) can significantly improve operation throughput by allowing interleaved execution of operations from multiple instruction streams. In this paper we study SMS for VLIW architectures and quantify the benefits associated with it using a case study of the MPEG-2 video decoder. We also propose the notion of virtual resources for VLIW architectures, which decouple architectural resources (resources exposed to the compiler) from the microarchitectural resources, to limit code size expansion. Our results for a VLIW architecture demonstrate that: (1) SMS delivers much higher throughput than that achieved by speculation and predicated execution, (2) the increase in performance due to the addition of speculation and predicated execution support over SMS averages around 12%. The minor increase in performance might not warrant the additional hardware complexity involved, and (3) the notion of virtual resources is very effective in reducing no-operations (NOPs) and consequently reduce code size with little or no impact on performance.