arXiv subjects

Matti Latva-aho

Publications and source records attributed to Matti Latva-aho.

At least 91 records · Page 5Linked to original sources

arXiv2021

Untrained DNN for Channel Estimation of RIS-Assisted Multi-User OFDM System with Hardware Impairments

Reconfigurable intelligent surface (RIS) is an emerging technology for improving performance in fifth-generation (5G) and beyond networks. Practically channel estimation of RIS-assisted systems is challenging due to the passive nature of the RIS. The purpose of this paper is to introduce a deep learning-based, low complexity channel estimator for the RIS-assisted multi-user single-input-multiple-output (SIMO) orthogonal frequency division multiplexing (OFDM) system with hardware impairments. We propose an untrained deep neural network (DNN) based on the deep image prior (DIP) network to denoise the effective channel of the system obtained from the conventional pilot-based least-square (LS) estimation and acquire a more accurate estimation. We have shown that our proposed method has high performance in terms of accuracy and low complexity compared to conventional methods. Further, we have shown that the proposed estimator is robust to interference caused by the hardware impairments at the transceiver and RIS.

eess.SP↗

arXiv2021

Average Rate and Error Probability Analysis in Short Packet Communications over RIS-aided URLLC Systems

In this paper, the average achievable rate and error probability of a reconfigurable intelligent surface (RIS) aided systems is investigated for the finite blocklength (FBL) regime. The performance loss due to the presence of phase errors arising from limited quantization levels as well as hardware impairments at the RIS elements is also discussed. First, the composite channel containing the direct path plus the product of reflected channels through the RIS is characterized. Then, the distribution of the received signal-to-noise ratio (SNR) is matched to a Gamma random variable whose parameters depend on the total number of RIS elements, phase errors and the channels' path loss. Next, by considering the FBL regime, the achievable rate expression and error probability are identified and the corresponding average rate and average error probability are elaborated based on the proposed SNR distribution. Furthermore, the impact of the presence of phase error due to either limited quantization levels or hardware impairments on the average rate and error probability is discussed. The numerical results show that Monte Carlo simulations conform to matched Gamma distribution to received SNR for sufficiently large number of RIS elements. In addition, the system reliability indicated by the tightness of the SNR distribution increases when RIS is leveraged particularly when only the reflected channel exists. This highlights the advantages of RIS-aided communications for ultra-reliable and low-latency systems. The difference between Shannon capacity and achievable rate in FBL regime is also discussed. Additionally, the required number of RIS elements to achieve a desired error probability in the FBL regime will be significantly reduced when the phase shifts are performed without error.

cs.IT↗

arXiv2021

Deep Reinforcement Based Optimization of Function Splitting in Virtualized Radio Access Networks

Virtualized Radio Access Network (vRAN) is one of the key enablers of future wireless networks as it brings the agility to the radio access network (RAN) architecture and offers degrees of design freedom. Yet, it also creates a challenging problem on how to design the functional split configuration. In this paper, a deep reinforcement learning approach is proposed to optimize function splitting in vRAN. A learning paradigm is developed that optimizes the location of functions in the RAN. These functions can be placed either at a central/cloud unit (CU) or a distributed unit (DU). This problem is formulated as constrained neural combinatorial reinforcement learning to minimize the total network cost. In this solution, a policy gradient method with Lagrangian relaxation is applied that uses a stacked long short-term memory (LSTM) neural network architecture to approximate the policy. Then, a sampling technique with a temperature hyperparameter is applied for the inference process. The results show that our proposed solution can learn the optimal function split decision and solve the problem with a $0.4\%$ optimality gap. Moreover, our method can reduce the cost by up to $320\%$ compared to a distributed-RAN (D-RAN). We also conclude that altering the traffic load and routing cost does not significantly degrade the optimality performance.

cs.NI↗

arXiv2021

Average Rate Analysis of RIS-aided Short Packet Communication in URLLC Systems

In this paper, the average achievable rate of a re-configurable intelligent surface (RIS) aided factory automation is investigated in finite blocklength (FBL) regime. First, the composite channel containing the direct path plus the product of reflected paths through the RIS is characterized. Then, the distribution of the received signal-to-noise ratio (SNR) is matched to a Gamma random variable whose parameters depend on the total number of RIS elements as well as the channel pathloss. Next, by assuming FBL model, the achievable rate expression is identified and the corresponding average rate is elaborated based on the proposed SNR distribution. The phase error due to quantizing the phase shifts is considered in the simulation. The numerical results show that Monte Carlo simulations conform to the matched Gamma distribution for the received SNR for large number of RIS elements. In addition, the system reliability indicated by the tightness of the SNR distribution increases when RIS is leveraged particularly when only the reflected channel exists. This highlights the advantages of RIS-aided communications for ultra-reliable low-latency communications (URLLC) systems. The reduction of average achievable rate due to working in FBL regime with respect to Shannon capacity is also investigated as a function of total RIS elements.

