arXiv subjects

Markku Juntti

Publications and source records attributed to Markku Juntti.

143 records · Page 8Linked to original sources

arXiv2018

Low Complexity Time Domain Semi-Blind MIMO-OFDM Channel Estimation Using Adaptive Bussgang Algorithm

In this paper, a low complexity time domain semi-blind algorithm is proposed to estimate and track the time varying MIMO OFDM channels. First, the proposed least mean squares (LMS) based algorithm is developed for the training mode and then is extended for the blind mode of the operation by combining with the decision direction (DD) or adaptive Bussgang algorithm (ABA) techniques. In the blind mode, because of decision errors, a smaller step size is considered for the LMS algorithm and the channel estimation is run a few times to improve its precision. In each round of the estimation in the blind mode, the step size is decreased to form some kind of annealing. Both DD LMS and ABA LMS techniques are simulated and compared to the full training case and MSE of channel estimation error is considered as comparison criterion. It is shown for 2x4 DD LMS and for 4x4 ABA LMS algorithms present near full training case estimation error. Of course in some scenarios the former proposed technique performs better and in other scenarios the latter is better and therefore combine of it can be very interesting in all channel conditions.

eess.SP↗

arXiv2017

Energy-Efficient Beam Coordination Strategies with Rate Dependent Processing Power

This paper proposes energy-efficient coordinated beamforming strategies for multi-cell multi-user multiple-input single-output system. We consider a practical power consumption model, where part of the consumed power depends on the base station or user specific data rates due to coding, decoding and backhaul. This is different from the existing approaches where the base station power consumption has been assumed to be a convex or linear function of the transmit powers. Two optimization criteria are considered, namely network energy efficiency maximization and weighted sum energy efficiency maximization. We develop successive convex approximation based algorithms to tackle these difficult nonconvex problems. We further propose decentralized implementations for the considered problems, in which base stations perform parallel and distributed computation based on local channel state information and limited backhaul information exchange. The decentralized approaches admit closed-form solutions and can be implemented without invoking a generic external convex solver. We also show an example of the pilot contamination effect on the energy efficiency using a heuristic pilot allocation strategy. The numerical results are provided to demonstrate that the rate dependent power consumption has a large impact on the system energy efficiency, and, thus, has to be taken into account when devising energy-efficient transmission strategies. The significant gains of the proposed algorithms over the conventional low-complexity beamforming algorithms are also illustrated.

cs.IT↗

arXiv2017

Joint Transmission with Limited Backhaul Connectivity

Downlink beamforming techniques with low signaling overhead are proposed for joint processing coordinated (JP) multi-point transmission. The objective is to maximize the weighted sum rate within joint transmission clusters. As the considered weighted sum rate maximization is a non-convex problem, successive convex approximation techniques, based on weighted mean-squared error minimization, are applied to devise algorithms with tractable computational complexity. Decentralized algorithms are proposed to enable JP even with limited backhaul connectivity. These algorithms rely provide a variety of alternatives for signaling overhead, computational complexity and convergence behavior. Time division duplexing is exploited to design transceiver training techniques for two scenarios: stream specific estimation and direct estimation. In the stream specific estimation, the base station and user equipment estimate all of the stream specific precoded pilots individually and construct the transmit/receive covariance matrices based on these pilot estimates. With the direct estimation, only the intended transmission is separately estimated and the covariance matrices constructed directly from the aggregate system-wide pilots. The impact of feedback/backhaul signaling quantization is considered, in order to further reduce the signaling overhead. Also, user admission is being considered for time-correlated channels. The enhanced transceiver convergence rate enables periodic beamformer reinitialization, which greatly improves the achieved system performance in dense networks.

cs.IT↗

arXiv2017

Energy-Efficient Joint Unicast and Multicast Beamforming with Multi-Antenna User Terminals

This paper studies energy-efficient joint transmit and receive beamforming in multi-cell multi-user multiple-input multiple-output systems. We consider conventional network energy efficiency metric where the users can receive unicasting streams in addition to the group-specific common multicasting streams which have certain rate constraints. The goal is to use the transmission resources more efficiently to improve the energy efficiency, when the users are equipped with multiple antennas. Numerical results show the achieved energy efficiency gains by using the additional degrees of freedom of the multicasting transmission to private message unicasting.

cs.IT↗

arXiv2017

Conic Quadratic Formulations for Wireless Communications Design

