13,699 research outputs found

    Efficient DSP and Circuit Architectures for Massive MIMO: State-of-the-Art and Future Directions

    Full text link
    Massive MIMO is a compelling wireless access concept that relies on the use of an excess number of base-station antennas, relative to the number of active terminals. This technology is a main component of 5G New Radio (NR) and addresses all important requirements of future wireless standards: a great capacity increase, the support of many simultaneous users, and improvement in energy efficiency. Massive MIMO requires the simultaneous processing of signals from many antenna chains, and computational operations on large matrices. The complexity of the digital processing has been viewed as a fundamental obstacle to the feasibility of Massive MIMO in the past. Recent advances on system-algorithm-hardware co-design have led to extremely energy-efficient implementations. These exploit opportunities in deeply-scaled silicon technologies and perform partly distributed processing to cope with the bottlenecks encountered in the interconnection of many signals. For example, prototype ASIC implementations have demonstrated zero-forcing precoding in real time at a 55 mW power consumption (20 MHz bandwidth, 128 antennas, multiplexing of 8 terminals). Coarse and even error-prone digital processing in the antenna paths permits a reduction of consumption with a factor of 2 to 5. This article summarizes the fundamental technical contributions to efficient digital signal processing for Massive MIMO. The opportunities and constraints on operating on low-complexity RF and analog hardware chains are clarified. It illustrates how terminals can benefit from improved energy efficiency. The status of technology and real-life prototypes discussed. Open challenges and directions for future research are suggested.Comment: submitted to IEEE transactions on signal processin

    Low latency low power bit flipping algorithms for LDPC decoding

    Get PDF

    Uplink Multiuser MIMO Detection Scheme with Reduced Computational Complexity

    Get PDF
    The wireless communication systems with multiple antennas have recently received significant attention due to their higher capacity and better immunity to fading channels as compared to single antenna systems. A fast antenna selection scheme has been introduced for the uplink multiuser multiple-input multiple-output (MIMO) detection to achieve diversity gains, but the computational complexity of the fast antenna selection scheme in multiuser systems is very high due to repetitive pseudo-inversion computations. In this paper, a new uplink multiuser detection scheme is proposed adopting a switch-and-examine combining (SEC) scheme and the Cholesky decomposition to solve the computational complexity problem. K users are considered that each users is equipped with two transmit antennas for Alamouti space-time block code (STBC) over wireless Rayleigh fading channels. Simulation results show that the computational complexity of the proposed scheme is much lower than the systems with exhaustive and fast antenna selection, while the proposed scheme does not experience the degradations of bit error rate (BER) performances

    Refraction-corrected ray-based inversion for three-dimensional ultrasound tomography of the breast

    Get PDF
    Ultrasound Tomography has seen a revival of interest in the past decade, especially for breast imaging, due to improvements in both ultrasound and computing hardware. In particular, three-dimensional ultrasound tomography, a fully tomographic method in which the medium to be imaged is surrounded by ultrasound transducers, has become feasible. In this paper, a comprehensive derivation and study of a robust framework for large-scale bent-ray ultrasound tomography in 3D for a hemispherical detector array is presented. Two ray-tracing approaches are derived and compared. More significantly, the problem of linking the rays between emitters and receivers, which is challenging in 3D due to the high number of degrees of freedom for the trajectory of rays, is analysed both as a minimisation and as a root-finding problem. The ray-linking problem is parameterised for a convex detection surface and three robust, accurate, and efficient ray-linking algorithms are formulated and demonstrated. To stabilise these methods, novel adaptive-smoothing approaches are proposed that control the conditioning of the update matrices to ensure accurate linking. The nonlinear UST problem of estimating the sound speed was recast as a series of linearised subproblems, each solved using the above algorithms and within a steepest descent scheme. The whole imaging algorithm was demonstrated to be robust and accurate on realistic data simulated using a full-wave acoustic model and an anatomical breast phantom, and incorporating the errors due to time-of-flight picking that would be present with measured data. This method can used to provide a low-artefact, quantitatively accurate, 3D sound speed maps. In addition to being useful in their own right, such 3D sound speed maps can be used to initialise full-wave inversion methods, or as an input to photoacoustic tomography reconstructions

    Adaptive and Iterative Multi-Branch MMSE Decision Feedback Detection Algorithms for MIMO Systems

    Full text link
    In this work, decision feedback (DF) detection algorithms based on multiple processing branches for multi-input multi-output (MIMO) spatial multiplexing systems are proposed. The proposed detector employs multiple cancellation branches with receive filters that are obtained from a common matrix inverse and achieves a performance close to the maximum likelihood detector (MLD). Constrained minimum mean-squared error (MMSE) receive filters designed with constraints on the shape and magnitude of the feedback filters for the multi-branch MMSE DF (MB-MMSE-DF) receivers are presented. An adaptive implementation of the proposed MB-MMSE-DF detector is developed along with a recursive least squares-type algorithm for estimating the parameters of the receive filters when the channel is time-varying. A soft-output version of the MB-MMSE-DF detector is also proposed as a component of an iterative detection and decoding receiver structure. A computational complexity analysis shows that the MB-MMSE-DF detector does not require a significant additional complexity over the conventional MMSE-DF detector, whereas a diversity analysis discusses the diversity order achieved by the MB-MMSE-DF detector. Simulation results show that the MB-MMSE-DF detector achieves a performance superior to existing suboptimal detectors and close to the MLD, while requiring significantly lower complexity.Comment: 10 figures, 3 tables; IEEE Transactions on Wireless Communications, 201

    ELSI: A Unified Software Interface for Kohn-Sham Electronic Structure Solvers

    Full text link
    Solving the electronic structure from a generalized or standard eigenproblem is often the bottleneck in large scale calculations based on Kohn-Sham density-functional theory. This problem must be addressed by essentially all current electronic structure codes, based on similar matrix expressions, and by high-performance computation. We here present a unified software interface, ELSI, to access different strategies that address the Kohn-Sham eigenvalue problem. Currently supported algorithms include the dense generalized eigensolver library ELPA, the orbital minimization method implemented in libOMM, and the pole expansion and selected inversion (PEXSI) approach with lower computational complexity for semilocal density functionals. The ELSI interface aims to simplify the implementation and optimal use of the different strategies, by offering (a) a unified software framework designed for the electronic structure solvers in Kohn-Sham density-functional theory; (b) reasonable default parameters for a chosen solver; (c) automatic conversion between input and internal working matrix formats, and in the future (d) recommendation of the optimal solver depending on the specific problem. Comparative benchmarks are shown for system sizes up to 11,520 atoms (172,800 basis functions) on distributed memory supercomputing architectures.Comment: 55 pages, 14 figures, 2 table

    Reconstruction from Periodic Nonlinearities, With Applications to HDR Imaging

    Full text link
    We consider the problem of reconstructing signals and images from periodic nonlinearities. For such problems, we design a measurement scheme that supports efficient reconstruction; moreover, our method can be adapted to extend to compressive sensing-based signal and image acquisition systems. Our techniques can be potentially useful for reducing the measurement complexity of high dynamic range (HDR) imaging systems, with little loss in reconstruction quality. Several numerical experiments on real data demonstrate the effectiveness of our approach
    corecore