Because using the perfect orthogonal code in CDMA system means elimination of multi-path interference and multiple access interference, we will discuss this aspect in this thesis.
At first, we address a algorithm to how to search a flock of perfect orthogonal code, which consisting of many codes have a characteristic of perfect auto-correlation and perfect cross-correlation to each other. Following, we will compare perfect orthogonal code we find with the present complementary codes include complete complementary code (CCC), super complementary code (SCC), and two-dimensional
orthogonal variable spreading code (2D-OVSF code).
Considering that the run time of searching perfect orthogonal code is long in case of high processing gain (PG), we construct a PC cluster based Linux O.S or Windows O.S for the operation of parallel program to faster our production of perfect orthogonal code.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0902105-111841 |
| Date | 02 September 2005 |
| Creators | Chang, Chin-hsiang |
| Contributors | Chin-der Wann, Hsiao-hwa Chen, Chan-tang Yu |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | Cholon |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0902105-111841 |
| Rights | not_available, Copyright information available at source archive |
Page generated in 0.0024 seconds