Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from VLDB 2026 / reviewers in the wild / expert

Troy A. Schaffer

dblp:17/10924 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2001
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Physical-layer communications · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Integrated circuit design · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications › equalization
blind equalization		 0.012001
Low-complexity and low-latency implementation of the Godard/CMA update · IEEE Trans. Commun. 2001
Physical-layer communications › equalization › blind equalization
constant modulus algorithm		 0.012001
Low-complexity and low-latency implementation of the Godard/CMA update · IEEE Trans. Commun. 2001
Physical-layer communications
equalization		 0.012001
Low-complexity and low-latency implementation of the Godard/CMA update · IEEE Trans. Commun. 2001
Integrated circuit design
low-power circuit design		 0.012001
Low-complexity and low-latency implementation of the Godard/CMA update · IEEE Trans. Commun. 2001

Methods — techniques the papers use, named apart from their topics

region-based quantization · 0.1decision-directed update · 0.1lookup table · 0.0look-up table · 0.0
YearPublicationVenuePosition
2001 Low-complexity and low-latency implementation of the Godard/CMA update
abstract
This paper discusses methods for calculating and implementing the update error term for the popular blind equalization algorithm known as Godard's (1980) algorithm, or the constant modulus algorithm (CMA), without the use of multipliers so that chip area and signal latency are both substantially reduced. One approach uses a decision-directed CMA update term, and another uses region-based quantization. The quantized error term can be calculated using a look-up table in place of costly multipliers and adders. Baseband and passband implementations are discussed, and computer simulations verify our methods.
Thomas J. Endres, Samir N. Hulyalkar, Christopher H. Strolle, Troy A. Schaffer
 IEEE Trans. Commun.4
2000 A decision-directed constant modulus algorithm for higher-order source constellations
abstract
This paper discusses methods for calculating and implementing the update error term for the popular blind equalization algorithm known as Godard's (1980) algorithm, or the constant modulus algorithm (CMA), without the use of multipliers so that the chip area and signal latency are both substantially reduced. A decision-directed CMA update term is derived for higher-order (non-constant modulus) source alphabets. The modified update error term can be calculated using a look-up table in place of costly multipliers and adders. Baseband and passband implementations for one-dimensional and two-dimensional signaling are discussed.
Thomas J. Endres, Samir N. Hulyalkar, Christopher H. Strolle, Troy A. Schaffer, Raúl A. Casas
 ICASSP4