REVIEW 3 cited by
Token-Domain Multiple Access: Exploiting Semantic Orthogonality for Collision Mitigation
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
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.
Forward citations
Cited by 3 Pith papers
-
Adaptive Semantic Token Communication for Transformer-based Edge Inference
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...
-
Text-Guided Token Communication for Wireless Image Transmission
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.
-
Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search
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.
Discussion (0). Continue with ORCID to comment.