High-Rate Space-Time Coded Large-MIMO Systems: Low-Complexity Detection and Channel Estimation

In this paper, we present a low-complexity algorithm for detection in high-rate, non-orthogonal space-time block coded (STBC) large-multiple-input multiple-output (MIMO) systems that achieve high spectral efficiencies of the order of tens of bps/Hz. We also present a training-based iterative detection/channel estimation scheme for such large STBC MIMO systems. Our simulation results show that excellent bit error rate and nearness-to-capacity performance are achieved by the proposed multistage likelihood ascent search (M-LAS) detector in conjunction with the proposed iterative detection/channel estimation scheme at low complexities. The fact that we could show such good results for large STBCs like 16 X 16 and 32 X 32 STBCs from Cyclic Division Algebras (CDA) operating at spectral efficiencies in excess of 20 bps/Hz (even after accounting for the overheads meant for pilot based training for channel estimation and turbo coding) establishes the effectiveness of the proposed detector and channel estimator. We decode perfect codes of large dimensions using the proposed detector. With the feasibility of such a low-complexity detection/channel estimation scheme, large-MIMO systems with tens of antennas operating at several tens of bps/Hz spectral efficiencies can become practical, enabling interesting high data rate wireless applications.

Homologous pairing between nucleosome cores on a linear duplex DNA and nucleoprotein filaments of RecA protein-single stranded DNA

The ability of E coli recA protein to promote homologous pairing with linear duplex DNA bound to HU protein (Nucleosome cores) was found to be differentially affected. The formation of paranemic joint molecules was not affected whereas the formation of plectomic joint molecules was inhibited from the start of the reaction. The formation of paranemic joint molecules between nucleoprotein filaments of recA protein-circular single stranded DNA and closed circular duplex DNA is believed to generate positive supercoiling in the duplex DNA. We found that the positively superhelical duplex DNA was inert in the formation of joint molecules but could be converted into an active substrate, in situ, by the action of wheat germ topoisomerase I. These observations initiate an understanding of the structural features of E coli chromosome such as DNA supercoiling and nucleosome-like structures in homologous recombination.

Kernel-based spatial-color modeling for fast moving object tracking

Visual tracking has been a challenging problem in computer vision over the decades. The applications of Visual Tracking are far-reaching, ranging from surveillance and monitoring to smart rooms. Mean-shift (MS) tracker, which gained more attention recently, is known for tracking objects in a cluttered environment and its low computational complexity. The major problem encountered in histogram-based MS is its inability to track rapidly moving objects. In order to track fast moving objects, we propose a new robust mean-shift tracker that uses both spatial similarity measure and color histogram-based similarity measure. The inability of MS tracker to handle large displacements is circumvented by the spatial similarity-based tracking module, which lacks robustness to object's appearance change. The performance of the proposed tracker is better than the individual trackers for tracking fast-moving objects with better accuracy.

Real-coded genetic algorithm for machining condition optimization

In this paper, we consider the machining condition optimization models presented in earlier studies. Finding the optimal combination of machining conditions within the constraints is a difficult task. Hence, in earlier studies standard optimization methods are used. The non-linear nature of the objective function, and the constraints that need to be satisfied makes it difficult to use the standard optimization methods for the solution. In this paper, we present a real coded genetic algorithm (RCGA), to find the optimal combination of machining conditions. We present various issues related to real coded genetic algorithm such as solution representation, crossover operators, and repair algorithm in detail. We also present the results obtained for these models using real coded genetic algorithm and discuss the advantages of using real coded genetic algorithm for these problems. From the results obtained, we conclude that real coded genetic algorithm is reliable and accurate for solving the machining condition optimization models.

Metal-ion-mediated tuning of duplex DNA binding by bis(2-(2-pyridyl)-1H-benzimidazole)

Studies of double-stranded-DNA binding have been performed with three isomeric bis)2-(n-pyridyl)-1H-benzimidazole)s (n = 2, 3, 4). Like the well-known Hoechst 33258, which is a bisbenzimidazole compound, these three isomers bind to the minor groove of duplex DNA. DNA binding by the three isomers was investigated in the presence of the divalent metal ions Mg2+, Co2+, Ni2+, Cu2+, and Zn2+. Ligand-DNA interactions were probed with fluorscence and circular dichroism spectroscopy. These studies revealed that the binding of the 2-pyridyl derivative to DNA is dramatically reduced in the presence of Co2+, Ni2+, and Cu2+ ions and is abolished completely at a ligand/metal-cation ratio of 1:1. Control experiments done with the isomeric 3- and 4-pyridyl derivatives showed that their binding to DNA is unaffected by the aforementioned transition-metal ions. The ability of 2-(2-pyridyl)benzimidazole changes of the ligand associated with ion chelation probably ledto such unusual binding results for the ortho isomer. The addition of ethylenediaminetetraacetic acid (EDTA) reversed the effects completely.

