995 resultados para Binary cyclic code
Resumo:
Ultrasonic absorption has been studied by the pulse technique in the binary mixtures of acetic acid in water, methyl and ethyl alcohols and covers a range of 2 to 26 Mc/s. The mixtures are studied from 0 to 100% by weight of the acid. In all the three mixtures, two relaxation processes are observed, the first occurring below the frequency range of the study. The second one occurs near 20 Mc/s in the acid-water mixtures and at much higher frequencies in the other cases. It is qualitatively explained that the monomer-dimer reaction of the acetic acid giving a relaxation near 1 Mc/s has shifted to a higher frequency when mixed in a solvent thus giving rise to a second relaxation in the mixtures.
Resumo:
This paper describes a hardware implementation of a two-way converter logic by which conversion between numbers from positive to negative binary representation is possible. Index terms: (i) Negative radix, (ii) Positive radix, (iii) Two-way conversion.
Resumo:
Binary room temperature molten electrolytes based on acetamide and zinc perchlorate have been prepared and characterized. The electrolytes are found to be highly zinc ion-conducting with very favorable physicochemical and electrochemical characteristics. Raman and infrared spectroscopic studies reveal the presence of large free-ion concentration in the molten liquid. This is corroborated by the high conductivity observed under ambient conditions. Rechargeable zinc batteries assembled using gamma-MnO2 as the cathode and Zn as the anode with the molten electrolyte show high discharge capacities over several cycles, indicating excellent reversibility. This unique class of acetamide-based, room temperature molten liquids may become viable and green alternative electrolytes for rechargeable zinc-based secondary batteries. (C) 2009 Elsevier Inc. All rights reserved.
Resumo:
Tanner Graph representation of linear block codes is widely used by iterative decoding algorithms for recovering data transmitted across a noisy communication channel from errors and erasures introduced by the channel. The stopping distance of a Tanner graph T for a binary linear block code C determines the number of erasures correctable using iterative decoding on the Tanner graph T when data is transmitted across a binary erasure channel using the code C. We show that the problem of finding the stopping distance of a Tanner graph is hard to approximate within any positive constant approximation ratio in polynomial time unless P = NP. It is also shown as a consequence that there can be no approximation algorithm for the problem achieving an approximation ratio of 2(log n)(1-epsilon) for any epsilon > 0 unless NP subset of DTIME(n(poly(log n))).
Resumo:
In this paper, the behaviour of a group of autonomous mobile agents under cyclic pursuit is studied. Cyclic pursuit is a simple distributed control law, in which the agent i pursues agent i + 1 modulo n.. The equations of motion are linear, with no kinematic constraints on motion. Behaviourally, the agents are identical, but may have different controller gains. We generalize existing results in the literature and show that by selecting these gains, the behavior of the agents can be controlled. They can be made to converge at a point or be directed to move in a straight line. The invariance of the point of convergence with the sequence of pursuit is also shown.
Resumo:
This work describes the parallelization of High Resolution flow solver on unstructured meshes, HIFUN-3D, an unstructured data based finite volume solver for 3-D Euler equations. For mesh partitioning, we use METIS, a software based on multilevel graph partitioning. The unstructured graph used for partitioning is associated with weights both on its vertices and edges. The data residing on every processor is split into four layers. Such a novel procedure of handling data helps in maintaining the effectiveness of the serial code. The communication of data across the processors is achieved by explicit message passing using the standard blocking mode feature of Message Passing Interface (MPI). The parallel code is tested on PACE++128 available in CFD Center
Resumo:
Template matching is concerned with measuring the similarity between patterns of two objects. This paper proposes a memory-based reasoning approach for pattern recognition of binary images with a large template set. It seems that memory-based reasoning intrinsically requires a large database. Moreover, some binary image recognition problems inherently need large template sets, such as the recognition of Chinese characters which needs thousands of templates. The proposed algorithm is based on the Connection Machine, which is the most massively parallel machine to date, using a multiresolution method to search for the matching template. The approach uses the pyramid data structure for the multiresolution representation of templates and the input image pattern. For a given binary image it scans the template pyramid searching the match. A binary image of N × N pixels can be matched in O(log N) time complexity by our algorithm and is independent of the number of templates. Implementation of the proposed scheme is described in detail.
Resumo:
The phase equilibrium studies of organic system, involving resorcinol (R) and p-dimethylaminobenzaldehyde (DMAB), reveal the formation of a 1:1 molecular complex with two eutectics. The heat of mixing, entropy of fusion, roughness parameter, interfacial energy, and the excess thermodynamic functions were calculated based on enthalpy of fusion data determined via differential scanning calorimetric (DSC) method. X-ray powder diffraction studies confirm that the eutectics are not simple mechanical mixture of the components under investigation. The spectroscopic investigations (IR and NMR) suggest the occurrence of hydrogen bonding between the components forming the molecular complex. The dielectric measurements, carried out on hot-pressed addition compound (molecular complex), show higher dielectric constant at 320 K than that of individual components. The microstructural investigations of eutectic and addition compound indicate dendritic and faceted morphological features. (C) 2000 Elsevier Science B.V. All rights reserved.
Resumo:
A molecular theory of collective orientational relaxation of dipolar molecules in a dense liquid is presented. Our work is based on a generalized, nonlinear, Smoluchowski equation (GSE) that includes the effects of intermolecular interactions through a mean‐field force term. The effects of translational motion of the liquid molecules on the orientational relaxation is also included self‐consistently in the GSE. Analytic expressions for the wave‐vector‐dependent orientational correlation functions are obtained for one component, pure liquid and also for binary mixtures. We find that for a dipolar liquid of spherical molecules, the correlation function ϕ(k,t) for l=1, where l is the rank of the spherical harmonics, is biexponential. At zero wave‐vector, one time constant becomes identical with the dielectric relaxation time of the polar liquid. The second time constant is the longitudinal relaxation time, but the contribution of this second component is small. We find that polar forces do not affect the higher order correlation functions (l>1) of spherical dipolar molecules in a linearized theory. The expression of ϕ(k,t) for a binary liquid is a sum of four exponential terms. We also find that the wave‐vector‐dependent relaxation times depend strongly on the microscopic structure of the dense liquid. At intermediate wave vectors, the translational diffusion greatly accelerates the rate of orientational relaxation. The present study indicates that one must pay proper attention to the microscopic structure of the liquid while treating the translational effects. An analysis of the nonlinear terms of the GSE is also presented. An interesting coupling between the number density fluctuation and the orientational fluctuation is uncovered.
Resumo:
Non-orthogonal space-time block codes (STBC) with large dimensions are attractive because they can simultaneously achieve both high spectral efficiencies (same spectral efficiency as in V-BLAST for a given number of transmit antennas) as well as full transmit diversity. Decoding of non-orthogonal STBCs with large dimensions has been a challenge. In this paper, we present a reactive tabu search (RTS) based algorithm for decoding non-orthogonal STBCs from cyclic division algebras (CDA) having largedimensions. Under i.i.d fading and perfect channel state information at the receiver (CSIR), our simulation results show that RTS based decoding of 12 X 12 STBC from CDA and 4-QAM with 288 real dimensions achieves i) 10(-3) uncoded BER at an SNR of just 0.5 dB away from SISO AWGN performance, and ii) a coded BER performance close to within about 5 dB of the theoretical MIMO capacity, using rate-3/4 turbo code at a spectral efficiency of 18 bps/Hz. RTS is shown to achieve near SISO AWGN performance with less number of dimensions than with LAS algorithm (which we reported recently) at some extra complexity than LAS. We also report good BER performance of RTS when i.i.d fading and perfect CSIR assumptions are relaxed by considering a spatially correlated MIMO channel model, and by using a training based iterative RTS decoding/channel estimation scheme.