cs.IT↗

arXiv2021

Deep Contextual Bandits for Fast Initial Access in mmWave Based User-Centric Ultra-Dense Networks

Millimeter wave (mmWave) based multiple-input multiple-output (MIMO) capable user-centric (UC) ultra-dense (UD) networks are suggested to facilitate high throughput requirements of future networks. Due to the high blockage susceptibility of mmWave, the connections may drop frequently. Hence efficient and fast beam management in initial access (IA) is essential. Current cellular systems use beam sweeping based IA mechanisms. UC UD concept requires all of its access points (APs) to perform IA. This leads to a shortage of orthogonal radio resources. Nonorthogonal resource allocation causes interference which leads to a higher misdetection probability. In this paper, we propose a novel deep contextual bandit (DCB) based approach to perform fast and efficient IA in mmWave based UC UD networks. The DCB model uses one reference signal from the user to predict the IA beam. The reduced use of reference signals improves beam discovery delay and relaxes the requirement for radio resources. Ray-tracing and stochastic channel model-based simulations show that the suggested system outperforms its beam sweeping counterpart in terms of probability of beam misdetection and beam discovery delay in mmWave based UC UD networks.

eess.SP↗

arXiv2021

Deep Contextual Bandits for Fast Neighbor-Aided Initial Access in mmWave Cell-Free Networks

Access points (APs) in millimeter-wave (mmWave) and sub-THz-based user-centric (UC) networks will have sleep mode functionality. As a result of this, it becomes challenging to solve the initial access (IA) problem when the sleeping APs are activated to start serving users. In this paper, a novel deep contextual bandit (DCB) learning method is proposed to provide instant IA using information from the neighboring active APs. In the proposed approach, beam selection information from the neighboring active APs is used as an input to neural networks that act as a function approximator for the bandit algorithm. Simulations are carried out with realistic channel models generated using the Wireless Insight ray-tracing tool. The results show that the system can respond to dynamic throughput demands with negligible latency compared to the standard baseline 5G IA scheme. The proposed fast beam selection scheme can enable the network to use energy-saving sleep modes without compromising the quality of service due to inefficient IA

eess.SP↗

arXiv2021

On the Optimal Deployment of Power Beacons for Massive Wireless Energy Transfer

Wireless energy transfer (WET) is emerging as an enabling green technology for Internet of Things (IoT) networks. WET allows the IoT devices to wirelessly recharge their batteries with energy from external sources such as dedicated radio frequency transmitters called power beacons (PBs). In this paper, we investigate the optimal deployment of PBs that guarantees a network-wide energy outage constraint. Optimal positions for the PBs are determined by maximizing the average incident power for the worst location in the service area since no information about the sensor deployment is provided. Such network planning guarantees the fairest harvesting performance for all the IoT devices. Numerical simulations evidence that our proposed optimization framework improves the energy supply reliability compared to benchmark schemes. Additionally, we show that although both, the number of deployed PBs and the number of antennas per PB, introduce performance improvements, the former has a dominant role. Finally, our proposal allows to extend the coverage area while keeping the total power budget fixed, which additionally reduces the level of electromagnetic radiation in the vicinity of PBs.

eess.SP↗

arXiv2021

Deep Learning-based Power Control for Cell-Free Massive MIMO Networks

A deep learning (DL)-based power control algorithm that solves the max-min user fairness problem in a cell-free massive multiple-input multiple-output (MIMO) system is proposed. Max-min rate optimization problem in a cell-free massive MIMO uplink setup is formulated, where user power allocations are optimized in order to maximize the minimum user rate. Instead of modeling the problem using mathematical optimization theory, and solving it with iterative algorithms, our proposed solution approach is using DL. Specifically, we model a deep neural network (DNN) and train it in an unsupervised manner to learn the optimum user power allocations which maximize the minimum user rate. This novel unsupervised learning-based approach does not require optimal power allocations to be known during model training as in previously used supervised learning techniques, hence it has a simpler and flexible model training stage. Numerical results show that the proposed DNN achieves a performance-complexity trade-off with around 400 times faster implementation and comparable performance to the optimization-based algorithm. An online learning stage is also introduced, which results in near-optimal performance with 4-6 times faster processing.

eess.SP↗

arXiv2021

Effective Energy Efficiency of Ultra-reliable Low Latency Communication

