首页 > 最新文献

Foundations and Trends in Communications and Information Theory最新文献

英文 中文
Statistical Physics and Information Theory 统计物理与信息论
IF 2.4 Q3 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2010-12-09 DOI: 10.1561/0100000052
N. Merhav
1: Introduction 2: Basic Background in Statistical Physics 3: Physical Interpretations of Information Measures 4: Analysis Tools and Asymptotic Methods 5: Interacting Particles and Phase Transitions 6: The Random Energy Model and Random Coding 7: Extensions of the REM 8: Summary and Outlook, References.
1:介绍2:统计物理的基本背景3:信息测量的物理解释4:分析工具和渐近方法5:相互作用粒子和相变6:随机能量模型和随机编码7:REM的扩展8:总结与展望,参考文献。
{"title":"Statistical Physics and Information Theory","authors":"N. Merhav","doi":"10.1561/0100000052","DOIUrl":"https://doi.org/10.1561/0100000052","url":null,"abstract":"1: Introduction 2: Basic Background in Statistical Physics 3: Physical Interpretations of Information Measures 4: Analysis Tools and Asymptotic Methods 5: Interacting Particles and Phase Transitions 6: The Random Energy Model and Random Coding 7: Extensions of the REM 8: Summary and Outlook, References.","PeriodicalId":45236,"journal":{"name":"Foundations and Trends in Communications and Information Theory","volume":"118 1","pages":"1-212"},"PeriodicalIF":2.4,"publicationDate":"2010-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80517577","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}
引用次数: 103
Combinatorial Designs for Authentication and Secrecy Codes 认证码与保密码的组合设计
IF 2.4 Q3 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2010-05-27 DOI: 10.1561/0100000044
Michael Huber
Combinatorial design theory is a very active area of mathematical research, with many applications in communications and information theory, computer science, statistics, engineering, and life sciences. As one of the fundamental discrete structures, combinatorial designs are used in fields as diverse as error-correcting codes, statistical design of experiments, cryptography and information security, mobile and wireless communications, group testing algorithms in DNA screening, software and hardware testing, and interconnection networks. This monograph provides a tutorial on combinatorial designs, which gives an overview of the theory. Furthermore, the application of combinatorial designs to authentication and secrecy codes is described in depth. This close relationship of designs with cryptography and information security was first revealed in Shannon's seminal paper on secrecy systems. We bring together in one source foundational and current contributions concerning design-theoretic constructions and characterizations of authentication and secrecy codes.
组合设计理论是一个非常活跃的数学研究领域,在通信和信息理论、计算机科学、统计学、工程和生命科学中有许多应用。组合设计作为一种基本的离散结构,被广泛应用于纠错码、实验统计设计、密码学和信息安全、移动和无线通信、DNA筛选中的组测试算法、软件和硬件测试以及互联网络等领域。这本专著提供了一个关于组合设计的教程,它给出了理论的概述。此外,还对组合设计在认证码和保密码中的应用进行了深入的描述。设计与密码学和信息安全的密切关系在香农关于保密系统的开创性论文中首次揭示。我们汇集在一个来源的基础和当前的贡献有关设计理论的结构和特征的认证和保密代码。
{"title":"Combinatorial Designs for Authentication and Secrecy Codes","authors":"Michael Huber","doi":"10.1561/0100000044","DOIUrl":"https://doi.org/10.1561/0100000044","url":null,"abstract":"Combinatorial design theory is a very active area of mathematical research, with many applications in communications and information theory, computer science, statistics, engineering, and life sciences. As one of the fundamental discrete structures, combinatorial designs are used in fields as diverse as error-correcting codes, statistical design of experiments, cryptography and information security, mobile and wireless communications, group testing algorithms in DNA screening, software and hardware testing, and interconnection networks. This monograph provides a tutorial on combinatorial designs, which gives an overview of the theory. Furthermore, the application of combinatorial designs to authentication and secrecy codes is described in depth. This close relationship of designs with cryptography and information security was first revealed in Shannon's seminal paper on secrecy systems. We bring together in one source foundational and current contributions concerning design-theoretic constructions and characterizations of authentication and secrecy codes.","PeriodicalId":45236,"journal":{"name":"Foundations and Trends in Communications and Information Theory","volume":"58 1","pages":"581-675"},"PeriodicalIF":2.4,"publicationDate":"2010-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74458321","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}
引用次数: 15
Information Theoretic Security 信息理论安全
IF 2.4 Q3 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2009-06-12 DOI: 10.1561/0100000036
Yingbin Liang, Vincent Poor, S. Shamai
Security is one of the most important issues in communications. Security issues arising in communication networks include confidentiality, integrity, authentication and non-repudiation. Attacks on the security of communication networks can be divided into two basic types: passive attacks and active attacks. An active attack corresponds to the situation in which a malicious actor intentionally disrupts the system. A passive attack corresponds to the situation in which a malicious actor attempts to interpret source information without injecting any information or trying to modify the information; i.e., passive attackers listen to the transmission without modifying it. Information Theoretic Security focuses on confidentiality issues, in which passive attacks are of primary concern. The information theoretic approach to achieving secure communication opens a promising new direction toward solving wireless networking security problems. Compared to contemporary cryptosystems, information theoretic approaches offer advantages such as eliminating the key management issue; are less vulnerable to the man-in-the-middle and achieve provable security that is robust to powerful eavesdroppers possessing unlimited computational resources, knowledge of the communication strategy employed including coding and decoding algorithms, and access to communication systems either through perfect or noisy channels. Information Theoretic Security surveys the research dating back to the 1970s which forms the basis of applying this technique in modern systems. It proceeds to provide an overview of how information theoretic approaches are developed to achieve secrecy for a basic wire-tap channel model as well as for its extensions to multiuser networks. It is an invaluable resource for students and researchers working in network security, information theory and communications.
安全是通信中最重要的问题之一。通信网络中出现的安全问题包括机密性、完整性、身份验证和不可否认性。针对通信网络安全的攻击可以分为被动攻击和主动攻击两种基本类型。主动攻击对应于恶意行为者故意破坏系统的情况。被动攻击对应于恶意行为者试图在不注入任何信息或试图修改信息的情况下解释源信息的情况;也就是说,被动攻击者只听传输而不修改。信息安全理论关注的是机密性问题,其中被动攻击是主要关注的问题。利用信息论方法实现安全通信,为解决无线网络安全问题开辟了一条有希望的新方向。与现代密码系统相比,信息理论方法具有消除密钥管理问题等优点;不容易受到中间人攻击,实现可证明的安全性,对拥有无限计算资源的强大窃听者具有鲁棒性,了解所采用的通信策略,包括编码和解码算法,以及通过完美或有噪声的信道访问通信系统。信息安全理论回顾了20世纪70年代以来的研究,构成了将该技术应用于现代系统的基础。接着概述了如何开发信息理论方法来实现基本有线监听信道模型及其扩展到多用户网络的保密性。对于从事网络安全、信息理论和通信工作的学生和研究人员来说,这是一份宝贵的资源。
{"title":"Information Theoretic Security","authors":"Yingbin Liang, Vincent Poor, S. Shamai","doi":"10.1561/0100000036","DOIUrl":"https://doi.org/10.1561/0100000036","url":null,"abstract":"Security is one of the most important issues in communications. Security issues arising in communication networks include confidentiality, integrity, authentication and non-repudiation. Attacks on the security of communication networks can be divided into two basic types: passive attacks and active attacks. An active attack corresponds to the situation in which a malicious actor intentionally disrupts the system. A passive attack corresponds to the situation in which a malicious actor attempts to interpret source information without injecting any information or trying to modify the information; i.e., passive attackers listen to the transmission without modifying it. Information Theoretic Security focuses on confidentiality issues, in which passive attacks are of primary concern. The information theoretic approach to achieving secure communication opens a promising new direction toward solving wireless networking security problems. Compared to contemporary cryptosystems, information theoretic approaches offer advantages such as eliminating the key management issue; are less vulnerable to the man-in-the-middle and achieve provable security that is robust to powerful eavesdroppers possessing unlimited computational resources, knowledge of the communication strategy employed including coding and decoding algorithms, and access to communication systems either through perfect or noisy channels. Information Theoretic Security surveys the research dating back to the 1970s which forms the basis of applying this technique in modern systems. It proceeds to provide an overview of how information theoretic approaches are developed to achieve secrecy for a basic wire-tap channel model as well as for its extensions to multiuser networks. It is an invaluable resource for students and researchers working in network security, information theory and communications.","PeriodicalId":45236,"journal":{"name":"Foundations and Trends in Communications and Information Theory","volume":"13 1","pages":"355-580"},"PeriodicalIF":2.4,"publicationDate":"2009-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73840497","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}
引用次数: 441
Universal Estimation of Information Measures for Analog Sources 模拟源信息测度的通用估计
IF 2.4 Q3 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2009-05-26 DOI: 10.1561/0100000021
Qing Wang, Sanjeev R. Kulkarni, Sergio Verdú
This monograph presents an overview of universal estimation of information measures for continuous-alphabet sources. Special attention is given to the estimation of mutual information and divergence based on independent and identically distributed (i.i.d.) data. Plug-in methods, partitioning-based algorithms, nearest-neighbor algorithms as well as other approaches are reviewed, with particular focus on consistency, speed of convergence and experimental performance.
本专著提出了对连续字母源的信息测度的普遍估计的概述。特别注意了基于独立和同分布(i.i.d)数据的互信息和发散估计。综述了插件方法、基于分区的算法、最近邻算法以及其他方法,特别关注一致性、收敛速度和实验性能。
{"title":"Universal Estimation of Information Measures for Analog Sources","authors":"Qing Wang, Sanjeev R. Kulkarni, Sergio Verdú","doi":"10.1561/0100000021","DOIUrl":"https://doi.org/10.1561/0100000021","url":null,"abstract":"This monograph presents an overview of universal estimation of information measures for continuous-alphabet sources. Special attention is given to the estimation of mutual information and divergence based on independent and identically distributed (i.i.d.) data. Plug-in methods, partitioning-based algorithms, nearest-neighbor algorithms as well as other approaches are reviewed, with particular focus on consistency, speed of convergence and experimental performance.","PeriodicalId":45236,"journal":{"name":"Foundations and Trends in Communications and Information Theory","volume":"14 1","pages":"265-353"},"PeriodicalIF":2.4,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88816302","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}
引用次数: 56
Channel Coding in the Presence of Side Information 边信息存在下的信道编码
IF 2.4 Q3 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2008-06-25 DOI: 10.1561/0100000025
Guy Keshet, Y. Steinberg, N. Merhav
In this survey we review the concepts and methods of communication systems equipped with side information. We focus on the channel coding problem, where side information is available to the transmitter in either a causal or non-causal manner, and we also consider the source coding problem with side information at the receiver. We first summarize the main results for channels with causal/non-causal side information and the associated capacity formulas. Next, we consider specific channel models, such as Costa's dirty-paper model, the AWGN channel model with fading and the modulo additive noise channel. Further, we provide applications to the models considered here, in particular, we present the watermarking problem and the Gaussian MIMO broadcast channel. We also consider algorithms for the calculation of the channel's capacity, and practical coding schemes for the communication systems explored in this survey. Finally, we study several related information-theoretic problems and present both the Wyner–Ziv and the Slepian–Wolf problems. The source coding problems and the channel coding problems, are presented in a unified version and the duality between the problems is presented. We also present extensions for the MAC and broadcast channel models, to the case where they are controlled by a state process, and consider several hybrid models, e.g., joint source–channel coding for the Wyner–Ziv source and the Gel'fand–Pinsker channel, and the achievable tradeoff between the message and the state information rates.
在这个调查中,我们回顾了配备侧信息的通信系统的概念和方法。我们专注于信道编码问题,其中侧信息以因果或非因果的方式提供给发射机,我们还考虑了接收器侧信息的源编码问题。我们首先总结了具有因果/非因果侧信息的通道的主要结果以及相关的容量公式。接下来,我们考虑了具体的信道模型,如Costa的脏纸模型、带衰落的AWGN信道模型和模加性噪声信道。此外,我们还提供了这里考虑的模型的应用,特别是我们提出了水印问题和高斯MIMO广播信道。我们还考虑了计算信道容量的算法,以及本调查中探索的通信系统的实用编码方案。最后,我们研究了几个相关的信息论问题,并给出了Wyner-Ziv问题和Slepian-Wolf问题。统一提出了源编码问题和信道编码问题,并指出了两者之间的对偶性。我们还提出了MAC和广播信道模型的扩展,以解决它们由状态过程控制的情况,并考虑了几种混合模型,例如,Wyner-Ziv源和Gel 'fand-Pinsker通道的联合源信道编码,以及消息和状态信息率之间可实现的权衡。
{"title":"Channel Coding in the Presence of Side Information","authors":"Guy Keshet, Y. Steinberg, N. Merhav","doi":"10.1561/0100000025","DOIUrl":"https://doi.org/10.1561/0100000025","url":null,"abstract":"In this survey we review the concepts and methods of communication systems equipped with side information. We focus on the channel coding problem, where side information is available to the transmitter in either a causal or non-causal manner, and we also consider the source coding problem with side information at the receiver. \u0000 \u0000We first summarize the main results for channels with causal/non-causal side information and the associated capacity formulas. Next, we consider specific channel models, such as Costa's dirty-paper model, the AWGN channel model with fading and the modulo additive noise channel. Further, we provide applications to the models considered here, in particular, we present the watermarking problem and the Gaussian MIMO broadcast channel. We also consider algorithms for the calculation of the channel's capacity, and practical coding schemes for the communication systems explored in this survey. Finally, we study several related information-theoretic problems and present both the Wyner–Ziv and the Slepian–Wolf problems. The source coding problems and the channel coding problems, are presented in a unified version and the duality between the problems is presented. We also present extensions for the MAC and broadcast channel models, to the case where they are controlled by a state process, and consider several hybrid models, e.g., joint source–channel coding for the Wyner–Ziv source and the Gel'fand–Pinsker channel, and the achievable tradeoff between the message and the state information rates.","PeriodicalId":45236,"journal":{"name":"Foundations and Trends in Communications and Information Theory","volume":"22 1","pages":"445-586"},"PeriodicalIF":2.4,"publicationDate":"2008-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85380747","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}
引用次数: 150
Topics in Multi-User Information Theory 多用户信息理论主题
IF 2.4 Q3 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2008-06-25 DOI: 10.1561/0100000028
G. Kramer
This survey reviews fundamental concepts of multi-user information theory. Starting with typical sequences, the survey builds up knowledge on random coding, binning, superposition coding, and capacity converses by introducing progressively more sophisticated tools for a selection of source and channel models. The problems addressed include: Source Coding; Rate-Distortion and Multiple Descriptions; Capacity-Cost; The Slepian–Wolf Problem; The Wyner-Ziv Problem; The Gelfand-Pinsker Problem; The Broadcast Channel; The Multiaccess Channel; The Relay Channel; The Multiple Relay Channel; and The Multiaccess Channel with Generalized Feedback. The survey also includes a review of basic probability and information theory.
本文回顾了多用户信息理论的基本概念。从典型序列开始,通过逐步引入更复杂的工具来选择源和信道模型,调查建立了关于随机编码、分组、叠加编码和容量转换的知识。解决的问题包括:源编码;率失真与多重描述;容量价值;睡狼问题;Wyner-Ziv问题;Gelfand-Pinsker问题;广播频道;多址信道;中继通道;多中继信道;广义反馈的多址信道。该调查还包括对基本概率论和信息论的回顾。
{"title":"Topics in Multi-User Information Theory","authors":"G. Kramer","doi":"10.1561/0100000028","DOIUrl":"https://doi.org/10.1561/0100000028","url":null,"abstract":"This survey reviews fundamental concepts of multi-user information theory. Starting with typical sequences, the survey builds up knowledge on random coding, binning, superposition coding, and capacity converses by introducing progressively more sophisticated tools for a selection of source and channel models. The problems addressed include: Source Coding; Rate-Distortion and Multiple Descriptions; Capacity-Cost; The Slepian–Wolf Problem; The Wyner-Ziv Problem; The Gelfand-Pinsker Problem; The Broadcast Channel; The Multiaccess Channel; The Relay Channel; The Multiple Relay Channel; and The Multiaccess Channel with Generalized Feedback. The survey also includes a review of basic probability and information theory.","PeriodicalId":45236,"journal":{"name":"Foundations and Trends in Communications and Information Theory","volume":"24 1","pages":"265-444"},"PeriodicalIF":2.4,"publicationDate":"2008-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81902303","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}
引用次数: 251
Reliability Criteria in Information Theory and in Statistical Hypothesis Testing 信息论与统计假设检验中的信度准则
IF 2.4 Q3 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2008-02-28 DOI: 10.1561/0100000008
E. Haroutunian, M. Haroutunian, A. Harutyunyan
This survey is devoted to one of the central problems of Information Theory -- the problem of determination of interdependence between coding rate and error probability exponent for different information transmission systems. The overview deals with memoryless systems of finite alphabet setting. It presents material complementary to the contents of the series of the most remarkable in Information Theory books of Feinstain, Fano, Wolfowitz, Gallager, Csiszar and Korner, Kolesnik and Poltirev, Blahut, Cover and Thomas and of the papers by Dobrushin, Gelfand and Prelov. We briefly formulate fundamental notions and results of Shannon theory on reliable transmission via coding and give a survey of results obtained in last two-three decades by the authors, their colleagues and some other researchers. The paper is written with the goal to make accessible to a broader circle of readers the theory of rate-reliability. We regard this concept useful to promote the noted problem solution in parallel with elaboration of the notion of reliability-reliability dependence relative to the statistical hypothesis testing and identification.
本文研究了信息论的核心问题之一——不同信息传输系统的编码率和错误率指数之间相互依赖关系的确定问题。概述处理有限字母设置的无记忆系统。它提供的材料补充了范斯坦、法诺、沃尔福威茨、加拉格、西萨尔和科尔纳、科列斯尼克和波列列夫、布拉胡特、盖普和托马斯等人在信息论中最杰出的一系列著作,以及多布鲁申、盖尔芬德和普雷洛夫的论文。本文简要地阐述了香农理论关于编码可靠传输的基本概念和结果,并对作者及其同事和其他研究人员近二三十年来所取得的结果进行了综述。写这篇论文的目的是为了让更广泛的读者了解率信度理论。我们认为这一概念有助于促进注意到的问题的解决,同时阐述可靠性的概念-相对于统计假设检验和识别的可靠性依赖。
{"title":"Reliability Criteria in Information Theory and in Statistical Hypothesis Testing","authors":"E. Haroutunian, M. Haroutunian, A. Harutyunyan","doi":"10.1561/0100000008","DOIUrl":"https://doi.org/10.1561/0100000008","url":null,"abstract":"This survey is devoted to one of the central problems of Information Theory -- the problem of determination of interdependence between coding rate and error probability exponent for different information transmission systems. The overview deals with memoryless systems of finite alphabet setting. It presents material complementary to the contents of the series of the most remarkable in Information Theory books of Feinstain, Fano, Wolfowitz, Gallager, Csiszar and Korner, Kolesnik and Poltirev, Blahut, Cover and Thomas and of the papers by Dobrushin, Gelfand and Prelov. \u0000 \u0000We briefly formulate fundamental notions and results of Shannon theory on reliable transmission via coding and give a survey of results obtained in last two-three decades by the authors, their colleagues and some other researchers. The paper is written with the goal to make accessible to a broader circle of readers the theory of rate-reliability. We regard this concept useful to promote the noted problem solution in parallel with elaboration of the notion of reliability-reliability dependence relative to the statistical hypothesis testing and identification.","PeriodicalId":45236,"journal":{"name":"Foundations and Trends in Communications and Information Theory","volume":"22 1 1","pages":"97-263"},"PeriodicalIF":2.4,"publicationDate":"2008-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78113130","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}
引用次数: 61
Cyclic Division Algebras: A Tool for Space-Time Coding 循环除法代数:空时编码的工具
IF 2.4 Q3 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2007-11-16 DOI: 10.1561/0100000016
F. Oggier, J. Belfiore, E. Viterbo
Multiple antennas at both the transmitter and receiver ends of a wireless digital transmission channel may increase both data rate and reliability. Reliable high rate transmission over such channels can only be achieved through Space-Time coding. Rank and determinant code design criteria have been proposed to enhance diversity and coding gain. The special case of full-diversity criterion requires that the difference of any two distinct codewords has full rank. Extensive work has been done on Space–Time coding, aiming at finding fully diverse codes with high rate. Division algebras have been proposed as a new tool for constructing Space–Time codes, since they are non-commutative algebras that naturally yield linear fully diverse codes. Their algebraic properties can thus be further exploited to improve the design of good codes. The aim of this work is to provide a tutorial introduction to the algebraic tools involved in the design of codes based on cyclic division algebras. The different design criteria involved will be illustrated, including the constellation shaping, the information lossless property, the non-vanishing determinant property, and the diversity multiplexing trade-off. The final target is to give the complete mathematical background underlying the construction of the Golden code and the other Perfect Space–Time block codes.
在无线数字传输信道的发送端和接收端使用多个天线可以同时提高数据速率和可靠性。在这种信道上,可靠的高速率传输只能通过空时编码来实现。提出了秩和行列式编码设计准则,以提高编码的多样性和增益。全分集准则的特殊情况要求任意两个不同码字的差值具有满秩。人们在空时编码方面做了大量的工作,目的是寻找高速率的完全多样的编码。除法代数是构造空时码的一种新工具,因为除法代数是一种非交换代数,可以产生线性的全变码。因此,可以进一步利用它们的代数性质来改进良好代码的设计。这项工作的目的是提供一个教程介绍,涉及到基于循环除法代数的代码设计的代数工具。所涉及的不同设计标准将被说明,包括星座形状,信息无损特性,不消失的行列式特性,以及分集多路复用权衡。最后的目标是给出黄金码和其他完美空时分组码构造的完整数学背景。
{"title":"Cyclic Division Algebras: A Tool for Space-Time Coding","authors":"F. Oggier, J. Belfiore, E. Viterbo","doi":"10.1561/0100000016","DOIUrl":"https://doi.org/10.1561/0100000016","url":null,"abstract":"Multiple antennas at both the transmitter and receiver ends of a wireless digital transmission channel may increase both data rate and reliability. Reliable high rate transmission over such channels can only be achieved through Space-Time coding. Rank and determinant code design criteria have been proposed to enhance diversity and coding gain. The special case of full-diversity criterion requires that the difference of any two distinct codewords has full rank. \u0000 \u0000Extensive work has been done on Space–Time coding, aiming at finding fully diverse codes with high rate. Division algebras have been proposed as a new tool for constructing Space–Time codes, since they are non-commutative algebras that naturally yield linear fully diverse codes. Their algebraic properties can thus be further exploited to improve the design of good codes. \u0000 \u0000The aim of this work is to provide a tutorial introduction to the algebraic tools involved in the design of codes based on cyclic division algebras. The different design criteria involved will be illustrated, including the constellation shaping, the information lossless property, the non-vanishing determinant property, and the diversity multiplexing trade-off. The final target is to give the complete mathematical background underlying the construction of the Golden code and the other Perfect Space–Time block codes.","PeriodicalId":45236,"journal":{"name":"Foundations and Trends in Communications and Information Theory","volume":"107 1","pages":"1-95"},"PeriodicalIF":2.4,"publicationDate":"2007-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76044855","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}
引用次数: 103
Majorization and Matrix-Monotone Functions in Wireless Communications 无线通信中的多数化和矩阵单调函数
IF 2.4 Q3 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2007-07-11 DOI: 10.1561/0100000026
Eduard Axel Jorswieck, H. Boche
This short tutorial presents two mathematical techniques namely Majorization Theory and Matrix-Monotone Functions, reviews their basic definitions and describes their concepts clearly with many illustrative examples. In addition to this tutorial, new results are presented with respect to Schur-convex functions and regarding the properties of matrix-monotone functions. The techniques are applied to solve communication and information theoretic problems in wireless communications. The impact of spatial correlation in multiple antenna systems is characterized for many important performance measures, e.g., average mutual information, outage probability, error performance, minimum Eb/N0 and wide-band slope, zero-outage capacity, and capacity region. The impact of user distribution in cellular systems is characterized for different scenarios including perfectly informed transmitters and receivers, regarding, e.g., the average sum rate, the outage sum rate, maximum throughput. Finally, a unified framework for the performance analysis of multiple antenna systems is developed based on matrix-monotone functions. The optimization of transmit strategies for multiple antennas is carried out by optimization of matrix-monotone functions. The results within this framework resemble and complement the various results on optimal transmit strategies in single-user and multiple-user multiple-antenna systems.
这篇简短的教程介绍了两种数学技术,即多数化理论和矩阵单调函数,回顾了它们的基本定义,并通过许多例子清楚地描述了它们的概念。除了本教程之外,还提出了关于舒尔-凸函数和关于矩阵单调函数的性质的新结果。这些技术被应用于解决无线通信中的通信和信息理论问题。空间相关性对多天线系统的影响表现为许多重要的性能指标,如平均互信息、中断概率、误差性能、最小Eb/N0和宽带斜率、零中断容量和容量区域。蜂窝系统中用户分布的影响具有不同场景的特征,包括完全知情的发射器和接收器,例如,关于平均和速率、中断和速率、最大吞吐量。最后,提出了基于矩阵单调函数的多天线系统性能分析的统一框架。通过矩阵单调函数的优化实现了多天线发射策略的优化。该框架内的结果类似并补充了单用户和多用户多天线系统中最优传输策略的各种结果。
{"title":"Majorization and Matrix-Monotone Functions in Wireless Communications","authors":"Eduard Axel Jorswieck, H. Boche","doi":"10.1561/0100000026","DOIUrl":"https://doi.org/10.1561/0100000026","url":null,"abstract":"This short tutorial presents two mathematical techniques namely Majorization Theory and Matrix-Monotone Functions, reviews their basic definitions and describes their concepts clearly with many illustrative examples. In addition to this tutorial, new results are presented with respect to Schur-convex functions and regarding the properties of matrix-monotone functions. \u0000 \u0000The techniques are applied to solve communication and information theoretic problems in wireless communications. The impact of spatial correlation in multiple antenna systems is characterized for many important performance measures, e.g., average mutual information, outage probability, error performance, minimum Eb/N0 and wide-band slope, zero-outage capacity, and capacity region. The impact of user distribution in cellular systems is characterized for different scenarios including perfectly informed transmitters and receivers, regarding, e.g., the average sum rate, the outage sum rate, maximum throughput. Finally, a unified framework for the performance analysis of multiple antenna systems is developed based on matrix-monotone functions. The optimization of transmit strategies for multiple antennas is carried out by optimization of matrix-monotone functions. The results within this framework resemble and complement the various results on optimal transmit strategies in single-user and multiple-user multiple-antenna systems.","PeriodicalId":45236,"journal":{"name":"Foundations and Trends in Communications and Information Theory","volume":"1 1","pages":"553-701"},"PeriodicalIF":2.4,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89911753","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}
引用次数: 154
MIMO Transceiver Design via Majorization Theory 基于最大化理论的MIMO收发器设计
IF 2.4 Q3 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2007-06-06 DOI: 10.1561/0100000018
D. Palomar, Yi Jiang
Multiple-input multiple-output (MIMO) channels provide an abstract and unified representation of different physical communication systems, ranging from multi-antenna wireless channels to wireless digital subscriber line systems. They have the key property that several data streams can be simultaneously established. In general, the design of communication systems for MIMO channels is quite involved (if one can assume the use of sufficiently long and good codes, then the problem formulation simplifies drastically). The first difficulty lies on how to measure the global performance of such systems given the tradeoff on the performance among the different data streams. Once the problem formulation is defined, the resulting mathematical problem is typically too complicated to be optimally solved as it is a matrix-valued nonconvex optimization problem. This design problem has been studied for the past three decades (the first papers dating back to the 1970s) motivated initially by cable systems and more recently by wireless multi-antenna systems. The approach was to choose a specific global measure of performance and then to design the system accordingly, either optimally or suboptimally, depending on the difficulty of the problem. This text presents an up-to-date unified mathematical framework for the design of point-to-point MIMO transceivers with channel state information at both sides of the link according to an arbitrary cost function as a measure of the system performance. In addition, the framework embraces the design of systems with given individual performance on the data streams. Majorization theory is the underlying mathematical theory on which the framework hinges. It allows the transformation of the originally complicated matrix-valued nonconvex problem into a simple scalar problem. In particular, the additive majorization relation plays a key role in the design of linear MIMO transceivers (i.e., a linear precoder at the transmitter and a linear equalizer at the receiver), whereas the multiplicative majorization relation is the basis for nonlinear decision-feedback MIMO transceivers (i.e., a linear precoder at the transmitter and a decision-feedback equalizer at the receiver).
多输入多输出(MIMO)信道提供了不同物理通信系统的抽象和统一表示,范围从多天线无线信道到无线数字用户线路系统。它们的关键特性是可以同时建立多个数据流。一般来说,MIMO信道通信系统的设计是相当复杂的(如果可以假设使用足够长的和好的代码,那么问题的表述就会大大简化)。第一个困难在于如何在给定不同数据流之间的性能权衡的情况下衡量此类系统的全局性能。一旦定义了问题的形式,所得到的数学问题通常过于复杂而无法最优解决,因为它是一个矩阵值非凸优化问题。这个设计问题已经研究了三十年(第一批论文可以追溯到20世纪70年代),最初是由有线系统引起的,最近是由无线多天线系统引起的。方法是选择一个特定的全局性能度量,然后根据问题的难度相应地设计系统,要么是最优的,要么是次优的。本文提出了一个最新的统一数学框架,用于设计点对点MIMO收发器,链路两侧的信道状态信息根据任意成本函数作为系统性能的度量。此外,该框架还支持在数据流上设计具有特定性能的系统。多数化理论是框架所依赖的基础数学理论。它允许将原本复杂的矩阵值非凸问题转化为简单的标量问题。特别是,加性多数化关系在线性MIMO收发器(即发射机的线性预编码器和接收机的线性均衡器)的设计中起着关键作用,而乘性多数化关系是非线性决策反馈MIMO收发器(即发射机的线性预编码器和接收机的决策反馈均衡器)的基础。
{"title":"MIMO Transceiver Design via Majorization Theory","authors":"D. Palomar, Yi Jiang","doi":"10.1561/0100000018","DOIUrl":"https://doi.org/10.1561/0100000018","url":null,"abstract":"Multiple-input multiple-output (MIMO) channels provide an abstract and unified representation of different physical communication systems, ranging from multi-antenna wireless channels to wireless digital subscriber line systems. They have the key property that several data streams can be simultaneously established. \u0000 \u0000In general, the design of communication systems for MIMO channels is quite involved (if one can assume the use of sufficiently long and good codes, then the problem formulation simplifies drastically). The first difficulty lies on how to measure the global performance of such systems given the tradeoff on the performance among the different data streams. Once the problem formulation is defined, the resulting mathematical problem is typically too complicated to be optimally solved as it is a matrix-valued nonconvex optimization problem. This design problem has been studied for the past three decades (the first papers dating back to the 1970s) motivated initially by cable systems and more recently by wireless multi-antenna systems. The approach was to choose a specific global measure of performance and then to design the system accordingly, either optimally or suboptimally, depending on the difficulty of the problem. \u0000 \u0000This text presents an up-to-date unified mathematical framework for the design of point-to-point MIMO transceivers with channel state information at both sides of the link according to an arbitrary cost function as a measure of the system performance. In addition, the framework embraces the design of systems with given individual performance on the data streams. \u0000 \u0000Majorization theory is the underlying mathematical theory on which the framework hinges. It allows the transformation of the originally complicated matrix-valued nonconvex problem into a simple scalar problem. In particular, the additive majorization relation plays a key role in the design of linear MIMO transceivers (i.e., a linear precoder at the transmitter and a linear equalizer at the receiver), whereas the multiplicative majorization relation is the basis for nonlinear decision-feedback MIMO transceivers (i.e., a linear precoder at the transmitter and a decision-feedback equalizer at the receiver).","PeriodicalId":45236,"journal":{"name":"Foundations and Trends in Communications and Information Theory","volume":"22 1","pages":""},"PeriodicalIF":2.4,"publicationDate":"2007-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72691240","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}
引用次数: 311
期刊
Foundations and Trends in Communications and Information Theory
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1