Full Sphere Axisymmetric Simulations of the Solar Dynamo

We explore a full sphere (2D axisymmetric) kinematic solar dynamo model based on the Babcock-Leighton idea that the poloidal field is generated in the surface layers from the decay of tilted bipolar solar active regions. This model incorporates the helioseismically deduced solar rotation profile and an algorithm for buoyancy motivated from simulations of flux tube dynamics. A prescribed deep meridional circulation plays an important role in the advection of magnetic flux. We specifically address the parity issue and show that – contrary to some recent claims – the Babcock-Leighton dynamo can reproduce solar-like dipolar parity if certain reasonable conditions are satisfied in the solar interior, the most important requirement being that the poloidal field of the two hemispheres be efficiently coupled across the equator.

A Low-Complexity, Full-Rate, Full-Diversity 2x2 STBC with Golden Code's Coding Gain

This paper presents a low-ML-decoding-complexity, full-rate, full-diversity space-time block code (STBC) for a 2 transmit antenna, 2 receive antenna multiple-input multipleoutput (MIMO) system, with coding gain equal to that of the best and well known Golden code for any QAM constellation.Recently, two codes have been proposed (by Paredes, Gershman and Alkhansari and by Sezginer and Sari), which enjoy a lower decoding complexity relative to the Golden code, but have lesser coding gain. The 2 × 2 STBC presented in this paper has lesser decoding complexity for non-square QAM constellations,compared with that of the Golden code, while having the same decoding complexity for square QAM constellations. Compared with the Paredes-Gershman-Alkhansari and Sezginer-Sari codes, the proposed code has the same decoding complexity for nonrectangular QAM constellations. Simulation results, which compare the codeword error rate (CER) performance, are presented.

A Low ML-Decoding Complexity, Full-Diversity, Full-Rate MIMO Precoder

Precoding for multiple-input multiple-output (MIMO) antenna systems is considered with perfect channel knowledge available at both the transmitter and the receiver. For two transmit antennas and QAM constellations, a real-valued precoder which is approximately optimal (with respect to the minimum Euclidean distance between points in the received signal space) among real-valued precoders based on the singular value decomposition (SVD) of the channel is proposed. The proposed precoder is obtainable easily for arbitrary QAM constellations, unlike the known complex-valued optimal precoder by Collin et al. for two transmit antennas which is in existence for 4-QAM alone and is extremely hard to obtain for larger QAM constellations. The proposed precoding scheme is extended to higher number of transmit antennas on the lines of the E - d(min) precoder for 4-QAM by Vrigneau et al. which is an extension of the complex-valued optimal precoder for 4-QAM. The proposed precoder's ML-decoding complexity as a function of the constellation size M is only O(root M)while that of the E - d(min) precoder is O(M root M)(M = 4). Compared to the recently proposed X- and Y-precoders, the error performance of the proposed precoder is significantly better while being only marginally worse than that of the E - d(min) precoder for 4-QAM. It is argued that the proposed precoder provides full-diversity for QAM constellations and this is supported by simulation plots of the word error probability for 2 x 2, 4 x 4 and 8 x 8 systems.

Collocated and Distributed STBCs with Partial Interference Cancellation Decoding, Part I: Full-Diversity Criterion

Low complexity decoders called Partial Interference Cancellation (PIC) and PIC with Successive Interference Cancellation (PIC-SIC), which include the Zero Forcing (ZF) and ZF-SIC receivers as special cases, were given by Guo and Xia along with sufficient conditions for a Space-Time Block Code (STBC) to achieve full diversity with PIC/PIC-SIC decoding for point-to-point MIMO channels. In Part-I of this two part series of papers, we give new 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. We then show that PIC and PIC-SIC decoders are capable of achieving the full cooperative diversity available in wireless relay networks and give sufficient conditions for a Distributed Space-Time Block Code (DSTBC) to achieve full diversity with PIC and PIC-SIC decoders. In Part-II, we construct new low complexity full-diversity PIC/PIC-SIC decodable STBCs and DSTBCs that achieve higher rates than the known full-diversity low complexity ML decodable STBCs and DSTBCs.

