3,644 research outputs found

    A New SLNR-based Linear Precoding for Downlink Multi-User Multi-Stream MIMO Systems

    Full text link
    Signal-to-leakage-and-noise ratio (SLNR) is a promising criterion for linear precoder design in multi-user (MU) multiple-input multiple-output (MIMO) systems. It decouples the precoder design problem and makes closed-form solution available. In this letter, we present a new linear precoding scheme by slightly relaxing the SLNR maximization for MU-MIMO systems with multiple data streams per user. The precoding matrices are obtained by a general form of simultaneous diagonalization of two Hermitian matrices. The new scheme reduces the gap between the per-stream effective channel gains, an inherent limitation in the original SLNR precoding scheme. Simulation results demonstrate that the proposed precoding achieves considerable gains in error performance over the original one for multi-stream transmission while maintaining almost the same achievable sum-rate.Comment: 8 pages, 1 figur

    Location-Aided Fast Distributed Consensus in Wireless Networks

    Full text link
    Existing works on distributed consensus explore linear iterations based on reversible Markov chains, which contribute to the slow convergence of the algorithms. It has been observed that by overcoming the diffusive behavior of reversible chains, certain nonreversible chains lifted from reversible ones mix substantially faster than the original chains. In this paper, we investigate the idea of accelerating distributed consensus via lifting Markov chains, and propose a class of Location-Aided Distributed Averaging (LADA) algorithms for wireless networks, where nodes' coarse location information is used to construct nonreversible chains that facilitate distributed computing and cooperative processing. First, two general pseudo-algorithms are presented to illustrate the notion of distributed averaging through chain-lifting. These pseudo-algorithms are then respectively instantiated through one LADA algorithm on grid networks, and one on general wireless networks. For a k×kk\times k grid network, the proposed LADA algorithm achieves an ϵ\epsilon-averaging time of O(klog(ϵ1))O(k\log(\epsilon^{-1})). Based on this algorithm, in a wireless network with transmission range rr, an ϵ\epsilon-averaging time of O(r1log(ϵ1))O(r^{-1}\log(\epsilon^{-1})) can be attained through a centralized algorithm. Subsequently, we present a fully-distributed LADA algorithm for wireless networks, which utilizes only the direction information of neighbors to construct nonreversible chains. It is shown that this distributed LADA algorithm achieves the same scaling law in averaging time as the centralized scheme. Finally, we propose a cluster-based LADA (C-LADA) algorithm, which, requiring no central coordination, provides the additional benefit of reduced message complexity compared with the distributed LADA algorithm.Comment: 44 pages, 14 figures. Submitted to IEEE Transactions on Information Theor

    A glimpse of Cre-mediated controversies in epicardial signalling

    Get PDF

    Modeling community succession and assembly: A novel method for network evolution

    Get PDF
    The process of modeling community succession and assembly is in some sense a method for network evolution, as done by Barabasi and Albert (1999). It is also one of the methods to create a sample networkfrom the statistic network I proposed earlier. I think that the mechanism of network evolution supposed by Barabasi and Albert is most likely applicable to the natural phenomena with emergency property. For natural phenomena without emergency property, the present study indicated that a scale-free network may be produced through a new mechanism, i.e., whether the connection of a taxon x occurs, dependent on the type and property of taxon y (in particular, the degree of its direct correlation with x) to be connected but not necessarily the existing number of connections of taxon y, as proposed in present study

    Frequency and load mode dependence of Vibrothermography

    Get PDF
    Vibrothermography is a method for finding cracks based on the heat generation due to vibration-induced rubbing of the crack surfaces. This technique has shown substantial promise for industrial use finding flaws in gas turbine parts, but the underlying physics remains unclear. Two long standing questions are the dependence of crack heating on excitation frequency, and the dependence of crack heating on loading mode (normal vs shear). With our broadband excitation system, we are able to excite the specimen at different resonances, and correlate the heating with dynamic vibrational stress and frequency of vibration. By exciting the specimen in different modes that load a particular crack either in pure normal stress or pure shear stress, we can measure how crack heating depends on loading mode. Our data shows that similar amount of heating occurs due to normal and shear stresses. In addition, when we fit a simple power law to the heating versus dynamic stress, we found that characteristics of different types of loading seem to be quite similar. A more general physical model is then proposed, which incorporates the dependence of vibrational frequency and dynamic loading types
    corecore