Pith. sign in

REVIEW 4 major objections 5 minor 3 cited by

Token-Domain Multiple Access: Exploiting Semantic Orthogonality for Collision Mitigation

T0 review · 4 major / 5 minor · reviewed 2026-08-08 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Devices that collide on the same wireless channel can still recover their images via masked-token prediction.

desk verdict ToDMA is a genuinely new token-domain multiple-access framework, but its abstract overclaims: the orthogonal baseline beats it on image quality at BER=0, and the latency advantage doesn't show up at the plotted operating point. read the letter →

arxiv 2502.06118 v2 pith:V5XENAGZ submitted 2025-02-10 cs.IT eess.SPmath.IT

Li Qiao , Mahdi Boloursaz Mashhadi , Zhen Gao , Deniz Gündüz This is my paper · ORCID
classification cs.ITeess.SPmath.IT
keywords tokencommunicationssemanticmultipleaccessmaskedpredictionnon-orthogonalgenerativemassiverandomimagetransmissionToDMA
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper is trying to establish that multiple wireless devices can share the same time-frequency resources without coordination if the receiver is allowed to repair token collisions with a pretrained generative model. In the proposed token-domain multiple access (ToDMA), every device uses the same tokenizer and the same orthonormal modulation codebook, so the overlapped signal at the base station is a structured mixture of tokens and channel vectors. The receiver detects which tokens were active, assigns them to devices by channel similarity, and hands the leftover collided positions to a bidirectional transformer, which fills them using context and semantic orthogonality. If this works, massive uncoordinated uplink access becomes a source-completion problem rather than an orthogonal-resource-allocation problem, cutting latency while keeping image quality.

What carries the argument

The load-bearing object is the shared orthonormal modulation codebook U and the projection identity it enables: because $U^H U = I_Q$, the receiver's projection $\widehat{H}_n = U^H Y_n$ recovers the equivalent channel matrix $H_n = \sum_k b_{k,n} h_k^T$ plus noise. That single operation turns an overlapped multiuser signal into a per-time-slot list of token-and-channel-vector pairs, which drives the whole receiver. Token detection extracts rows of $\widehat{H}_n$ whose energy passes a threshold; token assignment matches those channel vectors to known device CSIs; and the unassigned residual tokens become a candidate set that shrinks the transformer's prediction search from the full codebook size Q to the small collision set. The second machinery is the pretrained bidirectional transformer, which scores each candidate token against the surrounding context, exploiting what the paper calls semantic orthogonality: the idea that distinct sources' token sequences are mutually predictable and contextually separable.

What would settle it

Re-run the ToDMA receiver on images drawn from a domain the pretrained MaskGIT model has not seen, such as medical or satellite imagery, using the same VQ-GAN tokenizer; if the token error rate after masked-token prediction is no better than random selection from the candidate set, the claimed collision-mitigation gain is a property of the pretraining distribution rather than of the multiple-access scheme itself.

Watch

Extended reading notes

Core claim

The central claim is that token collisions in a non-orthogonal multiple access channel are not wasted information: they can be resolved by a pretrained masked-token transformer. Concretely, with K active devices sharing an orthonormal codebook U, the received signal at slot n takes the form $Y_n = U H_n + Z_n$, so projecting onto U gives an estimate of the equivalent channel matrix $H_n$, whose nonzero rows carry both the transmitted token and the device-specific channel vector. The receiver uses these pairs to assign each token to the device with the closest CSI; when several devices transmit the same token, the leftover tokens form a candidate set and the affected positions are marked [MASK]. A pretrained bidirectional transformer, the MaskGIT-style ViT, then picks the most contextually consistent candidate for each masked position. Simulations on ImageNet-100 at SNR = 25 dB show that this pipeline keeps token error rate, PSNR, and LPIPS close to an error-free orthogonal baseline as K grows, while cutting latency by a factor that grows with the total device population. The paper concludes that ToDMA outperforms context-unaware orthogonal and non-orthogonal schemes in both image quality and latency.

Load-bearing premise

The whole scheme depends on the pretrained transformer correctly guessing the tokens lost to collisions for the actual images being sent, and the paper demonstrates this only on ImageNet-100 at one SNR and one collision regime.

Editorial extensions

