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

Mu-Huo Cheng

dblp:53/5260 · DBLP profile ↗
← Back
7ranked-venue papers
6as first author
0since 2021 · last 2007
—ORCID · none

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

Graphics, computer vision, multimedia, augmented reality and games · 5 · 4 first-authorComputer networks · 2 · 2 first-author

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%

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

TopicWeightPapersLastEvidence papers
Physical-layer communications › equalization
decision feedback equalization
0.112005
Joint design of interpolation filters and decision feedback equalizers · IEEE Trans. Commun. 2005
Physical-layer communications
equalization
0.112005
Joint design of interpolation filters and decision feedback equalizers · IEEE Trans. Commun. 2005
Physical-layer communications › signal processing for communications › filter design
interpolation filter design
0.112005
Joint design of interpolation filters and decision feedback equalizers · IEEE Trans. Commun. 2005
Physical-layer communications
signal processing for communications
0.112005
Joint design of interpolation filters and decision feedback equalizers · IEEE Trans. Commun. 2005

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

minimum mean-square error · 0.1alternating minimization · 0.1
YearPublicationVenuePosition
2007 A Numerical Huffman Decoder
abstract
We formulate the Huffman decoding as a root-solving problem so that powerful numerical techniques such as the Newton method and the bisection method are employed for solution. The sectioning technique that narrows the searching scope for solution is further proposed for increasing the decoding speed. The numerical decoder is fast and memory efficient; it is also simple to realize and suitable for integrated circuit implementation.
Mu-Huo Cheng, Jin-Yen Lee, Yu-Hao Lu
ISCC1
2006 A new IIR adaptive notch filter
Mu-Huo Cheng, Jau-Long Tsai
Signal Process.1
2005 Joint design of interpolation filters and frequency equalizers in DMT systems for xDSL applications
abstract
We formulate the joint design of interpolation filter and frequency equalizer in DMT systems as a problem for minimization of the mean square error between the input data symbol and its output estimate. Then, an iterative algorithm is proposed for the solution. Each iteration requires only solving two quadratic minimizations; the algorithm also ensures convergence. Simulations for VDSL applications demonstrate that an increment in transmission rate can be achieved compared with the conventional design of the interpolation filter and frequency equalizer separately.
Mu-Huo Cheng, Pey-Huah Lu, Jia-Fu Wu
ICASSP (3)1
2005 Joint design of interpolation filters and decision feedback equalizers
abstract
This paper presents an algorithm to design jointly interpolation filters and decision feedback equalizers in the sense of minimum mean-square error such that the joint capacity which is neglected in conventional design is explored to improve the receiver performance. The algorithm comprises an iteration of two alternating simple quadratic minimizing operations and ensures convergence. A simulation example for the raised-cosine channel demonstrates that via this approach an improvement over the conventional design can be achieved.
Mu-Huo Cheng, Tsai-Sheng Kao
IEEE Trans. Commun.1
1998 A new adaptive notch filter with constrained poles and zeros using Steiglitz-McBride method
abstract
In this paper we present a new adaptive notch filter (ANF) using the well-known Steiglitz-McBride method (SMM) for an IIR filter with the constrained poles and zeros. The proposed ANF, termed as SMM-ANF, converges to the unbiased solution, has fast convergence speed, and requires less computational complexity than existing recursive maximum likelihood adaptive notch filters (RML-ANF). In the stationary environments, we analyze SMM-ANF convergence properties using the ordinary differential equation (ODE) technique; we derive conditions for the SMM-ANF convergence solution unbiased. Simulations further display that SMM-ANF has better resolution in identifying frequencies of multiple sine waves than RML-ANF. In the nonstationary environments, we also show that SMM-ANF and RML-ANF have approximately identical tracking performance. Simulations are also done to verify the theoretically derived results.
Mu-Huo Cheng, Jan-Long Tsai
ICASSP1
1994 Convergence, convergence point and convergence rate for Steiglitz-McBride method; a unified approach
abstract
This paper presents a unified approach to analyze the convergence properties of Steiglitz-McBride(1966) method (SMM) in general environments. SMM is formulated as a successive substitution equation. Using results from fixed point theory enables a unified analysis of SMM in both white and colored noise, and sufficient and insufficient order cases. This analysis provides us with several new results. Specifically, for sufficient order filters in white noise environments, the convergence rate of SMM can be predicted by the signal-power to noise-power ratio (SNR) at plant output. For sufficient order filters in colored noise, SMM may diverge or converge depending on the initial estimate and SNR at plant output. If SMM converges, the convergence point is near the unbiased solution. SNR again determines the bias magnitude. For insufficient order filters, in addition to the possible multiple convergence points, we also demonstrate the existence of diverging fixed points of SMM. These diverging fixed points can be used to separate the convergence region, and identify the convergence points for each initial estimate.>
Mu-Huo Cheng, Virginia L. Stonick
ICASSP (3)1
1994 Adaptive IIR filtering: composite prefiltered regressor method
abstract
In this paper, we present a new method for adaptive IIR filtering that promises improved performance under general operating conditions, including both colored and white noise, sufficient and insufficient order filter cases. By defining the regressor in adaptive IIR filter update to be a convex combination of the regressors for the Steiglitz-McBride method (SMM) and recursive predicted error method (RPEM), we are able to tradeoff the benefits of each. RPEM minimizes mean square output error (MSOE) directly, and thus has slow convergence rate and may converge to a local minimum because of nonconvexity and multimodality of MSOE surface, SMM converges fast, but may converge to a biased solution or diverge in colored noise environments. Other composite methods (e.g., composite regressor method (CRM)) use a similar approach, but only focus on reducing bias of equation error estimates for sufficient order filters in white noise environments. Conversely, our method, CPRM, can extend applications to general environments, prevent diverging, reduce bias, and increase likelihood of convergence to the global minimum.>
Virginia L. Stonick, Mu-Huo Cheng
ICASSP (3)2