Low-complexity joint transmit and receive antenna selection for MIMO systems

In this paper, we present a low-complexity algorithm for real-time joint transmit and receive antenna selection in MIMO systems. The computational complexity of exhaustive search in this problem grows exponentially with the number of transmit and receive antennas. We apply Binary Particle Swarm Optimization (BPSO) to the joint transmit and receive antenna selection problem. In addition, applying the general BPSO to joint antenna selection, we also present a specific improvement to this population-based heuristic algorithm, namely, we feed cyclically shifted initial population so that the average convergence time (the number of iterations until reaching an acceptable solution) is reduced. The proposed BPSO for joint antenna selection problem has a low computational complexity, and its effectiveness is verified through simulation results.     

基于Sorenson相似系数的快速天线选择算法

穷举搜索天线选择算法的计算复杂度随天线的增多变大,影响实际应用。针对该问题,提出基于Sorenson相似系数的快速天线选择算法。利用Sorenson相似系数来表征信道矩阵行向量间的相关性,通过逐行递增的方法,选择相似系数最小且行范数最大的接收天线,从而最大程度地增加系统容量。仿真结果表明,该算法在射频链路较少时计算复杂度很低,且能获得接近最优算法的中断容量。     

Autonomic cloud resource provisioning and scheduling using meta-heuristic algorithm

We investigate that resource provisioning and scheduling is a prominent problem due to heterogeneity as well as dispersion of cloud resources. Cloud service providers are building more and more datacenters due to demand of high computational power which is a serious threat to environment in terms of energy requirement. To overcome these issues, we need an efficient meta-heuristic technique that allocates applications among the virtual machines fairly and optimizes the quality of services (QoS) parameters to meet the end user objectives. Binary particle swarm optimization (BPSO) is used to solve real-world discrete optimization problems but simple BPSO does not provide optimal solution due to improper behavior of transfer function. To overcome this problem, we have modified transfer function of binary PSO that provides exploration and exploitation capability in better way and optimize various QoS parameters such as makespan time, energy consumption, and execution cost. The computational results demonstrate that modified transfer function-based BPSO algorithm is more efficient and outperform in comparison with other baseline algorithm over various synthetic datasets.

     

一种基于SLNR预编码的天线与用户联合选择算法*

针对在多用户MIMO系统中天线与用户联合选择算法复杂度高的问题,依据SLNR预编码算法特点,提出了一种基于SLNR预编码的天线与用户联合选择算法。分析了天线与用户选择顺序对基于SLNR预编码算法的多用户MIMO系统性能影响,给出了先天线后用户的次最优选择策略。所提算法首先为每个用户选取最优的单天线,再利用贪婪思想进行用户选择。仿真结果表明,所提算法与穷举算法相比和容量性能在020 dB的信噪比范围内损失均保持在1.6 dB左右;而误比特性能与穷举法相比在10-3有2 dB左右损失,但是所提算法复杂度与穷举法相比下降明显。     

Multi-cost job routing and scheduling in Grid networks

A key problem in Grid networks is how to efficiently manage the available infrastructure, in order to satisfy user requirements and maximize resource utilization. This is in large part influenced by the algorithms responsible for the routing of data and the scheduling of tasks. In this paper, we present several multi-cost algorithms for the joint scheduling of the communication and computation resources that will be used by a Grid task. We propose a multi-cost scheme of polynomial complexity that performs immediate reservations and selects the computation resource to execute the task and determines the path to route the input data. Furthermore, we introduce multi-cost algorithms that perform advance reservations and thus also find the starting times for the data transmission and the task execution. We initially present an optimal scheme of non-polynomial complexity and by appropriately pruning the set of candidate paths we also give a heuristic algorithm of polynomial complexity. Our performance results indicate that in a Grid network in which tasks are either CPU- or data-intensive (or both), it is beneficial for the scheduling algorithm to jointly consider the computational and communication problems. A comparison between immediate and advance reservation schemes shows the trade-offs with respect to task blocking probability, end-to-end delay and the complexity of the algorithms.     

一种基于码本聚类的低复杂度用户选择算法

