This letter presents a new data selective adaptive filtering algorithm, the set-membership affine projection (SM-AP) algorithm. The algorithm generalizes the idea of the set-membership NLMS (SM-NLMS) algorithm to include constraint sets constructed from the past input and desired signal pairs. The resulting algorithm can be seen as a set-membership version of the affine-projection (AP) algorithm with an optimized step size. Also, the SM-AP algorithm does not trade convergence speed with misadjustment and computational complexity as most adaptive filtering algorithms. Simulations show the good performance of the algorithm, especially for colored input signals, in terms of convergence, final misadjustment, and reduced computational complexity.

This new, fully-revised edition covers all the major topics of digital signal processing (DSP) design and analysis in a single, all-inclusive volume, interweaving theory with real-world examples and design trade-offs. Building on the success of the original, this edition includes new material on random signal processing, a new chapter on spectral estimation, greatly expanded coverage of filter banks and wavelets, and new material on the solution of difference equations. Additional steps in mathematical derivations make them easier to follow, and an important new feature is the do-it-yourself section at the end of each chapter, where readers get hands-on experience of solving practical signal processing problems in a range of MATLAB experiments. With 120 worked examples, 20 case studies, and almost 400 homework exercises, the book is essential reading for anyone taking DSP courses. Its unique blend of theory and real-world practical examples also makes it an ideal reference for practitioners.

The increasing scarcity in the available spectrum for wireless communication is one of the current bottlenecks impairing further deployment of services and coverage. The proper exploitation of white spaces in the radio spectrum requires fast, robust, and accurate methods for their detection. This paper proposes a new strategy to detect adaptively white spaces in the radio spectrum. Such strategy works in cognitive radio (CR) networks whose nodes perform spectrum sensing based on energy detection in a cooperative way or not. The main novelty of the proposal is the use of a cost-function that depends upon a single parameter which, by itself, contains the aggregate information about the presence or absence of primary users. The detection of white spaces based on this parameter is able to improve significantly the deflection coefficient associated with the detector, as compared to other state-of-the-art algorithms. In fact, simulation results show that the proposed algorithm outperforms by far other competing algorithms. For example, our proposal can yield a probability of miss-detection 20 times smaller than that of an optimal soft-combiner solution in a cooperative setup with a predefined probability of false alarm of 0.1.