As a wide class of resource management problems in wireless communications are nonconvex and even NP-hard in many cases, finding globally optimal solutions to these problems is of little practical interest. Towards more pragmatic approaches, there is a rich literature on iterative methods aiming at finding a solution satisfying necessary optimality conditions to these problems. These approaches have been derived under several similar mathematical frameworks such as inner approximation algorithm, concave-convex procedure, majorization-minimization algorithm, and successive convex approximation (SCA). However, a large portion of existing algorithms arrive at a relatively generic program at each iteration, which is less computationally efficient compared to a more standard convex formulation. This paper proposes \emph{numerically efficient} transformations and approximations for SCA-based methods to deal with nonconvexity in wireless communications design. More specifically, the central goal is to show that various nonconvex problems in wireless communications can be iteratively solved by conic quadratic optimization. We revisit various examples to demonstrate the advantages of the proposed approximations. Theoretical complexity analysis and numerical results show the superior efficiency in terms of computational cost of our proposed solutions compared to the existing ones.

cs.IT↗

arXiv2017

Energy Efficient Precoding C-RAN Downlink with Compression at Fronthaul

This paper considers a downlink transmission of cloud radio access network (C-RAN) in which precoded baseband signals at a common baseband unit are compressed before being forwarded to radio units (RUs) through limited fronthaul capacity links. We investigate the joint design of precoding, multivariate compression and RU-user selection which maximizes the energy efficiency of downlink C-RAN networks. The considered problem is inherently a rank-constrained mixed Boolean nonconvex program for which a globally optimal solution is difficult and computationally expensive to find. In order to derive practically appealing solutions, we invoke some useful relaxation and transformation techniques to arrive at a more tractable (but still nonconvex) continuous program. To solve the relaxation problem, we propose an iterative procedure based on DC algorithms which is provably convergent. Numerical results demonstrate the superior of the proposed solution in terms of achievable energy efficiency compared to existing schemes.

cs.IT↗

arXiv2017

Globally Optimal Beamforming Design for Downlink CoMP transmission with Limited Backhaul Capacity

This paper considers a multicell downlink channel in which multiple base stations (BSs) cooperatively serve users by jointly precoding shared data transported from a central processor over limited-capacity backhaul links. We jointly design the beamformers and BS-user link selection so as to maximize the sum rate subject to user-specific signal-to-interference-noise (SINR) requirements, per-BS backhaul capacity and per-BS power constraints. As existing solutions for the considered problem are suboptimal and their optimality remains unknown due to the lack of globally optimal solutions, we characterized this gap by proposing a globally optimal algorithm for the problem of interest. Specifically, the proposed method is customized from a generic framework of a branch and bound algorithm applied to discrete monotonic optimization. We show that the proposed algorithm converges after a finite number of iterations, and can serve as a benchmark for existing suboptimal solutions and those that will be developed for similar contexts in the future. In this regard, we numerically compare the proposed optimal solution to a current state-of-the-art, which show that this suboptimal method only attains 70% to 90% of the optimal performance.

cs.IT↗

arXiv2017

Energy-Efficient Coordinated Multi-Cell Multigroup Multicast Beamforming with Antenna Selection

This paper studies energy-efficient coordinated beamforming in multi-cell multi-user multigroup multicast multiple-input single-output systems. We aim at maximizing the network energy efficiency by taking into account the fact that some of the radio frequency chains can be switched off in order to save power. We consider the antenna specific maximum power constraints to avoid non-linear distortion in power amplifiers and user-specific quality of service (QoS) constraints to guarantee a certain QoS levels. We first introduce binary antenna selection variables and use the perspective formulation to model the relation between them and the beamformers. Subsequently, we propose a new formulation which reduces the feasible set of the continuous relaxation, resulting in better performance compared to the original perspective formulation based problem. However, the resulting optimization problem is a mixed-Boolean non-convex fractional program, which is difficult to solve. We follow the standard continuous relaxation of the binary antenna selection variables, and then reformulate the problem such that it is amendable to successive convex approximation. Thereby, solving the continuous relaxation mostly results in near-binary solution. To recover the binary variables from the continuous relaxation, we switch off all the antennas for which the continuous values are smaller than a small threshold. Numerical results illustrate the superior convergence result and significant achievable gains in terms of energy efficiency with the proposed algorithm.

cs.IT↗

arXiv2016

Parallel Digital Predistortion Design on Mobile GPU and Embedded Multicore CPU for Mobile Transmitters