现有块对角化(BD)预编码系统用户选择算法较少考虑利用已选用户与剩余用户之间的关系来排除不可选用户.针对这点不足,给出了一种采用码本聚类的低复杂度用户选择算法( CodeGreedy算法).该算法采用弦距离刻画用户信道的相关性,以此为依据将用户划分到不同码本空间中,聚集在同一码本空间的用户信道具有较强的相关性,形成互斥...     

A high speed 1000 fps CMOS image sensor with low noise global shutter pixels

A low read noise 8T global shutter pixel for high speed CMOS image sensor is proposed in this paper.The pixel has a pixel level sample-and-hold circuit and an in-pixel amplifier whose gain is larger than one.Using pixel level sample-and-hold circuit,the KTC noise on FD node can be effectively cancelled by correlated double sampling operation.The in-pixel amplifier with a gain larger than one is employed for reducing the pixel level sample-and-hold capacitors thermal noise and their geometric size.A high speed 1000 fps 256×256 CMOS image sensor based on the pixel is implemented in 0.18μm CMOS process.The chip active area is 5 mm×7 mm with a pixel size of 14μm×14μm.The developed sensor achieves a read noise level as low as 14.8e-while attaining a high fill factor of 40%.The full well capacity can contain 30840e-and the resulting signal dynamic range is 66 dB.     

多用户MIMO系统用户选择算法

MIMO系统在不增加带宽的情况下可以有效提高频谱效率。但由于多用户MIMO系统现存预编码方法和系统天线数目的限制,使得系统容纳用户数为一限定值,无法满足实际需要。针对这一问题,给出一种等功率分配的用户选择算法,其通过对信道容量等效近似来得到较优的用户组。为了降低用户选择复杂度,给出一种迭代的次优用户选择算法,达到快速选取较优用户的目的。仿真结果表明所提算法可以获得较好的系统容量性能,适用于实际通信系统。     

多用户MIMO系统低复杂度收发联合波束成形方案

基于多用户多输入多输出(MIMO)有限反馈系统提出了一种收发联合波束成形方法。该方法在发送端采用每个用户酉速率控制(PU2RC)波束成形技术,在接收端采用基于信干噪比(SINR)最大化的天线合并算法。天线合并算法利用用户SINR的广义Rayleigh熵特性寻找最佳的天线合并矢量。仿真结果表明,该方法能充分利用信道信息,不仅改善了传统PU2RC系统的和速率性能,相对于已有的迫零(ZF)联合波束成形方法,对信道状态信息的量化误差的敏感性更低,用户选择算法的复杂度更低,且低速率反馈条件下和速率性能更优。     

基于离散粒子群优化的多用户MIMO用户选择*

为了在降低计算复杂度的同时获得良好的性能,给出了一种基于离散粒子群优化的多用户MIMO用户选择方法.该方法基于sum-MSE预编码,所支持的用户数目取决于接收方的子流数之和,改变了传统的用户选择方法支持的用户接收天线数之和不大于发送天线数的限制.当移动台子流个数小于接收天线数时,所研究的用户选择方法可以增加同时服务的用户个数,获得更高的系统和容量.仿真结果表明,该方法能够在系统性能和复杂度之间进行良好的折中.     

Opportunistic scheduling and incentive mechanism for OFDMA networks with D2D relaying

The device-to-device (D2D) relaying is considered one of promising technologies to improve the spectral efficiency and extend the coverage of the cellular system with low additional costs. In the system with D2D relaying, some of user equipments (UEs) can act as relay stations (RSs) that forward other UEs’ data from/to the base station (BS). Compared with the RS, the D2D relaying has several advantages such as low deployment costs and high flexibility. We study an opportunistic subchannel scheduling problem in the OFDMA cellular network with D2D relaying in this paper. We formulate a stochastic optimization problem to maximize the sum-rate of the system with D2D relaying while satisfying the minimum average data rate requirement for each UE, and then develop an opportunistic scheduling algorithm by solving it. Due to a high computational complexity of the optimal scheduling algorithm, we also propose a heuristic algorithm with a lower computational complexity. In addition, since UEs that participate in D2D relaying sacrifice their resources to relay other UEs’ data, we also study incentive mechanisms to compensate their sacrifices. Through simulation results, we show the performance of our algorithms and the effects of our incentive mechanisms.     