Asymptotically-Optimal, Fast-Decodable, Full-Diversity STBCs

For a family/sequence of Space-Time Block Codes (STBCs) C1, C2,⋯, with increasing number of transmit antennas Ni, with rates Ri complex symbols per channel use (cspcu), i = 1,2,⋯, the asymptotic normalized rate is defined as limi→∞ Ri/Ni. A family of STBCs is said to be asymptotically-good if the asymptotic normalized rate is non-zero, i.e., when the rate scales as a non-zero fraction of the number of transmit antennas, and the family of STBCs is said to be asymptotically-optimal if the asymptotic normalized rate is 1, which is the maximum possible value. In this paper, we construct a new class of full-diversity STBCs that have the least maximum-likelihood (ML) decoding complexity among all known codes for any number of transmit antennas N>;1 and rates R>;1 cspcu. For a large set of (R,N) pairs, the new codes have lower ML decoding complexity than the codes already available in the literature. Among the new codes, the class of full-rate codes (R=N) are asymptotically-optimal and fast-decodable, and for N>;5 have lower ML decoding complexity than all other families of asymptotically-optimal, fast-decodable, full-diversity STBCs available in the literature. The construction of the new STBCs is facilitated by the following further contributions of this paper: (i) Construction of a new class of asymptotically-good, full-diversity multigroup ML decodable codes, that not only includes STBCs for a larger set of antennas, but also either matches in rate or contains as a proper subset all other high-rate or asymptotically-good, delay-optimal, multigroup ML decodable codes available in the literature. (ii) Construction of a new class of fast-group-decodable codes (codes that combine the low ML decoding complexity properties of multigroup ML decodable codes and fast-decodable codes) for all even number of transmit antennas and rates 1 <; R ≤ 5/4.- - (iii) Given a design with full-rank linear dispersion matrices, we show that a full-diversity STBC can be constructed from this design by encoding the real symbols independently using only regular PAM constellations.

Full spin and spatial symmetry adapted technique for correlated electronic hamiltonians: Application to an icosahedral cluster

One of the long standing problems in quantum chemistry had been the inability to exploit full spatial and spin symmetry of an electronic Hamiltonian belonging to a non-Abelian point group. Here, we present a general technique which can utilize all the symmetries of an electronic (magnetic) Hamiltonian to obtain its full eigenvalue spectrum. This is a hybrid method based on Valence Bond basis and the basis of constant z-component of the total spin. This technique is applicable to systems with any point group symmetry and is easy to implement on a computer. We illustrate the power of the method by applying it to a model icosahedral half-filled electronic system. This model spans a huge Hilbert space (dimension 1,778,966) and in the largest non-Abelian point group. The C60 molecule has this symmetry and hence our calculation throw light on the higher energy excited states of the bucky ball. This method can also be utilized to study finite temperature properties of strongly correlated systems within an exact diagonalization approach. (C) 2011 Wiley Periodicals, Inc. Int J Quantum Chem, 2012

Signal-Powered Low-Drop-Diode Equivalent Circuit for Full-Wave Bridge Rectifier

Piezoelectric-device-based vibration energy harvesting requires a rectifier for conversion of input ac to usable dc form. Power loss due to diode drop in rectifier is a significant fraction of the already low levels of harvested power. The proposed circuit is a low-drop-diode equivalent, which mimics a diode using linear region-operated MOSFET. The proposed diode equivalent is powered directly from input signal and requires no additional power supply for its control. Power used by the control circuit is kept at a bare minimum to have an overall output power improvement. Diode equivalent was used to replace the four diodes in a full-wave bridge rectifier, which is the basic full- wave rectifier and is a part of the more advanced rectifiers like switch-only and bias-flip rectifiers. Simulation in 130-nm technology and experiment with discrete components show that a bridge rectifier with the proposed diode provides a 30-169% increase in output power extracted from piezoelectric device, as compared to a bridge rectifier with diode-connected MOSFETs. The bridge rectifier with the proposed diode can extract 90% of the maximum available power from an ideal piezoelectric device-bridge rectifier circuit. Setting aside the constraint of power loss, simulations indicate that diode drop as low as 10 mV at 38 mu A can be achieved.

