A stable feedback control of the buffer state using the controlledLagrange multiplier method

We propose a stable feedback control algorithm of the buffer state using the controlled Lagrange multiplier in combined rate-distortion characteristics for a buffer-constrained adaptive quantization. The proposed algorithm is established using feedback control theory and is described by the state equation with nonlinearity in the feedback path. The nonlinearity of the state equation comes from the average distortion-rate curve of the information source. The stability of this buffer control algorithm is shown using Lyapunov stability theory. It is shown that the stability of the algorithm depends on average distortion-rate curve and buffer size, and sufficient conditions for the algorithm to be stable are obtained from the usual average distortion-rate curve. In addition, it is observed from experimental results that the performance of the proposed algorithm and the optimal algorithm is not significantly different. Although the proposed algorithm does not provide optimal performance, the algorithm can be implemented easily with quite low computational complexity, as compared with others.     

Alphabet Partitioning Techniques for Semiadaptive Huffman Coding of Large Alphabets

Practical applications that employ entropy coding for large alphabets often partition the alphabet set into two or more layers, and encode each symbol by using some suitable prefix coding for each layer. In this paper, we formulate the problem of finding an alphabet partitioning for the design of a two-layer semiadaptive code as an optimization problem, and give a solution based on dynamic programming. However, the complexity of the dynamic programming approach can be quite prohibitive for a long sequence and a very large alphabet size. Hence, we also give a simple greedy heuristic algorithm whose running time is linear in the length of the input sequence, irrespective of the underlying alphabet size. Although our dynamic programming and greedy algorithms do not provide a globally optimal solution for the alphabet partitioning problem, experimental results demonstrate that superior prefix coding schemes for large alphabets can be designed using our new approach     

多点协作下行链路单调协同波束形成算法

研究了单基站功率约束条件下的多点协作多输入单输出干扰下行链路系统的和速率最大化非凸优化问题。为有效求解和速率最大化优化问题,首先采用分层优化方法将和速率最大化优化问题分解成发射功率最小化优化问题和单输入单输出干扰信道的和速率最大化优化问题;其次利用二阶锥规划优化方法求解发射功率最小化优化问题;然后利用凸近似和几何规划方法求解单输入单输出干扰信道的和速率最大化优化问题;最后通过交替求解这两个子优化问题,进而提出了一种新颖的单调协同多点波束成形算法;而且利用单有界序列原理证明了所提算法的收敛性。数值仿真表明所提算法只需约四次迭代即可收敛到稳定点,而且所获得的最优性能非常接近穷举搜索算法的最优性能。      

Optimal buffered compression and coding mode selection for MPEG-4shape coding

We propose an optimal buffered compression algorithm for shape coding as defined in the forthcoming MPEG-4 international standard. The MPEG-4 shape coding scheme consists of two steps: first, distortion is introduced by down and up scaling; then, context-based arithmetic encoding is applied. Since arithmetic coding is "lossless," the down up scaling step is considered as a virtual quantizer. We first formulate the buffer-constrained adaptive quantization problem for shape coding, and then propose an algorithm for the optimal solution under buffer constraints. Previously, the fact that a conversion ratio (CR) of 1/4 makes a coded image irritating to human observers for QCIF size was reported for MPEG-4 shape coding. Therefore, careful consideration for small size images such as QCIF should be given to prevent coded images from being unacceptable. To this end, a low bit rate tuned algorithm is proposed in this paper as well. Experimental results are given using an MPEG-4 shape codec.     

Resource Allocation and Adaptive Modulation in Uplink SC-FDMA Systems

In this paper, we study joint power and sub-channel allocation, and adaptive modulation in Single Carrier Frequency Division Multiple Access (SC-FDMA) which is adopted as the multiple access scheme for the uplink in the 3GPP-LTE standard. A sum-utility maximization problem is considered. Unlike OFDMA, in addition to the restriction of allocating a sub-channel to one user at most, the multiple sub-channels allocated to a user in SC-FDMA should be consecutive as well. This renders the resource allocation problem prohibitively difficult and the standard optimization tools (e.g., Lagrange dual approach widely used for OFDMA, etc.) can not help towards its optimal solution. We propose a novel optimization framework for the solution of this problem which is inspired from the recently developed canonical duality theory. We first formulate the optimization problem as binary-integer programming problem, and then transform this binary-integer programming problems into a continuous space canonical dual problem that is a concave maximization problem. Based on the solution of the continuous space dual problem, we derive joint power and sub-channel allocation algorithm whose computational complexity is polynomial. We provide conditions under which the proposed algorithms are optimal. We also propose an adaptive modulation scheme which selects an appropriate modulation strategy for each user. We compare the proposed algorithm with the existing algorithms in the literature to assess their performance. The results show a tremendous performance gain.     

