【正文】 的同學(xué)，同樣給了我深深的認(rèn)識和體會。由于這次設(shè)計是在實習(xí)期間獨立完成的，所以在各模塊之間的銜接上，以及某些參數(shù)的確定上可能還存在一定的問題。但通過這次設(shè)計，收獲也頗多。通過查閱資料，我對DS直接序列和m序列有了很深刻的印象。以前，雖然也接觸過這些，但都不太了解，連具體的用處都還不是很明白?，F(xiàn)在，了解了很多，也明白了做一個設(shè)計首先就是要把具體方案設(shè)計出來，找出所需要的元件，再對其參數(shù)進(jìn)行設(shè)定，這樣完成一個設(shè)計就會很快了。最難的一塊就是確定方案了。當(dāng)時，我做這個設(shè)計的時候就是在設(shè)計方案以及參數(shù)的選擇上花費了很多時間。做完設(shè)計的同時也感覺到自己需要學(xué)的知識還很多。因此我將在以后的時間中加強學(xué)習(xí)，同時要學(xué)會利用Internet或圖書館查閱自己需要的資料。使自己在面對一個設(shè)計時能知道先做什么，后做什么。遇見不懂的地方也能通過查閱資料來搞懂。這次設(shè)計也存在著一些不足之處，望老師指教修改，進(jìn)一步完善。致 謝畢業(yè)設(shè)計即將結(jié)束，在老師的指導(dǎo)和同學(xué)的幫助之下，學(xué)生對于道路設(shè)計有了更多新的認(rèn)知，對路基路面設(shè)計有了更深一步的認(rèn)識，對路基路面綜合設(shè)計的整體脈絡(luò)了解得更加的清晰透徹。通過畢業(yè)設(shè)計，學(xué)生對自己大學(xué)四年以來所學(xué)的知識有更多的認(rèn)識。畢業(yè)設(shè)計，幫助我們總結(jié)大學(xué)四年收獲、認(rèn)清自我。同時，還幫助我們改變一些處理事情時懶散的習(xí)慣。從最開始時的搜集資料，整理資料，到方案比選，確定方案，再到著手開始進(jìn)行路基工程、路面工程和路線排水的設(shè)計，每一步都是環(huán)環(huán)相扣，銜接緊密，其中任何一個步驟產(chǎn)生遺漏或者疏忽，就會對以后的設(shè)計帶來很多的不便。學(xué)生的動手能力和資料搜集能力在設(shè)計中也得到提升。畢業(yè)設(shè)計中很多數(shù)值、公式、計算方法都需要我們?nèi)ツ托牡夭殚啎?，瀏覽資料，設(shè)計中需要用到輔助設(shè)計軟件的地方，也需要我們耐心的學(xué)習(xí)。掌握其使用的要領(lǐng)，運用到設(shè)計當(dāng)中去。最后匯總的時候，需要將前期各個階段的工作認(rèn)真整理。畢業(yè)設(shè)計結(jié)束了，通過設(shè)計，學(xué)生深刻領(lǐng)會到基礎(chǔ)的重要性，畢業(yè)設(shè)計不僅僅能幫助學(xué)生檢驗大學(xué)四年的學(xué)習(xí)成果，更多的是畢業(yè)設(shè)計可以幫助我們更加清楚的認(rèn)識自我，磨練學(xué)生的意志與耐性，這會為學(xué)生日后的工作和生活帶來很大的幫助。參考文獻(xiàn)[1] 張更新,[M].北京:人民郵電出版社,2001:7985.[2] [M].北京:工業(yè)出版社,2003:7881.[3] [M].北京:清華大學(xué)出版社,2007:7176.[4] 查光明,[M].西安:西安電子科技大學(xué)出版社,2002:97118.[5] 樊昌信,（第6版) [M].北京:國防工業(yè)出版社,2010:180400.[6] 曾一凡,[M].北京:機械工業(yè)出版社,2005:230.[7] [M].福建:廈門大學(xué)出版社,1998:3545.[8] [M].北京:國防工業(yè)出版社,1995:1769.[9] （MATLAB版)[M].北京:電子工業(yè)出版社,2005:313384.[10] 郭海燕,[M].北京:郵電出版社, 2004:88100.[11] Marvin K. Spectrum Comuunications Handbook[M].北京:人民郵電出版社, 2002:1533.[12] 曾興斐,[M].北京:國防工業(yè)出版社, 1997:121124.[13] 張葛祥,[M].北京:清華大學(xué)出版社, 2003:5678.[14] Joyce John. Adventures in home networking[J].Scientific Computing and Instrumentation 2005,22(2):1043.[15] 郝志勇,[M].西安:西安電子科技大學(xué)出版社, 2003:313316.[16] 徐明遠(yuǎn),[M].西安:西安電子科技大學(xué)出版社, 2005:100112.[17] 趙黎利,張曉林,（修訂版)[M].哈爾濱:哈爾濱工程大學(xué)出版社,2003:114116.附錄 科技文獻(xiàn)Pseudorandom sequence generator based on the generalized Henon mapAbstract:By analysis and parison of several chaotic systems that are applied to generate pseudorandom sequence, the generalized Henon map is proposed as a pseudorandom sequence generator. A new algorithm is created to solve the problem of nonuniform distribution of the sequence generated by the generalized Henon map. First, move the decimal point of elements in the sequence to the right。 then, cut off the integer。 and finally, quantify it into a binary sequence. Statistical test, security analysis, and the application of image encryption have strongly supported the good random statistical characteristics, high linear plexity, large key space, and great sensitivity of the binary sequence.Keywords :pseudorandom sequence, chaos, the generalized Henon map1 IntroductionThe extremely rapid development of the internet brings more and more attention to the information security techniques, such as text encryption, image encryption, video encryption, etc. As a result, highly qualified random sequences, as an inseparable part of encryption techniques, are urgently. There are two kinds of random sequences: real random sequences generated by physical methods and pseudorandom sequences generated by algorithm simulations, which are in accordance with some kindof probability distributions. However, the constructions of the real random sequences are usually poor in speed and efficiency,and require considerably more storage space as well, and these defects restrict the usage in modern cryptography. Pseudorandom sequences are usually generated by prescriptive processes or methods, and have similar characteristics with the white noise. Since pseudorandom sequences are easy to be generated, processed, and regenerated, they are widely used in various fields such as cryptography, munications, testing,aerospace, automation, etc. [1–12]. Most existing methods for generating the pseudorandom sequences are based on the midsquare method, the linear congruential method, linear and nonlinear feedback shift registers, etc. [13]. In recent years,several researchers have applied chaotic systems in the generation of pseudorandom sequences and been successful [4–6]. Chaotic sequence has very good pseudorandom characteristics and ergodicity. It is extremely sensitive to theinitial states: even a minute difference in the initial values of two similar chaotic systems can cause a significant difference in their tracks in a very short time. Therefore, chaotic sequence well fits the requirements of pseudorandom sequence. When the chaotic system has no less than 2 positive Lyapunov exponents, it is called hyperchaos. Since highdimensional hyperchaotic system is more plex and unpredictable, it is more suitable to be a pseudorandom sequences this article, a pseudorandom binary sequence is generated by the highdimensional generalized Henon hyperchaotic system. Statistical testing and security analysis verify that it has good pseudorandom characteristics and is highly capable to withstand attacks.2 The generalized Henon mapThe chaotic systems used for information security can be classified into two categories: onedimensional Logistic map and threedimensional Lorenz system. These are all excellent models that bear all the classical chaotic characteristics, yet,they have their own disadvantages. Lowdimensional chaotic system is easy to be cracked [7, 8]。 therefore, it will require two or more lowdimensional maps to work simultaneously [5, 9], or to merge with other chaotic systems to form a posite one [6, 10]. Threedimensional Lorenz system is a continuous dynamic system [11], and therefore, a fixed step numerical integration method is needed to solve differential equations。 however, this process will lead to the dynamic behaviors of the chaotic system degradation. Therefore, the ideal way to generate pseudorandom sequences is to use a discretetime highdimensional chaotic system.The generalized Henon map is designed by Richter in Ref. [14],and it can be elaborated as follows:where, i = 2, 3,..., w, a 0, b 0 and xw