Browsing by Author "Huang, Yen-Ying"

Now showing 1 - 2 of 2

A Spread Spectrum Clock Generator with Phase-rotation Algorithm for 6Gbps Clock and Data Recovery
(2009)
Lin, Chi-Hsien
;
Huang, Yen-Ying
;
Li, Shu-Rung
;
Cheng, Yuan-Pu
;
Jou, Shyh-Jye
A low jitter phase-lock-loop (PLL) and a proposed spread-spectrum clock method for Serial ATA with phase rotation is presented. The low jitter PLL uses error amplifier to resolve the current mismatch in charge pump and the 3rd order loop filter is adopted to reduce the reference spur. A passive resistance is presented in our design to reduce the K(VCO). Our spread spectrum clock generator (SSCG) for Serial ATA specification is down spread 5000 ppm with a triangular waveform and the modulation frequency is 30 similar to 33KHz. Spread-spectrum technique using PLL with a Delta Sigma modulator and phase rotation algorithm is reported. The proposed circuit has been designed in a 90-nm CMOS process. The non-spread spectrum clocking has a peak to peak jitter of 512fs and consumes 5.87mW at 1.4GHz. The EMI reduction is about 19.24dB.
On the construction of permutation arrays via mappings from binary vectors to permutations
(2006-08-01)
Huang, Yen-Ying
;
Tsai, Shi-Chun
;
Wu, Hsin-Lung
;
資訊工程學系
;
Department of Computer Science
An (n, d, k)-mapping f is a mapping from binary vectors of length n to permutations of length n + k such that for all x, y is an element of {0, 1}(n), d(H) (f (x), f (y)) >= d(H)(x, y) + d, if d(H) (x, y) <= (n + k)-d and d(H) (f (x), f (y)) = n + k, if d(H) (x, y) > (n + k)-d. In this paper, we construct an (n, 3, 2)-mapping for any positive integer n >= 6. An (n, r)-permutation array is a permutation array of length n and any two permutations of which have Hamming distance at least r. Let P (n, r) denote the maximum size of an (n, r)-permutation array and A (n, r) denote the same setting for binary codes. Applying (n, 3, 2)-mappings to the design of permutation array, we can construct an efficient permutation array (easy to encode and decode) with better code rate than previous results [Chang (2005). IEEE Trans inf theory 51:359-365, Chang et al. (2003). IEEE Trans Inf Theory 49:1054-1059; Huang et al. (submitted)]. More precisely, we obtain that, for n >= 8, P(n, r) >= A(n-2, r-3) > A(n-1, r-2) = A (n, r-1) when n is even and P(n, r) >= A(n-2, r-3) = A(n-1, r-2) > A(n, r-1) when n is odd. This improves the best bound A(n-1, r-2) so far [Huang et al. (submitted)] for n >= 8.