← Search

Slawomir Stanczak

16 accepted papers

2023

Deep-Unfolded Adaptive Projected Subgradient Method For Mimo Detection

ICASSP 2023accepted

In this paper, we propose deep-unfolded versions of the recently proposed superiorized adaptive projected subgradient method for MIMO detection. The proposed methods require a single matrix inverse for initialization, and they have a quadratic per-iteration complexity. Extensive simulations with rea…

Cited by 0SourceScholar
2023

Dynamic Distributed Convex Optimization "Over-The-Air" In Decentralized Wireless Networks

ICASSP 2023accepted

We propose a truly decentralized algorithm for solving distributed convex optimization problems with possibly time-varying objectives and dynamic networks. It is especially suitable for solving convex feasibility problems with possibly infinitely many sets, and its main novelty is that it covers pra…

Cited by 0SourceScholar
2021

Deep Learning Based Hybrid Precoding in Dual-Band Communication Systems

ICASSP 2021accepted

We propose a deep learning-based method that uses spatial and temporal information extracted from the sub-6GHz band to predict/track beams in the millimeter-wave (mmWave) band. In more detail, we consider a dual-band communication system operating in both the sub-6GHz and mmWave bands. The objective…

Cited by 0SourceScholar
2020

Channel Charting: an Euclidean Distance Matrix Completion Perspective

ICASSP 2020accepted

Channel charting (CC) is an emerging machine learning framework that aims at learning lower-dimensional representations of the radio geometry from collected channel state information (CSI) in an area of interest, such that spatial relations of the representations in the different domains are preserv…

Cited by 0SourceScholar
2020

Channel Covariance Estimation in Multiuser Massive Mimo Systems with an Approach Based on Infinite Dimensional Hilbert Spaces

ICASSP 2020accepted

We propose a novel algorithm to estimate the channel covariance matrix of a desired user in multiuser massive MIMO systems. The algorithm uses only knowledge of the array response and rough knowledge of the angular support of the incoming signals, which are assumed to be separated in a well-defined…

Cited by 0SourceScholar
2020

Joint Source-Channel Coding and Bayesian Message Passing Detection for Grant-Free Radio Access in IoT

ICASSP 2020accepted

Consider an Internet-of-Things (IoT) system that monitors a number of multi-valued events through multiple sensors sharing the same bandwidth. Each sensor measures data correlated to one or more events, and communicates to the fusion center at a base station using grant-free random access whenever t…

Cited by 0SourceScholar
2020

Online Channel Estimation for Hybrid Beamforming Architectures

ICASSP 2020accepted

Hybrid analog-/digital beamforming architectures are a promising means of reducing power consumption and hardware costs in large multi-antenna transceivers. However, channel estimation becomes more complicated compared with conventional (fully-digital) architectures because multiple measurements (pi…

Cited by 3SourceScholar
2020

Quality-of-Service Prediction for Physical-layer Security via Secrecy Maps

ICASSP 2020accepted

While most of the theoretical aspects of physical layer security are well understood, practical applications lag substantially behind theoretical advances. As a step towards the integration of physical-layer security aspects in the radio access system design, the concept of secrecy maps has been rec…

Cited by 0SourceScholar
2019

Multicast Beamforming Using Semidefinite Relaxation and Bounded Perturbation Resilience

ICASSP 2019accepted

Semidefinite relaxation followed by randomization is a well-known approach for approximating a solution to the NP-hard max-min fair multicast beamforming problem. While providing a good approximation to the optimal solution, this approach commonly involves the use of computationally demanding interi…

Cited by 0SourceScholar
2019

Weakly Standard Interference Mappings: Existence of Fixed Points and Applications to Power Control in Wireless Networks

ICASSP 2019accepted

We propose novel approaches to identify the existence of fixed points of the so-called weakly standard interference mappings, which include the well-known standard and general interference mappings as particular cases. The approaches are based on the concept of spectral radius of asymptotic mappings…

Cited by 0SourceScholar
2018

A Robust Machine Learning Method for Cell-Load Approximation in Wireless Networks

ICASSP 2018accepted

We propose a learning algorithm for cell-load approximation in wireless networks. The proposed algorithm is robust in the sense that it is designed to cope with the uncertainty arising from a small number of training samples. This scenario is highly relevant in wireless networks where training has t…

Cited by 0SourceScholar
2018

FDD Massive MIMO Channel Spatial Covariance Conversion Using Projection Methods

ICASSP 2018accepted

Knowledge of second-order statistics of channels (e.g. in the form of covariance matrices) is crucial for the acquisition of downlink channel state information (CSI) in massive MIMO systems operating in the frequency division duplexing (FDD) mode. Current MIMO systems usually obtain downlink covaria…

Cited by 0SourceScholar
2018

Spectral Radii of Asymptotic Mappings and the Convergence Speed of the Standard Fixed Point Algorithm

ICASSP 2018accepted

Important problems in wireless networks can often be solved by computing fixed points of standard or contractive interference mappings, and the conventional fixed point algorithm is widely used for this purpose. Knowing that the mapping used in the algorithm is not only standard but also contractive…

Cited by 0SourceScholar
2016

Block compressed sensing based distributed resource allocation for M2M communications

ICASSP 2016accepted

In this paper, we utilize the framework of compressed sensing (CS) for device detection and distributed resource allocation in large-scale machine-to-machine (M2M) communication networks. The devices are partitioned into clusters according to some pre-defined criteria, e.g., proximity or service typ…

Cited by 0SourceScholar