检索结果-内蒙古大学图书馆

lattice coding for the Two-Way Line Network

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2014年第9期32卷 1707-1720页

作者： Song, Yiwei Devroye, Natasha Shao, Huai-Rong Ngo, Chiu Y. Univ Illinois Dept Elect & Comp Engn Chicago IL 60607 USA Samsung Elect US R&D Ctr SISA San Jose CA 95134 USA

Full-duplex allows for the simultaneous flow of information in two directions and, in point-to-point Gaussian two-way channels, doubles capacity. A two-way line network where two sources exchange messages through multiple serial relays is considered. It is shown that when all nodes are full duplex, one may achieve to within a constant gap, independent of the number of relays, of the capacity of two one-way line networks. This shows that, even in the presence of relays that carry information in two directions, full duplex is able to approximately double capacity. A novel lattice coding scheme is developed for the two-way line network with two relays, which may be extended to an arbitrary number of relays and to half-duplex scenarios. The key technical contribution is the achievability strategy, where each relay decodes the sum of several signals ( using lattice codes) and then re-encodes it into another lattice codeword. This allows other nodes to again decode sums of codewords. The presented lattice-coding-based scheme ensures that both directions simultaneously fully utilize the relays' powers, even for asymmetric channels. The symmetric rate achieved by the proposed scheme is within 0.5 log 5 bit/Hz/s of the symmetric rate capacity regardless of the number of relays.

关键词： Full-duplex two-way line network lattice coding two-way relay channel

来源：评论

学校读者我要写书评

暂无评论

Cooperative lattice coding and decoding in half-duplex channels

引用

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS 2007年第2期25卷 268-279页

作者： Murugan, Arul Azarian, Karnbiz El Gamal, Hesharn Ohio State Univ Dept Elect Engn Columbus OH 43210 USA

We propose novel lattice coding/decoding schemes for half-duplex outage-limited cooperative channels. These schemes are inspired by the cooperation protocols of Azarian et al. and enjoy an excellent performance-complexity tradeoff. More specifically, for the relay channel, we first use our lattice coding framework to generalize Yang and Belfiore implementation of the non-orthogonal amplify and forward cooperation protocol. This generalization is shown to offer significant performance gains while keeping the decoding complexity manageable. We then devise a novel variant of the dynamic decode and forward protocol, along with a lattice-coded implementation, which enjoys a near-optimal diversity-multiplexing tradeoff with a low encoding/decoding complexity. Finally, for the cooperative multiple-access channel, we present a lattice-coded implementation of the non-orthogonal amplify and forward protocol and demonstrate its excellent performance-complexity tradeoff. Throughout the paper, we establish the performance gains of our proposed protocols via a comprehensive simulation study.

关键词： lattice coding lattice decoding half-duplex channels tree search MMSE-Fano decoder amplify and forward decode and forward cooperative multiple access

来源：评论

学校读者我要写书评

暂无评论

Employing a Pseudo-Random Sequence to Secure a lattice coding Scheme 27

Employing a Pseudo-Random Sequence to Secure a Lattice Codin...

引用

27th Iranian Conference on Electrical Engineering (ICEE)

作者： Sanandaji, Nader Falahati, Abolfazl Iran Univ Sci & Technol Dept Elect Engn Tehran Iran

ISBN: (纸本)9781728115085

A pseudo-random antipodal sequence that is accessible to transmitter and legitimate receiver is employed over a lattice coding scheme to provide the required security. Traditionally, pseudo-random sequences are employed in spread spectrum techniques to maintain the security of a wireless communication system. However, spread spectrum techniques require a huge amount of bandwidth that is a major constraint for wireless systems. Nonetheless, in the proposed scheme, the pseudo-random sequence is employed over channel coding level, so the bandwidth limitation of the spread spectrum is eased significantly. Mathematically, it is proved that the eavesdropper suffers from a degraded channel compared with legitimate receiver, and at high signal to noise ratio regimes, the proposed scheme can considerably deliver the required secrecy.

关键词： physical layer security lattice coding wiretap channel secrecy capacity

来源：评论

学校读者我要写书评

暂无评论

Wyner-Ziv Nested lattice coding for Single-Cell Multicast Service Delivery 28

Wyner-Ziv Nested Lattice Coding for Single-Cell Multicast Se...