A full-length bifunctional protein involved in c-di-GMP turnover is required for long-term survival under nutrient starvation in Mycobacterium smegmatis

The bacterial second messenger cyclic diguanosine monophosphate (c-di-GMP) plays an important role in a variety of cellular functions, including biofilm formation, alterations in the cell surface, host colonization and regulation of bacterial flagellar motility, which enable bacteria to survive changing environmental conditions. The cellular level of c-di-GMP is regulated by a balance between opposing activities of diguanylate cyclases (DGCs) and cognate phosphodiesterases (PDE-As). Here, we report the presence and importance of a protein, MSDGC-1 (an orthologue of Rv1354c in Mycobacterium tuberculosis), involved in c-di-GMP turnover in Mycobacterium smegmatis. MSDGC-1 is a multidomain protein, having GAF, GGDEF and EAL domains arranged in tandem, and exhibits both c-di-GMP synthesis and degradation activities. Most other proteins containing GGDEF and EAL domains have been demonstrated to have either DGC or PDE-A activity. Unlike other bacteria, which harbour several copies of the protein involved in c-di-GMP turnover, M. smegmatis has a single genomic copy, deletion of which severely affects long-term survival under conditions of nutrient starvation. Overexpression of MSDGC-1 alters the colony morphology and growth profile of M. smegmatis. In order to gain insights into the regulation of the c-di-GMP level, we cloned individual domains and tested their activities. We observed a loss of activity in the separated domains, indicating the importance of full-length MSDGC-1 for controlling bifunctionality.

Full Chemical Kinetic Simulation of Biogas Early Phase Combustion in SI Engines

This paper presents computational work on the biogas early phase combustion in spark ignition (SI) engines using detailed chemical kinetics. Specifically, the early phase combustion is studied to assess the effect of various ignition parameters such as spark plug location, spark energy, and number of spark plugs. An integrated version of the KIVA-3V and CHEMKIN codes was developed and used for the simulations utilizing detailed kinetics involving 325 reactions and 53 species The results show that location of the spark plug and local flow field play an important role. A central plug configuration, which is associated with higher local flow velocities in the vicinity of the spark plug, showed faster initial combustion. Although a dual plug configuration shows the highest rate of fuel consumption, it is comparable to the rate exhibited by the central plug case. The radical species important in the initiation of combustion are identified, and their concentrations are monitored during the early phase of combustion. The concentration of these radicals is also observed to correlate very well with the above-mentioned trend.Thus, the role of these radicals in promoting faster combustion has been clearly established. It is also observed that the minimum ignition energy required to initiate a self-sustained flame depends on the flow field condition in the vicinity of the spark plug.Increasing the methane content in the biogas has shown improved combustion.

An Adaptive Conditional Zero-Forcing Decoder With Full-Diversity, Least Complexity and Essentially-ML Performance for STBCs

A low complexity, essentially-ML decoding technique for the Golden code and the three antenna Perfect code was introduced by Sirianunpiboon, Howard and Calderbank. Though no theoretical analysis of the decoder was given, the simulations showed that this decoding technique has almost maximum-likelihood (ML) performance. Inspired by this technique, in this paper we introduce two new low complexity decoders for Space-Time Block Codes (STBCs)-the Adaptive Conditional Zero-Forcing (ACZF) decoder and the ACZF decoder with successive interference cancellation (ACZF-SIC), which include as a special case the decoding technique of Sirianunpiboon et al. We show that both ACZF and ACZF-SIC decoders are capable of achieving full-diversity, and we give a set of sufficient conditions for an STBC to give full-diversity with these decoders. We then show that the Golden code, the three and four antenna Perfect codes, the three antenna Threaded Algebraic Space-Time code and the four antenna rate 2 code of Srinath and Rajan are all full-diversity ACZF/ACZF-SIC decodable with complexity strictly less than that of their ML decoders. Simulations show that the proposed decoding method performs identical to ML decoding for all these five codes. These STBCs along with the proposed decoding algorithm have the least decoding complexity and best error performance among all known codes for transmit antennas. We further provide a lower bound on the complexity of full-diversity ACZF/ACZF-SIC decoding. All the five codes listed above achieve this lower bound and hence are optimal in terms of minimizing the ACZF/ACZF-SIC decoding complexity. Both ACZF and ACZF-SIC decoders are amenable to sphere decoding implementation.

