Test Whats new message.
Scheduled Maintenance on Monday 1/13/2025
Single article sales and account management will be unavailable from 5:00 AM - 7:00 PM ET (09:00 - 23:00 UTC). We apologize for the inconvenience.
Showing 1-25 of 59 results
- Sort
Filter Results
Show
Sort By
Results
Integrated Communication and Binary State Detection Under Unequal Error Constraints
IEEE Transactions on Communications
Year: 2025 | Early Access Article |
This work considers a problem of integrated sensing and communication (ISAC) in which the goal of sensing is to detect a binary state. Unlike most approaches that minimize the total detection error probability, in our work, we disaggregate the error probability into false alarm and missed detection probabilities and investigate their information-theoretic three-way tradeoff including communication...Show More
Integrated Communication and Binary State Detection Under Unequal Error Constraints
Year: 2025 | Early Access Article |
Integrated Communication and Binary State Detection from Hoeffding's Perspective
2024 22nd International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)
Year: 2024 | Conference Paper |
This work considers a problem of integrated sensing and communication (ISAC) from an information-theoretic per-spective, in which the goal of sensing is to detect a binary state. We assume a broadcast channel that consists of a transmitter, a communication receiver, and a binary detector where the detector's channel is affected by an unknown binary state. Unlike most approaches where the detection...Show More
On the Fundamental Tradeoff of Joint Communication and Quickest Change Detection with State-Independent Data Channels
IEEE Transactions on Communications
Year: 2024 | Early Access Article |
In this work, we take the initiative in studying the information-theoretic tradeoff between communication and quickest change detection (QCD) under an integrated sensing and communication setting. We formally establish a joint communication and sensing problem for the quickest change detection. We assume a broadcast channel with a transmitter, a communication receiver, and a QCD detector in which ...Show More
On the Fundamental Tradeoff of Joint Communication and Quickest Change Detection
2024 IEEE International Symposium on Information Theory (ISIT)
Year: 2024 | Conference Paper |
Cited by: Papers (2)
In this study, we investigate the tradeoff between communication rate and quickest change detection (QCD) in integrated sensing and communication. We establish a joint problem for QCD, utilizing constant subblock-composition codes and a modified CuSum detection rule, named subblock CuSum (SCS). This approach provides an inner bound for the tradeoff between communication rate and change point detec...Show More
In many sensor network applications, a fusion center often has additional valuable information, such as context data, which cannot be obtained directly from the sensors. Motivated by this, we study a generalized CEO problem where a CEO has access to context information. The main contribution of this work is twofold. Firstly, we characterize the asymptotically optimal error exponent per rate as the...Show More
Distributed Lossy Computation with Structured Codes: From Discrete to Continuous Sources
Adriano Pastore;Sung Hoon Lim;Chen Feng;Bobak Nazer;Michael Gastpar
2023 IEEE International Symposium on Information Theory (ISIT)
Year: 2023 | Conference Paper |
This paper considers the problem of distributed lossy compression where the goal is to recover one or more linear combinations of the sources at the decoder, subject to distortion constraints. For certain configurations, it is known that codes with algebraic structure can outperform i.i.d. codebooks. For the special case of finite-alphabet sources, recent work has demonstrated how to incorporate j...Show More
In this paper, we consider the problem of decision making in the context of a dense heterogeneous network with a macro base station and multiple small base stations. We propose a deep Q-learning based algorithm that efficiently minimizes the overall energy consumption by taking into account both the energy consumption from transmission and overheads, and various network information such as channel...Show More
A Unified Discretization Approach to Compute–Forward: From Discrete to Continuous Inputs
Adriano Pastore;Sung Hoon Lim;Chen Feng;Bobak Nazer;Michael Gastpar
Compute–forward is a coding technique that enables receiver(s) in a network to directly decode one or more linear combinations of the transmitted codewords. Initial efforts focused on Gaussian channels and derived achievable rate regions via nested lattice codes and single-user (lattice) decoding as well as sequential (lattice) decoding. Recently, these results have been generalized to discrete me...Show More
A Discretization Approach to Compute–Forward
Adriano Pastore;Sung Hoon Lim;Chen Feng;Bobak Nazer;Michael Gastpar
2021 IEEE International Symposium on Information Theory (ISIT)
Year: 2021 | Conference Paper |
Cited by: Papers (2)
We present a novel unified framework of compute-forward achievable rate regions for simultaneous decoding of multiple linear codeword combinations. This framework covers a wide class of discrete and continuous-input channels, and computation over finite fields, integers, and reals. The resulting rate regions recover several well-known achievability results, and in some cases extend them. The frame...Show More
Distributed Online Handover Decisions for Energy Efficiency in Dense HetNets
GLOBECOM 2020 - 2020 IEEE Global Communications Conference
Year: 2020 | Conference Paper |
Cited by: Papers (4)
In this paper, we consider the problem of handover decision making in the context of a dense heterogeneous network with a macro base station and multiple small base stations. We propose a distributed deep Q-learning based algorithm that minimizes the overall energy consumption by taking into account both the energy consumption from transmission and hand over overheads. The proposed algorithm is pe...Show More
Online Learning for Joint Beam Tracking and Pattern Optimization in Massive MIMO Systems
IEEE INFOCOM 2020 - IEEE Conference on Computer Communications
Year: 2020 | Conference Paper |
Cited by: Papers (20)
In this paper, we consider a joint beam tracking and pattern optimization problem for massive multiple input multiple output (MIMO) systems in which the base station (BS) selects a beamforming codebook and performs adaptive beam tracking taking into account the user mobility. A joint adaptation scheme is developed in a two-phase reinforcement learning framework which utilizes practical signaling a...Show More
Compute-Forward for DMCs: Simultaneous Decoding of Multiple Combinations
Sung Hoon Lim;Chen Feng;Adriano Pastore;Bobak Nazer;Michael Gastpar
Algebraic network information theory is an emerging facet of network information theory, studying the achievable rates of random code ensembles that have algebraic structure, such as random linear codes. A distinguishing feature is that linear combinations of codewords can sometimes be decoded more efficiently than codewords themselves. The present work further develops this framework by studying ...Show More
On the Optimal Achievable Rates for Linear Computation With Random Homologous Codes
The problem of computing a linear combination of sources over a multiple access channel is studied. Inner and outer bounds on the optimal tradeoff between the communication rates are established when encoding is restricted to random ensembles of homologous codes, namely, structured nested coset codes from the same generator matrix and individual shaping functions, but when decoding is optimized wi...Show More
On Cooperative Achievable Rates of UAV Assisted Cellular Networks
In this paper, we study an UAV base station (UBS) assisted cellular network that consists of a single ground macro base station (MBS), multiple UBSs, and multiple ground terminals. We assume that the MBS transmits to the UBSs and the terminals in the licensed band while the UBSs use a separate unlicensed band (e.g., Wi-Fi) to transmit to the terminals. For the utilization of the UBSs, we propose a...Show More
On Cooperative Achievable Rates of UAV Assisted Cellular Networks
Yujae Song;Sung Hoon Lim;Sang-Woon Jeon;Seungjae Baek;Huicheol Shin
2019 IEEE Vehicular Networking Conference (VNC)
Year: 2019 | Conference Paper |
In this paper, we consider an aerial UAV base station (UBS) assisted cellular network that consists of a single ground macro base station (MBS), multiple UBSs, and multiple ground terminals. We assume that the MBS transmits in a licensed band while the UBSs use a separate unlicensed band to transmit to the terminals. For the utilization of the UBSs, we propose a cooperative decode-forward (DF) pro...Show More
Towards an Algebraic Network Information Theory: Distributed Lossy Computation of Linear Functions
Sung Hoon Lim;Chen Feng;Adriano Pastore;Bobak Nazer;Michael Gastpar
2019 IEEE International Symposium on Information Theory (ISIT)
Year: 2019 | Conference Paper |
Cited by: Papers (5)
Consider the important special case of the K-user distributed source coding problem where the decoder only wishes to recover one or more linear combinations of the sources. The work of Körner and Marton demonstrated that, in some cases, the optimal rate region is attained by random linear codes, and strictly improves upon the best-known achievable rate region established via random i.i.d. codes. R...Show More
Compute–Forward Multiple Access (CFMA): Practical Implementations
Erixhen Sula;Jingge Zhu;Adriano Pastore;Sung Hoon Lim;Michael Gastpar
We present a practical strategy that aims to attain rate points on the dominant face of the multiple access channel capacity using a standard low complexity decoder. This technique is built upon recent theoretical developments of Zhu and Gastpar on compute-forward multiple access which achieves the capacity of the multiple access channel using a sequential decoder. We illustrate this strategy with...Show More
Communication Versus Computation: Duality for Multiple-Access Channels and Source Coding
Computation codes in network information theory are designed for scenarios where the decoder is not interested in recovering the information sources themselves, but only a function thereof. Körner and Marton showed for distributed source coding (DSC) that such function decoding can be achieved more efficiently than decoding the full information sources. Compute-forward has shown that function deco...Show More
Simultaneous Wireless Information and Power Transfer for the MISO Interference Channel: Gain from Decoding Interferences
2018 IEEE 88th Vehicular Technology Conference (VTC-Fall)
Year: 2018 | Conference Paper |
We study a simultaneous wireless information and power transfer (SWIPT) setup for the K-user multiple-input single-output (MISO) interference channel. Each transmitter can either send a private or a common message, and each receiver uses a power splitting method that divides the received signal into two parts for information decoding and energy harvesting. The private message is recovered by the d...Show More
A Joint Typicality Approach to Compute–Forward
Sung Hoon Lim;Chen Feng;Adriano Pastore;Bobak Nazer;Michael Gastpar
This paper presents a joint typicality framework for encoding and decoding nested linear codes in multi-user networks. This framework provides a new perspective on compute-forward within the context of discrete memoryless networks. In particular, it establishes an achievable rate region for computing a linear combination over a discrete memoryless multiple-access channel (MAC). When specialized to...Show More
Optimal Achievable Rates for Computation With Random Homologous Codes
2018 IEEE International Symposium on Information Theory (ISIT)
Year: 2018 | Conference Paper |
Cited by: Papers (4)
Recent studies by Padakandla and Pradhan, and by Lim, Feng, Pastore, Nazer, and Gastpar built the framework of nested coset codes for the computation problem, namely, computing a desired linear combination of sources over a multiple access channel. This paper presents an outer bound on the optimal rate region for the computation problem when the encoding strategy is restricted to random ensembles ...Show More
On the Effects of Subpacketization in Content-Centric Mobile Networks
A large-scale content-centric mobile ad hoc network employing subpacketization is studied in which each mobile node having finite-size cache moves according to the reshuffling mobility model and requests a content object from the library independently at random according to the Zipf popularity distribution. Instead of assuming that one content object is transferred in a single time slot, we consid...Show More
Simultaneous Wireless Information and Power Transfer for Internet of Things Sensor Networks
IEEE Internet of Things Journal
Cited by: Papers (48)
In this paper, we study simultaneous wireless information and power transfer (SWIPT) for Internet of Things (IoT) sensor networks. The transmitters (e.g., access point) employ hybrid beamforming and each IoT receiver adopts a power splitting (PS) method that divides the received signal into two parts for information recovery and energy harvesting. We propose a novel strategy for SWIPT in which the...Show More
Physical-Layer Network Coding Based Throughput-Optimal Transmission for Bidirectional Traffic
In this study, we develop a physical-layer network coding based throughput-optimal transmission scheduling policy, which we call network coding aware maximum differential backlog (NCMDB), and demonstrate its throughput optimality. As the proposed policy requires an NP-hard network-wide centralized algorithm to determine the optimal transmission schedule, we propose a distributed NCMDB based on lin...Show More
Degrees of Freedom of Full-Duplex Multiantenna Cellular Networks
We study Please be advised that per instructions from the Communications Society this proof was formatted in Times Roman font and therefore some of the fonts will appear different from the fonts in your originally submitted manuscript. For instance, the math calligraphy font may appear different due to usage of the usepackage[mathcal]euscript. The Communications Society has decided not to use Comp...Show More
IEEE Account
Purchase Details
Profile Information
Need Help?
- US & Canada: +1 800 678 4333
- Worldwide: +1 732 981 0060
- Contact & Support
- About IEEE Xplore
- Contact Us
- Help
- Accessibility
- Terms of Use
- Nondiscrimination Policy
- Sitemap
- Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.
© Copyright 2025 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.