kth.sePublikationer KTH
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
SumComp: Coding for Digital Over-the-Air Computation via the Ring of Integers
KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Nätverk och systemteknik.ORCID-id: 0000-0003-4519-9204
Uppsala Univ, Dept Informat Technol, S-75105 Uppsala, Sweden.ORCID-id: 0000-0002-4503-4242
KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Nätverk och systemteknik. KTH, Skolan för elektroteknik och datavetenskap (EECS), Centra, Digital futures.ORCID-id: 0000-0001-9810-3478
2025 (Engelska)Ingår i: IEEE Transactions on Communications, ISSN 0090-6778, E-ISSN 1558-0857, Vol. 73, nr 2, s. 752-767Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

Communication and computation are traditionally treated as separate entities, allowing for individual optimizations. However, many applications focus on local information's functionality rather than the information itself. For such cases, harnessing interference for computation in a multiple access channel through digital over-the-air computation can notably increase the computation, as established by the ChannelComp method. However, the coding scheme originally proposed in ChannelComp may suffer from high computational complexity because it is general and is not optimized for specific modulation categories. Therefore, this study considers a specific category of digital modulations for over-the-air computations, quadrature amplitude modulation (QAM) and pulse-amplitude modulation (PAM), for which we introduce a novel coding scheme called SumComp. Furthermore, we derive a mean squared error (MSE) analysis for SumComp coding in the computation of the arithmetic mean function and establish an upper bound on the mean absolute error (MAE) for a set of nomographic functions. Simulation results are presented to affirm the superior performance of SumComp coding compared to traditional analog over-the-air computation and the original coding in ChannelComp approaches in terms of both MSE and MAE over a noisy multiple access channel. Specifically, SumComp coding shows at least 10 dB improvements for computing arithmetic and geometric mean on the normalized MSE for low noise scenarios.

Ort, förlag, år, upplaga, sidor
Institute of Electrical and Electronics Engineers (IEEE) , 2025. Vol. 73, nr 2, s. 752-767
Nyckelord [en]
Encoding, Modulation, Digital modulation, Wireless networks, Quadrature amplitude modulation, Lattices, Optimization, Constellation points, Gaussian integers, over-the-air computation, modulation coding, ring of integers
Nationell ämneskategori
Telekommunikation
Identifikatorer
URN: urn:nbn:se:kth:diva-360959DOI: 10.1109/TCOMM.2024.3450794ISI: 001426306700024Scopus ID: 2-s2.0-85202719230OAI: oai:DiVA.org:kth-360959DiVA, id: diva2:1942890
Anmärkning

QC 20251002

Tillgänglig från: 2025-03-06 Skapad: 2025-03-06 Senast uppdaterad: 2025-10-02Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltextScopus

Person

Razavikia, SaeedFischione, Carlo

Sök vidare i DiVA

Av författaren/redaktören
Razavikia, Saeedda Silva Jr, Jose Mairton BarrosFischione, Carlo
Av organisationen
Nätverk och systemteknikDigital futures
I samma tidskrift
IEEE Transactions on Communications
Telekommunikation

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetricpoäng

doi
urn-nbn
Totalt: 90 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf