Channel assignment for cellular radio using extended dynamic programming

The channel assignment is an important aspect of cellular radio networks. Because of the limitations on the frequency spectrum, the optimal or near-optimal channel assignment has become an essential part of the network operations of wireless personal communication systems. We formulate a new strategy for the channel assignment problem in agreement with the electromagnetic compatibility constraints. We introduce and formulate the extended dynamic programming (EDP), as an extension of dynamic programming for solving the channel assignment problem in a cellular system. Using EDP an algorithm is developed for fixed channel assignment problem and it is tested and compared with other existing methods by solving different problems. In agreement with electromagnetic compatibility constraints, solution strategy based on EDP algorithm finds many valid solutions with minimum possible bandwidth.     

基于阵型和动态角色分配的射门协作方法

针对复杂、实时、动态的RoboCup仿真环境下的多智能体协作问题,提出在比赛阵型和基本角色的基础上,利用阵型中关键智能体来组织实现多智能体间协作,分配协作智能体的角色,并利用这种方法来规划进攻时的射门动作.本文主要利用该协作方法,根据球员和场上信息建立在进攻时对方禁区范围内的状态模型,利用关键球员组织协作策略、对球员进...     

Huffman coding of DCT coefficients using dynamic codeword assignment and adaptive codebook selection

In many image sequence compression applications, Huffman coding is used to eliminate statistical redundancy resident in given data. The Huffman table is often pre-defined to reduce coding delay and table transmission overhead. Local symbol statistics, however, may be much different from the global ones manifested in the pre-defined table. In this paper, we propose three Huffman coding methods in which pre-defined codebooks are effectively manipulated according to local symbol statistics. The first proposed method dynamically modifies the symbol-codeword association without rebuilding the Huffman tree itself. The encoder and decoder maintain identical symbol-codeword association by performing the same modifications to the Huffman table, thus eliminating extra transmission overhead. The second method adaptively selects a codebook from a set of given ones, which produces the minimum number of bits. The transmission overhead in this method is the codebook selection information, which is observed to be negligible compared with the bit saving attained. Finally, we combine the two aforementioned methods to further improve compression efficiency. Experiments are carried out using five test image sequences to demonstrate the compression performance of the proposed methods.