Max-Min Fairness Precoding with Low Resolution DACs

We propose a max-min fairness (MMF) precoding algorithm for a multi-user multiple-input multiple-output (MU-MIMO) downlink system with different user weights, considering the quantization effects of low-resolution digital-to-analog converters (DACs). To find a precoder, we first formulate a problem, which jointly considers MMF and quantization. This joint problem presents some challenges that make finding a direct solution infeasible: non-smoothness and non-convexity. To address the non-smoothness, we use LogSumExp method to approximate the problem into a smooth problem. Subsequently, we derive the first-order optimality condition and cast it as a nonlinear eigenvalue problem. Lastly, we employ a generalized power iteration method to determine the superior stationary point. Simulation result demonstrates the superiority of our MMF precoding algorithm.

Authors

Institutions

Publication Details

Published
2024-10-16
DOI
https://doi.org/10.1109/ictc62082.2024.10826817
Primary Topic
Error Correcting Code Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Max-Min Fairness Precoding with Low Resolution DACs

Jinseok Choi, Sangmin Lee, Sung Chul Bae, Seunghyeong Yoo
Error Correcting Code Techniques
article

Max-Min Fairness Precoding with Low Resolution DACs

Jinseok Choi, Sangmin Lee, Sung Chul Bae, Seunghyeong Yoo
article en

Abstract

We propose a max-min fairness (MMF) precoding algorithm for a multi-user multiple-input multiple-output (MU-MIMO) downlink system with different user weights, considering the quantization effects of low-resolution digital-to-analog converters (DACs). To find a precoder, we first formulate a problem, which jointly considers MMF and quantization. This joint problem presents some challenges that make finding a direct solution infeasible: non-smoothness and non-convexity. To address the non-smoothness, we use LogSumExp method to approximate the problem into a smooth problem. Subsequently, we derive the first-order optimality condition and cast it as a nonlinear eigenvalue problem. Lastly, we employ a generalized power iteration method to determine the superior stationary point. Simulation result demonstrates the superiority of our MMF precoding algorithm.

Korea Advanced Institute of Science and Technology (KR), Ulsan National Institute of Science and Technology (KR)
Samsung
Climate action
Openalex Percentile: Top 70%
Error Correcting Code Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.