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

IEEE Global Communications Conference (GLOBECOM)

作者： Xia, Dengfeng Yang, Chuanchuan Dai, Bin Southwest Jiaotong Univ Sch Informat Sci & Technol Chengdu 610031 Peoples R China Peking Univ Dept Elect Beijing 100871 Peoples R China Peng Cheng Lab Shenzhen 518055 Peoples R China

ISBN: (纸本)9781665435406

In this paper, the dirty-tape channel (the white Gaussian channel with causal state interference at the transmitter) is revisited by considering a noisy feedback link between the transmitter and receiver. A finite blocklength (FBL) coding scheme is proposed for this model, which is based on the classical Schalkwijk-Kailath (SK) scheme and an existing lattice-based interference canceling scheme. Based on the proposed scheme, an achievable rate for given blocklength and decoding error probability is obtained, and the results of this paper are further illustrated via numerical examples.

关键词： Dirty-tape channel finite blocklength coding lattice coding noisy feedback Schalkwijk-Kailath scheme

来源：评论

学校读者我要写书评

暂无评论

Almost Universal Codes for MIMO Wiretap Channels

Almost Universal Codes for MIMO Wiretap Channels

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Luzzi, Laura Vehkalahti, Roope Ling, Cong Univ Cergy Pontoise Univ Paris Seine CNRS ENSEAETISUMR 8051 F-95014 Cergy Pontoise France Univ Turku Dept Math & Stat FI-20014 Turku Finland Aalto Univ Dept Commun & Networking FI-02150 Espoo Finland Imperial Coll London Dept Elect & Elect Engn London SW7 2AZ England

Despite several works on secrecy coding for fading and MIMO wiretap channels from an error probability perspective, the construction of information-theoretically secure codes over such channels remains an open problem. In this paper, we consider a fading wiretap channel model where the transmitter has only partial statistical channel state information. Our channel model includes static channels, i.i.d. block fading channels, and ergodic stationary fading with fast decay of large deviations for the eavesdropper's channel. We extend the flatness factor criterion from the Gaussian wiretap channel to fading and MIMO wiretap channels, and establish a simple design criterion where the normalized product distance/minimum determinant of the lattice and its dual should be maximized simultaneously. Moreover, we propose concrete lattice codes satisfying this design criterion, which are built from algebraic number fields with constant root discriminant in the single-antenna case, and from division algebras centered at such number fields in the multiple-antenna case. The proposed lattice codes achieve strong secrecy and semantic security for all rates R < C-b - C-e - kappa, where C-b and C-e are Bob and Eve's channel capacities, respectively, and kappa is an explicit constant gap. Furthermore, these codes are almost universal in the sense that a fixed code is good for secrecy for a wide range of fading models. Finally, we consider a compound wiretap model with a more restricted uncertainty set, and show that rates R < (C) over bar (b) - (C) over bar (e) - kappa are achievable, where (C) over bar (b) is a lower bound for Bob's capacity and (C) over bar (e) is an upper bound for Eve's capacity for all the channels in the set.

关键词： Algebraic number theory division algebras fading wiretap channel information theoretic security lattice coding MIMO wiretap channel statistical CSIT

来源：评论

学校读者我要写书评

暂无评论

Number field lattices achieve Gaussian and Rayleigh channel capacity within a constant gap

Number field lattices achieve Gaussian and Rayleigh channel ...

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Vehkalahti, Roope Luzzi, Laura Univ Turku Dept Math & Stat SF-20500 Turku Finland CNRS UCP ENSEA Lab ETIS Cergy Pontoise France

ISBN: (纸本)9781467377041

This paper shows that a family of number field lattice codes simultaneously achieves a constant gap to capacity in Rayleigh fast fading and Gaussian channels. The key property in the proof is the existence of infinite towers of Hilbert class fields with bounded root discriminant. The gap to capacity of the proposed lattice codes is determined by the root discriminant. The comparison between the Gaussian and fading case reveals that in Rayleigh fading channels the normalized minimum product distance plays an analogous role to the Hermite invariant in Gaussian channels.

关键词： lattice coding Gaussian channel fast fading channels number theory

来源：评论

学校读者我要写书评

暂无评论

Joint Channel coding Network coding for Multi-Way Relay Systems

Joint Channel Coding Network Coding for Multi-Way Relay Syst...

引用

SAI Computing Conference (SAI)

作者： Liu, William Imperial Coll London Dept Elect & Elect Engn London England

ISBN: (纸本)9781467384605

Physical layer network coding (PNC) with channel coding is a strategy that applies error correction at the relay nodes of a relay system to improve data communication reliability of the whole relay system. So far, channel coded PNC schemes have been studied for two-way relay systems, but have not been systematically proposed for general multiple-way relay systems. In this paper, joint channel coding network coding schemes (JCCNC) are proposed for compute-and-forward (CF) relaying scheme that is able to be applied to general types of PAM and QAM modulation systems. LDPC codes are used for channel coding. Numerical results from simulation show that these JCCNC schemes greatly improve the performance of the relay systems.

