Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Samir N. Hulyalkar is active.

Publication


Featured researches published by Samir N. Hulyalkar.


wireless communications and networking conference | 1999

Blended CMA: smooth, adaptive transfer from CMA to DD-LMS

Louis R. Litwin; Michael D. Zoltowski; Thomas J. Endres; Samir N. Hulyalkar

A common technique in a blind equalization communication system is to use the constant modulus algorithm (CMA) to open the channel eye and then to switch to decision-directed LMS once the error rate has dropped to a sufficiently low level. The propose a new algorithm, blended CMA, which dynamically selects to use either the CMA or DD-LMS update term when adapting the equalizer taps. The decision rule governing this selection is also adaptive. Simulation results presented in this paper demonstrate how the algorithm performs when equalizing 64-QAM over real-world channels and highlights the performance gain over using traditional transfer methods.


IEEE Transactions on Communications | 2001

Low-complexity and low-latency implementation of the Godard/CMA update

Thomas J. Endres; Samir N. Hulyalkar; Christopher H. Strolle; Troy A Schaffer

This paper discusses methods for calculating and implementing the update error term for the popular blind equalization algorithm known as Godards (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.


international conference on acoustics, speech, and signal processing | 2000

A decision-directed constant modulus algorithm for higher-order source constellations

Thomas J. Endres; Samir N. Hulyalkar; Christopher H. Strolle; Troy A Schaffer; Raul A. Casas

This paper discusses methods for calculating and implementing the update error term for the popular blind equalization algorithm known as Godards (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.


Archive | 2002

Receiver for robust data extension for 8VSB signaling

Christopher H. Strolle; Samir N. Hulyalkar; Jeffrey S Hamilton; Haosong Fu; Troy A Schaffer


Archive | 1999

Adaptive equalizer with enhanced error quantization

Thomas J. Endres; Samir N. Hulyalkar; Christopher H. Strolle; Troy A Schaffer


Archive | 1998

Reduced complexity equalizer for multi mode signaling

Thomas J. Endres; Samir N. Hulyalkar; Troy A Schaffer; Christopher H. Strolle


Archive | 1999

Adaptive equalizer with decision directed constant modulus algorithm

Thomas J. Endres; Samir N. Hulyalkar; Christopher H. Strolle; Troy A Schaffer


Archive | 2002

Dual loop automatic gain control

Troy A Schaffer; Samir N. Hulyalkar; Anand M Shah


Archive | 2001

Carrier phase estimation based on single-axis constant modulus cost criterion and Bussgang criteria

Azzédine Touzni; Raúl A. Casas; Thomas J. Endres; Stephen L. Biracree; Christopher H. Strolle; Samir N. Hulyalkar


Archive | 1998

Method of estimating trellis encoded symbols utilizing simplified trellis decoding

Samir N. Hulyalkar; Thomas J. Endres; Troy A Schaffer; Christopher H. Strolle

Collaboration


Dive into the Samir N. Hulyalkar's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge