On the role of MMSE estimation in approaching the information-theoretic limits of linear Gaussian channels: Shannon meets Wiener

Abstract

We discuss why MMSE estimation arises in lattice-based schemes for approaching the capacity of linear Gaussian channels, and comment on its properties.

10 pages, 2 figures

Cited by in corpus (40)

• An Algebraic Approach to Physical-Layer Network Coding
• Semantically Secure Lattice Codes for the Gaussian Wiretap Channel
• The Wiretap Channel with Feedback: Encryption over the Channel
• Nomographic Functions: Efficient Computation in Clustered Gaussian Sensor Networks
• Nested Lattice Codes for Gaussian Relay Networks with Interference
• Multiple Description Quantization via Gram-Schmidt Orthogonalization
• Strongly Secure Communications Over the Two-Way Wiretap Channel
• Providing Secrecy With Structured Codes: Tools and Applications to Two-User Gaussian Channels
• Capacity of the Gaussian Two-way Relay Channel to within 1/2 Bit
• Shannon meets Wiener II: On MMSE estimation in successive decoding schemes
• Reliable Physical Layer Network Coding
• Eigen-Direction Alignment Based Physical-Layer Network Coding for MIMO Two-Way Relay Channels
• On the Achievable Rate-Regions for State-Dependent Gaussian Interference Channel
• On Stochastic Orders and Fast Fading Multiuser Channels with Statistical CSIT
• Construction ${\pi }_A$ and ${\pi }_D$ Lattices: Construction, Goodness, and Decoding Algorithms
• Control-theoretic Approach to Communication with Feedback: Fundamental Limits and Code Design
• On the Fundamental Feedback-vs-Performance Tradeoff over the MISO-BC with Imperfect and Delayed CSIT
• Strong Coordination over Noisy Channels
• On the Capacity of Multiplicative Finite-Field Matrix Channels
• Lattice Sequential Decoding for LAST Coded MIMO Channels: Achievable Rate, DMT, and Complexity Analysis
• Nested Lattice Codes for Gaussian Two-Way Relay Channels
• Joint Coordination-Channel Coding for Strong Coordination over Noisy Channels Based on Polar Codes
• Geometric Relationships Between Gaussian and Modulo-Lattice Error Exponents
• Low-Complexity Iterative Algorithms for (Discrete) Compressed Sensing
• Strong Secrecy from Channel Resolvability
• Gaussian Channels with Feedback: Optimality, Fundamental Limitations, and Connections of Communication, Estimation, and Control
• Cooperative Compute-and-Forward
• Strong Secrecy and Reliable Byzantine Detection in the Presence of an Untrusted Relay
• On the Feedback Capacity of the Fully Connected $K$-User Interference Channel
• Hard and Soft Spherical-Bound Stack decoder for MIMO systems
• Compute-and-Forward Can Buy Secrecy Cheap
• Towards Scalable Security in Interference Channels With Arbitrary Number of Users
• Structured interference-mitigation in two-hop networks
• Lattice Coding for Downlink Multiuser Transmission
• Quantized Compute and Forward: A Low-Complexity Architecture for Distributed Antenna Systems
• Distributed and Cascade Lossy Source Coding with a Side Information "Vending Machine"
• Polar Coding for the Wiretap Broadcast Channel with Multiple Messages
• A Lattice Compress-and-Forward Scheme
• Preserving Confidentiality in The Gaussian Broadcast Channel Using Compute-and-Forward
• Achieving AWGN Channel Capacity With Lattice Gaussian Coding