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

Christopher H. Strolle

dblp:85/10923 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2002
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 3Computer networks · 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
2002 Differential carrier loop estimation for digital vestigial side band modulation
abstract
In this paper we address the problem of phase recovery for a digital VSB modulation. Two criteria, a Constant Modulus and MSE, which exploit the properties of VSB signaling in the presence of noise are proposed and analyzed. The extrema of the objective functions and their domains of attraction are derived. Under mild conditions on the statistics of the input sequence, it is shown that the derivative of these functions can be used as a new phase detector in a Phase Locked Loop (PLL) implementation. An effective semi-blind solution which consists of a combination of the MSE and CM phase detectors is introduced and analyzed.
Azzédine Touzni, Supat Wongwirawat, Christopher H. Strolle, Steve Biracree
ICASSP3
2001 Closed form expression of EMSE for Bussgang equalization with spatio-temporal diversity
abstract
Bussgang algorithms are a class of simple stochastic gradient type solutions for blind channel equalization. We investigate the degradation of performance in the source estimation resulting from the stochastic jitter around stationary points of Bussgang algorithms (which correspond to the equalizers of the channel). More precisely, we derive a closed form approximation of the excess mean square error (EMSE) defined as the variance of the jitter which depends on the effects of the channel characteristics, the source distribution and the non-linearity used in the update equation. The analysis is performed in a context of spatiotemporal channel diversity involving a single-input/multiple outputs data model.
Azzédine Touzni, Thomas J. Endres, Raúl A. Casas, Christopher H. Strolle
ICASSP4
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.3
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
ICASSP3