Chivapreecha, Sorawat
Loading...
Preferred name
Chivapreecha, Sorawat
Alternative Name
Chivapreecha, S.
Chivapreecha, Sorwat
Main Affiliation
Email
sorawat.ch@kmitl.ac.th
7 results
Now showing 1 - 7 of 7
- Some of the metrics are blocked by yourconsent settings
Item type:Publication, Generalized Pascal matrices, inverses, computations and properties using one-to-one rational polynomial s-z transformations(2008-01-01); Dejhan, KobchaiThis paper proposes a one-to-one mapping between the coefficients of continuous-time (s-domain) and discrete-time (z-domain) IIR transfer functions such that the s-domain numerator/denominator coefficients can be uniquely mapped to the z-domain numerator/denominator coefficients. The one-to-one mapping provides a firm basis for proving the inverses of the so-called generalized Pascal matrices from various first-order s-z transformations. We also derive recurrence formulas for recursively determining the inner elements of the generalized Pascal matrices from their boundary ones. Consequently, all the elements of the whole generalized Pascal matrix can be easily generated through utilizing their neighbourhood, which can be exploited for further simplifying the Pascal matrix generations. Finally, we reveal and prove some interesting properties of the generalized Pascal matrices. © 2008 IEEE. - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Weighted least-squares design of variable recursive digital filters with guaranteed stability(2013-12-31); Dejhan, KobchaiThe stability guarantee is the most important issue in designing variable infinite-impulse-response (IIR) digital filters. This paper presents a new variable substitution method for transforming the denominator coefficients of a variable-IIR-filter into another set of variables such that arbitrary values of the new variables can guarantee the stability of the resulting variable-IIR-filter. That is, the design problem subject to stability guarantee (constrained non-linear design problem) is converted into an unconstrained design problem. As a consequence, the resulting variable-IIR-filters are always guaranteed theoretically. A lowpass variable-IIR-filter design example is given to illustrate the effectiveness of the design formulation. © 2013 IEEE. - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Bi-minimax design of even-order variable fractional-delay FIR digital filters(2012-01-01); Dejhan, KobchaiThis paper proposes a new minimax method for designing even-order finite-impulse-response (FIR) variable fractional-delay (VFD) digital filters with both the peak errors (maximum absolute errors) of variable frequency response (VFR) and VFD response being minimized. We call such a new minimax design the bi-minimax design, which minimizes a mixed error function that contains both the VFR peak error and VFD peak error. A relative weighting factor is used in the mixed error function for adjusting the relative weightings of the two peak errors. The central part of the biminimax design is how to formulate the biminimax design with highly non-linear constraints on the VFD errors as a solvable one. After linearizing the highly non-linear constraints as linear ones, the biminimax design problem can be easily solved by using the well-known efficient software SeDuMi. As a result, both the VFR peak error and VFD peak error can be simultaneously suppressed and the resulting VFR errors and VFD errors are made nearly equiripple (bi-equiripple). As compared with the existing SOCP-based minimax design that minimizes only the VFR peak error, the proposed biminimax method can achieve a nearly biequiripple design for both the VFR and VFD errors. A design example is given to illustrate the effectiveness of the biminimax design method. © 2004-2012 IEEE. - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Unified Pascal matrix for first-order s-z domain transformations(2009-06-16); Dejhan, KobchaiThe so-called generalized Pascal matrix is used for transforming a continuous-time (CT) linear system (filter) into a discrete-time (DT) one. This paper derives an explicit expression for a new generalized Pascal matrix called unified Pascal matrixfrom a unified first-order s-z transformation model and rigorously proves the inverses for various first-order s-z transformations. After deriving a recurrence formula for recursively generating the inner elements of the unified Pascal matrix from its boundary elements, we also show that the recurrence formula leads to computationally unstable solutions for high-order systems due to the so-called catastrophic cancellation in numerical computation, but the unstable problem can be solved through partitioning the whole unified Pascal matrix into several small matrices (submatrices) and then using the recurrence formula to compute the submatrices individually from their boundary elements. This operation almost retains the same computational complexity while guarantees numerically stable solutions. Moreover, an interesting property of the unified Pascal matrix is proved. © 2009 IEEE. - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Discrete Pascal filter and its hardware realization(2009-01-01); - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Low-Complexity and High-Modularity Structure for Implementing Transient-Free Pascal-Delay Filter(2017-12-01) - Some of the metrics are blocked by yourconsent settings
Item type:Publication, Very low-complexity structure for lagrange-type variable fractional-delay filter(2010-09-20); Deng, Tian BoThis paper presents a very low-complexity structure for the Lagrange-type variable fractional-delay (VFD) FIR filter. This structure consists of two sections called front-end and back-end sections. The front-end section is a multiplierless digital filter while the back-end section requires a small number of multiplications that is a linear function of the order k. Since the proposed VFD filter structure can fast tune the delay parameter on-line, it is suitable for real-time applications. © 2010 IEEE.