关键词： channel coding compute-and-forward lattice coding LDPC code multi-way relay PNC

来源：评论

学校读者我要写书评

暂无评论

Soft output decoding of lattices

引用

Annales des Telecommunications/Annals of Telecommunications 1998年第9期53卷 353-360页

作者： Lamy, Catherine Boutros, Joseph Motorola Semiconductors SA F. 31023 Toulouse Le Mirail BP 1029 France Dept. Commun. et Électronique ENST F-75013 Paris 46 rue Barrault France

We present a universal MSE algorithm for lattice decoding in dimensions up to 1024 for both Gaussian and Rayleigh fading channels. This algorithm can be applied to decode high diversity multidimensional rotations. The decoding is performed by a decision feedback equalizer and provides soft output which allows a concatenation of the lattice codes with other type of error-correcting codes. The problem of selecting a good rotation is also considered, and we show that a high dimensional random rotation exhibits very good performance on a Rayleigh fading channel.

关键词： Decoding Equalization Gaussian channel lattice coding Mean square error Multidimensional space Rayleigh fading Rotation Signal constellation

来源：评论

学校读者我要写书评

暂无评论

Algebraic structures for multi-terminal communication systems

Algebraic structures for multi-terminal communication system...

引用

作者： Krithivasan, Dinesh University of Michigan

学位级别：Ph.D.

We study a distributed source coding problem with multiple encoders, a central decoder and a joint distortion criterion. The encoders do not communicate with each other. The encoders observe correlated sources which they quantize and communicate noiselessly to a central decoder which is interested in minimizing a joint distortion criterion that depends on the sources and the reconstruction. We are interested in characterizing an inner hound to the optimal rate-distortion region. We first consider a special case where the sources are jointly Gaussian and the decoder wants to reconstruct a linear function of the sources under mean square error distortion. We demonstrate a coding scheme involving nested lattice codes that, reconstructs the linear function by encoding in such a fashion that, the decoder is able to reconstruct the function directly. For certain source distributions, this approach yields a larger rate-distortion region compared to when the decoder reconstructs lossy versions of the sources first and then estimates the function from them. We then extend this approach to the case of reconstructing a linear function of an arbitrary number of jointly Gaussian sources. Next, we consider the general distributed source coding problem with discrete sources. This formulation includes as a special case many famous distributed source coding problems. We present a new achievable rate-distortion region for this problem based on "good" structured nested random codes built over abelian groups. We demonstrate rate gains for this problem over traditional coding schemes using unstructured random codes. For certain sources and distortion functions, the new rate region is strictly bigger than the Berger-Tung rate region, which has been the best known achievable rate region for the problem till now. Further, there is no known way of achieving these rate gains without exploiting the structure of the coding scheme. Achievable performance limits for single-user source coding usi

关键词： Information Theory Distributed Source coding lattice coding Abelian Group Codes Structured Codes Thesis

来源：评论

学校读者我要写书评

暂无评论

On throughput-reliability-delay tradeoffs in wireless networks

On throughput-reliability-delay tradeoffs in wireless networ...

引用

作者： Nam, Young-Han The Ohio State University

学位级别：Ph.D.

In wireless communication networks, performance goals are often conflicting with each other. For example, in point-to-point multi-input-multi-output (MIMO) links, spectrum efficiency and reliability are in a tradeoff relation; in ad-hoc wireless networks, we need to sacrifice throughput to decrease packet delay. In this dissertation, we investigate problems on the diversity-multiplexing tradeoff (DMT) in cellular wireless communication networks and problems on the throughput-delay tradeoff in adhoc wireless networks. We first consider two topics on the DMT in cellular uplinks (or multiple-access channels, MACs): (1) the diversity-multiplexing-delay tradeoff (DMDT) in a random-access scenario and (2) an explicit construction of space-time coding scheme achieving the DMT. For the random-access scenario, we propose an incremental-redundancy automatic repeat request (IR-ARQ) scheme. We prove that our scheme successfully exploits both ARQ diversity and joint-decoding advantage, and achieves a better DMT than other existing protocols, such as Tsatsanis et al.’s network-assisted diversity multiple-access (NDMA) and Gallager tree algorithm. Next, we propose a lattice-space time (LAST) coding/decoding scheme in MACs and prove that it achieves the optimal DMT in MACs. Although our result is established using a random coding argument, it is important to note that the proposed scheme is explicit in a sense that it lends itself to a structured encoder and an efficient decoder which does not require exhaustive search. Next, we formulate and analyze the DMT in delay-constrained cellular downlinks (or broadcast channels, BCs). We show that dirty-paper precoding achieves the optimal DMT in BCs. Furthermore, we analyze the DMTs for a few suboptimal precoding schemes. In particular, we find that vector precoding schemes such as vector perturbation of Peel et al. and LLL lattice reduction achieve the optimal DMT of a type of BCs, in which a BS has a larger number of antennas than the n