If this is right

  • With ToDMA, the latency of an uplink transmission becomes independent of the total number of devices $K_T$, since the frame duration is $L N / (N_s f_s)$ rather than a share of the bandwidth divided among all devices.
  • Image quality stays close to an ideal orthogonal baseline even as the number of active devices K grows, because the transformer repairs the vast majority of collided tokens instead of leaving them as random errors.
  • The token error rate becomes a modality-agnostic performance metric, and the residual candidate set reduces the prediction complexity from the full codebook size to the number of collided tokens.
  • The same transmitter-receiver structure applies to any source with a pretrained tokenizer and a pretrained bidirectional token model, making the scheme a joint source-channel coding approach for generative semantic communication.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Because the latency expression contains no dependence on $K_T$, the scheme's advantage should grow with the size of the device population; the paper only simulates up to $K=80$ active devices, so extrapolating to much larger K is an untested consequence.
  • The collision-repair gain is really a property of the source prior: ToDMA should transfer to text, audio, or video tokens only insofar as a pretrained bidirectional model can predict the collided tokens, so the fundamental limit is the source's conditional predictability rather than the channel's collision statistics.
  • A natural extension the paper does not test is iterative refinement: have the transformer emit confidence scores and lock in the most certain masked positions first, then re-predict the remaining ones; this could push the operating point to higher collision rates.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 5 minor

Summary. ToDMA is a proposed multiple access scheme in which active devices share a tokenizer and a fixed orthonormal modulation codebook, transmit token-modulated codewords non-orthogonally over the same time-frequency resources, and rely on a base station with many antennas to detect active tokens, assign them to devices by CSI, and fill unresolved token collisions using a pre-trained bidirectional masked image transformer. The paper evaluates the scheme on ImageNet-100 image transmission with a VQ-GAN tokenizer and MaskGIT, comparing against a context-unaware non-orthogonal scheme ('Non-Orth Com') and an orthogonal QAM scheme ('Orth-Com') that is simulated at BER=0. The main claimed advantages are lower latency and better image quality than both benchmarks.

Significance. The idea of moving collision resolution from the physical layer into a pretrained generative source model is interesting and potentially relevant for 6G massive access, and the system model is presented clearly enough to be simulated. The paper's central quantitative claims, however, are currently overstated: the orthogonal baseline is evaluated in an idealized error-free regime, and the reported figures and latency formulas do not support the advertised quality and latency advantages over that baseline. If the claims are appropriately weakened and the orthogonal comparison is made resource-matched, the core architecture and the observed TER trend remain a useful contribution to the semantic multiple access literature.

major comments (4)
  1. [Abstract, Section III, Fig. 3, Section VI-B] The claim that ToDMA 'outperforms context-unaware orthogonal and non-orthogonal communication methods ... achieving lower latency and better image quality' is contradicted by the paper's own results. In Fig. 3(b) and 3(c), the Orth-Com baseline, evaluated at BER=0, achieves higher PSNR and lower LPIPS than ToDMA for every plotted value of K; and using the paper's formulas with the stated parameters (SNR=25 dB, KT=500, BER=10^-3), the Orth-Com latency is roughly 12.8 ms while the ToDMA latency is about 17.1 ms. The headline claim must be weakened or the orthogonal benchmark must be redefined as a resource-matched practical scheme.
  2. [Section IV-B and Section V-C] The random access model says that the BS does not know which devices are active, but the token assignment step in Section V-C assumes the CSI of the K active devices is known. The paper gives no activity detection or channel estimation procedure that would provide this CSI in a grant-free setting, so the receiver design does not yet implement the claimed uncoordinated massive access scenario.
  3. [Section VI-A, Fig. 3] The Orth-Com baseline in Fig. 3 is not a fair or practical comparison: it is simulated at BER=0, i.e., with perfect error-free transmission, whereas ToDMA and Non-Orth Com operate at finite SNR with a fixed spreading factor L=Q. The authors should instead compare against an orthogonal scheme consuming the same total bandwidth and energy, or clearly state that Orth-Com is an idealized upper bound and not a competing scheme to be outperformed.
  4. [Section V-D] The masked-token prediction component is a pretrained MaskGIT model trained on natural images, and the simulations only use ImageNet-100 images, i.e., in-distribution data. The paper does not evaluate the sensitivity of the TER advantage to out-of-distribution sources or to collision rates that exceed the model's completion ability; this should be discussed and, ideally, experimentally characterized before claiming a general token-domain multiple access framework.