Distributed STBCs with full-diversity partial interference cancellation decoding

Recently, Guo and Xia introduced low complexity decoders called Partial Interference Cancellation (PIC) and PIC with Successive Interference Cancellation (PIC-SIC), which include the Zero Forcing (ZF) and ZF-SIC receivers as special cases, for point-to-point MIMO channels. In this paper, we show that PIC and PIC-SIC decoders are capable of achieving the full cooperative diversity available in wireless relay networks. We give sufficient conditions for a Distributed Space-Time Block Code (DSTBC) to achieve full diversity with PIC and PIC-SIC decoders and construct a new class of DSTBCs with low complexity full-diversity PIC-SIC decoding using complex orthogonal designs. The new class of codes includes a number of known full-diversity PIC/PIC-SIC decodable Space-Time Block Codes (STBCs) constructed for point-to-point channels as special cases. The proposed DSTBCs achieve higher rates (in complex symbols per channel use) than the multigroup ML decodable DSTBCs available in the literature. Simulation results show that the proposed codes have better bit error rate performance than the best known low complexity, full-diversity DSTBCs.

Full-rate full-diversity achieving MIMO precoding with partial CSIT

In this paper, we consider a slow-fading nt ×nr multiple-input multiple-output (MIMO) channel subjected to block fading. Reliability (in terms of achieved diversity order) and rate (in number of symbols transmitted per channel use) are of interest in such channels. We propose a new precoding scheme which achieves both full diversity (nt ×nrth order diversity) as well as full rate (nt symbols per channel use) using partial channel state information at the transmitter (CSIT). The proposed scheme achieves full diversity and improved coding gain through an optimization over the choice of constellation sets. The optimization maximizes dmin2 for our precoding scheme subject to an energy constraint. The scheme requires feedback of nt - 1 angle parameter values, compared to 2ntnr real coefficients in case of full CSIT. Further, for the case of nt × 1 system, we prove that the capacity achieved by the proposed scheme is same as that achieved with full CSIT. Error rate performance results for nt = 3,4,8 show that the proposed scheme performs better than other precoding schemes in the literature; the better performance is due to the choice of the signal sets and the feedback angles in the proposed scheme.

Full-rate full-diversity finite feedback space-time schemes with minimum feedback and transmission duration

A Finite Feedback Scheme (FFS) for a quasi-static MIMO block fading channel with finite N-ary delay-free noise-free feedback consists of N Space-Time Block Codes (STBCs) at the transmitter, one corresponding to each possible value of feedback, and a function at the receiver that generates N-ary feedback. A number of FFSs are available in the literature that provably attain full-diversity. However, there is no known full-diversity criterion that universally applies to all FFSs. In this paper a universal necessary condition for any FFS to achieve full-diversity is given, and based on this criterion the notion of Feedback-Transmission duration optimal (FT-optimal) FFSs is introduced, which are schemes that use minimum amount of feedback N for the given transmission duration T, and minimum T for the given N to achieve full-diversity. When there is no feedback (N = 1) an FT-optimal scheme consists of a single STBC, and the proposed condition reduces to the well known necessary and sufficient condition for an STBC to achieve full-diversity. Also, a sufficient criterion for full-diversity is given for FFSs in which the component STBC yielding the largest minimum Euclidean distance is chosen, using which full-rate (N-t complex symbols per channel use) full-diversity FT-optimal schemes are constructed for all N-t > 1. These are the first full-rate full-diversity FFSs reported in the literature for T < N-t. Simulation results show that the new schemes have the best error performance among all known FFSs.