874 resultados para iterative multitier ensembles
Resumo:
This paper presents our investigation on iterativedecoding performances of some sparse-graph codes on block-fading Rayleigh channels. The considered code ensembles are standard LDPC codes and Root-LDPC codes, first proposed in and shown to be able to attain the full transmission diversity. We study the iterative threshold performance of those codes as a function of fading gains of the transmission channel and propose a numerical approximation of the iterative threshold versus fading gains, both both LDPC and Root-LDPC codes.Also, we show analytically that, in the case of 2 fading blocks,the iterative threshold root of Root-LDPC codes is proportional to (α1 α2)1, where α1 and α2 are corresponding fading gains.From this result, the full diversity property of Root-LDPC codes immediately follows.
Resumo:
This thesis includes analysis of disordered spin ensembles corresponding to Exact Cover, a multi-access channel problem, and composite models combining sparse and dense interactions. The satisfiability problem in Exact Cover is addressed using a statistical analysis of a simple branch and bound algorithm. The algorithm can be formulated in the large system limit as a branching process, for which critical properties can be analysed. Far from the critical point a set of differential equations may be used to model the process, and these are solved by numerical integration and exact bounding methods. The multi-access channel problem is formulated as an equilibrium statistical physics problem for the case of bit transmission on a channel with power control and synchronisation. A sparse code division multiple access method is considered and the optimal detection properties are examined in typical case by use of the replica method, and compared to detection performance achieved by interactive decoding methods. These codes are found to have phenomena closely resembling the well-understood dense codes. The composite model is introduced as an abstraction of canonical sparse and dense disordered spin models. The model includes couplings due to both dense and sparse topologies simultaneously. The new type of codes are shown to outperform sparse and dense codes in some regimes both in optimal performance, and in performance achieved by iterative detection methods in finite systems.
Resumo:
It is shown that the families of generalized matrix ensembles recently considered which give rise to an orthogonal invariant stable Levy ensemble can be generated by the simple procedure of dividing Gaussian matrices by a random variable. The nonergodicity of this kind of disordered ensembles is investigated. It is shown that the same procedure applied to random graphs gives rise to a family that interpolates between the Erdos-Renyi and the scale free models.
Resumo:
The present fundamental knowledge of fluid turbulence has been established primarily from hot- and cold-wire measurements. Unfortunately, however, these measurements necessarily suffer from contamination by noise since no certain method has previously been available to optimally filter noise from the measured signals. This limitation has impeded our progress of understanding turbulence profoundly. We address this limitation by presenting a simple, fast-convergent iterative scheme to digitally filter signals optimally and find Kolmogorov scales definitely. The great efficacy of the scheme is demonstrated by its application to the instantaneous velocity measured in a turbulent jet.
Resumo:
A new method is presented to determine an accurate eigendecomposition of difficult low temperature unimolecular master equation problems. Based on a generalisation of the Nesbet method, the new method is capable of achieving complete spectral resolution of the master equation matrix with relative accuracy in the eigenvectors. The method is applied to a test case of the decomposition of ethane at 300 K from a microcanonical initial population with energy transfer modelled by both Ergodic Collision Theory and the exponential-down model. The fact that quadruple precision (16-byte) arithmetic is required irrespective of the eigensolution method used is demonstrated. (C) 2001 Elsevier Science B.V. All rights reserved.
Resumo:
Sympatric individuals of Rattus fuscipes and Rattus leucopus, two Australian native rats from the tropical wet forests of north Queensland, are difficult to distinguish morphologically and are often confused in the field. When we started a study on fine-scale movements of these species, using microsatellite markers, we found that the species as identified in the field did not form coherent genetic groups. In this study, we examined the potential of an iterative process of genetic assignment to separate specimens from distinct (e.g. species, populations) natural groups. Five loci with extensive overlap in allele distributions between species were used for the iterative process. Samples were randomly distributed into two starting groups of equal size and then subjected to the test. At each iteration, misassigned samples switched groups, and the output groups from a given round of assignment formed the input groups for the next round. All samples were assigned correctly on the 10th iteration, in which two genetic groups were clearly separated. Mitochondrial DNA sequences were obtained from samples from each genetic group identified by assignment, together with those of museum voucher specimens, to assess which species corresponded to which genetic group. The iterative procedure was also used to resolve groups within species, adequately separating the genetically identified R. leucopus from our two sampling sites. These results show that the iterative assignment process can correctly differentiate samples into their appropriate natural groups when diagnostic genetic markers are not available, which allowed us to resolve accurately the two R. leucopus and R. fuscipes species. Our approach provides an analytical tool that may be applicable to a broad variety of situations where genetic groups need to be resolved.
Resumo:
As discussed in the preceding paper [Wiseman and Vaccaro, preceding paper, Phys. Rev. A 65, 043605 (2002)], the stationary state of an optical or atom laser far above threshold is a mixture of coherent field states with random phase, or, equivalently, a Poissonian mixture of number states. We are interested in which, if either, of these descriptions of rho(ss) as a stationary ensemble of pure states, is more natural. In the preceding paper we concentrated upon the question of whether descriptions such as these are physically realizable (PR). In this paper we investigate another relevant aspect of these ensembles, their robustness. A robust ensemble is one for which the pure states that comprise it survive relatively unchanged for a long time under the system evolution. We determine numerically the most robust ensembles as a function of the parameters in the laser model: the self-energy chi of the bosons in the laser mode, and the excess phase noise nu. We find that these most robust ensembles are PR ensembles, or similar to PR ensembles, for all values of these parameters. In the ideal laser limit (nu=chi=0), the most robust states are coherent states. As the phase noise or phase dispersion is increased through nu or the self-interaction of the bosons chi, respectively, the most robust states become more and more amplitude squeezed. We find scaling laws for these states, and give analytical derivations for them. As the phase diffusion or dispersion becomes so large that the laser output is no longer quantum coherent, the most robust states become so squeezed that they cease to have a well-defined coherent amplitude. That is, the quantum coherence of the laser output is manifest in the most robust PR ensemble being an ensemble of states with a well-defined coherent amplitude. This lends support to our approach of regarding robust PR ensembles as the most natural description of the state of the laser mode. It also has interesting implications for atom lasers in particular, for which phase dispersion due to self-interactions is expected to be large.
Resumo:
A laser, be it an optical laser or an atom laser, is an open quantum system that produces a coherent beam of bosons (photons or atoms, respectively). Far above threshold, the stationary state rho(ss) of the laser mode is a mixture of coherent-field states with random phase, or, equivalently, a Poissonian mixture of number states. This paper answers the question: can descriptions such as these, of rho(ss) as a stationary ensemble of pure states, be physically realized? Here physical realization is as defined previously by us [H. M. Wiseman and J. A. Vaccaro, Phys. Lett. A 250, 241 (1998)]: an ensemble of pure states for a particular system can be physically realized if, without changing the dynamics of the system, an experimenter can (in principle) know at any time that the system is in one of the pure-state members of the ensemble. Such knowledge can be obtained by monitoring the baths to which the system is coupled, provided that coupling is describable by a Markovian master equation. Using a family of master equations for the (atom) laser, we solve for the physically realizable (PR) ensembles. We find that for any finite self-energy chi of the bosons in the laser mode, the coherent-state ensemble is not PR; the closest one can come to it is an ensemble of squeezed states. This is particularly relevant for atom lasers, where the self-energy arising from elastic collisions is expected to be large. By contrast, the number-state ensemble is always PR. As the self-energy chi increases, the states in the PR ensemble closest to the coherent-state ensemble become increasingly squeezed. Nevertheless, there are values of chi for which states with well-defined coherent amplitudes are PR, even though the atom laser is not coherent (in the sense of having a Bose-degenerate output). We discuss the physical significance of this anomaly in terms of conditional coherence (and hence conditional Bose degeneracy).
Resumo:
In this paper we propose a second linearly scalable method for solving large master equations arising in the context of gas-phase reactive systems. The new method is based on the well-known shift-invert Lanczos iteration using the GMRES iteration preconditioned using the diffusion approximation to the master equation to provide the inverse of the master equation matrix. In this way we avoid the cubic scaling of traditional master equation solution methods while maintaining the speed of a partial spectral decomposition. The method is tested using a master equation modeling the formation of propargyl from the reaction of singlet methylene with acetylene, proceeding through long-lived isomerizing intermediates. (C) 2003 American Institute of Physics.
Resumo:
In this paper we propose a novel fast and linearly scalable method for solving master equations arising in the context of gas-phase reactive systems, based on an existent stiff ordinary differential equation integrator. The required solution of a linear system involving the Jacobian matrix is achieved using the GMRES iteration preconditioned using the diffusion approximation to the master equation. In this way we avoid the cubic scaling of traditional master equation solution methods and maintain the low temperature robustness of numerical integration. The method is tested using a master equation modelling the formation of propargyl from the reaction of singlet methylene with acetylene, proceeding through long lived isomerizing intermediates. (C) 2003 American Institute of Physics.
Resumo:
We have recently developed a scaleable Artificial Boundary Inhomogeneity (ABI) method [Chem. Phys. Lett.366, 390–397 (2002)] based on the utilization of the Lanczos algorithm, and in this work explore an alternative iterative implementation based on the Chebyshev algorithm. Detailed comparisons between the two iterative methods have been made in terms of efficiency as well as convergence behavior. The Lanczos subspace ABI method was also further improved by the use of a simpler three-term backward recursion algorithm to solve the subspace linear system. The two different iterative methods are tested on the model collinear H+H2 reactive state-to-state scattering.
Resumo:
A numerical comparison is performed between three methods of third order with the same structure, namely BSC, Halley’s and Euler–Chebyshev’s methods. As the behavior of an iterative method applied to a nonlinear equation can be highly sensitive to the starting points, the numerical comparison is carried out, allowing for complex starting points and for complex roots, on the basins of attraction in the complex plane. Several examples of algebraic and transcendental equations are presented.
Resumo:
The performance of an amperometric biosensor constructed by associating tyrosinase (Tyr) enzyme with the advantages of a 3D gold nanoelectrode ensemble (GNEE) is evaluated in a flow-injection analysis (FIA) system for the analysis of l-dopa. GNEEs were fabricated by electroless deposition of the metal within the pores of polycarbonate track-etched membranes. A simple solvent etching procedure based on the solubility of polycarbonate membranes is adopted for the fabrication of the 3D GNEE. Afterward, enzyme was immobilized onto preformed self-assembled monolayers of cysteamine on the 3D GNEEs (GNEE-Tyr) via cross-linking with glutaraldehyde. The experimental conditions of the FIA system, such as the detection potential (−0.200 V vs. Ag/AgCl) and flow rates (1.0 mL min−1) were optimized. Analytical responses for l-dopa were obtained in a wide concentration range between 1 × 10−8 mol L−1 and 1 × 10−2 mol L−1. The limit of quantification was found to be 1 × 10−8 mol L−1 with a resultant % RSD of 7.23% (n = 5). The limit of detection was found to be 1 × 10−9 mol L−1 (S/N = 3). The common interfering compounds, namely glucose (10 mmol L−1), ascorbic acid (10 mmol L−1), and urea (10 mmol L−1), were studied. The recovery of l-dopa (1 × 10−7 mol L−1) from spiked urine samples was found to be 96%. Therefore, the developed method is adequate to be applied in the clinical analysis.
Resumo:
In distributed video coding, motion estimation is typically performed at the decoder to generate the side information, increasing the decoder complexity while providing low complexity encoding in comparison with predictive video coding. Motion estimation can be performed once to create the side information or several times to refine the side information quality along the decoding process. In this paper, motion estimation is performed at the decoder side to generate multiple side information hypotheses which are adaptively and dynamically combined, whenever additional decoded information is available. The proposed iterative side information creation algorithm is inspired in video denoising filters and requires some statistics of the virtual channel between each side information hypothesis and the original data. With the proposed denoising algorithm for side information creation, a RD performance gain up to 1.2 dB is obtained for the same bitrate.