minor comments (5)
  1. [Throughout] The notation is not always consistent: the frame is called 'TODMA' in the Section IV heading and 'ToDMA' elsewhere; the abstract contains a stray space in 'T oDMA'.
  2. [Section V-C] The threshold Th is introduced as a design parameter and set to 2σ^2 in simulation, but no sensitivity analysis is provided; a brief discussion of how the performance depends on Th would improve reproducibility.
  3. [Section VI-A, Fig. 4] The assumption that ToDMA and Non-Orth Com have perfect estimation of the token set Pn in Fig. 4 is stated in the caption but not in the main text; this should be part of the simulation description.
  4. [Section VI-B] The latency comparison ignores beacon overhead, tokenization/detokenization delay, and transformer inference time at the base station, all of which are relevant for a complete latency comparison.
  5. [Section II] The concept of 'semantic orthogonality' is illustrated only with examples; a formal definition or measurable criterion would strengthen the paper, since this notion is central to the claimed collision-mitigation capability.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity; the collision-recovery gain rests on an external pretrained transformer prior, not on fitted or self-referential inputs.

full rationale

No circularity found. ToDMA's derivation chain is self-contained: tokenization uses the pre-trained VQ-GAN tokenizer [8]; each token is mapped to a column of an orthonormal codebook U; the receiver obtains an estimate of Hn by the linear projection U^H Yn (Eq. 2); token assignment uses known CSI vectors; collisions leave masked positions plus a residual candidate set; and masked tokens are filled by the pre-trained MaskGIT ViT [7]. At no step is a parameter fitted to the simulated outputs, and the performance gain over the 'Non-Orth Com' benchmark comes from an external pretrained image prior, not from a quantity defined in terms of the result. The self-citations (e.g., [10], [14], [21], [24], [33], [38]) are background references and are not load-bearing; no uniqueness theorem or ansatz is imported from them. The abstract's claim that ToDMA outperforms Orth-Com is contradicted by the paper's own Fig. 3 (Orth-Com at BER=0 has higher PSNR) and by the latency arithmetic at KT=500, but that is an internal evidence/claim mismatch, not a circular derivation.

Assumptions & free parameters 1 free parameters · 5 assumptions · 0 invented entities

The ledger is modest: one hand-set detection threshold and four domain assumptions. No free parameters are fitted to make the curves come out; the main external input is the pretrained image model.

free parameters (1)
  • Detection threshold T_h = 2 sigma^2 (reported; not fitted to data)
    Hand-set threshold in Section V-B; controls which tokens are detected and which assignments are accepted. The paper states it is based on noise variance, but does not study sensitivity.
assumptions (5)
  • domain assumption The source distribution is such that a pre-trained bidirectional transformer can predict masked tokens from surrounding context with high accuracy.
    Section V-D relies on this for collision mitigation; the simulation uses ImageNet-100 with a MaskGIT-pretrained ViT, so the assumption is tied to training distribution overlap. If this fails, ToDMA's TER advantage disappears.
  • domain assumption Channel vectors h_k remain constant over all N time slots and are known at the receiver.
    Section IV-B states this 'without loss of generality' and Section V-C assumes the CSI of K devices is known, enabling assignment by Euclidean distance.
  • domain assumption All active devices share the same tokenizer and the same orthonormal modulation codebook U, with U^H U = I_Q.
    Section IV-A; this is the design premise that makes projections in Eq. (2) separate tokens, and is not derived from physical constraints.
  • standard math The noise is i.i.d. complex Gaussian and the modulation codebook is orthonormal, so U^H Z_n has the same variance as Z_n.
    Section IV-B Eq. (2); standard linear algebra, not controversial.
  • domain assumption The number of active devices K is known to the receiver.
    Problem formulation and Algorithm 1 iterate over k=1 to K; activity detection is not modeled, so the receiver must know how many devices are active.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Token-Domain Multiple Access: Exploiting Semantic Orthogonality for Collision Mitigation." pith.science (2026). https://pith.science/paper/V5XENAGZ

@misc{pith2026250206118,
  author       = {Pith},
  title        = {Pith review of: Token-Domain Multiple Access: Exploiting Semantic Orthogonality for Collision Mitigation},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/V5XENAGZ}},
  note         = {Machine review of arXiv:2502.06118}
}
read the original abstract

Token communications is an emerging generative semantic communication concept that reduces transmission rates by using context and transformer-based token processing, with tokens serving as universal semantic units. In this paper, we propose a semantic multiple access scheme in the token domain, referred to as ToDMA, where a large number of devices share a tokenizer and a modulation codebook for source and channel coding, respectively. Specifically, the source signal is tokenized into sequences, with each token modulated into a codeword. Codewords from multiple devices are transmitted simultaneously, resulting in overlap at the receiver. The receiver detects the transmitted tokens, assigns them to their respective sources, and mitigates token collisions by leveraging context and semantic orthogonality across the devices' messages. Simulations demonstrate that the proposed ToDMA framework outperforms context-unaware orthogonal and non-orthogonal communication methods in image transmission tasks, achieving lower latency and better image quality.

