IEEE BITS the information theory magazine最新文献

{"title":"Timely and Massive Communication in 6G: Pragmatics, Learning, and Inference","authors":"Deniz Gündüz, Federico Chiariotti, Kaibin Huang, Anders E. Kalør, Szymon Kobus, Petar Popovski","doi":"10.1109/mbits.2023.3322667","DOIUrl":"https://doi.org/10.1109/mbits.2023.3322667","url":null,"abstract":"5G has expanded the traditional focus of wireless systems to embrace two new connectivity types: ultra-reliable low latency and massive communication. The technology context at the dawn of 6G is different from the past one for 5G, primarily due to the growing intelligence at the communicating nodes. This has driven the set of relevant communication problems beyond reliable transmission towards semantic and pragmatic communication. This paper puts the evolution of low-latency and massive communication towards 6G in the perspective of these new developments. At first, semantic/pragmatic communication problems are presented by drawing parallels to linguistics. We elaborate upon the relation of semantic communication to the information-theoretic problems of source/channel coding, while generalized real-time communication is put in the context of cyber-physical systems and real-time inference. The evolution of massive access towards massive closed-loop communication is elaborated upon, enabling interactive communication, learning, and cooperation among wireless sensors and actuators.","PeriodicalId":486961,"journal":{"name":"IEEE BITS the information theory magazine","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136008106","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Private Information Retrieval and Its Extensions: An Introduction, Open Problems, Future Directions","authors":"Sajani Vithana, Zhusheng Wang, Sennur Ulukus","doi":"10.1109/mbits.2023.3322972","DOIUrl":"https://doi.org/10.1109/mbits.2023.3322972","url":null,"abstract":"Private information retrieval (PIR) is a privacysetting that allows a user to download a required message from a set of messages stored in a system of databases without revealing the index of the required message to the databases. PIR was introduced under computational privacy guarantees, and is recently re-formulated to provide information-theoretic guarantees, resulting in <italic xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" xmlns:xlink=\"http://www.w3.org/1999/xlink\">information theoretic privacy</i> . Subsequently, many important variants of the basic PIR problem have been studied focusing on fundamental performance limits as well as achievable schemes. More recently, a variety of conceptual extensions of PIR have been introduced, such as, private set intersection (PSI), private set union (PSU), and private read-update-write (PRUW). Some of these extensions are mainly intended to solve the privacy issues that arise in distributed learning applications due to the extensive dependency of machine learning on users' private data. In this article, we first provide an introduction to basic PIR with examples, followed by a brief description of its immediate variants. We then provide a detailed discussion on the conceptual extensions of PIR, along with potential research directions.","PeriodicalId":486961,"journal":{"name":"IEEE BITS the information theory magazine","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136053817","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"6G: A Welcome Chance to Unify Channel Coding?","authors":"Marvin Geiselhart, Felix Krieg, Jannis Clausius, Daniel Tandler, Stephan ten Brink","doi":"10.1109/mbits.2023.3322974","DOIUrl":"https://doi.org/10.1109/mbits.2023.3322974","url":null,"abstract":"Channel coding is one of the workhorses of the physical layer, enabling reliable and energy-efficient data transmission. In this article, we highlight the core innovations in channel coding that have been commercialized in wireless mobile communication standards over the past decades, in the context of current and anticipated future requirements. We point out major challenges in channel coding foreseen for sixth generation networks, with the concept of “unified coding” being a possible enabler. We review promising new solutions to these challenges, such as AED and “code-agnostic” decoding.","PeriodicalId":486961,"journal":{"name":"IEEE BITS the information theory magazine","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136054224","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Channel Coding for 6 G Extreme Connectivity - Requirements, Capabilities and Fundamental Tradeoffs","authors":"Huazi Zhang, Wen Tong","doi":"10.1109/mbits.2023.3322978","DOIUrl":"https://doi.org/10.1109/mbits.2023.3322978","url":null,"abstract":"Information theory has driven the information and communication technology (ICT) industry for over seventy years. Great successes have been achieved in both academia and industry. In theory, polar codes and spatially-coupled LDPC codes have achieved the theoretical bound. In practice, capacity-approaching coding schemes such as turbo, polar and LDPC codes are adopted by global wireless standards and implemented with reasonable complexity. However, this by no means suggests a halt in future information theoretic research. For channel coding, coding gain has been the main key performance indicator (KPI). From the practical viewpoint, there is a long list of unfulfilled target KPIs that deserves rigorous and deeper understanding. The inability to fulfil these target KPIs will become the major limitations of future communication systems such as 6 G and beyond. Moreover, a diverse set of new 6 G services will require new capabilities beyond data transmissions. New opportunities will be created for information theory and channel coding. Above all, we hope that the readers of this survey find the discussion of motivational background and preliminary results from an industry perspective helpful.","PeriodicalId":486961,"journal":{"name":"IEEE BITS the information theory magazine","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136052851","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Machine Learning: Enabling and Enabled by Advances in Storage and Memory Systems","authors":"Anxiao Jiang, Erich F. Haratsch","doi":"10.1109/mbits.2023.3314392","DOIUrl":"https://doi.org/10.1109/mbits.2023.3314392","url":null,"abstract":"Machine learning is becoming an important tool for analyzing and enabling storage/memory systems. At the same time, it also needs new innovations in storage/memory systems to store its increasingly large models reliably, and to run its increasingly costly models efficiently. This paper reviews some recent topics on the interactions between machine learning and storage/memory systems. They range from supervised learning to unsupervised and generative learning, from magnetic recording to 2D and 3D flash memories, from analog error-correcting codes for compute-in-memory to binary codes for protecting trained deep learning models, and from storage channel modeling, bit-error rate prediction, signal detection to symbolic regression. The continuation of research in the area can lead to deeper synergy between AI and storage/memory for more scientific and engineering discoveries.","PeriodicalId":486961,"journal":{"name":"IEEE BITS the information theory magazine","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135402808","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Error Correction for DNA Storage","authors":"Jin Sima, Netanel Raviv, Moshe Schwartz, Jehoshua Bruck","doi":"10.1109/mbits.2023.3318516","DOIUrl":"https://doi.org/10.1109/mbits.2023.3318516","url":null,"abstract":"DNA-based storage is an emerging storage technology that provides high information density and long duration. Due to the physical constraints in the reading and writing processes, error correction in DNA storage poses several interesting coding theoretic challenges, some of which are new. In this paper, we give a brief introduction to some of the coding challenges for DNA-based storage, including deletion/insertion correcting codes, codes over sliced channels, and duplication correcting codes.","PeriodicalId":486961,"journal":{"name":"IEEE BITS the information theory magazine","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135699083","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Spectral vs Energy Efficiency in 6 G: Impact of the Receiver Front-End","authors":"Angel Lozano, Sundeep Rangan","doi":"10.1109/mbits.2023.3322975","DOIUrl":"https://doi.org/10.1109/mbits.2023.3322975","url":null,"abstract":"This article puts the spotlight on the receiver front-end (RFE), an integral part of any wireless device that information theory typically idealizes into a mere addition of noise. While this idealization was sound in the past, as operating frequencies, bandwidths, and antenna counts rise, a soaring amount of power is required for the RFE to behave accordingly. Containing this surge in power expenditure exposes a harsher behavior on the part of the RFE (more noise, nonlinearities, and coarse quantization), setting up a tradeoff between the spectral efficiency under such nonidealities and the efficiency in the use of energy by the RFE. With the urge for radically better power consumptions and energy efficiencies in 6 G, this emerges as an issue on which information theory can cast light at a fundamental level. More broadly, this article advocates the interest of having information theory embrace the device power consumption in its analyses. In turn, this calls for new models and abstractions such as the ones herein put together for the RFE, and for a more holistic perspective.","PeriodicalId":486961,"journal":{"name":"IEEE BITS the information theory magazine","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136053812","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Exploiting the Depth and Angular Domains for Massive Near-Field Spatial Multiplexing","authors":"Parisa Ramezani, Alva Kosasih, Amna Irshad, Emil Björnson","doi":"10.1109/mbits.2023.3322670","DOIUrl":"https://doi.org/10.1109/mbits.2023.3322670","url":null,"abstract":"In this article, we present our vision for how extremely large aperture arrays (ELAAs), equipped with hundreds or thousands of antennas, can play a major role in future 6G networks by enabling a remarkable increase in data rates through spatial multiplexing of a massive number of data streams to both a single user and many simultaneous users. Specifically, with the quantum leap in the array aperture size, the users will be in the so-called radiative near-field region of the array, where previously negligible physical phenomena dominate the propagation conditions and give the channel matrices more favorable properties. This article presents the foundational properties of communication in the radiative near-field region and then exemplifies how these properties enable two unprecedented spatial multiplexing schemes: depth-domain multiplexing of multiple users and angular multiplexing of data streams to a single user. We also highlight research challenges and open problems that require further investigation.","PeriodicalId":486961,"journal":{"name":"IEEE BITS the information theory magazine","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136007929","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"OTFS - Predictability in the Delay- Doppler Domain and Its Value to Communication and Radar Sensing","authors":"Saif Khan Mohammed, Ronny Hadani, Ananthanarayanan Chockalingam, Robert Calderbank","doi":"10.1109/mbits.2023.3319595","DOIUrl":"https://doi.org/10.1109/mbits.2023.3319595","url":null,"abstract":"In our first paper [2] we explained why the Zak-OTFS input-output (I/O) relation is predictable and non-fading when the delay and Doppler periods are greater than the effective channel delay and Doppler spreads, a condition which we refer to as the crystallization condition. We argued that a communication system should operate within the crystalline regime. It is well known that it is possible to identify a linear time varying (LTV) channel if and only if it is under-spread. The crystallization condition is more restrictive than the under-spread condition, so identification is always possible. In the crystalline regime, we show that Zak-OTFS pilot sequences minimize the complexity of identifying the effective DD domain channel filter. We demonstrate that the filter taps can simply be read off from the response to a single Zak-OTFS pilot. In general, we provide an explicit formula for reconstructing the Zak-OTFS I/O relation from a finite number of received pilot symbols in the delay- Doppler (DD) domain. This reconstruction formula makes it possible to study predictability of the Zak-OTFS I/O relation for a sampled system that operates under finite duration and bandwidth constraints. We analyze reconstruction accuracy for different choices of the delay and Doppler periods, and of the pulse shaping filter. Reconstruction accuracy is high when the crystallization condition is satisfied, implying that it is possible to learn directly the I/O relation without needing to estimate the underlying channel. This opens up the possibility of a model-free mode of operation, which is especially useful when a traditional model-dependent mode of operation (reliant on estimation of the underlying physical channel) is out of reach (for example, when the channel comprises of unresolvable paths, or exhibits a continuous delay- Doppler profile such as in presence of acceleration). Our study clarifies the fundamental origins of predictability by revealing how non-predictability appears as a consequence of aliasing in the DD domain. This perspective leads to a canonical decomposition of the effective DD channel as a sum of predictable and non-predictable components, which we refer to as the crystalline decomposition. Vanishing of the non-predictable component of the channel is equivalent to satisfying the crystallization condition. Finally, we measure the benefits of predictability in terms of bit error rate (BER) performance. We consider two cases. In the first, we measure performance given perfect knowledge of the I/O relation. We show that performance is optimal when the crystallization condition holds, that performance approaches that of Time Domain Modulation (TDM) when the Doppler period vanishes, and approaches that of Frequency Domain Modulation (FDM) when the delay period vanishes. In the second, we measure performance given imperfect knowledge of the I/O relation, as is the case when it is not possible to learn the underlying channel. We show that model-free","PeriodicalId":486961,"journal":{"name":"IEEE BITS the information theory magazine","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135794321","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}