Waveform Design for 5G and Beyond

5G is envisioned to improve major key performance indicators (KPIs), such as peak data rate, spectral efficiency, power consumption, complexity, connection density, latency, and mobility. This chapter aims to provide a complete picture of the ongoing 5G waveform discussions and overviews the major candidates. It provides a brief description of the waveform and reveals the 5G use cases and waveform design requirements. The chapter presents the main features of cyclic prefix-orthogonal frequency-division multiplexing (CP-OFDM) that is deployed in 4G LTE systems. CP-OFDM is the baseline of the 5G waveform discussions since the performance of a new waveform is usually compared with it. The chapter examines the essential characteristics of the major waveform candidates along with the related advantages and disadvantages. It summarizes and compares the key features of different waveforms.Comment: 22 pages, 21 figures, 2 tables; accepted version (The URL for the final version: https://onlinelibrary.wiley.com/doi/abs/10.1002/9781119333142.ch2

Large-scale wave-front reconstruction for adaptive optics systems by use of a recursive filtering algorithm

We propose a new recursive filtering algorithm for wave-front reconstruction in a large-scale adaptive optics system. An embedding step is used in this recursive filtering algorithm to permit fast methods to be used for wave-front reconstruction on an annular aperture. This embedding step can be used alone with a direct residual error updating procedure or used with the preconditioned conjugate-gradient method as a preconditioning step. We derive the Hudgin and Fried filters for spectral-domain filtering, using the eigenvalue decomposition method. Using Monte Carlo simulations, we compare the performance of discrete Fourier transform domain filtering, discrete cosine transform domain filtering, multigrid, and alternative-direction-implicit methods in the embedding step of the recursive filtering algorithm. We also simulate the performance of this recursive filtering in a closed-loop adaptive optics system

Blind deconvolution of medical ultrasound images: parametric inverse filtering approach

©2007 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or distribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.DOI: 10.1109/TIP.2007.910179The problem of reconstruction of ultrasound images by means of blind deconvolution has long been recognized as one of the central problems in medical ultrasound imaging. In this paper, this problem is addressed via proposing a blind deconvolution method which is innovative in several ways. In particular, the method is based on parametric inverse filtering, whose parameters are optimized using two-stage processing. At the first stage, some partial information on the point spread function is recovered. Subsequently, this information is used to explicitly constrain the spectral shape of the inverse filter. From this perspective, the proposed methodology can be viewed as a ldquohybridizationrdquo of two standard strategies in blind deconvolution, which are based on either concurrent or successive estimation of the point spread function and the image of interest. Moreover, evidence is provided that the ldquohybridrdquo approach can outperform the standard ones in a number of important practical cases. Additionally, the present study introduces a different approach to parameterizing the inverse filter. Specifically, we propose to model the inverse transfer function as a member of a principal shift-invariant subspace. It is shown that such a parameterization results in considerably more stable reconstructions as compared to standard parameterization methods. Finally, it is shown how the inverse filters designed in this way can be used to deconvolve the images in a nonblind manner so as to further improve their quality. The usefulness and practicability of all the introduced innovations are proven in a series of both in silico and in vivo experiments. Finally, it is shown that the proposed deconvolution algorithms are capable of improving the resolution of ultrasound images by factors of 2.24 or 6.52 (as judged by the autocorrelation criterion) depending on the type of regularization method used

Parallel eigensolvers in plane-wave Density Functional Theory

We consider the problem of parallelizing electronic structure computations in plane-wave Density Functional Theory. Because of the limited scalability of Fourier transforms, parallelism has to be found at the eigensolver level. We show how a recently proposed algorithm based on Chebyshev polynomials can scale into the tens of thousands of processors, outperforming block conjugate gradient algorithms for large computations

Application of the Trend Filtering Algorithm on the MACHO Database

Due to the strong effect of systematics/trends in variable star observations, we employ the Trend Filtering Algorithm (TFA) on a subset of the MACHO database and search for variable stars. TFA has been applied successfully in planetary transit searches, where weak, short-lasting periodic dimmings are sought in the presence of noise and various systematics (due to, e.g., imperfect flat fielding, crowding, etc). These latter effects introduce colored noise in the photometric time series that can lead to a complete miss of the signal. By using a large number of available photometric time series of a given field, TFA utilizes the fact that the same types of systematics appear in several/many time series of the same field. As a result, we fit each target time series by a (least-square-sense) optimum linear combination of templates and frequency-analyze the residuals. Once a signal is found, we reconstruct the signal by employing the full model, including the signal, systematics and noise. We apply TFA on the brightest ~5300 objects from subsets of each of the MACHO Large Magellanic Cloud fields #1 and #79. We find that the Fourier frequency analysis performed on the original data detect some 60% of the objects as trend-dominated. This figure decreases essentially to zero after using TFA. Altogether, We detect 387 variables in the two fields, 183 of which would have remained undetected without using TFA. Where possible, we give preliminary classification of the variables found.Comment: 12 pages, 15 figures, 3 tables with online material; to appear in Astronomy and Astrophysic