Robust Monotonic Optimization Framework for Multicell MISO Systems

The performance of multiuser systems is both difficult to measure fairly and to optimize. Most resource allocation problems are non-convex and NP-hard, even under simplifying assumptions such as perfect channel knowledge, homogeneous channel properties among users, and simple power constraints. We establish a general optimization framework that systematically solves these problems to global optimality. The proposed branch-reduce-and-bound (BRB) algorithm handles general multicell downlink systems with single-antenna users, multiantenna transmitters, arbitrary quadratic power constraints, and robustness to channel uncertainty. A robust fairness-profile optimization (RFO) problem is solved at each iteration, which is a quasi-convex problem and a novel generalization of max-min fairness. The BRB algorithm is computationally costly, but it shows better convergence than the previously proposed outer polyblock approximation algorithm. Our framework is suitable for computing benchmarks in general multicell systems with or without channel uncertainty. We illustrate this by deriving and evaluating a zero-forcing solution to the general problem.Comment: Published in IEEE Transactions on Signal Processing, 16 pages, 9 figures, 2 table

Efficient Heuristic for Resource Allocation in Zero-forcing OFDMA-SDMA Systems with Minimum Rate Constraints

4G wireless access systems require high spectral efficiency to support the ever increasing number of users and data rates for real time applications. Multi-antenna OFDM-SDMA systems can provide the required high spectral efficiency and dynamic usage of the channel, but the resource allocation process becomes extremely complex because of the augmented degrees of freedom. In this paper, we propose two heuristics to solve the resource allocation problem that have very low computational complexity and give performances not far from the optimal. The proposed heuristics select a set of users for each subchannel, but contrary to the reported methods that solve the throughput maximization problem, our heuristics consider the set of real-time (RT) users to ensure that their minimum rate requirements are met. We compare the heuristics' performance against an upper bound and other methods proposed in the literature and find that they give a somewhat lower performance, but support a wider range of minimum rates while reducing the computational complexity. The gap between the objective achieved by the heuristics and the upper bound is not large. In our experiments this gap is 10.7% averaging over all performed numerical evaluations for all system configurations. The increase in the range of the supported minimum rates when compared with a method reported in the literature is 14.6% on average.Comment: 8 figure

Development and implementation of an adaptive digital beamforming network for satellite communication systems

The use of adaptive digital beamforming techniques has, until recently, been largely restricted to high performance military radar systems. Recent advances in digital technology, however, have enabled the design of single chip digital beamforming networks. This, coupled with advances in digital signal processor technology, enables complete beamforming systems to be constructed at a lower cost, thus making the application of these techniques to commercial communications systems attractive. The design and development of such an adaptative digital beamforming network are described. The system is being developed as a proof of concept laboratory based demonstrator to enable the feasibility of adaptive digital beamforming techniques for communication systems to be determined. Ultimately, digital beamforming could be used in conjunction with large array antennas for communication satellite systems. This will enable the simultaneous steering of high gain antenna beams in the direction of gr...Peer ReviewedPostprint (published version

A Genetic Algorithm-based Beamforming Approach for Delay-constrained Networks

In this paper, we study the performance of initial access beamforming schemes in the cases with large but finite number of transmit antennas and users. Particularly, we develop an efficient beamforming scheme using genetic algorithms. Moreover, taking the millimeter wave communication characteristics and different metrics into account, we investigate the effect of various parameters such as number of antennas/receivers, beamforming resolution as well as hardware impairments on the system performance. As shown, our proposed algorithm is generic in the sense that it can be effectively applied with different channel models, metrics and beamforming methods. Also, our results indicate that the proposed scheme can reach (almost) the same end-to-end throughput as the exhaustive search-based optimal approach with considerably less implementation complexity

CABE : a cloud-based acoustic beamforming emulator for FPGA-based sound source localization

Microphone arrays are gaining in popularity thanks to the availability of low-cost microphones. Applications including sonar, binaural hearing aid devices, acoustic indoor localization techniques and speech recognition are proposed by several research groups and companies. In most of the available implementations, the microphones utilized are assumed to offer an ideal response in a given frequency domain. Several toolboxes and software can be used to obtain a theoretical response of a microphone array with a given beamforming algorithm. However, a tool facilitating the design of a microphone array taking into account the non-ideal characteristics could not be found. Moreover, generating packages facilitating the implementation on Field Programmable Gate Arrays has, to our knowledge, not been carried out yet. Visualizing the responses in 2D and 3D also poses an engineering challenge. To alleviate these shortcomings, a scalable Cloud-based Acoustic Beamforming Emulator (CABE) is proposed. The non-ideal characteristics of microphones are considered during the computations and results are validated with acoustic data captured from microphones. It is also possible to generate hardware description language packages containing delay tables facilitating the implementation of Delay-and-Sum beamformers in embedded hardware. Truncation error analysis can also be carried out for fixed-point signal processing. The effects of disabling a given group of microphones within the microphone array can also be calculated. Results and packages can be visualized with a dedicated client application. Users can create and configure several parameters of an emulation, including sound source placement, the shape of the microphone array and the required signal processing flow. Depending on the user configuration, 2D and 3D graphs showing the beamforming results, waterfall diagrams and performance metrics can be generated by the client application. The emulations are also validated with captured data from existing microphone arrays.</jats:p