{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T16:22:42Z","timestamp":1781713362365,"version":"3.54.5"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T00:00:00Z","timestamp":1638316800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100012542","name":"Sichuan Science and Technology Program","doi-asserted-by":"publisher","award":["2021YFH0014"],"award-info":[{"award-number":["2021YFH0014"]}],"id":[{"id":"10.13039\/100012542","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62071090"],"award-info":[{"award-number":["62071090"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Hong Kong General Research Fund","award":["14201920"],"award-info":[{"award-number":["14201920"]}]},{"name":"Hong Kong General Research Fund","award":["14202421"],"award-info":[{"award-number":["14202421"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Select. Areas Commun."],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1109\/jsac.2021.3118348","type":"journal-article","created":{"date-parts":[[2021,10,6]],"date-time":"2021-10-06T22:46:54Z","timestamp":1633560414000},"page":"3757-3771","source":"Crossref","is-referenced-by-count":27,"title":["Temporal-Structure-Assisted Gradient Aggregation for Over-the-Air Federated Edge Learning"],"prefix":"10.1109","volume":"39","author":[{"given":"Dian","family":"Fan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0433-6535","authenticated-orcid":false,"given":"Xiaojun","family":"Yuan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7304-6849","authenticated-orcid":false,"given":"Ying-Jun Angela","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"crossref","first-page":"2371","DOI":"10.1109\/TIT.2011.2111010","article-title":"Estimation in Gaussian noise: Properties of the minimum mean-square error","volume":"57","author":"guo","year":"2011","journal-title":"IEEE Trans Inf Theory"},{"key":"ref33","author":"pearl","year":"1988","journal-title":"Probabilistic Reasoning in Intelligent Systems Networks of Plausible Inference"},{"key":"ref32","author":"goodfellow","year":"2016","journal-title":"Deep Learning"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2017.2787708"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2222382"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2017.7966217"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0909892106"},{"key":"ref35","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","article-title":"Maximum likelihood from incomplete data via the EM algorithm","volume":"39","author":"dempster","year":"1977","journal-title":"J Roy Statist Soc B Statist Methodol"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/18.910572"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.2981904"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.2974748"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2019.8852172"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2019.8761315"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.3015671"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.3038407"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.3024629"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2019.2946245"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2019.2961673"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.3039309"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/110830629"},{"key":"ref4","first-page":"1709","article-title":"QSGD: Communication-efficient SGD via gradient quantization and encoding","author":"alistarh","year":"2017","journal-title":"Proc Int Conf Neural Inf Process Syst (NIPS)"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2015.2414951"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2019.2941458"},{"key":"ref6","first-page":"560","article-title":"SignSGD: Compressed optimisation for non-convex problems","author":"bernstein","year":"2018","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2020.3012287"},{"key":"ref5","first-page":"1058","article-title":"1-bit stochastic gradient descent and its application to data-parallel distributed training of speech DNNs","author":"seide","year":"2014","journal-title":"Proc Annu Conf Int Speech Commu Assoc (INTERSPEECH)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.3041185"},{"key":"ref7","first-page":"1","article-title":"Deep gradient compression: Reducing the communication bandwidth for distributed training","author":"lin","year":"2018","journal-title":"Proc Int Conf Learn Represent (ICLR)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.001.1900103"},{"key":"ref9","article-title":"Sparse communication for training deep networks","author":"eghlidi","year":"2020","journal-title":"arXiv 2009 09271"},{"key":"ref1","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","author":"mcmahan","year":"2017","journal-title":"Proc Int Conf Artif Int Statist (AISTATS)"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3078783"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2021.3086116"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.2989580"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.904785"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2021.3065920"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2014.2351822"},{"key":"ref25","first-page":"1","article-title":"Learning both weights and connections for efficient neural networks","author":"han","year":"2015","journal-title":"Proc Int Conf Neural Inf Process Syst (NIPS)"}],"container-title":["IEEE Journal on Selected Areas in Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/49\/9620733\/09562516.pdf?arnumber=9562516","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T11:40:51Z","timestamp":1725882051000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9562516\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12]]},"references-count":38,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/jsac.2021.3118348","relation":{},"ISSN":["0733-8716","1558-0008"],"issn-type":[{"value":"0733-8716","type":"print"},{"value":"1558-0008","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12]]}}}