Location:
Search - H.Minn
Search list
Description: This is a paper of \"a rbust timing and freqeuncy synchronization for ofdm systems\"
Platform: |
Size: 698690 |
Author: Tony |
Hits:
Description: This is a paper of "a rbust timing and freqeuncy synchronization for ofdm systems"
Platform: |
Size: 698368 |
Author: Tony |
Hits:
Description: The combinatorial core of the OVSF code assignment problem
that arises in UMTS is to assign some nodes of a complete binary
tree of height h (the code tree) to n simultaneous connections, such that
no two assigned nodes (codes) are on the same root-to-leaf path. Each
connection requires a code on a specified level. The code can change over
time as long as it is still on the same level. We consider the one-step code
assignment problem: Given an assignment, move the minimum number of
codes to serve a new request. Minn and Siu proposed the so-called DCAalgorithm
to solve the problem optimally. We show that DCA does not
always return an optimal solution, and that the problem is NP-hard.
We give an exact nO(h)-time algorithm, and a polynomial time greedy
algorithm that achieves approximation ratio Θ(h). Finally, we consider
the online code assignment problem for which we derive several results-The combinatorial core of the OVSF code assignment problemthat arises in UMTS is to assign some nodes of a complete binarytree of height h (the code tree) to n simultaneous connections, such thatno two assigned nodes (codes) are on the same root-to- leaf path. Eachconnection requires a code on a specified level. The code can change overtime as long as it is still on the same level. We consider the one-step codeassignment problem: Given an assignment, move the minimum number ofcodes to serve a new request. Minn and Siu proposed the so-called DCAalgorithmto solve the problem optimally. We show that DCA does notalways return an optimal solution, and that the problem is NP-hard.We give an exact nO (h)-time algorithm, and a polynomial time greedyalgorithm that achieves approximation ratio Θ (h). Finally, we considerthe online code assignment problem for which we derive several results
Platform: |
Size: 157696 |
Author: shilei |
Hits:
Description: 对OFDM经典算法H.Minn算法进行仿真，形成定时度量仿真图-H.M inn to OFDM classical algorithm simulation, formation algorithm simulation diagram. Timing metric
Platform: |
Size: 1024 |
Author: 鲁莎莎 |
Hits:
Description: 经典的schmidl&cox、H.Minn、以及park同步方案，希望做ofdm项目的同学对你们有所帮助.-Robust Frequency and Timing
Synchronization for OFDM
Platform: |
Size: 933888 |
Author: 朱四洋 |
Hits: