The first version of PSCAN program (Personal Superconductor Circuit ANalyzer) was introduced in 1991. The program is a general purpose superconductor circuit simulator with an emphasis on the design of Rapid Single-Fl...
详细信息
The first version of PSCAN program (Personal Superconductor Circuit ANalyzer) was introduced in 1991. The program is a general purpose superconductor circuit simulator with an emphasis on the design of Rapid Single-Flux-Quantum (RSFQ) circuits. In the intervening years a number of new features were gradually added to the program. In particular, verification of the correct circuit behavior was enhanced using a special hierarchical Single-Flux-Quantum Hardware Description Language (SFQHDL). Next, a fast heuristic algorithm for margin optimization was introduced, which increased the number of parameters that can be simultaneously optimized in reasonable CPU times. Finally, recently we improved the numerical algorithm used for the simulation by using sparse symmetric positive definite matrices (instead of general structure band matrices as before). As a result, simulation speed has increased almost tenfold. Now it takes about 30 seconds of a CPU time on HP715/100 workstation to run a 2,000-ps simulation of a 120-Josephson-junction circuit, and about a week to optimize all parameters of a two hundred Josephson junction circuit. We have merged all these improvements in a new version of our simulator, PSCAN'96, which will be released by the time of this conference.
We consider in this paper multiuser downlink beamforming with interference cancellation (BFIC). In our BFIC problem, the total transmitted power of the base station (BS) is minimized under signalto- interference-plus-...
详细信息
ISBN:
(纸本)9781479928934
We consider in this paper multiuser downlink beamforming with interference cancellation (BFIC). In our BFIC problem, the total transmitted power of the base station (BS) is minimized under signalto- interference-plus-noise ratio (SINR) requirements of the mobile stations (MSs) and single-stage interference cancellation (SSIC) is adopted at the MSs. The challenge of the problem lies in its combinatorial and non-convex nature. We propose a semidefinite programming (SDP) based branch-and-bound (BnB) algorithm to (optimally) solve the BFIC problem. The SDP-based BnB algorithm employs SDP and sequential second-order cone programming. We further develop a fast heuristic algorithm for large-scale applications. Simulations show that employing SSIC achieves significant reductions in total transmitted BS power. The proposed SDP-based BnB algorithm optimally solves all considered instances of the BFIC problem, and the heuristicalgorithm yields near-optimal solutions.
暂无评论