<p>Unsourced massive random access manages simultaneously a massive number of uncoordinated and bursty transmitters with a single receiver. Many traditional nonlinear least squares decoders at the receiver are inadequate and perform poorly for low signal-to-noise ratio cases, especially for impulsive (non-Gaussian) noise. In this paper, to deal with these heavy-tailed impulsive noise, we first propose a novel <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11081_2025_9998_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="15" /> </InlineMediaObject> <EquationSource Format="TEX">\(\ell _1\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>ℓ</mi> <mn>1</mn> </msub> </math></EquationSource> </InlineEquation>-norm based tensor optimization model for decoding active users’ symbols at the receiver. Then, we introduce a practical alternating direction method of multipliers (ADMM) equipped with a novel inexact strategy for dealing with a class of nonconvex and nonsmooth composite optimization problems. It is noteworthy that our new algorithm can efficiently alleviate the computational burden caused by the composite objective with a nonsmooth outer function and a nonlinear inner part. Theoretically, under some standard conditions, we analyze the global convergence of the proposed practical ADMM. Numerical experiments on unsourced massive random access with up to 1000 active users illustrate that the proposed <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11081_2025_9998_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="15" /> </InlineMediaObject> <EquationSource Format="TEX">\(\ell _1\)</EquationSource> <EquationSource Format="MATHML"><math> <msub> <mi>ℓ</mi> <mn>1</mn> </msub> </math></EquationSource> </InlineEquation>-norm based optimization model and the newly introduced ADMM work well in practice.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Removing Impulsive Noise for Unsourced Massive Random Access via A Practical Inexact ADMM

  • Yannan Chen,
  • Hongjin He,
  • Liqun Qi,
  • Xinzhen Zhang

摘要

Unsourced massive random access manages simultaneously a massive number of uncoordinated and bursty transmitters with a single receiver. Many traditional nonlinear least squares decoders at the receiver are inadequate and perform poorly for low signal-to-noise ratio cases, especially for impulsive (non-Gaussian) noise. In this paper, to deal with these heavy-tailed impulsive noise, we first propose a novel \(\ell _1\) 1 -norm based tensor optimization model for decoding active users’ symbols at the receiver. Then, we introduce a practical alternating direction method of multipliers (ADMM) equipped with a novel inexact strategy for dealing with a class of nonconvex and nonsmooth composite optimization problems. It is noteworthy that our new algorithm can efficiently alleviate the computational burden caused by the composite objective with a nonsmooth outer function and a nonlinear inner part. Theoretically, under some standard conditions, we analyze the global convergence of the proposed practical ADMM. Numerical experiments on unsourced massive random access with up to 1000 active users illustrate that the proposed \(\ell _1\) 1 -norm based optimization model and the newly introduced ADMM work well in practice.