Lagrangean Based Methods for Solving Large-Scale Cellular Network Design Problems

The cellular network design (CND) problem is formulated as a comprehensive linear mixed integer programming model integrating the base station location (BSL) problem, the frequency channel assignment (FCA) problem and the topological network design (TND) problem. A solution algorithm based on Lagrangean relaxation is proposed for solving this complex cellular network design problem. Pursuing the optimum solution through exact algorithms to this problem appears to be unrealistic considering the large scale nature and NP-hardness of the problem. Therefore, the solution algorithm strategy consists in computing effective lower and upper bounds for the problem. Lower bounds are evaluated through a Lagrangean relaxation technique and subgradient method. A Lagrangean heuristic is developed to compute upper bounds based on the Lagrangean solution. The bounds are improved through a customized branch and bound algorithm which takes in account specific knowledge of the problem to improve its efficiency. Thirty two random test instances are solved using the proposed algorithm and the CPLEX optimization package. The results show that the duality gap is excessive, so it cannot guarantee the quality of the solution. However, the proposed algorithm provides optimal or near optimal solutions for the problem instances for which CPLEX also provides the optimal solution. It further suggests that the proposed algorithm provides optimal or near optimal solutions for the other instances too. Finally, the results demonstrate that the proposed algorithm is superior to CPLEX as a solution approach for the CND problem.     

基于量子布谷鸟搜索的认知无线网络频谱分配

为了有效解决认知无线网络频谱分配的离散优化问题,将量子计算引入布谷鸟搜索算法,提出了一种新的组合优化算法——量子布谷鸟搜索算法。该算法使用量子鸟窝表征问题的多维解,通过Lévy flights随机游动方式和量子突变策略快速搜索到全局最优位置。通过使用基准函数验证了算法的高效性,并提出了一种基于量子布谷鸟搜索的认知无线网络频谱分配方法。然后与经典频谱分配算法在不同的网络效益函数下进行仿真性能比较。结果表明,所提出的频谱分配方法能够较快找到全局最优解,并且在不同网络效益函数下均优于已有的经典频谱分配算法。     

Fuzzy predictive filters in model predictive control

The application of model predictive control (MPG) to complex, nonlinear processes results in a nonconvex optimization problem for computing the optimal control actions. This optimization problem can be addressed by discrete search techniques, such as the branch-and-bound method, which has been successfully applied to MPG. The discretization, however, introduces a tradeoff between the number of discrete actions (computation time) and the performance. This paper proposes a solution to these problems by using a fuzzy predictive filter to construct the discrete control alternatives. The filter is represented as an adaptive set of control actions multiplied by a gain factor. This keeps the number of necessary alternatives low and increases the performance. Herewith, the problems introduced by the discretization of the control actions are diminished. The proposed MPC method using fuzzy predictive filters is applied by the temperature control of an air-conditioned test room. Simulations and real-time results show the advantages of the proposed method     

基于变换域的局部最优纯方位航迹关联

针对同平台无源传感器纯方位线关联问题,提出了一种基于变换域的局部最优航迹关联算法。该算法采用霍夫变换( Hough Transform)将方位线映射到参数域等价为点描述,将不同方位线的点描述构建成时间的离散函数,利用时间对准形成具有相同时标的点序列。对关联门限内的目标构建指数判证函数,计算满足关联门限目标的关联矩阵,并确定各航迹关联程度,采用局部寻优方法求取最优关联度的目标作为关联对。实验表明,所提算法具有较好的稳定性及时效性,有效解决了同平台多方位线关联问题。     

Multi-objective routing algorithms for low-earth orbit satellite network

The low-earth orbit (LEO) satellite network, composed of a large number of satellite nodes, is a hot research topic at present. Due to the characteristics of the large-scale LEO satellite network, such as many satellite nodes, short orbit period, large dynamic change of topology, and unstable link-state, its communication quality of service (QoS) requirements are difficult to meet. Aiming at this problem, various factors that may affect data transmission are first analyzed. The network link selection problem is modeled as a multi-constraint optimization decision problem, a routing mathematical model based on linear programming (LP) is designed, and its solution is solved. Aiming at the problem of limited onboard computing resources, a multi-object optimization Dijkstra algorithm (MOODA) is designed. The MOODA finds the optimal path according to the comprehensive performance of the link. It solves the problems of poor comprehensive QoS performance and the low degree of load balancing of the paths found by the Dijkstra algorithm. The simulation results show that the paths found by the two algorithms have good QoS, robustness, and load balancing performance.     

