Yunghsiang S. Han

Yunghsiang S. Han

Auto-generated profile, based on publicly available information

Yunghsiang S. Han

Shenzhen Institute for Advanced Study, University of Electronic Science and Technology of China, Shenzhen, China

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
15 August 2016 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
SLSian Jheng Lin
Sian Jheng Lin
TATareq Y. Al-Naffouri
Tareq Y. Al-Naffouri
YHYunghsiang S. Han
Yunghsiang S. Han
Recently, a new polynomial basis over binary extension fields was proposed, such that the fast Fourier transform (FFT) over such fields can be computed in the complexity of order O(n lg(n)), where n is the number of points evaluated in FFT. In this paper, we reformulate this FFT algorithm, such that it can be easier understood and be extended to develop frequencydomain decoding algorithms for (n = 2 m , k) systematic Reed-Solomon (RS) codes over F 2m , m ∈ Z + , with n- k a power of two. First, the basis of syndrome polynomials is reformulated in the decoding procedure so that the new transforms can be applied to the decoding procedure. A fast extended Euclidean algorithm is developed to determine the error locator polynomial. The computational complexity of the proposed decoding algorithm is O(n lg(n-k)+(n-k) lg 2 (n-k)), improving upon the best currently available decoding complexity O(n lg 2 (n) lglg(n)), and reaching the best known complexity bound that was established by Justesen in 1976. However, Justesen's approach is only for the codes over some specific fields, which can apply Cooley-Tukey FFTs. As revealed by the computer simulations, the proposed decoding algorithm is 50 times faster than the conventional one for the (2 16 , 2 15 ) RS code over F 216 .

13 September 2016 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
SLSian Jheng Lin
Sian Jheng Lin
TATareq Y. Al-Naffouri
Tareq Y. Al-Naffouri
YHYunghsiang S. Han
Yunghsiang S. Han
WCWei-Ho Chung
Wei-Ho Chung
In this paper, we present a fast Fourier transform algorithm over extension binary fields, where the polynomial is represented in a non-standard basis. The proposed Fourier-like transform requires O(h lg(h)) field operations, where h is the number of evaluation points. Based on the proposed Fourier-like algorithm, we then develop the encoding/decoding algorithms for (n = 2 m , k) Reed-Solomon erasure codes. The proposed encoding/erasure decoding algorithm requires O(n lg(n)), in both additive and multiplicative complexities. As the complexity leading factor is small, the proposed algorithms are advantageous in practical applications. Finally, the approaches to convert the basis between the monomial basis and the new basis are proposed.

26 July 2018 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
HHHanxu Hou
Hanxu Hou
YHYunghsiang S. Han
Yunghsiang S. Han
Kenneth ShumKenneth Shum
Kenneth Shum
HLHui Li
Hui Li
Array codes are used widely in data storage systems such as redundant array of independent disks. The row-diagonal parity (RDP) codes and EVENODD codes are two popular double-parity array codes. The increasing capacity of hard disks demands better fault tolerance by using array codes with three or more parity disks. Although many extensions of RDP and EVENODD codes have been proposed, their main drawback is high decoding complexity. In this paper, we propose a unified form of RDP and EVENODD codes under which RDP codes can be treated as shortened EVENODD codes. Moreover, an efficient decoding algorithm based on an LU factorization of a Vandermonde matrix is proposed. The LU decoding method is applicable to all the erasure patterns of RDP and EVENODD codes with three parity columns. It is also applicable to the erasure decoding of RDP and EVENODD codes with more than three parity columns when the number of continuous surviving parity columns is no less than the number of erased information columns and the first parity column has not failed. The proposed efficient decoding algorithm is also applicable to other Vandermonde array codes, with less decoding complexity than that of the existing method.

19 October 2022 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
NTNianqi Tang
Nianqi Tang
YHYunghsiang S. Han
Yunghsiang S. Han
Decoding algorithms for Reed–Solomon (RS) codes are of great interest for both practical and theoretical reasons. In this paper, an efficient algorithm, called the modular approach (MA), is devised for solving the Welch–Berlekamp (WB) key equation. By taking the MA as the key equation solver, we propose a new decoding algorithm for systematic RS codes. For ( n, k ) RS codes, where n is the code length and k is the code dimension, the proposed decoding algorithm has both the best asymptotic computational complexity O ( n log( n-k )+( n-k ) log 2 ( n-k )) and the smallest constant factor achieved to date. By comparing the number of field operations required, we show that when decoding practical RS codes, the new algorithm is significantly superior to the existing methods in terms of computational complexity. When decoding the (4096,3584) RS code defined over F 212 , the new algorithm is 10 times faster than a conventional syndrome-based method. Furthermore, the new algorithm has a regular architecture and is thus suitable for hardware implementation.

24 October 2017 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
HHHanxu Hou
Hanxu Hou
YHYunghsiang S. Han
Yunghsiang S. Han
Array codes have been widely used in communication and storage systems. To reduce computational complexity, one important property of the array codes is that only exclusive OR operations are used in the encoding and decoding processes. Cauchy Reed-Solomon codes, Rabin-like codes, and circulant Cauchy codes are existing Cauchy maximum-distance separable (MDS) array codes that employ Cauchy matrices over finite fields, circular permutation matrices, and circulant Cauchy matrices, respectively. All these codes can correct any number of failures; however, a critical drawback of existing codes is the high decoding complexity. In this paper, we propose a new construction of Rabin-like codes based on a quotient ring with a cyclic structure. The newly constructed Rabin-like codes have more supported parameters (prime p is extended to an odd number), such that the world sizes of them are more flexible than the existing Cauchy MDS array codes. An efficient decoding method using LU factorization of the Cauchy matrix can be applied to the newly constructed Rabin-like codes. It is shown that the decoding complexity of the proposed approach is less than that of existing Cauchy MDS array codes. Hence, the Rabin-like codes based on the new construction are attractive to distributed storage systems.

3 January 2020 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
LYLeilei Yu
Leilei Yu
ZLZhichang Lin
Zhichang Lin
SLSian Jheng Lin
Sian Jheng Lin
YHYunghsiang S. Han
Yunghsiang S. Han
NYNenghai Yu
Nenghai Yu
This article describes a fast Reed-Solomon encoding algorithm with four and seven parity symbols in between. First, we show that the syndrome of Reed-Solomon codes can be computed via the Reed-Muller transform. Based on this result, the fast encoding algorithm is then derived. Analysis shows that the proposed approach asymptotically requires 3 XORs per data bit, representing an improvement over previous algorithms. The simulation demonstrates that the performance of the proposed approach improves with the increase of code length and is superior to other methods. In particular, when the parity number is 5, the proposed approach is about two times faster than other cutting-edge methods.