Digital predistortion (DPD) is a widely adopted baseband processing technique in current radio transmitters. While DPD can effectively suppress unwanted spurious spectrum emissions stemming from imperfections of analog RF and baseband electronics, it also introduces extra processing complexity and poses challenges on efficient and flexible implementations, especially for mobile cellular transmitters, considering their limited computing power compared to basestations. In this paper, we present high data rate implementations of broadband DPD on modern embedded processors, such as mobile GPU and multicore CPU, by taking advantage of emerging parallel computing techniques for exploiting their computing resources. We further verify the suppression effect of DPD experimentally on real radio hardware platforms. Performance evaluation results of our DPD design demonstrate the high efficacy of modern general purpose mobile processors on accelerating DPD processing for a mobile transmitter.

cs.DC↗

arXiv2016

DoF Analysis in a Two-Layered Heterogeneous Wireless Interference Network

Degrees of freedom (DoF) is studied in the downlink of a heterogenous wireless network modeled as a two-layered interference network. The first layer of the interference network is the backhaul layer between macro base stations (MB) and small cell base stations (SB), which is modeled as a Wyner type linear network. The second layer is the transmission layer between SBs and mobile terminals (MTs), which is modeled as a linear Wyner $L_T$ network, i.e., each MT is connected to $L_T+1$ SBs. The SBs are assumed to be half-duplex, thus restricting the per user degrees of freedom (puDoF) in the system to $1/2$. The puDoF can be further restricted by the number of antennas at the MB. For $L_T \in \{1,2\}$, the optimal puDoF can be achieved by using simple interference avoidance schemes. The increase in the connectivity of transmission layer beyond $L_T=2$ limits the achievable puDoF using only zero-forcing schemes to less than 1/2, even in the presence of large number of antennas at each MB but the optimal puDoF can be achieved by making each message available at multiple SBs. This is done by sending an appropriate linear combination to the SB to zero-force interference at the intended user. The maximum per user DoF of 1/2 can be achieved in the linear network with sufficient number of antennas using only interference avoidance schemes. These results are also extended to a more realistic hexagonal cellular model as well.

cs.IT↗

arXiv2015

Design of a Unified Transport Triggered Processor for LDPC/Turbo Decoder

This paper summarizes the design of a programmable processor with transport triggered architecture (TTA) for decoding LDPC and turbo codes. The processor architecture is designed in such a manner that it can be programmed for LDPC or turbo decoding for the purpose of internetworking and roaming between different networks. The standard trellis based maximum a posteriori (MAP) algorithm is used for turbo decoding. Unlike most other implementations, a supercode based sum-product algorithm is used for the check node message computation for LDPC decoding. This approach ensures the highest hardware utilization of the processor architecture for the two different algorithms. Up to our knowledge, this is the first attempt to design a TTA processor for the LDPC decoder. The processor is programmed with a high level language to meet the time-to-market requirement. The optimization techniques and the usage of the function units for both algorithms are explained in detail. The processor achieves 22.64 Mbps throughput for turbo decoding with a single iteration and 10.12 Mbps throughput for LDPC decoding with five iterations for a clock frequency of 200 MHz.

cs.IT↗

arXiv2015

Design of a Transport Triggered Architecture Processor for Flexible Iterative Turbo Decoder

In order to meet the requirement of high data rates for the next generation wireless systems, the efficient implementation of receiver algorithms is essential. On the other hand, the rapid development of technology motivates the investigation of programmable implementations. This paper summarizes the design of a programmable turbo decoder as an applicationspecific instruction-set processor (ASIP) using Transport Triggered Architecture (TTA). The processor architecture is designed in such manner that it can be programmed to support other receiver algorithms, for example, decoding based on the Viterbi algorithm. Different suboptimal maximum a posteriori (MAP) algorithms are used and compared to one another for the softinput soft-output (SISO) component decoders in a single TTA processor. The max-log-MAP algorithm outperforms the other suboptimal algorithms in terms of latency. The design enables the designer to change the suboptimal algorithms according to the bit error rate (BER) performance requirement. Unlike many other programmable turbo decoder implementations, quadratic polynomial permutation (QPP) interleaver is used in this work for contention-free memory access and to make the processor 3GPP LTE compliant. Several optimization techniques to enable real time processing on programmable platforms are introduced. Using our method, with a single iteration 31.32 Mbps throughput is achieved for the max-log-MAP algorithm for a clock frequency of 200 MHz.

cs.AR↗

arXiv2015

A Customized Lattice Reduction Multiprocessor for MIMO Detection

