VIETNAMESE
REFERENCES
[1] MSc. Hoang Le Uyen Thuc, Digital signal processing textbook, University of Science and Technology
– Danang University.
Maybe you are interested!
-
Evaluate the performance of some distributed hash table algorithms DHT and propose solutions to improve the performance of the CHORD algorithm - 1 -
Description of the Mlp Neural Network Training Algorithm Using Backpropagation Learning with Overshoot Step. Algorithm for Calculating Overshoot Step -
Stack With Recursive Algorithm Implementation: -
d-blast algorithm in mimo technology - 8 -
Algorithm Diagram to Find Rules from Sample Rule Database.
[2] Nguyen Quoc Trung, Digital signal processing - volume 1, Science and Technology Publishing House.
ENGLISH

[3] Klatt D., “Prediction of perceived phonetic distance from critical band spectra”, Proc IEEE Int. Conf. Acoustic. Speech Signal Process.
[4] Quackenbush S., Barnwell T. and Clements M., “Objective Measurement of Speech Quality”, Englewood Cliffs NJ: Prentice Hall.
SOME REFERENCE WEBSITES
[5] https://www.google.com.vn/
[6] http://vi.wikipedia.org
[7] http://www.doko.vn/
[8] http://tailieu.vn/
[9] http://en.wikipedia.org/wiki/Code_Excited_Linear_Prediction
included
APPENDIX
The entire source code of the executable program is stored on the attached CD.
GUIDE'S COMMENTS
...................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................
...................................................................................................................................................