IRS辅助毫米波MIMO系统波束赋形优化的低复杂度方案

智能反射表面(intelligent reflective surface,IRS)被认为是无线通信网络的前景技术之一。然而由于IRS无源波束赋形优化受到本身所具有的非凸恒模约束,现有工作在IRS辅助的多输入多输出(multiple input multiple output,MIMO)系统中的研究只能得到次优解且具有较高的复杂度。本文考虑一个单用户IRS辅助通信的毫米波MIMO系统,为了最大化频谱效率,优化通信接入点AP(access point)端有源和IRS端无源波束赋形矩阵。首先将有源和无源波束赋形矩阵解耦,得到AP的最优有源波束赋形解,将IRS无源波束赋形设计问题推导为一个非凸二次约束二次规划(quadratically constrained quadratic programming,QCQP)问题;采用低复杂度的连续闭式解(successive closed form,SCF)算法求解IRS无源波束赋形矩阵,为了衡量SCF算法性能,分析对比了现有的最优分支界定(branch and bound,BnB)算法。仿真结果验证了SCF算法在IRS相移连续和离散时均能在较低复杂...     

基于禁忌搜索算法的系统辨识

本文研究了禁忌搜索算法解决系统辨识问题的可行性。首先将系统辨识问题转化为参数空间上的优化问题,然后利用禁忌搜索算法求取优化问题的最优解以获得系统参数的最优估计。分别通过对离散和连续系统的仿真研究,表明了本方法的可行性。并与其它方法进行了比较,结果表明本方法在搜索全局最优和克服噪音上都具有很好的效果。     

Optimal power allocation for multi-user OFDM and distributed antenna cognitive radio with RoF

In cognitive radio (CR), power allocation plays an important role in protecting primary user from disturbance of secondary user. Some existing studies about power allocation in CR utilize 'interference temperature' to achieve this protection, which might not be suitable for the OFDM-based CR. Thus in this paper, power allocation problem in multi-user orthogonal frequency division multiplexing (OFDM) and distributed antenna cognitive radio with radio over fiber (RoF) is firstly modeled as an optimization problem, where the limitation on secondary user is not 'interference temperature', but that total throughput of primary user in all the resource units (RUs) must be beyond the given threshold. Moreover, based on the theorem about maximizing the total throughput of secondary user, equal power allocation algorithm is introduced. Furthermore, as the optimization problem for power allocation is not convex, it is transformed to be a convex one with geometric programming, where the solution can be obtained using duality and Karush-Kuhn-Tucker (KKT) conditions to form the optimal power allocation algorithm. Finally, extensive simulation results illustrate the significant performance improvement of the optimal algorithm compared to the existing algorithm and equal power allocation algorithm.     

A joint resource optimization and adaptive modulation framework for uplink single‐carrier frequency‐division multiple access systems

In this paper, we study joint resource allocation and adaptive modulation in single‐carrier frequency‐division multiple access systems, which is adopted as the multiple access scheme for the uplink in the 3GPP Long Term Evolution standard. We formulate an adaptive modulation and sum‐cost minimization (JAMSCmin) problem. Unlike orthogonal frequency‐division multiple access, in addition to the restriction of allocating a subchannel to one user at most, the multiple subchannels allocated to a user in single‐carrier frequency‐division multiple access systems should be consecutive as well. This renders the resource allocation problem prohibitively difficult and the standard optimization tools (e.g., Lagrange dual approach widely used for orthogonal frequency‐division multiple access, etc.) cannot help towards its optimal solution. We propose a novel optimization framework for the solution of this problem that is inspired from the recently developed canonical duality theory. We first formulate the optimization problem as binary‐integer programming (BIP) problem and then transform this BIP problem into continuous space canonical dual problem that is the concave maximization problem. Based on the solution of the canonical dual problem, we derive joint resource allocation and adaptive modulation algorithm, which has polynomial time complexity. We provide conditions under which the proposed algorithm is optimal. We compare the proposed algorithm with the existing algorithms in the literature. The results show a tremendous performance gain. Copyright © 2013 John Wiley & Sons, Ltd.     

Resource allocation in satellite networks: certainty equivalent approaches versus sensitivity estimation algorithms

In this paper, we consider a resource allocation problem for a satellite network, where variations of fading conditions are added to those of traffic load. Since the capacity of the system is finite and divided in finite discrete portions, the resource allocation problem reveals to be a discrete stochastic programming one, which is typically NP‐hard. We propose a new approach based on the minimization over a discrete constraint set using an estimation of the gradient, obtained through a ‘relaxed continuous extension’ of the performance measure. The computation of the gradient estimation is based on the infinitesimal perturbation analysis technique, applied on a stochastic fluid model of the network. No closed‐forms of the performance measure, nor additional feedback concerning the state of the system, and very mild assumptions on the probabilistic properties about the statistical processes involved in the problem are requested. Such optimization approach is compared with a dynamic programming algorithm that maintains a perfect knowledge about the state of the satellite network (traffic load statistics and fading levels). The comparison shows that the sensitivity estimation capability of the proposed algorithm allows to maintain the optimal resource allocation in dynamic conditions and it is able to provide even better performance than the one reached by employing the dynamic programming approach. Copyright © 2004 John Wiley & Sons, Ltd.     

Optimal video stream multiplexing through linear programming

This paper presents a new optimal multiplexing scheme for compressed video streams based on their individual e-PCRTT transmission schedules. A linear programming algorithm is proffered, which takes into account the different constraints of each client. The algorithm simultaneously finds the optimum total multiplexed and individual stream schedules that minimize the peak transmission rate. Since the problem is formulated as a linear program it is bounded in polynomial time. It is shown that the algorithm succeeds in obtaining maximum bandwidth utilization with Quality of Service (QoS) guarantees. Simulation results using 10 real MPEG-1 video sequences are presented. The optimal multiplexing linear programming results are compared to the e-PCRTT and Join-the-Shortest-Queue (JSQ) procedures in terms of peak transmission bandwidth, P-loss performance and standard deviation. For several client buffer sizes, the rate obtained by our LP solution when compared to a previous e-PCRTT and JSQ methods resulted in reductions of 47% and 56%, respectively. This implies for a fixed rate problem that the proposed scheme can allow an increase in the number of simultaneously served video streams.     

A bound dynamic programming for solving reliability redundancy optimization

This paper presents a bound dynamic programming for solving reliability optimization problems, in which the optimal solution is obtained in the bound region of the problem by using dynamic programming. This algorithm is based on the studies of the characters of the problem and Misra [IEEE Trans. Reliability 40, 81–91 (1991)] bound search technique. With some examples, the proposed algorithm has been found to be more economical and effective than Misra integer programming to obtain the exact solutions of reliability redundancy optimization problems.     

Variations on optimal and suboptimal handoff control for wirelesscommunication systems

The design of handoff algorithms for cellular communication systems based on signal-strength measurements is addressed. The system is modeled using a hybrid framework: a mixture of continuous state and discrete event systems. The handoff problem is formulated as an optimization problem to control the switchings within the discrete event system. Performance is evaluated as a function of the expected number of handoffs, the expected handoff delay, and the expected number of signal degradations. A signal degradation occurs when the signal level falls below a threshold. The cost of handoff delay is explicitly specified, in contrast to prior work. Various optimization problems are posed to trade off between these quantities. Based on the optimal solutions which are obtained through dynamic programming, suboptimal versions are proposed for ease of implementation. The performance of the suboptimal algorithm which trades off between the expected number of handoffs and the expected number of signal degradations is improved through the use of signal averaging; however, this algorithm suffers from excessive handoff delay. Therefore, the tradeoff between handoff delay and number of handoffs is considered. The corresponding suboptimal algorithm provides nearly one handoff and almost no delay, which is ideal if call quality is also good. Finally, an algorithm which is a combination of the two previous algorithms is explored     

基于模拟退火算法的风电场消纳线路负载拓扑结构研究

基于当前线路负载率具有较高的突发性、较高的实时性等特点,将对线路资源利用率和电流控制问题所采用的模拟退火算法进行风电场拓扑结构模型优化。利用模拟退火算法对线路负载均衡问题进行搜索,随后在全局最优区域附近进行局部拓扑结构优化,就可以找到线路负载均衡问题最优解。仿真研究表明,此方法不但完善了局部搜索速度,还提高了线路消纳的利用率,明显改善了线路拓扑负载不均衡的情形,进而可以为大型风电场建设中的功率设备线路拓扑优化提供有效的参考。