932 resultados para Full Restoration
Resumo:
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.
Resumo:
Image and video filtering is a key image-processing task in computer vision especially in noisy environment. In most of the cases the noise source is unknown and hence possess a major difficulty in the filtering operation. In this paper we present an error-correction based learning approach for iterative filtering. A new FIR filter is designed in which the filter coefficients are updated based on Widrow-Hoff rule. Unlike the standard filter the proposed filter has the ability to remove noise without the a priori knowledge of the noise. Experimental result shows that the proposed filter efficiently removes the noise and preserves the edges in the image. We demonstrate the capability of the proposed algorithm by testing it on standard images infected by Gaussian noise and on a real time video containing inherent noise. Experimental result shows that the proposed filter is better than some of the existing standard filters
Resumo:
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.
Resumo:
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.
Resumo:
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.
Resumo:
Aquatic Ecosystems perform numerous valuable environmental functions. They recycle nutrients, purify water, recharge ground water, augment and maintain stream flow, and provide habitat for a wide variety of flora and fauna and recreation for people. A rapid population increase accompanied by unplanned developmental works has led to the pollution of surface waters due to residential, agricultural, commercial and industrial wastes/effluents and decline in the number of water bodies. Increased demands for drainage of wetlands have been accommodated by channelisation, resulting in further loss of stream habitat, which has led to aquatic organisms becoming extinct or imperiled in increasing numbers and to the impairment of many beneficial uses of water, including drinking, swimming and fishing. Various anthropogenic activities have altered the physical, chemical and biological processes within aquatic ecosystems. An integrated and accelerated effort toward environmental restoration and preservation is needed to stop further degradation of these fragile ecosystems. Failure to restore these ecosystems will result in sharply increased environmental costs later, in the extinction of species or ecosystem types, and in permanent ecological damage.
Resumo:
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
Resumo:
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.
Resumo:
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.
Resumo:
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.
Resumo:
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.