Effective Capacity defines the maximum communication rate subject to a specific delay constraint, while effective energy efficiency (EEE) indicates the ratio between effective capacity and power consumption. We analyze the EEE of ultra-reliable networks operating in the finite blocklength regime. We obtain a closed form approximation for the EEE in quasi-static Nakagami-$m$ (and Rayleigh as sub-case) fading channels as a function of power, error probability, and latency. Furthermore, we characterize the QoS constrained EEE maximization problem for different power consumption models, which shows a significant difference between finite and infinite blocklength coding with respect to EEE and optimal power allocation strategy. As asserted in the literature, achieving ultra-reliability using one transmission consumes huge amount of power, which is not applicable for energy limited IoT devices. In this context, accounting for empty buffer probability in machine type communication (MTC) and extending the maximum delay tolerance jointly enhances the EEE and allows for adaptive retransmission of faulty packets. Our analysis reveals that obtaining the optimum error probability for each transmission by minimizing the non-empty buffer probability approaches EEE optimality, while being analytically tractable via Dinkelbach's algorithm. Furthermore, the results illustrate the power saving and the significant EEE gain attained by applying adaptive retransmission protocols, while sacrificing a limited increase in latency.

cs.IT↗

arXiv2021

On the SIR Meta Distribution in Massive MTCNetworks with Scheduling and Data Aggregation

Data aggregation is an efficient approach to handle the congestion introduced by a massive number of machine type devices (MTDs). The aggregators not only collect data but also implement scheduling mechanisms to cope with scarce network resources. We use the concept of meta distribution (MD) of the signal-to-interference ratio (SIR) to gain a complete understanding of the per-link reliability and describe the performance of two scheduling methods for data aggregation of machine type communication (MTC): random resource scheduling (RRS) and channel-aware resource scheduling (CRS). The results show the fraction of users in the network that achieves a target reliability, which is an important aspect to consider when designing wireless systems with stringent service requirements.

eess.SP↗

arXiv2021

Massive Wireless Energy Transfer: Enabling Sustainable IoT Towards 6G Era

Recent advances on wireless energy transfer (WET) make it a promising solution for powering future Internet of Things (IoT) devices enabled by the upcoming sixth generation (6G) era. The main architectures, challenges and techniques for efficient and scalable wireless powering are overviewed in this paper. Candidates enablers such as energy beamforming (EB), distributed antenna systems (DAS), advances on devices' hardware and programmable medium, new spectrum opportunities, resource scheduling and distributed ledger technology are outlined. Special emphasis is placed on discussing the suitability of channel state information (CSI)-limited/free strategies when powering simultaneously a massive number of devices. The benefits from combining DAS and EB, and from using average CSI whenever available, are numerically illustrated. The pros and cons of the state-of-the-art CSI-free WET techniques in ultra-low power setups are thoroughly revised, and some possible future enhancements are outlined. Finally, key research directions towards realizing WET-enabled massive IoT networks in the 6G era are identified and discussed in detail.

cs.NI↗

arXiv2020

CSI-free vs CSI-based multi-antenna WET for massive low-power Internet of Things

Wireless Energy Transfer (WET) is a promising solution for powering massive Internet of Things deployments. An important question is whether the costly Channel State Information (CSI) acquisition procedure is necessary for optimum performance. In this paper, we shed some light into this matter by evaluating CSI-based and CSI-free multi-antenna WET schemes in a setup with WET in the downlink, and periodic or Poisson-traffic Wireless Information Transfer (WIT) in the uplink. When CSI is available, we show that a maximum ratio transmission beamformer is close to optimum whenever the farthest node experiences at least 3 dB of power attenuation more than the remaining devices. On the other hand, although the adopted CSI-free mechanism is not capable of providing average harvesting gains, it does provide greater WET/WIT diversity with lower energy requirements when compared with the CSI-based scheme. Our numerical results evidence that the CSI-free scheme performs favorably under periodic traffic conditions, but it may be deficient in case of Poisson traffic, specially if the setup is not optimally configured. Finally, we show the prominent performance results when the uplink transmissions are periodic, while highlighting the need of a minimum mean square error equalizer rather than zero-forcing for information decoding.

cs.NI↗

arXiv2020

Hybrid Beamforming for mm-Wave Massive MIMO Systems with Partially Connected RF Architecture

To satisfy the capacity requirements of future mobile systems, under-utilized millimeter wave frequencies can be efficiently exploited by employing massive MIMO technology with highly directive beamforming. Hybrid analog-digital beamforming has been recognised as a promising approach for large-scale MIMO implementations with a reduced number of costly and power-hungry RF chains. In comparison to fully connected architecture, hybrid beamforming (HBF) with partially connected RF architecture is particularly appealing for the practical implementation due to less complex RF power division and combining networks. In this paper, we first formulate single- and multi-user rate maximization problems as weighted minimum mean square error (WMMSE) and derive solutions for hybrid beamformers using alternating optimization. The algorithms are designed for the full-array- and sub-array-based processing strategies of partially connected HBF architecture. In addition to the rate maximizing WMMSE solutions, we propose lower complexity sub-array-based zero-forcing algorithms. The performance of the proposed algorithms is evaluated in two different channel models, i.e., a simple geometric model and a realistic statistical millimeter wave model known as NYUSIM. The performance results of the WMMSE HBF algorithms are meant to reveal the potential of partially connected HBF and serve as upper bounds for lower complexity methods. Numerical results imply that properly designed partially connected HBF has the potential to provide an good compromise between hardware complexity and system performance in comparison to fully digital beamforming.

eess.SP↗

arXiv2020

A Predictive Interference Management Algorithm for URLLC in Beyond 5G Networks

Interference mitigation is a major design challenge in wireless systems,especially in the context of ultra-reliable low-latency communication (URLLC) services. Conventional average-based interference management schemes are not suitable for URLLC as they do not accurately capture the tail information of the interference distribution. This letter proposes a novel interference prediction algorithm that considers the entire interference distribution instead of only the mean. The key idea is to model the interference variation as a discrete state space discrete-time Markov chain. The state transition probability matrix is then used to estimate the state evolution in time, and allocate radio resources accordingly. The proposed scheme is found to meet the target reliability requirements in a low-latency single-shot transmission system considering realistic system assumptions, while requiring only ~25% more resources than the optimum case with perfect interference knowledge.

cs.IT↗

arXiv2020

Ultra-low Latency, Low Energy and Massiveness in the 6G Era via Efficient CSIT-limited Schemes

Channel state information (CSI) has been a key component in traditional wireless communication systems. This might no longer hold in future networks supporting services with stringent quality of service constraints such as extremely low-latency, low-energy and/or large number of simultaneously connected devices, where acquiring CSI would become extremely costly or even impractical. We overview the main limitations of CSI at transmitter side (CSIT)-based designs toward the 6G era, assess how to design and use efficient CSIT-limited schemes that allow meeting the new and stringent requirements, and highlight some key research directions. We delve into the ideas of efficiently allocating pilot sequences, relying on statistical CSIT and/or using location-based strategies, and demonstrate viability via a selected use case.

cs.IT↗

arXiv2020

A Low-Complexity Beamforming Design for Multiuser Wireless Energy Transfer

Wireless energy transfer (WET) is a green enabler of low-power Internet of Things (IoT). Therein, traditional optimization schemes relying on full channel state information (CSI) are often too costly to implement due to excessive energy consumption and high processing complexity. This letter proposes a simple, yet effective, energy beamforming scheme that allows a multi-antenna power beacon (PB) to fairly power a set of IoT devices by only relying on the first-order statistics of the channels. In addition to low complexity, the proposed scheme performs favorably as compared to benchmarking schemes and its performance improves as the number of PB's antennas increases. Finally, it is shown that further performance improvement can be achieved through proper angular rotations of the PB.

cs.IT↗

arXiv2020

A 6G White Paper on Connectivity for Remote Areas

In many places all over the world rural and remote areas lack proper connectivity that has led to increasing digital divide. These areas might have low population density, low incomes, etc., making them less attractive places to invest and operate connectivity networks. 6G could be the first mobile radio generation truly aiming to close the digital divide. However, in order to do so, special requirements and challenges have to be considered since the beginning of the design process. The aim of this white paper is to discuss requirements and challenges and point out related, identified research topics that have to be solved in 6G. This white paper first provides a generic discussion, shows some facts and discusses targets set in international bodies related to rural and remote connectivity and digital divide. Then the paper digs into technical details, i.e., into a solutions space. Each technical section ends with a discussion and then highlights identified 6G challenges and research ideas as a list.

eess.SP↗

arXiv2020

Partially Permuted Multi-Trellis Belief Propagation for Polar Codes

Belief propagation (BP) is an iterative decoding algorithm for polar codes which can be parallelized effectively to achieve higher throughput. However, because of the presence of error floor due to cycles and stopping sets in the factor graph, the performance of the BP decoder is far from the performance of state of the art cyclic redundancy check (CRC) aided successive cancellation list (CA-SCL) decoders. It has been shown that successive BP decoding on multiple permuted factor graphs, which is called the multi-trellis BP decoder, can improve the error performance. However, when permuting the entire factor graph, since the decoder dismisses the information from the previous permutation, the number of iterations required is significantly larger than that of the standard BP decoder. In this work, we propose a new variant of the multi-trellis BP decoder which permutes only a subgraph of the original factor graph. This enables the decoder to retain information of variable nodes in the subgraphs, which are not permuted, reducing the required number of iterations needed in-between the permutations. As a result, the proposed decoder can perform permutations more frequently, hence being more effective in mitigating the effect of cycles which cause oscillation errors. Experimental results show that for a polar code with block length 1024 and rate 0.5 the error performance gain of the proposed decoder at the frame error rate of 10^(-6) is 0.25 dB compared to multi-trellis decoder based on full permutations. This performance gain is achieved along with reduced latency in terms of the number of iterations.

cs.IT↗