Figures

Figures reproduced from arXiv: 2502.06118 by the authors.

Figure 1
Figure 1. The proposed Token-Domain Multiple Access (ToDMA) framework. [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Illustration of token assignment and masked token prediction. elements of this residual token set serve as candidate tokens to assist the following steps [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. Performance comparison of the proposed ToDMA-based image transmission with benchmark schemes, validated on the ImageNet100 dataset, SNR [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
Figures from the paper (1 more)
Figure 5
Figure 5. Figure 5: Latency compared to adaptive QAM with various target BERs. [PITH_FULL_IMAGE:figures/full_fig_p005_5.png]

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Adaptive Semantic Token Communication for Transformer-based Edge Inference

    cs.LG 2025-05 conditional novelty 6.0 of 10

    A single adaptive deep joint source-channel coding model with budget-conditioned token selection and Lyapunov-based resource allocation achieves better accuracy-compression trade-offs than static DJSCC and digital bas...

  2. Text-Guided Token Communication for Wireless Image Transmission

    cs.IT 2025-07 reject novelty 5.0 of 10

    A text-guided token transmission system using pre-trained image and text models outperforms a deep JSCC baseline on perceptual and semantic metrics, but relies on an assumption that text is available at the receiver.

  3. Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search

    eess.SP 2025-06 conditional novelty 5.0 of 10

    SemPA-Look groups tokens into packets using a leave-one-out residual semantic score and a fixed-width lookahead search, matching near-optimal ATS at linear text-encoding complexity.

Reference graph

Works this paper leans on

40 extracted references · 31 canonical work pages · cited by 3 Pith papers

  1. [1]

    Hello GPT-4o,

    OpenAI, “Hello GPT-4o,” 2024. Accessed: 2024-09-29

    work page 2024

  2. [2]

    Show-o: One single transformer to unify multimodal understanding and generation,

    J. Xie et al. , “Show-o: One single transformer to unify multimodal understanding and generation,” arXiv preprint arXiv:2408.12528 , 2024

    arXiv 2024

  3. [3]

    The (r) evolution of multimodal large language models: A survey,

    D. Caffagni et al. , “The (r) evolution of multimodal large language models: A survey,” arXiv preprint arXiv:2402.12451 , 2024

    arXiv 2024

  4. [4]

    Attention is all you need,

    A. Vaswani, “Attention is all you need,” Proc. Adv. Neural Inf. Process. Syst. (NeurIPS) , 2017

    work page 2017

  5. [5]

    Bert: Pre-training of deep bidirectional transformers for language understanding,

    J. Devlin, “Bert: Pre-training of deep bidirectional transformers for language understanding,” arXiv preprint arXiv:1810.04805 , 2018

    arXiv 2018

  6. [6]

    Neural discrete representation learning,

    A. Van Den Oord, O. Vinyals, et al. , “Neural discrete representation learning,” Proc. Adv. Neural Inf. Process. Syst. (NeurIPS) , vol. 30, 2017

    work page 2017

  7. [7]

    MaskGIT: Masked generative image transformer,

    H. Chang, H. Zhang, L. Jiang, C. Liu, and W. T. Freeman, “MaskGIT: Masked generative image transformer,” in Proc. IEEE Conf. Comput. Vis. Pattern Recognit. (CVPR) , pp. 11315–11325, 2022

    work page 2022

  8. [8]

    Taming transformers for high- resolution image synthesis,

    P. Esser, R. Rombach, and B. Ommer, “Taming transformers for high- resolution image synthesis,” in Proc. IEEE Conf. Comput. Vis. Pattern Recognit. (CVPR) , pp. 12873–12883, 2021

    work page 2021

Show all 40 references
  1. [9]

    Goal-oriented and semantic communication in 6G AI-native networks: The 6G-GOALS approach,

    E. C. Strinati et al. , “Goal-oriented and semantic communication in 6G AI-native networks: The 6G-GOALS approach,” arXiv preprint arXiv:2402.07573, 2024

    2024 arXiv

  2. [10]

    Beyond transmitting bits: Context, semantics, and task-oriented communications,

    D. G ¨und¨uz et al. , “Beyond transmitting bits: Context, semantics, and task-oriented communications,” IEEE J. Select. Areas Commun. , vol. 41, no. 1, pp. 5–41, 2023

    2023

  3. [11]

    Generative AI-driven semantic communication networks: Architecture, technologies and applications,

    C. Liang et al. , “Generative AI-driven semantic communication networks: Architecture, technologies and applications,” arXiv:2401.00124v2, 2024

    2024 arXiv

  4. [12]

    Deep generative modeling reshapes compression and transmission: From efficiency to resiliency,

    J. Dai, X. Qin, S. Wang, L. Xu, K. Niu, and P. Zhang, “Deep generative modeling reshapes compression and transmission: From efficiency to resiliency,” IEEE Wireless Commun. , vol. 31, no. 4, pp. 48–56, 2024

    2024

  5. [13]

    Language modeling is compression,

    G. Del ´etang et al., “Language modeling is compression,” arXiv preprint arXiv:2309.10668, 2023

    2023 arXiv

  6. [14]

    Latency-aware generative semantic communications with pre-trained diffusion models,

    L. Qiao et al., “Latency-aware generative semantic communications with pre-trained diffusion models,” IEEE Wireless Commun. Lett. , 2024

    2024

  7. [15]

    Language-oriented semantic latent representation for image transmission,

    G. Cicchetti et al. , “Language-oriented semantic latent representation for image transmission,” arXiv preprint arXiv:2405.09976 , 2024

    2024 arXiv

  8. [16]

    Generative semantic communication via textual prompts: Latency performance tradeoffs,

    M. Ren et al., “Generative semantic communication via textual prompts: Latency performance tradeoffs,” arXiv preprint arXiv:2409.09715, 2024

    2024 arXiv

  9. [17]

    Extreme video compression with prediction using pre- trained diffusion models,

    B. Li et al. , “Extreme video compression with prediction using pre- trained diffusion models,” in 2024 16th International Conference on Wireless Communications and Signal Processing (WCSP) , pp. 1449– 1455, 2024

    2024

  10. [18]

    Error correction code transformer,

    Y . Choukroun and L. Wolf, “Error correction code transformer,” Proc. Adv. Neural Inf. Process. Syst. (NeurIPS) , vol. 35, pp. 38695–38705, 2022

    2022

  11. [19]

    Language-oriented communication with semantic coding and knowledge distillation for text-to-image generation,

    H. Nam et al., “Language-oriented communication with semantic coding and knowledge distillation for text-to-image generation,” in ICASSP 2024-2024 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) , pp. 13506–13510, IEEE, 2024

    2024

  12. [20]

    High perceptual quality wireless image delivery with denoising diffusion models,

    S. F. Yilmaz et al., “High perceptual quality wireless image delivery with denoising diffusion models,” in IEEE INFOCOM 2024-IEEE Confer- ence on Computer Communications Workshops (INFOCOM WKSHPS) , pp. 1–5, IEEE, 2024

    2024

  13. [21]

    Generative joint source-channel coding for semantic image transmission,

    E. Erdemir, T.-Y . Tung, P. L. Dragotti, and D. G¨und¨uz, “Generative joint source-channel coding for semantic image transmission,” IEEE J. Select. Areas Commun., vol. 41, no. 8, pp. 2645–2657, 2023

    2023

  14. [22]

    Adaptive semantic token selection for AI-native goal- oriented communications,

    A. Devoto et al., “Adaptive semantic token selection for AI-native goal- oriented communications,” arXiv preprint arXiv:2405.02330 , 2024

    2024 arXiv

  15. [23]

    Semantics-guided diffusion for deep joint source- channel coding in wireless image transmission,

    M. Zhang et al. , “Semantics-guided diffusion for deep joint source- channel coding in wireless image transmission,” arXiv preprint arXiv:2501.01138, 2025

    2025 arXiv

  16. [24]

    Distributed deep joint source-channel coding over a multiple access channel,

    S. F. Yilmaz, C. Karamanlı, and D. G ¨und¨uz, “Distributed deep joint source-channel coding over a multiple access channel,” in IEEE Inter- national Conference on Communications (ICC) , pp. 1400–1405, 2023

    2023

  17. [25]

    Orthogonal model division multiple access,

    H. Liang et al. , “Orthogonal model division multiple access,” IEEE Trans. Wireless Commun. , 2024

    2024

  18. [26]

    Deepma: End-to-end deep multiple access for wireless image transmission in semantic communication,

    W. Zhang et al., “Deepma: End-to-end deep multiple access for wireless image transmission in semantic communication,” IEEE Trans. Cogn. Commun. Netw., 2023

    2023

  19. [27]

    Exploiting semantic communication for non- orthogonal multiple access,

    X. Mu and Y . Liu, “Exploiting semantic communication for non- orthogonal multiple access,” IEEE J. Select. Areas Commun. , vol. 41, no. 8, pp. 2563–2576, 2023

    2023

  20. [28]

    Next generation multiple access for IMT towards 2030 and beyond,

    Z. Ding, R. Schober, P. Fan, and H. V . Poor, “Next generation multiple access for IMT towards 2030 and beyond,” Sci. China Inf. Sci. , vol. 67, no. 6, p. 166301, 2024

    2024

  21. [29]

    Probabilistic searching for MIMO detection based on lattice Gaussian distribution,

    Z. Wang et al. , “Probabilistic searching for MIMO detection based on lattice Gaussian distribution,” IEEE Trans. Commun. , vol. 72, no. 1, pp. 85–100, 2024, doi: 10.1109/TCOMM.2023.3278732

    2024

  22. [30]

    Randomized iterative sampling decoding algorithm for large-scale MIMO detection,

    Z. Wang et al. , “Randomized iterative sampling decoding algorithm for large-scale MIMO detection,” IEEE Trans. Signal Process. , vol. 72, pp. 580–593, 2024, doi: 10.1109/TSP.2023.3336199

    2024

  23. [31]

    Unsourced multiple access: A coding paradigm for massive random access,

    G. Liva and Y . Polyanskiy, “Unsourced multiple access: A coding paradigm for massive random access,” Proc. IEEE, 2024

    2024

  24. [32]

    Massive connectivity with massive MIMO—Part I: Device activity detection and channel estimation,

    L. Liu and W. Yu, “Massive connectivity with massive MIMO—Part I: Device activity detection and channel estimation,” IEEE Trans. Signal Process., vol. 66, pp. 2933–2946, June 2018

    2018

  25. [33]

    Sensing user’s activity, channel, and location with near- field extra-large-scale MIMO,

    L. Qiao et al., “Sensing user’s activity, channel, and location with near- field extra-large-scale MIMO,” IEEE Trans. Commun. , 2023

    2023

  26. [34]

    Covariance-based device activity detection with massive MIMO for near-field correlated channels,

    Z. Wang, Y . Li, Y .-F. Liu, and J. Ma, “Covariance-based device activity detection with massive MIMO for near-field correlated channels,” arXiv preprint arXiv:2411.05492, 2024

    2024

  27. [35]

    A perspective on massive random-access,

    Y . Polyanskiy, “A perspective on massive random-access,” inProc. IEEE Int. Symp. Inf. Theory (ISIT) , pp. 2523–2527, IEEE, 2017

    2017

  28. [36]

    Massive unsourced random access based on uncou- pled compressive sensing: Another blessing of massive MIMO,

    V . Shyianov et al., “Massive unsourced random access based on uncou- pled compressive sensing: Another blessing of massive MIMO,” IEEE J. Select. Areas Commun. , vol. 39, no. 3, pp. 820–834, 2020

    2020

  29. [37]

    Design and analysis of massive uncoupled unsourced random access with bayesian joint decoding,

    F. Tian, X. Chen, Y . L. Guan, and C. Yuen, “Design and analysis of massive uncoupled unsourced random access with bayesian joint decoding,” IEEE Trans. V eh. Technol., 2024

    2024

  30. [38]

    Massive digital over-the-air computation for communication-efficient federated edge learning,

    L. Qiao, Z. Gao, M. B. Mashhadi, and D. G ¨und¨uz, “Massive digital over-the-air computation for communication-efficient federated edge learning,” IEEE J. Select. Areas Commun. , 2024

    2024

  31. [39]

    Imagenet large scale visual recognition chal- lenge,

    O. Russakovsky et al. , “Imagenet large scale visual recognition chal- lenge,” International journal of computer vision , vol. 115, pp. 211–252, 2015

    2015

  32. [40]

    Variable-rate variable-power MQAM for fading channels,

    A. J. Goldsmith et al., “Variable-rate variable-power MQAM for fading channels,” IEEE Trans. Commun., vol. 45, no. 10, pp. 1218–1230, 1997

    1997

Pith tools

Reviewed August 8, 2026 · model on record in the stance chip above.