Lattice reduction (LR) is a preprocessing technique for multiple-input multiple-output (MIMO) symbol detection to achieve better bit error-rate (BER) performance. In this paper, we propose a customized homogeneous multiprocessor for LR. The processor cores are based on transport triggered architecture (TTA). We propose some modification of the popular LR algorithm, Lenstra-Lenstra-Lovasz (LLL) for high throughput. The TTA cores are programmed with high level language. Each TTA core consists of several special function units to accelerate the program code. The multiprocessor takes 187 cycles to reduce a single matrix for LR. The architecture is synthesized on 90 nm technology and takes 405 kgates at 210 MHz.

cs.IT↗

arXiv2013

Joint Distributed Source-Channel Decoding for LDPC-Coded Binary Markov Sources

We propose a novel joint decoding technique for distributed source-channel (DSC) coded systems for transmission of correlated binary Markov sources over additive white Gaussian noise (AWGN) channels. In the proposed scheme, relatively short-length, low-density parity-check (LDPC) codes are independently used to encode the bit sequences of each source. To reconstruct the original bit sequence, a joint source-channel decoding (JSCD) technique is proposed which exploits the knowledge of both temporal and source correlations. The JSCD technique is composed of two stages, which are iteratively performed. First, a sum-product (SP) decoder is serially concatenated with a BCJR decoder, where the knowledge of source memory is utilized during {\em local (horizontal) iterations}. Then, the estimate of correlation between the sources is used to update the concatenated decoder during {\em global (vertical) iterations}. Therefore, the correlation of the sources is assumed as side information in the subsequent global iteration of each concatenated decoder. From the simulation results of frame/bit error rate (FER/BER), we note that significant gains are achieved by the proposed decoding scheme with respect to the case where the correlation knowledge is not completely utilized at the decoder.

cs.IT↗

arXiv2013

Computationally Efficient Robust Beamforming for SINR Balancing in Multicell Downlink

We address the problem of downlink beamformer design for signal-to-interference-plus-noise ratio (SINR) balancing in a multiuser multicell environment with imperfectly estimated channels at base stations (BSs). We first present a semidefinite program (SDP) based approximate solution to the problem. Then, as our main contribution, by exploiting some properties of the robust counterpart of the optimization problem, we arrive at a second-order cone program (SOCP) based approximation of the balancing problem. The advantages of the proposed SOCP-based design are twofold. First, it greatly reduces the computational complexity compared to the SDP-based method. Second, it applies to a wide range of uncertainty models. As a case study, we investigate the performance of proposed formulations when the base station is equipped with a massive antenna array. Numerical experiments are carried out to confirm that the proposed robust designs achieve favorable results in scenarios of practical interest.

cs.IT↗

arXiv2013

Efficient Solutions for Weighted Sum Rate Maximization in Multicellular Networks With Channel Uncertainties

The important problem of weighted sum rate maximization (WSRM) in a multicellular environment is intrinsically sensitive to channel estimation errors. In this paper, we study ways to maximize the weighted sum rate in a linearly precoded multicellular downlink system where the receivers are equipped with a single antenna. With perfect channel information available at the base stations, we first present a novel fast converging algorithm that solves the WSRM problem. Then, the assumption is relaxed to the case where the error vectors in the channel estimates are assumed to lie in an uncertainty set formed by the intersection of finite ellipsoids. As our main contributions, we present two procedures to solve the intractable nonconvex robust designs based on the worst case principle. The proposed iterative algorithms solve the semidefinite programs in each of their steps and provably converge to a locally optimal solution of the robust WSRM problem. The proposed approaches are numerically compared against each other to ascertain their robustness towards channel estimation imperfections. The results clearly indicate the performance gain compared to the case when channel uncertainties are ignored in the design process. For certain scenarios, we also quantify the gap between the proposed approximations and exact solutions.

cs.IT↗

arXiv2012

Fast Converging Algorithm for Weighted Sum Rate Maximization in Multicell MISO Downlink

The problem of maximizing weighted sum rates in the downlink of a multicell environment is of considerable interest. Unfortunately, this problem is known to be NP-hard. For the case of multi-antenna base stations and single antenna mobile terminals, we devise a low complexity, fast and provably convergent algorithm that locally optimizes the weighted sum rate in the downlink of the system. In particular, we derive an iterative second-order cone program formulation of the weighted sum rate maximization problem. The algorithm converges to a local optimum within a few iterations. Superior performance of the proposed approach is established by numerically comparing it to other known solutions.

cs.IT↗