The algorithms for iris recognition set forth by Daugman can perform identification accurately and quickly, but the implementation about the algorithms has not been reported in open literatures. The algorithms are studied and implemented. A new method combining coarse location with fine location is proposed to locate the iris quickly. Furthermore, only the real parts of filters are used during the filtering, which can decrease code length and still have good results. The detailed procedure of implementing the algorithms is given, including preprocessing, constructing Gabor filters and the computation of iris codes and Hamming distances. The results show that this approach has very high speed of operation and good results of feature extraction and can be used for actual personal identification system.