Efficient link scheduling with joint power control and successive interference cancellation in wireless networks无线网络中联合功率控制和串行干扰消除的高效链路调度算法

Existing works have addressed the interference mitigation by any two of the three approaches: link scheduling, power control, and successive interference cancellation (SIC). In this paper, we integrate the above approaches to further improve the spectral efficiency of the wireless networks and consider the max-min fairness to guarantee the transmission demand of the worst-case link. We formulate the link scheduling with joint power control and SIC (PCSIC) problem as a mixed-integer non-linear programming (MINLP), which has been proven to be NP-complete. Consequently, we propose an iterative algorithm to tackle the problem by decomposing it into a series of linear subproblems, and then the analysis shows that the algorithm has high complexity in the worst case. In order to reduce the computational complexity, we have further devised a two-stage algorithm with polynomial-time complexity. Numerical results show the performance improvements of our proposed algorithms in terms of the network throughput and power consumption compared with the link scheduling scheme only with SIC.     

A computationally efficient genetic algorithm for MIMO broadcast scheduling

In conventional single-input single-output (SISO) systems, the capacity is limited as base station can provide service to only one user at any instant. However, multiuser (MU) multiple-input multiple-output (MIMO) systems deliver optimum system capacity by providing service to multiple users (as many as transmit antennas) simultaneously according to dirty paper coding (DPC) scheme. However, DPC is an exhaustive search algorithm (ESA) where the user encoding sequence is important to transmit data to multiple users. Exhaustive search becomes imperative as the search space grows with number of users and number of transmit antennas in the MU MIMO system. This can be treated as an optimization problem of maximizing the achievable system sum-rate. In this paper, it has been demonstrated that combined user and antenna scheduling (CUAS) with binary genetic algorithm (BGA) adopting elitism and adaptive mutation (AM) achieves about 97–99% of system sum-rate obtained by ESA (DPC) with significantly reduced computational and time complexity. It has been shown that BGA is able to find the globally optimum solution for MU MIMO systems well within the time interval of modern wireless packet data communications. However, it is interesting to observe that BGA is able to find a solution to CUAS close to the optimum value quite rapidly. In this paper, it is also shown that BGA with elitism and AM achieves higher throughput than limited feedback scheduling schemes as well.     

一种改进的智能电网能耗调度算法

为了提高电网的运行效率,提出一种新的实时能耗调度算法,通过考虑负载不确定性来实现每个用户的电费最小化.我们将负载调度描述为一个优化问题.为了降低计算复杂度,提出一种近似动态规划算法,以解决电器运行的调度问题.在研究问题时,考虑了必须运行和可控运行在内的不同电器.与大部分当前需求侧管理算法假设完全知晓用户用电需求不同,算法只需知道将来部分需求的估计即可.仿真结果表明,能量调度算法既降低了用户用电支出,又提高了负载需求的峰均比,为用户和电力公司带来收益.     

EH-MIMO协作网络中数据与能量天线选择性能分析

为了实现有效的能量利用和数据传输,针对无线EH-MIMO协作系统,提出了在节点的多根天线中选择部分天线进行能量收集和部分天线进行数据传输的遍历最优算法。选择结果即是所提出的EH-MIMO协作模型信道容量最大化问题的遍历解决方案,因此在容量性能方面是最优的。为了降低算法的复杂度,进一步提出了递增天线选择和递减天线选择的两种次优天线选择算法,并与最优算法进行了对比。仿真结果表明,次优算法在系统信道容量和能量效率方面接近最优算法,同时具有较低的复杂度。     

A Pareto archive particle swarm optimization for multi-objective job shop scheduling

In this paper, we present a particle swarm optimization for multi-objective job shop scheduling problem. The objective is to simultaneously minimize makespan and total tardiness of jobs. By constructing the corresponding relation between real vector and the chromosome obtained by using priority rule-based representation method, job shop scheduling is converted into a continuous optimization problem. We then design a Pareto archive particle swarm optimization, in which the global best position selection is combined with the crowding measure-based archive maintenance. The proposed algorithm is evaluated on a set of benchmark problems and the computational results show that the proposed particle swarm optimization is capable of producing a number of high-quality Pareto optimal scheduling plans.     

