2,276 research outputs found

    Efficient implementation of filter bank multicarrier systems using circular fast convolution

    Get PDF
    In this paper, filter bank-based multicarrier systems using a fast convolution approach are investigated. We show that exploiting offset quadrature amplitude modulation enables us to perform FFT/IFFT-based convolution without overlapped processing, and the circular distortion can be discarded as a part of orthogonal interference terms. This property has two advantages. First, it leads to spectral efficiency enhancement in the system by removing the prototype filter transients. Second, the complexity of the system is significantly reduced as the result of using efficient FFT algorithms for convolution. The new scheme is compared with the conventional waveforms in terms of out-of-band radiation, orthogonality, spectral efficiency, and complexity. The performance of the receiver and the equalization methods are investigated and compared with other waveforms through simulations. Moreover, based on the time variant nature of the filter response of the proposed scheme, a pilot-based channel estimation technique with controlled transmit power is developed and analyzed through lower-bound derivations. The proposed transceiver is shown to be a competitive solution for future wireless networks

    Generalized Fast-Convolution-based Filtered-OFDM: Techniques and Application to 5G New Radio

    Get PDF
    This paper proposes a generalized model and methods for fast-convolution (FC)-based waveform generation and processing with specific applications to fifth generation new radio (5G-NR). Following the progress of 5G-NR standardization in 3rd generation partnership project (3GPP), the main focus is on subband-filtered cyclic prefix (CP) orthogonal frequency-division multiplexing (OFDM) processing with specific emphasis on spectrally well localized transmitter processing. Subband filtering is able to suppress the interference leakage between adjacent subbands, thus supporting different numerologies for so-called bandwidth parts as well as asynchronous multiple access. The proposed generalized FC scheme effectively combines overlapped block processing with time- and frequency-domain windowing to provide highly selective subband filtering with very low intrinsic interference level. Jointly optimized multi-window designs with different allocation sizes and design parameters are compared in terms of interference levels and implementation complexity. The proposed methods are shown to clearly outperform the existing state-of-the-art windowing and filtering-based methods.Comment: To appear in IEEE Transactions on Signal Processin

    Efficient Fast-Convolution-Based Waveform Processing for 5G Physical Layer

    Get PDF
    This paper investigates the application of fast-convolution (FC) filtering schemes for flexible and effective waveform generation and processing in the fifth generation (5G) systems. FC-based filtering is presented as a generic multimode waveform processing engine while, following the progress of 5G new radio standardization in the Third-Generation Partnership Project, the main focus is on efficient generation and processing of subband-filtered cyclic prefix orthogonal frequency-division multiplexing (CP-OFDM) signals. First, a matrix model for analyzing FC filter processing responses is presented and used for designing optimized multiplexing of filtered groups of CP-OFDM physical resource blocks (PRBs) in a spectrally well-localized manner, i.e., with narrow guardbands. Subband filtering is able to suppress interference leakage between adjacent subbands, thus supporting independent waveform parametrization and different numerologies for different groups of PRBs, as well as asynchronous multiuser operation in uplink. These are central ingredients in the 5G waveform developments, particularly at sub-6-GHz bands. The FC filter optimization criterion is passband error vector magnitude minimization subject to a given subband band-limitation constraint. Optimized designs with different guardband widths, PRB group sizes, and essential design parameters are compared in terms of interference levels and implementation complexity. Finally, extensive coded 5G radio link simulation results are presented to compare the proposed approach with other subband-filtered CP-OFDM schemes and time-domain windowing methods, considering cases with different numerologies or asynchronous transmissions in adjacent subbands. Also the feasibility of using independent transmitter and receiver processing for CP-OFDM spectrum control is demonstrated

    Pipelined digital SAR azimuth correlator using hybrid FFT-transversal filter

    Get PDF
    A synthetic aperture radar system (SAR) having a range correlator is provided with a hybrid azimuth correlator which utilizes a block-pipe-lined fast Fourier transform (FFT). The correlator has a predetermined FFT transform size with delay elements for delaying SAR range correlated data so as to embed in the Fourier transform operation a corner-turning function as the range correlated SAR data is converted from the time domain to a frequency domain. The azimuth correlator is comprised of a transversal filter to receive the SAR data in the frequency domain, a generator for range migration compensation and azimuth reference functions, and an azimuth reference multiplier for correlation of the SAR data. Following the transversal filter is a block-pipelined inverse FFT used to restore azimuth correlated data in the frequency domain to the time domain for imaging

    study of adaptive signal processing

    Get PDF
    An adaptive filter is a digital filter that can adjust its coefficients to give the best match t An adaptive filter is a digital filter that can adjust its coefficients to give the best match to a given desired signal. When an adaptive filter operates in a changeable environment the filter coefficients can adapt in response to changes in the applied input signals. Adaptive filters depend on recursive algorithms to update their coefficients and train them to near the optimum solution. An everyday example of adaptive filters is in the telephone system where, impedance mismatches causing echoes of a signal are a significant source of annoyance to the users of the system. The adaptive signal process is here to estimate and generate the echo path and compensate for it. To do this the echo path is viewed as an unknown system with some impulse response and the adaptive filter must mimic this response. Adaptive Filters are generally implemented in the time domain which works well in most scenarios however in many applications the impulse response become long, and increasing the complexity of the filter beyond a level where it can no longer be implemented efficiently in the time domain. An example of acoustic echo cancellation applications is in hands free telephony system. However there exists an alternative solution and that is to implement the filters in the frequency domain. The Discrete Fourier Transform or Fast Fourier Transform (FFT) allows the conversion of signals from the time domain to the frequency domain in an efficient manner. Despite the efficiency of the FFT the overhead involved in converting the signals to the frequency domain does place a restriction on the use of the algorithm. When the impulse response of the unknown system and hence the impulse response of the filter is long enough however this is not an issue since the computational cost of the conversion is much less than that of the time domain algorithm. The actual filtering of the signals requires little computational cost in the frequency domain. Investigation of the so-called crossover point, the point where the frequency domain implementation becomes more efficient than the time domain implementation is important to establish the point where frequency domain implementation becomes practica

    Toward Early-Warning Detection of Gravitational Waves from Compact Binary Coalescence

    Get PDF
    Rapid detection of compact binary coalescence (CBC) with a network of advanced gravitational-wave detectors will offer a unique opportunity for multi-messenger astronomy. Prompt detection alerts for the astronomical community might make it possible to observe the onset of electromagnetic emission from (CBC). We demonstrate a computationally practical filtering strategy that could produce early-warning triggers before gravitational radiation from the final merger has arrived at the detectors.Comment: 16 pages, 7 figures, published in ApJ. Reformatted preprint with emulateap

    DSPSR: Digital Signal Processing Software for Pulsar Astronomy

    Full text link
    DSPSR is a high-performance, open-source, object-oriented, digital signal processing software library and application suite for use in radio pulsar astronomy. Written primarily in C++, the library implements an extensive range of modular algorithms that can optionally exploit both multiple-core processors and general-purpose graphics processing units. After over a decade of research and development, DSPSR is now stable and in widespread use in the community. This paper presents a detailed description of its functionality, justification of major design decisions, analysis of phase-coherent dispersion removal algorithms, and demonstration of performance on some contemporary microprocessor architectures.Comment: 15 pages, 10 figures, to be published in PAS

    Enabling pulsar and fast transient searches using coherent dedispersion

    Full text link
    We present an implementation of the coherent dedispersion algorithm capable of dedispersing high-time-resolution radio observations to many different dispersion measures (DMs). This approach allows the removal of the dispersive effects of the interstellar medium and enables searches for pulsed emission from pulsars and other millisecond-duration transients at low observing frequencies and/or high DMs where time broadening of the signal due to dispersive smearing would otherwise severely reduce the sensitivity. The implementation, called 'cdmt', for Coherent Dispersion Measure Trials, exploits the parallel processing capability of general-purpose graphics processing units to accelerate the computations. We describe the coherent dedispersion algorithm and detail how cdmt implements the algorithm to efficiently compute many coherent DM trials. We present the concept of a semi-coherent dedispersion search, where coherently dedispersed trials at coarsely separated DMs are subsequently incoherently dedispersed at finer steps in DM. The software is used in an ongoing LOFAR pilot survey to test the feasibility of performing semi-coherent dedispersion searches for millisecond pulsars at 135MHz. This pilot survey has led to the discovery of a radio millisecond pulsar -- the first at these low frequencies. This is the first time that such a broad and comprehensive search in DM-space has been done using coherent dedispersion, and we argue that future low-frequency pulsar searches using this approach are both scientifically compelling and feasible. Finally, we compare the performance of cdmt with other available alternatives.Comment: 8 pages, 7 figures, submitted to Astronomy and Computin
    corecore