完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | Chen, Yuh-Shyan | |
| dc.contributor.author | Chien, Jung-Yu | |
| dc.date.accessioned | 2009-08-23T04:40:52Z | |
| dc.date.accessioned | 2020-05-25T06:37:44Z | - |
| dc.date.available | 2009-08-23T04:40:52Z | |
| dc.date.available | 2020-05-25T06:37:44Z | - |
| dc.date.issued | 2006-10-16T01:56:00Z | |
| dc.date.submitted | 2002-12-18 | |
| dc.identifier.uri | http://dspace.lib.fcu.edu.tw/handle/2377/1376 | - |
| dc.description.abstract | In this paper, a new channelization code scheme, namely ROVSF (Rotated-Orthogonal Variable Spreading Factor), is developed to quickly seeking available codes, compared to using the conventional OVSF (Orthogonal Variable Spreading Factor) in the WCDMA system. When new call enters the system, the OVSF-based scheme always takes lots of time to search for a feasible code. Our ROVSF-based scheme provides a fast code assignment strategy based on new proposed code tree structure. Observe that, our ROVSF scheme offers the same code capability with the OVSF-based schemes, and inherited most of the properties of OVSF code tree. Finally, the simulation result illustrates that the fast-searching achievement of our ROVSF-based scheme. | |
| dc.description.sponsorship | 東華大學,花蓮縣 | |
| dc.format.extent | 15p. | |
| dc.format.extent | 560168 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | zh_TW | |
| dc.relation.ispartofseries | 2002 ICS會議 | |
| dc.subject | channelization code | |
| dc.subject | code assignment | |
| dc.subject | code re-assignment | |
| dc.subject | OVSF | |
| dc.subject | WCDMA | |
| dc.title | A Fast Code Assignment Strategy for W-CDMA Rotated-OVSF Tree with Code-Locality Capability | |
| 分類: | 2002年 ICS 國際計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| ce07ics002002000109.PDF | 547.04 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。