A real coded genetic algorithm for data partitioning and scheduling in networks with arbitrary processor release time

The problem of scheduling divisible loads in distributed computing systems, in presence of processor release time is considered. The objective is to find the optimal sequence of load distribution and the optimal load fractions assigned to each processor in the system such that the processing time of the entire processing load is a minimum. This is a difficult combinatorial optimization problem and hence genetic algorithms approach is presented for its solution.

A non-orthogonal distributed space-time coded protocol - Part 1:Signal model and design criteria

In this two-part series of papers, a generalized non-orthogonal amplify and forward (GNAF) protocol which generalizes several known cooperative diversity protocols is proposed. Transmission in the GNAF protocol comprises of two phases - the broadcast phase and the cooperation phase. In the broadcast phase, the source broadcasts its information to the relays as well as the destination. In the cooperation phase, the source and the relays together transmit a space-time code in a distributed fashion. The GNAF protocol relaxes the constraints imposed by the protocol of Jing and Hassibi on the code structure. In Part-I of this paper, a code design criteria is obtained and it is shown that the GNAF protocol is delay efficient and coding gain efficient as well. Moreover GNAF protocol enables the use of sphere decoders at the destination with a non-exponential Maximum likelihood (ML) decoding complexity. In Part-II, several low decoding complexity code constructions are studied and a lower bound on the Diversity-Multiplexing Gain tradeoff of the GNAF protocol is obtained.

GAP-RBF based NR image quality measurement for JPEG coded images

In this paper, we present a growing and pruning radial basis function based no-reference (NR) image quality model for JPEG-coded images. The quality of the images are estimated without referring to their original images. The features for predicting the perceived image quality are extracted by considering key human visual sensitivity factors such as edge amplitude, edge length, background activity and background luminance. Image quality estimation involves computation of functional relationship between HVS features and subjective test scores. Here, the problem of quality estimation is transformed to a function approximation problem and solved using GAP-RBF network. GAP-RBF network uses sequential learning algorithm to approximate the functional relationship. The computational complexity and memory requirement are less in GAP-RBF algorithm compared to other batch learning algorithms. Also, the GAP-RBF algorithm finds a compact image quality model and does not require retraining when the new image samples are presented. Experimental results prove that the GAP-RBF image quality model does emulate the mean opinion score (MOS). The subjective test results of the proposed metric are compared with JPEG no-reference image quality index as well as full-reference structural similarity image quality index and it is observed to outperform both.

Novel composite coded pattern for small angle measurement using imaging method -art.no.62891D

A novel approach for measurement of small rotation angles using imaging method is proposed and demonstrated. A plane mirror placed on a precision rotating table is used for imaging the newly designed composite coded pattern. The imaged patterns are captured with the help of a CCD camera. The angular rotation of the plane mirror is determined from a pair of the images of the pattern, captured once before and once after affecting the tilt of the mirror. Both simulation and experimental results suggest that the proposed approach not only retains the advantages of the original imaging method but also contributes significantly to the enhancement of its measuring range (+/- 4.13 degrees with accuracy of the order of 1 arcsec).

DNA duplex with the potential to change handedness after every half a turn

Polymorphic forms of the DNA duplex with long stretches of structural monotony are known. Several alternating purine-pyrimidine sequences have been shown to adopt left-handed Z-conformation. We report a DNA sequence d(CGCGCGATCGAT)n exhibiting alternating right-handed B and left-handed Z helical conformation after every half a turn. Further, this unusual conformation with change in handedness after every six base pairs was induced at physiological superhelical density.

Interaction between the Z-type DNA duplex and 1,3-propanediamine:crystal structure of d(CACGTG)(2) at 1.2 angstrom resolution

The crystal structure of a hexamer duplex d(CACGTG)(2) has been determined and refined to an R-factor of 18.3% using X-ray data up to 1.2 angstrom resolution. The sequence crystallizes as a left-handed Z-form double helix with Watson-Crick base pairing. There is one hexamer duplex, a spermine molecule, 71 water molecules, and an unexpected diamine (Z-5, 1,3-propanediamine, C3H10N2)) in the asymmetric unit. This is the high-resolution non-disordered structure of a Z-DNA hexamer containing two AT base pairs in the interior of a duplex with no modifications such as bromination or methylation on cytosine bases. This structure does not possess multivalent cations such as cobalt hexaammine that are known to stabilize Z-DNA. The overall duplex structure and its crystal interactions are similar to those of the pure-spermine form of the d(CGCGCG)(2) structure. The spine of hydration in the minor groove is intact except in the vicinity of the T5A8 base pair. The binding of the Z-5 molecule in the minor grove of the d(CACGTG)(2) duplex appears to have a profound effect in conferring stability to a Z-DNA conformation via electrostatic complementarity and hydrogen bonding interactions. The successive base stacking geometry in d(CACGTG)(2) is similar to the corresponding steps in d(CG)(3). These results suggest that specific polyamines such as Z-5 could serve as powerful inducers of Z-type conformation in unmodified DNA sequences with AT base pairs. This structure provides a molecular basis for stabilizing AT base pairs incorporated into an alternating d(CG) sequence.

