#### Filter Results:

- Full text PDF available (30)

#### Publication Year

2000

2017

- This year (1)
- Last 5 years (16)
- Last 10 years (39)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Jaiganesh Balakrishnan, Richard K. Martin, C. Richard Johnson
- IEEE Trans. Signal Processing
- 2003

We propose a new blind, adaptive channel shortening algorithm for updating a time-domain equalizer (TEQ) in a system employing multicarrier modulation. The technique attempts to minimize the sum-squared auto-correlation of the combined channel-TEQ impulse response outside a window of desired length. The proposed algorithm, “Sum-squared Auto-correlation… (More)

- Richard K. Martin, John MacLaren Walsh, C. Richard Johnson
- IEEE Transactions on Signal Processing
- 2004

Channel shortening is often employed as a means of mitigating intersymbol and intercarrier interference (ISI and ICI) in systems using multicarrier modulation. The Multicarrier Equalization by Restoration of RedundancY (MERRY) algorithm has previously been shown to blindly and adaptively shorten a channel to the length of the guard interval in a… (More)

- Richard K. Martin, Jamie S. Velotta, John F. Raquet
- IEEE Transactions on Signal Processing
- 2009

Source localization, the problem of determining the physical location of an acoustic or wireless emitter, is commonly encountered in sensor networks which are attempting to locate and track an emitter. Similarly, in navigation systems that do not rely on the global positioning system (GPS), ldquosignals of opportunityrdquo (existing wireless infrastructure)… (More)

- Richard K. Martin, William A. Sethares, Robert C. Williamson, C. Richard Johnson
- IEEE Trans. Signal Processing
- 2002

This paper studies a class of algorithms called Natural Gradient (NG) algorithms, and their approximations, known as ANG algorithms. The LMS algorithm is derived within the NG framework, and a family of LMS variants that exploit sparsity is derived. Mean squared error (MSE) analysis of the family of ANG algorithms is provided, and it is shown that if the… (More)

- Richard K. Martin, Marshall E. Haker
- IEEE Trans. Wireless Communications
- 2009

- Richard K. Martin, Ryan W. Thomas
- IEEE Trans. Wireless Communications
- 2009

- Richard K. Martin
- IEEE Transactions on Signal Processing
- 2007

Orthogonal frequency-division multiplexing (OFDM) is a popular transmission format for emerging wireless communication systems, including satellite radio, various wireless local area network (LAN) standards, and digital broadcast television. Single-carrier cyclic-prefixed (SCCP) modulation is similar to OFDM, but with all frequency-domain operations… (More)

- Richard K. Martin, Geert Ysebaert, Koen Vanbleu
- IEEE Transactions on Signal Processing
- 2007

Cyclic prefixed communications, such as multicarrier communications, first became widely used in the context of digital subscriber lines (DSL). In DSL, bit loading is allowed at the transmitter, and the performance metric is the bit rate that can be provided without exceeding a given bit error rate (BER). Wireless cyclic prefixed systems are now becoming… (More)

- Richard K. Martin, Chunpeng Yan, H. Howard Fan, Christopher Rondeau
- IEEE Transactions on Signal Processing
- 2011

One main drawback of using time difference of arrival (TDOA) methods for source localization and navigation is that they require centralization of multiple copies of a signal. This paper considers blindly estimating the location of a cyclic prefix (CP) in an orthogonal frequency division multiplexing (OFDM) signal, enabling distributed TDOA computation up… (More)

- Richard K. Martin, Koen Vanbleu, +5 authors C. Richard Johnson
- IEEE Transactions on Signal Processing
- 2006

Several high-speed communication standards modulate encoded data on multiple-carrier frequencies using the fast Fourier transform (FFT). The real part of the quantized inverse FFT samples form a symbol. The symbol is periodically extended by prepending a copy of its last few samples, also known as a cyclic prefix. When the cyclic prefix is longer than the… (More)