Design of near-perfect-reconstructed transmultiplexer using different modulation techniques: A comparative study

AbstractIn this paper, an efficient iterative method for design of near-perfect reconstructed transmultiplexer (NPR TMUX) is proposed for the prescribed roll-off factor (RF) and stop band attenuation (As). In this method, windowing technique has been used for the design of prototype filter, and different modulation techniques have been exploited for designing multi-channel transmultiplexer (TMUX). In this method, inter-channel interference (ICI) is iteratively minimized so that it approximately reduces to ideal value zero. Design example is given to illustrate the superiority of the proposed method over earlier reported work. A comparative study of the performance of different modulation techniques for designing TMUX is also presented

An Iterative Design with Variable Step Prototype Filter for Cosine Modulated Filter Bank

A systematic and self controlled prototype filter design approach for multichannel Cosine Modulated Near Perfect Reconstruction (NPR) filter bank is proposed in this paper. The primary goal is to design a prototype filter with enhanced performance i.e., minimum amplitude distortion and aliasing error. This algorithm approximates 3dB cutoff frequency very close to π/2M. This is achieved by selecting suitable step size which is a function of transition width. If the selection of step size is too fine, the objective function oscillates. Whereas, if step size is coarse, 3dB cutoff frequency will not be close to π/2M. This will degrade the overall performance of the prototype filter. Thus by choosing the step size as a function of transition width and varying the step size from coarser to finer level, the minimum amplitude distortion and aliasing error can be definitely achieved. The proposed filter is designed using two input parameters: number of subbands M and attenuation A and all other system parameters are derived from it to avoid heuristic inputs. Simulation results indicate better performance with reference to algorithms existing in literature. In addition, the design approach is systematic and self controlled

A Generalized Window Approach for Designing Transmultiplexers

This paper proposes a computational, very efficient, approach for designing a novel family of M-channel maximally decimated nearly perfect-reconstruction cosine-modulated transmultiplexers. This approach is referred to as the generalized windowing method for transmultiplexers because after knowing the transmission channel a proper weighted sum of the inter-channel and inter-symbol interferences can be properly taken into account in the optimization of the window function, unlike in other existing windowing techniques. The proposed approach has also the following two advantages. First, independent of the number of subchannels and the common order of the subchannel filters, the number of unknowns is only four. Second, the overall optimization procedure is made considerably fast by estimating the above-mentioned sum in terms of two novel measures, namely, the signal to inter-symbol and the signal to inter-channel interferences, which are very easy to evaluate. Furthermore, when the transmission channel is not considered in the design, a table is provided, which contains the parameters for designing the prototype filter directly by using the windowing method without any time-consuming optimization. When comparing the resulting transmultiplexers with the corresponding perfect-reconstruction designs (the same number of subchannels and same prototype filter order), the levels of interferences are practically the same. However, when the system is affected by a strong narrowband interference, the proposed transmultiplexers outperform their PR counterparts. Design examples are included illustrating the efficiency of the proposed design approach over other existing techniques based on the use of the windowing method

(SI10-068) Performance Analysis of Cosine Window Function

This paper reviews the mathematical functions called the window functions which are employed in the Finite Impulse Response (FIR) filter design applications as well as spectral analysis for the detection of weak signals. The characteristic properties of the window functions are analyzed and parameters are compared among the known conventional cosine window (CW) functions (Rectangular, Hamming, Hanning, and Blackman) and the variable Kaiser window function. The window function expressed in the time domain can be transformed into the frequency domain by taking the Discrete Fourier Transform (DFT) of the time domain window function. The frequency response of the window function so obtained has main lobe, side lobes, and roll-off rate of side lobes. The main lobe width (MLW) expressed in 3dB bandwidth (BW), highest side lobe level (HSLL), and side lobe roll-off rate (SLROR) of the conventional window function and variable Kaiser window is then evaluated from the frequency response and compared to find out the appropriate window for employed applications

On the application of under-decimated filter banks

Maximally decimated filter banks have been extensively studied in the past. A filter bank is said to be under-decimated if the number of channels is more than the decimation ratio in the subbands. A maximally decimated filter bank is well known for its application in subband coding. Another application of maximally decimated filter banks is in block filtering. Convolution through block filtering has the advantages that parallelism is increased and data are processed at a lower rate. However, the computational complexity is comparable to that of direct convolution. More recently, another type of filter bank convolver has been developed. In this scheme, the convolution is performed in the subbands. Quantization and bit allocation of subband signals are based on signal variance, as in subband coding. Consequently, for a fixed rate, the result of convolution is more accurate than is direct convolution. This type of filter bank convolver also enjoys the advantages of block filtering, parallelism, and a lower working rate. Nevertheless, like block filtering, there is no computational saving. In this article, under-decimated systems are introduced to solve the problem. The new system is decimated only by half the number of channels. Two types of filter banks can be used in the under-decimated system: the discrete Fourier transform (DFT) filter banks and the cosine modulated filter banks. They are well known for their low complexity. In both cases, the system is approximately alias free, and the overall response is equivalent to a tunable multilevel filter. Properties of the DFT filter banks and the cosine modulated filter banks can be exploited to simultaneously achieve parallelism, computational saving, and a lower working rate. Furthermore, for both systems, the implementation cost of the analysis or synthesis bank is comparable to that of one prototype filter plus some low-complexity modulation matrices. The individual analysis and synthesis filters have complex coefficients in the DFT filter banks but have real coefficients in the cosine modulated filter banks

On the design of nearly-PR and PR FIR cosine modulated filter banks having approximate cosine-rolloff transition band

This paper proposes an efficient method for designing nearly perfect reconstruction (NPR) and perfect reconstruction (PR) cosine modulated filter banks (CMFBs) with prototype filters having an approximate cosine-rolloff (CR) transition band. It is shown that the flatness condition required for an NPR CMFB can be automatically satisfied by using a prototype filter with a CR transition band. The design problem is then formulated as a convex minimax optimization problem, and it can be solved by second-order cone programming (SOCP). By using the NPR CMFB so obtained as an initial guess to nonlinear optimizers such as Fmincon in Matlab, high-quality PR CMFBs can be obtained. The advantages of the proposed method are that it does not require a user-supplied initial guess of the prototype filter and bumps in the passband of the analysis filters can be effectively suppressed. © 2008 IEEE.published_or_final_versio

Channelization for Multi-Standard Software-Defined Radio Base Stations

As the number of radio standards increase and spectrum resources come under more pressure, it becomes ever less efficient to reserve bands of spectrum for exclusive use by a single radio standard. Therefore, this work focuses on channelization structures compatible with spectrum sharing among multiple wireless standards and dynamic spectrum allocation in particular. A channelizer extracts independent communication channels from a wideband signal, and is one of the most computationally expensive components in a communications receiver. This work specifically focuses on non-uniform channelizers suitable for multi-standard Software-Defined Radio (SDR) base stations in general and public mobile radio base stations in particular. A comprehensive evaluation of non-uniform channelizers (existing and developed during the course of this work) shows that parallel and recombined variants of the Generalised Discrete Fourier Transform Modulated Filter Bank (GDFT-FB) represent the best trade-off between computational load and flexibility for dynamic spectrum allocation. Nevertheless, for base station applications (with many channels) very high filter orders may be required, making the channelizers difficult to physically implement. To mitigate this problem, multi-stage filtering techniques are applied to the GDFT-FB. It is shown that these multi-stage designs can significantly reduce the filter orders and number of operations required by the GDFT-FB. An alternative approach, applying frequency response masking techniques to the GDFT-FB prototype filter design, leads to even bigger reductions in the number of coefficients, but computational load is only reduced for oversampled configurations and then not as much as for the multi-stage designs. Both techniques render the implementation of GDFT-FB based non-uniform channelizers more practical. Finally, channelization solutions for some real-world spectrum sharing use cases are developed before some final physical implementation issues are considered

Waveform Design for 5G and beyond Systems

5G traffic has very diverse requirements with respect to data rate, delay, and reliability. The concept of using multiple OFDM numerologies adopted in the 5G NR standard will likely meet these multiple requirements to some extent. However, the traffic is radically accruing different characteristics and requirements when compared with the initial stage of 5G, which focused mainly on high-speed multimedia data applications. For instance, applications such as vehicular communications and robotics control require a highly reliable and ultra-low delay. In addition, various emerging M2M applications have sparse traffic with a small amount of data to be delivered. The state-of-the-art OFDM technique has some limitations when addressing the aforementioned requirements at the same time. Meanwhile, numerous waveform alternatives, such as FBMC, GFDM, and UFMC, have been explored. They also have their own pros and cons due to their intrinsic waveform properties. Hence, it is the opportune moment to come up with modification/variations/combinations to the aforementioned techniques or a new waveform design for 5G systems and beyond. The aim of this Special Issue is to provide the latest research and advances in the field of waveform design for 5G systems and beyond