关键词： Electrical Engineering diversity multiplexing tradeoff throughput delay tradeoff broadcast channel multiple access channel lattice decoding lattice coding incremental redundancy automatic repeat request (ARQ) random access channel

来源：评论

学校读者我要写书评

暂无评论

Synthesis and Characterization of Precursors for a New Type of Molecular Baskets

Synthesis and Characterization of Precursors for a New Type ...

引用

作者： Zujovic, Teodora The Ohio State University

学位级别：master

The theory of lattices ?– a mathematical approach for representing infinite discrete points in Euclidean space, has become a powerful tool to analyze many point-to-point digital and wireless communication systems, particularly, communication systems that can be well-described by the linear Gaussian vector channel model. This is mainly due to the three facts about channel codes constructed using lattices: they have simple structure, their ability to achieve the fundamental limits (the capacity) of the channel, and most importantly, they can be decoded using efficient decoders called lattice decoders. Since its introduction to multiple-input multiple-output (MIMO) wireless communication systems, sphere decoders has become an attractive efficient implementation of lattice decoders, especially for small signal dimensions and/or moderate to large signal-to-noise ratios (SNRs). In the first part of this dissertation, we consider sphere decoding algorithms that describe lattice decoding. The exact complexity analysis of the basic sphere decoder for general space-time codes applied to MIMO wireless channel is known to be difficult. Characterizing and understanding the complexity distribution is important, especially when the sphere decoder is used under practically relevant runtime constraints. In this work, we shed the light on the (average) computational complexity of sphere decoding for the quasi-static, lattice Space-Time (LAST) coded MIMO channel. Sphere decoders are only efficient in the high SNR regime and low signal dimensions, and exhibits exponential (average) complexity for low-to-moderate SNR and large signal dimensions. On the other extreme, linear and non-linear receivers such as minimum mean-square error (MMSE), and MMSE decision-feedback equalization (DFE) are considered attractive alternatives to sphere decoders in MIMO channels. Unfortunately, the very low decoding complexity advantage that these decoders can provide comes at the expense of poor perform

关键词： lattices lattice coding lattice Decoding MIMO MIMO-ARQ Sphere Decoding Sequential Decoding Diversity-Multiplexing Tradeoff

来源：评论

学校读者我要写书评

暂无评论

Non-Linear lattice Precoding for Multiuser Cellular Two-Way Relay Channels

Non-Linear Lattice Precoding for Multiuser Cellular Two-Way ...

引用

IEEE Global Communications Conference

作者： Zhaoxi Fang Xiaojun Yuan Xin Wang Dept. of Commun. Eng. Zhejiang Wanli University School of Info. Sci. & Tech. ShanghaiTech University Key Laboratory of EMW Information (MoE) Dept. of Commun. Sci. & Eng. Fudan University

ISBN: (纸本)9781479935130

This paper considers transceiver design for the cellular two-way relay channel (cTWRC), where a multi-antenna base station (BS) exchanges information with multiple single-antenna mobile stations via a multi-antenna relay station. We propose a novel network coding scheme to approach the sum capacity of the cTWRC. Specifically, a new non-linear lattice-based precoding technique is proposed at the BS to pre-compensate the inter-stream interference, in order to allow efficient interference-free lattice decoding at the relay. We derive sufficient conditions for the proposed scheme to asymptotically achieve the sum capacity of the cTWRC in the high signal-to-noise ratio (SNR) regime. Numerical results show that the proposed scheme outperforms the existing schemes and is able to asymptotically achieve the cut-set bound of the cellular relay networks.

关键词： Multiuser two-way relaying lattice coding Dirty paper coding Non-linear precoding

来源：评论

学校读者我要写书评

暂无评论

Practical Implementation of Integer Forcing Linear Receivers in MIMO Channels

Practical Implementation of Integer Forcing Linear Receivers...

引用

IEEE Vehicular Technology Conference

作者： Asma Mejri Ghaya Rekaya-Ben Othman Telecom ParisTech 46 Rue Barrault 75013 Paris France

ISBN: (纸本)9781467361866

Integer Forcing (IF) architecture has been recently proposed to design linear receivers in MIMO systems. Research works show the promise of this architecture from a capacity achieving perspective. However, it is not totally understood how to select IF coefficient matrix and if the promised theoretical gain of the resulting receivers is attainable in practical settings. We try in this work to fill the gap between theory and practice: we propose algorithms to select optimal IF receiver parameters that lead to the maximization of the total achievable rate. We propose an implementation of an IF-based MIMO system considering a practical scenario where lattice codes are used. Experimental studies are carried out to evaluate the error rate performance of the proposed algorithms and compare them to traditional linear receivers. Our proposed implementation shows that the theoretical potential of the IF receivers is achievable even with finite-length lattice codes.

关键词： MIMO systems linear receivers lattice reduction lattice coding Integer Forcing Linear receivers LINEAR RECEIVERS multiple input multiple output systems Integer ARCHITECTURE Building construction Intermediate frequencies Receivers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：