goText is a program for mobile phones that allows you to send text messages over GPRS/EDGE/umts. It was made in Java (J2ME) MIDP 1.0 CLDC 1.0 and so avaible for all java mobile devices.
Harri Holma的umts FOR WCDMA(第二版) 英文版，很有價值的一本書，作者是Nokia的專家，里面的內(nèi)容簡明，最重要的是內(nèi)容權(quán)威準(zhǔn)確，比那些很厚但內(nèi)容混亂的書好多了。由陳澤強(qiáng)等翻譯的中文版也不錯，但留一本英文版輔助查閱絕對有必要。
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
