121 research outputs found

    Non-Uniform Channelization Methods for Next Generation SDR PMR Base Stations

    Get PDF
    Channelization in multi-standard Software-Defined Radio base stations presents a significant challenge. In this paper, two different channelization structures designed for a multi-standard SDR base station are studied. As a basis for comparing their computational efficiency and reconfigurability, both are applied to a specific case study of a TETRA and TEDS standards base station. Uniform narrow band spectrum division followed by channel recombination demonstrates greater flexibility than a non-uniform parallel spectrum division alternative. However, computational advantages between both structures depend on the channel allocation patterns considered

    Channelization for Multi-Standard Software-Defined Radio Base Stations

    Get PDF
    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

    Practical Non-Uniform Channelization for Multistandard Base Stations

    Get PDF
    A Multistandard software-defined radio base station must perform non-uniform channelization of multiplexed frequency bands. Non-uniform channelization accounts for a significant portion of the digital signal processing workload in the base station receiver and can be difficult to realize in a physical implementation. In non-uniform channelization methods based on generalized DFT filter banks, large prototype filter orders are a significant issue for implementation. In this paper, a multistage filter design is applied to two different non-uniform generalized DFT-based channelizers in order to reduce their filter orders. To evaluate the approach, a TETRA and TEDS base station is used. Experimental results show that the new multistage design reduces both the number of coefficients and operations and leads to a more feasible design and practical physical implementation

    Practical Non-Uniform Channelization for Multistandard Base Stations

    Get PDF
    A Multistandard software-defined radio base station must perform non-uniform channelization of multiplexed frequency bands. Non-uniform channelization accounts for a significant portion of the digital signal processing workload in the base station receiver and can be difficult to realize in a physical implementation. In non-uniform channelization methods based on generalized DFT filter banks, large prototype filter orders are a significant issue for implementation. In this paper, a multistage filter design is applied to two different non-uniform generalized DFT-based channelizers in order to reduce their filter orders. To evaluate the approach, a TETRA and TEDS base station is used. Experimental results show that the new multistage design reduces both the number of coefficients and operations and leads to a more feasible design and practical physical implementation

    Global optimum design of uniform FIR filter bank with magnitude constraints

    Get PDF
    The optimum design of a uniform finite impulse response filter bank can be formulated as a nonlinear semi-infinite optimization problem. However, this optimization problem is nonconvex with infinitely many inequality constraints. In this paper, we propose a new hybrid approach for solving this highly challenging nonlinear, nonconvex semi-infinite optimization problem. In this approach, a gradient-based method is used in conjunction with a filled function method to determine a global minimum of the problem. This new hybrid approach finds an optimal result independent of the initial guess of the solution. The method is applied to some existing examples. The results obtained are superior to those obtained by other existing methods. © 2008 IEEE

    A New Hybrid Descent Method with Application to the Optimal Design of Finite Precision FIR Filters

    Get PDF
    In this paper, the problem of the optimal design of discrete coefficient FIR filters is considered. A novelhybrid descent method, consisting of a simulated annealing algorithm and a gradient-based method, isproposed. The simulated annealing algorithm operates on the space of orthogonal matrices and is used tolocate descent points for previously converged local minima. The gradient-based method is derived fromconverting the discrete problem to a continuous problem via the Stiefel manifold, where convergence canbe guaranteed. To demonstrate the effectiveness of the proposed hybrid descent method, several numericalexamples show that better discrete filter designs can be sought via this hybrid descent method

    Two-channel linear phase FIR QMF bank minimax design via global nonconvex optimization programming

    Get PDF
    In this correspondence, a two-channel linear phase finite impulse response (FIR) quadrature mirror filter (QMF) bank minimax design problem is formulated as a nonconvex optimization problem so that a weighted sum of the maximum amplitude distortion of the filter bank, the maximum passband ripple magnitude and the maximum stopband ripple magnitude of the prototype filter is minimized subject to specifications on these performances. A modified filled function method is proposed for finding the global minimum of the nonconvex optimization problem. Computer numerical simulations show that our proposed design method is efficient and effective

    Broadband adaptive beamforming with low complexity and frequency invariant response

    No full text
    This thesis proposes different methods to reduce the computational complexity as well as increasing the adaptation rate of adaptive broadband beamformers. This is performed exemplarily for the generalised sidelobe canceller (GSC) structure. The GSC is an alternative implementation of the linearly constrained minimum variance beamformer, which can utilise well-known adaptive filtering algorithms, such as the least mean square (LMS) or the recursive least squares (RLS) to perform unconstrained adaptive optimisation.A direct DFT implementation, by which broadband signals are decomposed into frequency bins and processed by independent narrowband beamforming algorithms, is thought to be computationally optimum. However, this setup fail to converge to the time domain minimum mean square error (MMSE) if signal components are not aligned to frequency bins, resulting in a large worst case error. To mitigate this problem of the so-called independent frequency bin (IFB) processor, overlap-save based GSC beamforming structures have been explored. This system address the minimisation of the time domain MMSE, with a significant reduction in computational complexity when compared to time-domain implementations, and show a better convergence behaviour than the IFB beamformer. By studying the effects that the blocking matrix has on the adaptive process for the overlap-save beamformer, several modifications are carried out to enhance both the simplicity of the algorithm as well as its convergence speed. These modifications result in the GSC beamformer utilising a significantly lower computational complexity compare to the time domain approach while offering similar convergence characteristics.In certain applications, especially in the areas of acoustics, there is a need to maintain constant resolution across a wide operating spectrum that may extend across several octaves. To attain constant beamwidth is difficult, particularly if uniformly spaced linear sensor array are employed for beamforming, since spatial resolution is reciprocally proportional to both the array aperture and the frequency. A scaled aperture arrangement is introduced for the subband based GSC beamformer to achieve near uniform resolution across a wide spectrum, whereby an octave-invariant design is achieved. This structure can also be operated in conjunction with adaptive beamforming algorithms. Frequency dependent tapering of the sensor signals is proposed in combination with the overlap-save GSC structure in order to achieve an overall frequency-invariant characteristic. An adaptive version is proposed for frequency-invariant overlap-save GSC beamformer. Broadband adaptive beamforming algorithms based on the family of least mean squares (LMS) algorithms are known to exhibit slow convergence if the input signal is correlated. To improve the convergence of the GSC when based on LMS-type algorithms, we propose the use of a broadband eigenvalue decomposition (BEVD) to decorrelate the input of the adaptive algorithm in the spatial dimension, for which an increase in convergence speed can be demonstrated over other decorrelating measures, such as the Karhunen-Loeve transform. In order to address the remaining temporal correlation after BEVD processing, this approach is combined with subband decomposition through the use of oversampled filter banks. The resulting spatially and temporally decorrelated GSC beamformer provides further enhanced convergence speed over spatial or temporal decorrelation methods on their own
    corecore