Please use this identifier to cite or link to this item: http://hdl.handle.net/11455/7885
DC FieldValueLanguage
dc.contributor.advisor楊谷章zh_TW
dc.contributor.advisorGuu-Chang Yangen_US
dc.contributor.author張詒淳zh_TW
dc.contributor.authorChun, Chang Yien_US
dc.date2004zh_TW
dc.date.accessioned2014-06-06T06:40:41Z-
dc.date.available2014-06-06T06:40:41Z-
dc.identifier.urihttp://hdl.handle.net/11455/7885-
dc.description.abstract在近年來,在光纖分碼多工系統中,為了提高在傳統一維的展頻系統中更多的使用者,分波跳頻-時域展頻的二維展頻碼技術已廣泛的討論及研究。在本論文裡將先對於跳頻質數碼的特性與建造先加以介紹,接著敘述同步與非同步系統的差別,最後使用高斯逼近法來做系統效能的數值分析。因為使用高斯逼近法在同步與非同步系統之間的差異在於變異數,而變異數與所有的碰撞機率有關,因此必須求出所有的碰撞機率,而同步系統中跳頻質數碼之間的碰撞情形較為單純,分有碰撞與沒碰撞兩種機率;而非同步系統中頻質數碼之間的碰撞情形較為複雜,分連續碰種、有碰撞、沒碰撞、有碰撞後沒碰撞與沒碰撞後有碰撞四種機率,所以我們去歸納當資料傳輸時,跳頻質數碼之間所有可能互相碰撞的各個機率值,再做數值分析比較其效能。zh_TW
dc.description.abstractIn recent years, a two-dimensional (2-D) wavelength-hopping time-spreading (or so-called wavelength-time) coding scheme has been studied for optical code-division multiple-access (O-CDMA) systems in order to support more subscribers and simultaneous users than the conventional one-dimensional approaches. To further improve the numbers of subscribers and simultaneous users in wavelength-time O-CDMA systems without sacrificing performance, a new class of 2-D carrier-hopping prime codes with very good correlation properties and significantly expanded cardinality was recently constructed. In this thesis, the performances of wavelength-time O-CDMA systems utilizing these new 2-D carrier-hopping prime codes are analyzed and compared under chip-synchronous and chip-asynchronous assumptions.en_US
dc.description.tableofcontentsContents 1 Introduction …………………………………………………....…...…………1 1.1 Background……………………………………….………….……………...1 1.2 Motivation and Outline of Thesis……..………………………………...8 2 Construction of Carrier-Hopping Prime Codes………….……10 2.1 Prime Codes………………………………………………..………………10 2.2 Carrier-Hopping Prime Codes…………………………..………………13 2.2.1 Coding Algorithms………………….…….……………………………15 2.2.2 Correlation Properties…………………………………..........................19 2.2.3 Cardinality……………………………………………………………..20 3 Performance Analysis With the Chip-Synchronous Assumption………………………………………………………………….....23 3.1 Partial Cross-Correlation Functions…………………………………....23 3.2 Performance Analysis With the Chip-Synchronous…………………29 4 Performance Analysis With the Chip-Asynchronous Assumption.........................................................................................................33 4.1 Probabilities of Partial Cross-Correlation Functions…..……....……35 4.2 Numerical Analysis……………………..………………..….……………46 5 Conclusion…………………………………………………...………..52 Reference…………………………………………………………………...………53 List of Tables Table 2.1 Generalized Prime Sequences and Code Sequences Over GF(3) With k=2 12 Table 2.2 Generalized Prime Sequences Over GF(5) With k=2 12 Table 2.3 Relationships of Cardinality, Length, Weight, and Maximum Cross- Correlation Value λc Between the Reed-Solomon-Based Codes [12, 29] and Carrier-Hopping Prime Code, Where the Number of Carriers Is Fixed to a Prime Number p…… ..21 Table 4.1 Carrier-hopping prime code with and the values of when use as an example… .36 Table 4.2 Carrier-hopping prime code with and the values of 37 Table 4.3 Carrier-hopping prime code with and the values of … ..38 Table 4.4 Carrier-hopping prime code with and the values of ..39 Table 4.5 Carrier-hopping prime code with and the values of 40 Table 4.6 The values of for the carrier-hopping prime code with 41 Table 4.7 The values of for the carrier-hopping prime code with … 41 Table 4.8 The values of for the carrier-hopping prime code with ….. 42 Table 4.9 The general form of the three groups of 43 Table 4.10 , , , for the carrier-hopping prime code, where 45 Table 4.11 , , , for the carrier-hopping prime code, where 46 List of Figures Figure 1.1 A typical CDMA fiber-optic network. 4 Figure 1.2 A station in a typical CDMA fiber-optic network with incoherent optical signal processing….. 5 Figure 1.3 An optical sampler 6 Figure 2.1 A matrix, where the shaded squares represent its ordered pairs. The horizontal and vertical numbers in the matrix represent the chip position and transmitting carriers of the ordered pairs, respectively. 14 Figure 2.2 Matrix of the carrier-hopping prime code 16 Figure 2.3 Matrix of the carrier-hopping prime code 17 Figure 2.4 Matrix of the carrier-hopping prime code 17 Figure 3.1 Partial correlation of with at the th and mth data bits 24 Figure 3.2 Cross-correlation functions of the two code sequences 1101000001000 and 1100010000010 for the (a) chip-synchronous and (b) chip-asynchronous cases 28 Figure 4.1 Error probability versus the number of simultaneous users K for an O-CDMA system with the carrier-hopping prime code, for k ={1,2,3}, and , with the chip-synchronous and chip-asynchronous assumptions 48 Figure 4. 2 Error probability versus the number of simultaneous users K for an O-CDMA system with the carrier-hopping prime code, for k = 2, and , with the chip-synchronous and chip-asynchronous assumptions 49 Figure 4. 3 Error probability versus the number of simultaneous users K for an O-CDMA system with the carrier-hopping prime code, for k = 2, and , with the chip-synchronous and chip-asynchronous assumptions 50 Figure 4.4 Error probability versus the number of simultaneous users K for the chip-synchronous and chip-asynchronous assumptions 51zh_TW
dc.language.isoen_USzh_TW
dc.publisher電機工程學系zh_TW
dc.subjectO-CDMAen_US
dc.subject光纖分碼多工zh_TW
dc.subjectcarrier-hopping prime codesen_US
dc.subjectchip-synchronousen_US
dc.subjectchip-asynchronousen_US
dc.subject跳頻質數碼zh_TW
dc.subject同步zh_TW
dc.subject非同步zh_TW
dc.title跳頻質數碼應用於非同步光纖分碼多工系統zh_TW
dc.titlePerformance Analysis of Carrier-Hopping Prime Codes for Chip-Asynchronous Optical CDMA Systemsen_US
dc.typeThesis and Dissertationzh_TW
item.languageiso639-1en_US-
item.openairetypeThesis and Dissertation-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.fulltextno fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
Appears in Collections:電機工程學系所
Show simple item record
 

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.