Binary particle swarm optimization (BPSO) based state assignment for area minimization of sequential circuits

State assignment (SA) for finite state machines (FSMs) is one of the main optimization problems in the synthesis of sequential circuits. It determines the complexity of its combinational circuit and thus area, delay, testability and power dissipation of its implementation. Particle swarm optimization (PSO) is a non-deterministic heuristic that optimizes a problem by iteratively trying to improve a candidate solution with regard to a given measure of quality. PSO optimizes a problem by having a population of candidate solutions called particles, and moving them around in the search-space according to a simple mathematical formulae. In this paper, we propose an improved binary particle swarm optimization (BPSO) algorithm and demonstrate its effectiveness in solving the state assignment problem in sequential circuit synthesis targeting area optimization. It will be an evident that the proposed BPSO algorithm overcomes the drawbacks of the original BPSO algorithm. Experimental results demonstrate the effectiveness of the proposed BPSO algorithm in comparison to other BPSO variants reported in the literature and in comparison to Genetic Algorithm (GA), Simulated Evolution (SimE) and deterministic algorithms like Jedi and Nova.     

基于分层聚类和干扰对齐的MIMO链路调度算法

为了降低干扰对齐所需的处理开销,将链路划分为多个簇分别进行处理成为可行的办法之一。针对现有簇划分算 法中运算复杂度较高的问题,本文提出了一种基于最小信干比的簇划分算法。在此基础上,针对所有簇同时通信造成部分簇内链路接收端信干噪比（Signal to interference plus noise ratio,SINR）较低的问题,本文将以链路为单位的调度问题等效为以簇为单位的调度问题,提出了一种基于层次聚类的簇调度算法。理论与仿真实验结果表明,本文所提出的簇划分算法的运算复杂度明显低于现有算法,且相同条件下的系统平均吞吐量更高。同时,本文提出的基于簇层次聚类的调度算法不同程度地提升了各簇内链路接收端的SINR,系统可根据不同的性能需求进行调度策略选择。     

Compressive sampling optimization for user signal parameter estimation in massive MIMO systems

As the most promising technology in wireless communications, massive multiple-input multiple-output (MIMO) faces a significant challenge in practical implementation because of the high complexity and cost involved in deploying a separate front-end circuit for each antenna. In this paper, we apply the compressive sampling technique to reduce the number of required front-end circuits in the analog domain and the computational complexity in the digital domain. Unlike the commonly adopted random projections, we exploit the a priori probability distribution of the user positions to optimize the compressive sampling strategy, so as to maximize the mutual information between the compressed measurements and the direction-of-arrival (DOA) of user signals. With the optimized compressive sampling strategy, we further propose a compressive sampling Capon spatial spectrum estimator for DOA estimation. In addition, the user signal power is estimated by solving a compressed measurement covariance matrix fitting problem. Furthermore, the user signal waveforms are estimated from a robust adaptive beamformer through the reconstruction of an interference-plus-noise compressed covariance matrix. Simulation results clearly demonstrate the performance advantages of the proposed techniques for user signal parameter estimation as compared to existing techniques.     

结合用户聚类和评分偏好的推荐算法*

针对推荐算法中用户评分矩阵维度高、计算量大的问题,为更加真实地反映用户本身评分偏好,提出一种结合用户聚类和评分偏好的推荐算法。先利用PCA降维和k-means聚类对用户评分矩阵进行预处理,在最近邻选取方法上,添加用户共同评分数量作为约束,利用用户和相似簇的相似度对相似簇内评分加权求和生成基本预测评分;再综合用户评分偏置和用户项目类型偏好,建立用户评分偏好模型;最后通过多元线性回归确定每部分的权重,生成最终的预测评分。对比实验结果表明,新算法能更真实地反映用户评分,有效减少计算量并提高推荐系统的预测准确率,更好地满足用户对于推荐系统的个性化需求。