default search action
Malcolm D. Macleod
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [c21]Stephan Weiss, Jesus Selva, Malcolm D. Macleod:
Measuring Smoothness of Trigonometric Interpolation Through Incomplete Sample Points. EUSIPCO 2020: 2319-2323
2010 – 2019
- 2019
- [c20]Stephan Weiss, Malcolm D. Macleod:
Maximally Smooth Dirichlet Interpolation from Complete and Incomplete Sample Points on the Unit Circle. ICASSP 2019: 8053-8057 - 2010
- [c19]Stephan Weiss, Andrew P. Millar, Robert W. Stewart, Malcolm D. Macleod:
Performance of transmultiplexers based on oversampled filter banks under variable oversampling ratios. EUSIPCO 2010: 2181-2185
2000 – 2009
- 2009
- [c18]Matthew Hayes, Jonathon A. Chambers, Malcolm D. Macleod:
A single-carrier quasi-orthogonal transmission scheme for asynchronous cooperative relay networks. EUSIPCO 2009: 125-129 - 2008
- [c17]W. D. Addison, Malcolm D. Macleod:
Non-stationary Bayesian direction of arrival estimation with drifting sensor locations. EUSIPCO 2008: 1-5 - [c16]Matthew Hayes, Jonathon A. Chambers, Malcolm D. Macleod:
A simple quasi-orthogonal space-time scheme for use in asynchronous virtual antenna array enabled cooperative networks. EUSIPCO 2008: 1-5 - [c15]Matthew Hayes, Shakiru K. Kassim, Jonathon A. Chambers, Malcolm D. Macleod:
Exploitation of Quasi-Orthogonal Space Time Block Codes in Virtual Antenna Arrays: Part I - Theoretical Capacity and throughput Gains. VTC Spring 2008: 349-352 - 2005
- [j12]Malcolm D. Macleod:
Multiplierless Implementation of Rotators and FFTs. EURASIP J. Adv. Signal Process. 2005(17): 2903-2910 (2005) - [j11]Malcolm D. Macleod, Andrew G. Dempster
:
Multiplierless FIR filter design algorithms. IEEE Signal Process. Lett. 12(3): 186-189 (2005) - [j10]Zhuo Zhang, Andreas Jakobsson
A Hybrid Phase-Based Single Frequency Estimator. IEEE Signal Process. Lett. 12(9): 657-660 (2005) - [c14]Malcolm D. Macleod:
Robust normalised LMS filtering. ICASSP (4) 2005: 37-40 - [c13]Balaji Iyer, Malcolm D. Macleod:
Color image retrieval using the datasieve. ICASSP (2) 2005: 417-420 - [c12]Andrew G. Dempster
Multiplication by two integers using the minimum number of adders. ISCAS (2) 2005: 1814-1817 - 2004
- [j9]Stephen W. Hainsworth, Malcolm D. Macleod:
Particle Filtering Applied to Musical Tempo Tracking. EURASIP J. Adv. Signal Process. 2004(15): 2385-2395 (2004) - [j8]Andrew G. Dempster
Generation of signed-digit representations for integer multiplication. IEEE Signal Process. Lett. 11(8): 663-665 (2004) - [j7]Malcolm D. Macleod:
Multiplierless Winograd and prime factor FFT implementation. IEEE Signal Process. Lett. 11(9): 740-743 (2004) - [c11]Andrew G. Dempster, Malcolm D. Macleod:
Using all signed-digit representations to design single integer multipliers using subexpression elimination. ISCAS (3) 2004: 165-168 - [c10]Andrew G. Dempster, Malcolm D. Macleod:
Digital filter design using subexpression elimination and all signed-digit representations. ISCAS (3) 2004: 169-172 - 2003
- [c9]Stephen W. Hainsworth, Malcolm D. Macleod:
Onset Detection in Musical Audio Signals. ICMC 2003 - 2002
- [j6]Malcolm D. Macleod:
Performance of the hierarchical LMS algorithm. IEEE Signal Process. Lett. 9(12): 436-437 (2002) - [c8]Malcolm D. Macleod:
Implementation of median-LMS adaptive filters using power-of-two multiplication in the adaptation arithmetic. EUSIPCO 2002: 1-4 - 2001
- [j5]Malcolm D. Macleod:
A fast frequency domain notch periodogram algorithm. Signal Process. 81(7): 1449-1463 (2001) - [j4]Vincent K. N. Lau
Variable-rate adaptive trellis coded QAM for flat-fading channels. IEEE Trans. Commun. 49(9): 1550-1560 (2001) - [c7]Malcolm D. Macleod:
Joint detection and high resolution ML estimation of multiple sinusoids in noise. ICASSP 2001: 3065-3068 - [c6]Stephen W. Hainsworth, Malcolm D. Macleod:
Automatic Bass Line Transcription from Polyphonic Music. ICMC 2001 - 2000
- [c5]Balaji Iyer, Malcolm D. Macleod:
. Multiscale region segmentation of images using nonlinear methods. VCIP 2000: 1116-1125
1990 – 1999
- 1998
- [j3]Malcolm D. Macleod:
Fast nearly ML estimation of the parameters of real or complex single tones or resolved multiple tones. IEEE Trans. Signal Process. 46(1): 141-148 (1998) - [c4]Malcolm D. Macleod:
High resolution nearly-ML estimation of sinusoids in noise using a fast frequency domain approach. EUSIPCO 1998: 1-4 - 1997
- [c3]Vincent K. N. Lau, Malcolm D. Macleod:
Variable Rate Adaptive Trellis Coded QAM for High Bandwidth Efficiency Applications under Raleigh Fading Channel. IMACC 1997: 168-179 - 1996
- [j2]Teng Joon Lim, Malcolm D. Macleod:
On-line interpolation using spline functions. IEEE Signal Process. Lett. 3(5): 144-146 (1996) - 1995
- [j1]Teng Joon Lim, Malcolm D. Macleod:
Adaptive algorithms for joint time delay estimation and IIR filtering. IEEE Trans. Signal Process. 43(4): 841-851 (1995) - [c2]Andrew G. Dempster, Malcolm D. Macleod:
Comparison of IIR Filter Structure Complexities Using Multiplier Blocks. ISCAS 1995: 858-861 - 1994
- [c1]Andrew G. Dempster, Malcolm D. Macleod:
Use of Multiplier Blocks to Reduce Filter Complexity. ISCAS 1994: 263-266
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: