scispace - formally typeset
Topic

Matched filter

About: Matched filter is a(n) research topic. Over the lifetime, 13237 publication(s) have been published within this topic receiving 215837 citation(s).
Papers
More filters

Proceedings ArticleDOI
07 Nov 2004-
TL;DR: To improve radio sensitivity of the sensing function through processing gain, three digital signal processing techniques are investigated: matched filtering, energy detection and cyclostationary feature detection.
Abstract: There are new system implementation challenges involved in the design of cognitive radios, which have both the ability to sense the spectral environment and the flexibility to adapt transmission parameters to maximize system capacity while coexisting with legacy wireless networks. The critical design problem is the need to process multigigahertz wide bandwidth and reliably detect presence of primary users. This places severe requirements on sensitivity, linearity and dynamic range of the circuitry in the RF front-end. To improve radio sensitivity of the sensing function through processing gain we investigated three digital signal processing techniques: matched filtering, energy detection and cyclostationary feature detection. Our analysis shows that cyclostationary feature detection has advantages due to its ability to differentiate modulated signals, interference and noise in low signal to noise ratios. In addition, to further improve the sensing reliability, the advantage of a MAC protocol that exploits cooperation among many cognitive users is investigated.

2,761 citations


Journal ArticleDOI
Abstract: A maximum-likelihood sequence estimator for a digital pulse-amplitude-modulated sequence in the presence of finite intersymbol interference and white Gaussian noise is developed, The structure comprises a sampled linear filter, called a whitened matched filter, and a recursive nonlinear processor, called the Viterbi algorithm. The outputs of the whitened matched filter, sampled once for each input symbol, are shown to form a set of sufficient statistics for estimation of the input sequence, a fact that makes obvious some earlier results on optimum linear processors. The Viterbi algorithm is easier to implement than earlier optimum nonlinear processors and its performance can be straightforwardly and accurately estimated. It is shown that performance (by whatever criterion) is effectively as good as could be attained by any receiver structure and in many cases is as good as if intersymbol interference were absent. Finally, a simplified but effectively optimum algorithm suitable for the most popular partial-response schemes is described.

2,667 citations


Journal ArticleDOI
TL;DR: The results show that the proposed multiuser detectors afford important performance gains over conventional single-user systems, in which the signal constellation carries the entire burden of complexity required to achieve a given performance level.
Abstract: Consider a Gaussian multiple-access channel shared by K users who transmit asynchronously independent data streams by modulating a set of assigned signal waveforms. The uncoded probability of error achievable by optimum multiuser detectors is investigated. It is shown that the K -user maximum-likelihood sequence detector consists of a bank of single-user matched filters followed by a Viterbi algorithm whose complexity per binary decision is O(2^{K}) . The upper bound analysis of this detector follows an approach based on the decomposition of error sequences. The issues of convergence and tightness of the bounds are examined, and it is shown that the minimum multiuser error probability is equivalent in the Iow-noise region to that of a single-user system with reduced power. These results show that the proposed multiuser detectors afford important performance gains over conventional single-user systems, in which the signal constellation carries the entire burden of complexity required to achieve a given performance level.

2,287 citations


Book
01 Nov 1991-
TL;DR: The Radar Equation, The Matched Filter and Pulse Compression, and Other Imaging Algorithms: Imaging and the Rectangular Algorithm.
Abstract: The Radar Equation. The Matched Filter and Pulse Compression. Imaging and the Rectangular Algorithm. Ancillary Processes in Image Formation. SAR Flight System. Radiometric Calibration of SAR Data. Geometric Calibration of SAR Data. The SAR Ground System. Other Imaging Algorithms. Appendices. List of Acronyms. Index.

1,827 citations


Journal ArticleDOI
TL;DR: The concept of matched filter detection of signals is used to detect piecewise linear segments of blood vessels in these images and the results are compared to those obtained with other methods.
Abstract: Blood vessels usually have poor local contrast, and the application of existing edge detection algorithms yield results which are not satisfactory. An operator for feature extraction based on the optical and spatial properties of objects to be recognized is introduced. The gray-level profile of the cross section of a blood vessel is approximated by a Gaussian-shaped curve. The concept of matched filter detection of signals is used to detect piecewise linear segments of blood vessels in these images. Twelve different templates that are used to search for vessel segments along all possible directions are constructed. Various issues related to the implementation of these matched filters are discussed. The results are compared to those obtained with other methods. >

1,569 citations


Network Information
Related Topics (5)
Signal-to-noise ratio

28K papers, 356.5K citations

94% related
Narrowband

8.6K papers, 121.4K citations

92% related
Beamforming

29.9K papers, 472.6K citations

91% related
Multipath propagation

27.2K papers, 434.6K citations

91% related
Gaussian noise

25.9K papers, 552K citations

91% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20222
2021175
2020256
2019295
2018286
2017320

Top Attributes

Show by:

Topic's top 5 most impactful authors

Hongbin Li

31 papers, 924 citations

Jari Iinatti

27 papers, 217 citations

Shannon D. Blunt

18 papers, 553 citations

Rui Dinis

17 papers, 199 citations

Norman C. Beaulieu

16 papers, 280 citations