引用

28th Annual IEEE International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)

作者： Smirani, Sinda Denis, Juwendo Ghariani, Takoua Diomonde, Bakarime Jouaber, Badii Telecom SudParis Inst Mines Telecom CNRS UMR 5157SAMOVAR Evry Essonne France

ISBN: (纸本)9781538635315

This paper addresses the problem of physical-layer multicasting over single-cell point-to-multipoint communication. We consider a base station that needs to convey a common information to a group of users. We propose a Wyner-Ziv coder (WZC) based on doubly nested lattice quantization. In our scheme, we use the base layer generated by a standard coder as the decoder side information. Then, WZC is performed for enhancing the quality of the transmitted message. With the proposed layered coding, two enhancement messages will be generated, the first for all users and the second for only a subgroup of users with the best channel conditions. We optimize the scheme parameters in order to maximize the multicast rate and minimize the reconstruction distortion at all users. The efficiency of the proposed scheme is confirmed by the rate-distortion performance results that show significant decrease of the decoded signal distortion, compared to the basic multicasting scheme.

关键词： Point-to-multipoint communication Wyner-Ziv coder lattice coding enhancement layers subgrouping

来源：评论

学校读者我要写书评

暂无评论

Achieving AWGN Channel Capacity With lattice Gaussian coding

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2014年第10期60卷 5918-5929页

作者： Ling, Cong Belfiore, Jean-Claude Univ London Imperial Coll Sci Technol & Med Dept Elect & Elect Engn London SW7 2AZ England Telecom ParisTech Dept Commun & Elect F-75013 Paris France

We propose a new coding scheme using only one lattice that achieves the 1/2 log(1 + SNR) capacity of the additive white Gaussian noise (AWGN) channel with lattice decoding, which is provable for signal-to-noise ratio SNR > e at present. The scheme applies a discrete Gaussian distribution over an AWGN-good lattice, but otherwise does not require a shaping lattice or dither. Thus, it significantly simplifies the default lattice coding scheme of Erez and Zamir which involves a quantization-good lattice as well as an AWGN-good lattice. Using the flatness factor, we show that the error probability of the proposed scheme under minimum mean-square error lattice decoding is almost the same as that of Erez and Zamir, for any rate up to the AWGN channel capacity. We introduce the notion of good constellations, which carry almost the same mutual information as that of continuous Gaussian inputs. We also address the implementation of Gaussian shaping for the proposed lattice Gaussian coding scheme.

关键词： Channel capacity flatness factor lattice coding lattice Gaussian distribution MMSE

来源：评论

学校读者我要写书评

暂无评论

lattice-Based coding to Enhance Error Performance of the Hidden Direct Sequence Spread Spectrum

引用

IETE JOURNAL OF RESEARCH 2021年第6期67卷 754-766页

作者： Sanandaji, Nader Falahati, Abolfazl Iran Univ Sci & Technol IUST Dept Elect Engn Digital Coding & Cryptog Lab DCCL Tehran Iran

A direct sequence spread spectrum is employed together with a lattice coding scheme to enhance physical layer security and efficiency of a wireless communication system against the denial of service attacks, due to the presence of deliberate unwanted interferences. Based on the results, using a direct sequence spread spectrum together with a random "construction A" lattice coding scheme named "DSSS/RCA" can highly improve the error performance compared with similar methods. Regarding a typically large block code length, some constraints on the coding rate and average signal to noise ratio are drawn to guarantee a block error probability which is asymptotically close to zero. Also, the secrecy capacity of DSSS/RCA is investigated and the achievability of perfect secrecy is verified.

关键词： Block error rate Direct sequence spread spectrum Forward error correction coding Interference mitigation lattice coding Secrecy capacity Sphere decoding

来源：评论

学校读者我要写书评

暂无评论

Employing a Pseudo-Random Sequence to Secure a lattice coding Scheme

Employing a Pseudo-Random Sequence to Secure a Lattice Codin...

引用

Iranian Conference on Electrical Engineering

作者： Nader Sanandaji Abolfazl Falahati Department of Electrical Engineering Iran University of Science and Technology Tehran Iran

