軟件無線電(SDR，Software Defined Radio)由于具備傳統(tǒng)無線電技術(shù)無可比擬的優(yōu)越性，已成為業(yè)界公認(rèn)的現(xiàn)代無線電通信技術(shù)的發(fā)展方向。理想的軟件無線電系統(tǒng)強(qiáng)調(diào)體系結(jié)構(gòu)的開放性和可編程性，減少靈活性著的硬件電路，把數(shù)字化處理(ADC和DAC)盡可能靠近天線，通過軟件的更新改變硬件的配置、結(jié)構(gòu)和功能。目前，直接對(duì)射頻(RF)進(jìn)行采樣的技術(shù)尚未實(shí)現(xiàn)普及的產(chǎn)品化，而用數(shù)字變頻器在中頻進(jìn)行數(shù)字化是普遍采用的方法，其主要思想是，數(shù)字混頻器用離散化的單頻本振信號(hào)與輸入采樣信號(hào)在乘法器中相乘，再經(jīng)插值或抽取濾波，其結(jié)果是，輸入信號(hào)頻譜搬移到所需頻帶，數(shù)據(jù)速率也相應(yīng)改變，以供后續(xù)模塊做進(jìn)一步處理。數(shù)字變頻器在發(fā)射設(shè)備和接收設(shè)備中分別稱為數(shù)字上變頻器(DUC，Digital Upper Converter)和數(shù)字下變頻器(DDC，Digital Down Converter)，它們是軟件無線電通信設(shè)備的關(guān)鍵部什。大規(guī)模可編程邏輯器件的應(yīng)用為現(xiàn)代通信系統(tǒng)的設(shè)計(jì)帶來極大的靈活性。基于FPGA的數(shù)字變頻器設(shè)計(jì)是深受廣大設(shè)計(jì)人員歡迎的設(shè)計(jì)手段。本文的重點(diǎn)研究是數(shù)字下變頻器(DDC)，然而將它與數(shù)字上變頻器(DUC)完全割裂后進(jìn)行研究顯然是不妥的，因此，本文對(duì)數(shù)字上變頻器也作適當(dāng)介紹。 第一章簡(jiǎn)要闡述了軟件無線電及數(shù)字下變頻的基本概念，介紹了研究背景及所完成的主要研究工作。 第二章介紹了數(shù)控振蕩器(NCO)，介紹了兩種實(shí)現(xiàn)方法，即基于查找表和基于CORDIC算法的實(shí)現(xiàn)。對(duì)CORDIc算法作了重點(diǎn)介紹，給出了傳統(tǒng)算法和改進(jìn)算法，并對(duì)基于傳統(tǒng)CORDIC算法的NCO的FPGA實(shí)現(xiàn)進(jìn)行了EDA仿真。 第三章介紹了變速率采樣技術(shù)，重點(diǎn)介紹了軟件無線電中廣泛采用的級(jí)聯(lián)積分梳狀濾波器 (cascaded integratot comb， CIC)和ISOP(Interpolated Second Order polynomial)補(bǔ)償法，對(duì)前者進(jìn)行了基于Matlab的理論仿真和FPGA實(shí)現(xiàn)的EDA仿真，后者只進(jìn)行了基于Matlab的理論仿真。 第四章介紹了分布式算法和軟件無線電中廣泛采用的半帶(half-band，HB)濾波器，對(duì)基于分布式算法的半帶濾波器的FPGA實(shí)現(xiàn)進(jìn)行了EDA仿真，最后簡(jiǎn)要介紹了FIR的多相結(jié)構(gòu)。 第五章對(duì)數(shù)字下變頻器系統(tǒng)進(jìn)行了噪聲綜合分析，給出了一個(gè)噪聲模型。 第六章介紹了數(shù)字下變頻器在短波電臺(tái)中頻數(shù)字化應(yīng)用中的一個(gè)實(shí)例，給出了測(cè)試結(jié)果，重點(diǎn)介紹了下變頻器的：FPGA實(shí)現(xiàn)，其對(duì)應(yīng)的VHDL程序收錄在本文最后的附錄中，希望對(duì)從事該領(lǐng)域設(shè)計(jì)的技術(shù)人員具有一定參考價(jià)值。
軟件無線電(SDR，Software Defined Radio)由于具備傳統(tǒng)無線電技術(shù)無可比擬的優(yōu)越性，已成為業(yè)界公認(rèn)的現(xiàn)代無線電通信技術(shù)的發(fā)展方向。理想的軟件無線電系統(tǒng)強(qiáng)調(diào)體系結(jié)構(gòu)的開放性和可編程性，減少靈活性著的硬件電路，把數(shù)字化處理(ADC和DAC)盡可能靠近天線，通過軟件的更新改變硬件的配置、結(jié)構(gòu)和功能。目前，直接對(duì)射頻(RF)進(jìn)行采樣的技術(shù)尚未實(shí)現(xiàn)普及的產(chǎn)品化，而用數(shù)字變頻器在中頻進(jìn)行數(shù)字化是普遍采用的方法，其主要思想是，數(shù)字混頻器用離散化的單頻本振信號(hào)與輸入采樣信號(hào)在乘法器中相乘，再經(jīng)插值或抽取濾波，其結(jié)果是，輸入信號(hào)頻譜搬移到所需頻帶，數(shù)據(jù)速率也相應(yīng)改變，以供后續(xù)模塊做進(jìn)一步處理。數(shù)字變頻器在發(fā)射設(shè)備和接收設(shè)備中分別稱為數(shù)字上變頻器(DUC，Digital Upper Converter)和數(shù)字下變頻器(DDC，Digital Down Converter)，它們是軟件無線電通信設(shè)備的關(guān)鍵部什。大規(guī)模可編程邏輯器件的應(yīng)用為現(xiàn)代通信系統(tǒng)的設(shè)計(jì)帶來極大的靈活性。基于FPGA的數(shù)字變頻器設(shè)計(jì)是深受廣大設(shè)計(jì)人員歡迎的設(shè)計(jì)手段。本文的重點(diǎn)研究是數(shù)字下變頻器(DDC)，然而將它與數(shù)字上變頻器(DUC)完全割裂后進(jìn)行研究顯然是不妥的，因此，本文對(duì)數(shù)字上變頻器也作適當(dāng)介紹。 第一章簡(jiǎn)要闡述了軟件無線電及數(shù)字下變頻的基本概念，介紹了研究背景及所完成的主要研究工作。 第二章介紹了數(shù)控振蕩器(NCO)，介紹了兩種實(shí)現(xiàn)方法，即基于查找表和基于CORDIC算法的實(shí)現(xiàn)。對(duì)CORDIc算法作了重點(diǎn)介紹，給出了傳統(tǒng)算法和改進(jìn)算法，并對(duì)基于傳統(tǒng)CORDIC算法的NCO的FPGA實(shí)現(xiàn)進(jìn)行了EDA仿真。 第三章介紹了變速率采樣技術(shù)，重點(diǎn)介紹了軟件無線電中廣泛采用的級(jí)聯(lián)積分梳狀濾波器 (cascaded integratot comb， CIC)和ISOP(Interpolated Second Order polynomial)補(bǔ)償法，對(duì)前者進(jìn)行了基于Matlab的理論仿真和FPGA實(shí)現(xiàn)的EDA仿真，后者只進(jìn)行了基于Matlab的理論仿真。 第四章介紹了分布式算法和軟件無線電中廣泛采用的半帶(half-band，HB)濾波器，對(duì)基于分布式算法的半帶濾波器的FPGA實(shí)現(xiàn)進(jìn)行了EDA仿真，最后簡(jiǎn)要介紹了FIR的多相結(jié)構(gòu)。 第五章對(duì)數(shù)字下變頻器系統(tǒng)進(jìn)行了噪聲綜合分析，給出了一個(gè)噪聲模型。 第六章介紹了數(shù)字下變頻器在短波電臺(tái)中頻數(shù)字化應(yīng)用中的一個(gè)實(shí)例，給出了測(cè)試結(jié)果，重點(diǎn)介紹了下變頻器的：FPGA實(shí)現(xiàn)，其對(duì)應(yīng)的VHDL程序收錄在本文最后的附錄中，希望對(duì)從事該領(lǐng)域設(shè)計(jì)的技術(shù)人員具有一定參考價(jià)值。
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
密碼學(xué)界牛人Victor Shoup用C++編寫數(shù)論類庫。
NTL is a high-performance, portable C++ library providing data structures and algorithms for arbitrary length integers for vectors, matrices, and polynomials over the integers and over finite fields and for arbitrary precision floating point arithmetic.
NTL provides high quality implementations of state-of-the-art algorithms for:
* arbitrary length integer arithmetic and arbitrary precision floating point arithmetic
* polynomial arithmetic over the integers and finite fields including basic arithmetic, polynomial factorization, irreducibility testing, computation of minimal polynomials, traces, norms, and more
* lattice basis reduction, including very robust and fast implementations of Schnorr-Euchner, block Korkin-Zolotarev reduction, and the new Schnorr-Horner pruning heuristic for block Korkin-Zolotarev
* basic linear algebra over the integers, finite fields, and arbitrary precision floating point numbers.
These codes require an ASCII input file interp.dat of the following form:
N: Number of polynomial Interpolation Points (Small)
First Sample (x1,y1)
Second Sample (x2,y2)
...
Nth Sample (xN,yN)
N1: Number of Error Evaluation Points (Large)
First Sample (x1,y1)
Second Sample (x2,y2)
...
N1th Sample (xN1,yN1)
The basic topic of this book is solving problems from system and control theory using
convex optimization. We show that a wide variety of problems arising in system
and control theory can be reduced to a handful of standard convex and quasiconvex
optimization problems that involve matrix inequalities. For a few special cases there
are “analytic solutions” to these problems, but our main point is that they can be
solved numerically in all cases. These standard problems can be solved in polynomial-
time (by, e.g., the ellipsoid algorithm of Shor, Nemirovskii, and Yudin), and so are
tractable, at least in a theoretical sense. Recently developed interior-point methods
for these standard problems have been found to be extremely efficient in practice.
Therefore, we consider the original problems from system and control theory as solved.
