( en | de | ru )

 

Disambiguation of "Truong, Trieu-Kien"

Author of the publication

copydeleteadd this publication to your clipboard
Techniques for Computing the Discrete Fourier Transform Using the Quadratic Residue Fermat Number Systems.

, , , , and . IEEE Trans. Computers, 35 (11): 1008-1012 (1986)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Vinh Trieu

Hoc Khiem Trieu

Trieu Xuan Quynh

Doan Binh Trieu

Trieu Van Hung

 

Other publications of authors with the same name

Use of the RS decoder as an RS encoder for two-way digital communications and storage systems., , and . IEEE Trans. Circuits Syst. Video Techn., 4 (1): 91-92 (1994)A Fast Algorithm of the Discrete Cosine Transform for the Fermat Prime-Length., , , and . ICGEC, page 261-264. IEEE, (2012)A Pipeline Design of a Fast Prime Factor DFT on a Finite Field., , , , and . IEEE Trans. Computers, 37 (3): 266-273 (1988)A New Hybrid Algorithm for Computing a Fast Discrete Fourier Transform., and . IEEE Trans. Computers, 28 (7): 487-492 (1979)Mathematical analysis for CSI scheme with the interpolation kernel size increased., , , and . IET Image Processing, 11 (8): 595-604 (2017)Reconstruction of Single Image from Multiple Blurry Measured Images., , , , and . IEEE Trans. Image Processing, 27 (6): 2762-2776 (2018)Novel Approaches to the Parametric Cubic-Spline Interpolation., , , , and . IEEE Trans. Image Processing, 22 (3): 1233-1241 (2013)Decoding the (47, 24, 11) quadratic residue code using bit-error probability estimates., , , and . IEEE Trans. Commun., 57 (7): 1986-1993 (2009)Fast Transform for Decoding Both Errors and Erasures of Reed-Solomon Codes Over GF (2m) for 8 leq m leq 10., , , and . IEEE Trans. Commun., 54 (2): 181-186 (2006)Decoding of the (24, 12, 8) extended golay code up to four errors., , , , and . IET Commun., 3 (2): 232-238 (2009)