A pseudo-random antipodal sequence that is accessible to transmitter and legitimate receiver is employed over a lattice coding scheme to provide the required security. Traditionally, pseudo-random sequences are employed in spread spectrum techniques to maintain the security of a wireless communication system. However, spread spectrum techniques require a huge amount of bandwidth that is a major constraint for wireless systems. Nonetheless, in the proposed scheme, the pseudorandom sequence is employed over channel coding level, so the bandwidth limitation of the spread spectrum is eased significantly. Mathematically, it is proved that the eavesdropper suffers from a degraded channel compared with legitimate receiver, and at high signal to noise ratio regimes, the proposed scheme can considerably deliver the required secrecy.

关键词： Physical layer security lattice coding Wiretap channel Secrecy capacity

来源：评论

学校读者我要写书评

暂无评论

Gaussian source coding with spherical codes

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2002年第11期48卷 2980-2989页

作者： Hamkins, J Zeger, K CALTECH Jet Prop Lab Pasadena CA 91109 USA Univ Calif San Diego Dept Elect & Comp Engn La Jolla CA 92093 USA

A fixed-rate shape-gain quantizer for the memoryless Gaussian source is proposed. The shape quantizer is constructed from wrapped spherical codes that map a sphere packing in Rk-1 onto a sphere in R-k, and the gain codebook is a globally optimal scalar quantizer. A wrapped Leech lattice shape quantizer is used to demonstrate a signal-to-quantization-noise ratio within 1 dB of the distortion-rate function for rates above 1 bit per sample, and an improvement over existing techniques of similar complexity. An asymptotic analysis of the tradeoff between gain quantization and shape quantization is also given.

关键词： data compression Gaussian source lattice coding vector quantization

来源：评论

学校读者我要写书评

暂无评论

Semantically Secure lattice Codes for the Gaussian Wiretap Channel

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2014年第10期60卷 6399-6416页

作者： Ling, Cong Luzzi, Laura Belfiore, Jean-Claude Stehle, Damien Univ London Imperial Coll Sci Technol & Med Dept Elect & Elect Engn London SW7 2AZ England Telecom ParisTech Dept Commun & Elect F-75739 Paris France Ecole Normale Super Lyon Lab Informat Parallelisme F-69364 Lyon France

We propose a new scheme of wiretap lattice coding that achieves semantic security and strong secrecy over the Gaussian wiretap channel. The key tool in our security proof is the flatness factor, which characterizes the convergence of the conditional output distributions corresponding to different messages and leads to an upper bound on the information leakage. We not only introduce the notion of secrecy-good lattices, but also propose the flatness factor as a design criterion of such lattices. Both the modulo-lattice Gaussian channel and genuine Gaussian channel are considered. In the latter case, we propose a novel secrecy coding scheme based on the discrete Gaussian distribution over a lattice, which achieves the secrecy capacity to within a half nat under mild conditions. No a priori distribution of the message is assumed, and no dither is used in our proposed schemes.

关键词： lattice coding information theoretic security strong secrecy semantic security wiretap channel

来源：评论

学校读者我要写书评

暂无评论

On the Performance of Diagonal lattice Space-Time Codes

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2013年第11期12卷 5717-5727页

作者： Abediseid, Walid Alouini, Mohamed-Slim King Abdullah Univ Sci & Technol Elect Engn Program CEMSE Div Thuwal Makkah Province Saudi Arabia

There has been tremendous work done on designing space-time codes for the quasi-static multiple-input multiple output (MIMO) channel. All the coding design up-to-date focuses on either high-performance, high rates, low complexity encoding and decoding, or targeting a combination of these criteria [1]-[9]. In this paper, we analyze in details the performance limits of diagonal lattice space-time codes under lattice decoding. We present both lower and upper bounds on the average decoding error probability. We first derive a new closed-form expression for the lower bound using the so-called sphere lower bound. This bound presents the ultimate performance limit a diagonal lattice space-time code can achieve at any signal-to-noise ratio (SNR). The upper bound is then derived using the union-bound which demonstrates how the average error probability can be minimized by maximizing the minimum product distance of the code. Combining both the lower and the upper bounds on the average error probability yields a simple upper bound on the the minimum product distance that any (complex) lattice code can achieve. At high-SNR regime, we discuss the outage performance of such codes and provide the achievable diversity-multiplexing tradeoff under lattice decoding.

关键词： Diagonal space-time codes lattice coding lattice decoding coding gain product distance

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：