Groove Binding Ligands for the Interaction with Parallel-Stranded ps-Duplex DNA and Triplex DNA

DNA adopts different conformations not only based on novel base pairs, but also with different chain polarities. Besides several duplex structures (A, B, Z, parallel stranded (ps)-DNA, etc.), DNA also forms higher-order structures like triplex, tetraplex, and i-motif. Each of these structures has its own biological significance. The ps-duplexes have been found to be resistant to certain nucleases and endonucleases. Molecules that promote triple-helix formation have significant potential. These investigations have many therapeutic advantages which may be useful in the regulation of the expression of genes responsible for certain diseases by locking either their transcription (antigene) or translation (antisense). Each DNA minor groove binding ligand (MGBL) interacts with DNA through helical minor groove recognition in a sequence-specific manner, and this interferes with several DNA-associated processes. Incidentally, these ligands interact with some non-B-DNA and with higher-order DNA structures including ps-DNA and triplexes. While the design and recognition of minor grooves of duplex DNA by specific MGBLs have been a topic of many reports, limited information is available on the binding behavior of MGBLs with nonduplex DNA. In this review, we summarize various attempts of the interaction of MGBLs with ps-DNA and DNA triplexes.

Nucleosomes on linear duplex DNA allow homologous pairing but prevent strand exchange promoted by RecA protein

To understand the molecular basis of gene targeting, we have studied interactions of nucleoprotein filaments comprised of single-stranded DNA and RecA protein with chromatin templates reconstituted from linear duplex DNA and histones. We observed that for the chromatin templates with histone/DNA mass ratios of 0.8 and 1.6, the efficiency of homologous pairing was indistinguishable from that of naked duplex DNA but strand exchange was repressed. In contrast, the chromatin templates with a histone/DNA mass ratio of 9.0 supported neither homologous pairing nor strand exchange. The addition of histone H1, in stoichiometric amounts, to chromatin templates quells homologous pairing. The pairing of chromatin templates with nucleoprotein filaments of RecA protein-single-stranded DNA proceeded without the production of detectable networks of DNA, suggesting that coaggregates are unlikely to be the intermediates in homologous pairing. The application of these observations to strategies for gene targeting and their implications for models of genetic recombination are discussed.

High-Rate Space-Time Coded Large MIMO Systems: Low-Complexity Detection and Performance

Large MIMO systems with tens of antennas in each communication terminal using full-rate non-orthogonal space-time block codes (STBC) from Cyclic Division Algebras (CDA) can achieve the benefits of both transmit diversity as well as high spectral efficiencies. Maximum-likelihood (ML) or near-ML decoding of these large-sized STBCs at low complexities, however, has been a challenge. In this paper, we establish that near-ML decoding of these large STBCs is possible at practically affordable low complexities. We show that the likelihood ascent search (LAS) detector, reported earlier by us for V-BLAST, is able to achieve near-ML uncoded BER performance in decoding a 32x32 STBC from CDA, which employs 32 transmit antennas and sends 32(2) = 1024 complex data symbols in 32 time slots in one STBC matrix (i.e., 32 data symbols sent per channel use). In terms of coded BER, with a 16x16 STBC, rate-3/4 turbo code and 4-QAM (i.e., 24 bps/Hz), the LAS detector performs close to within just about 4 dB from the theoretical MIMO capacity. Our results further show that, with LAS detection, information lossless (ILL) STBCs perform almost as good as full-diversity ILL (FD-ILL) STBCs. Such low-complexity detectors can potentially enable implementation of high spectral efficiency large MIMO systems that could be considered in wireless standards.

Implications of the half-duplex constraint on relay-aided cooperation using rateless codes

The half-duplex constraint, which mandates that a cooperative relay cannot transmit and receive simultaneously, considerably simplifies the demands made on the hardware and signal processing capabilities of a relay. However, the very inability of a relay to transmit and receive simultaneously leads to a potential under-utilization of time and bandwidth resources available to the system. We analyze the impact of the half-duplex constraint on the throughput of a cooperative relay system that uses rateless codes to harness spatial diversity and efficiently transmit information from a source to a destination. We derive closed-form expressions for the throughput of the system, and show that as the number of relays increases, the throughput approaches that of a system that uses more sophisticated full-duplex nodes. Thus, half-duplex nodes are well suited for cooperation using rateless codes despite the simplicity of both the cooperation protocol and the relays.