The use of multiple antennas at base stations is a key component in the design of cellular communication systems that can meet high-capacity demands in the downlink. Under ideal conditions, the gai ...
{"title":"Optimal Resource Allocation in Coordinated Multi-Cell Systems","authors":"Emil Björnson, Eduard Axel Jorswieck","doi":"10.1561/0100000069","DOIUrl":"https://doi.org/10.1561/0100000069","url":null,"abstract":"The use of multiple antennas at base stations is a key component in the design of cellular communication systems that can meet high-capacity demands in the downlink. Under ideal conditions, the gai ...","PeriodicalId":45236,"journal":{"name":"Foundations and Trends in Communications and Information Theory","volume":"52 1","pages":"113-381"},"PeriodicalIF":2.4,"publicationDate":"2013-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90861850","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}
{"title":"Gaussian Interference Channels: An Information Theoretic Point of View","authors":"Xiaohu Shang, Biao Chen","doi":"10.1561/0100000071","DOIUrl":"https://doi.org/10.1561/0100000071","url":null,"abstract":"","PeriodicalId":45236,"journal":{"name":"Foundations and Trends in Communications and Information Theory","volume":"27 1","pages":"247-378"},"PeriodicalIF":2.4,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83403106","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}
Concentration inequalities have been the subject of exciting developments during the last two decades, and have been intensively studied and used as a powerful tool in various areas. These include convex geometry, functional analysis, statistical physics, mathematical statistics, pure and applied probability theory, information theory, theoretical computer science, learning theory, and dynamical systems. Concentration of Measure Inequalities in Information Theory, Communications, and Coding focuses on some of the key modern mathematical tools that are used for the derivation of concentration inequalities, on their links to information theory, and on their various applications to communications and coding. In addition to being a survey, this monograph also includes various new recent results derived by the authors. This third edition of the bestselling book introduces the reader to the martingale method and the Efron-Stein-Steele inequalities in completely new sections. A new application of lossless source coding with side information is described in detail. Finally, the references have been updated and ones included that have been published since the original publication. Concentration of Measure Inequalities in Information Theory, Communications, and Coding is essential reading for all researchers and scientists in information theory and coding.
{"title":"Concentration of Measure Inequalities in Information Theory, Communications, and Coding","authors":"M. Raginsky, I. Sason","doi":"10.1561/0100000064","DOIUrl":"https://doi.org/10.1561/0100000064","url":null,"abstract":"Concentration inequalities have been the subject of exciting developments during the last two decades, and have been intensively studied and used as a powerful tool in various areas. These include convex geometry, functional analysis, statistical physics, mathematical statistics, pure and applied probability theory, information theory, theoretical computer science, learning theory, and dynamical systems. Concentration of Measure Inequalities in Information Theory, Communications, and Coding focuses on some of the key modern mathematical tools that are used for the derivation of concentration inequalities, on their links to information theory, and on their various applications to communications and coding. In addition to being a survey, this monograph also includes various new recent results derived by the authors. This third edition of the bestselling book introduces the reader to the martingale method and the Efron-Stein-Steele inequalities in completely new sections. A new application of lossless source coding with side information is described in detail. Finally, the references have been updated and ones included that have been published since the original publication. Concentration of Measure Inequalities in Information Theory, Communications, and Coding is essential reading for all researchers and scientists in information theory and coding.","PeriodicalId":45236,"journal":{"name":"Foundations and Trends in Communications and Information Theory","volume":"23 1","pages":"1-246"},"PeriodicalIF":2.4,"publicationDate":"2012-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84835957","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}
Fundamental Performance Limits in Cross-layer Wireless Optimization: Throughput, Delay, and Energy
跨层无线优化的基本性能限制:吞吐量、延迟和能量
{"title":"Fundamental Performance Limits in Cross-layer Wireless Optimization: Throughput, Delay, and Energy","authors":"E. Yeh","doi":"10.1561/0100000014","DOIUrl":"https://doi.org/10.1561/0100000014","url":null,"abstract":"Fundamental Performance Limits in Cross-layer Wireless Optimization: Throughput, Delay, and Energy","PeriodicalId":45236,"journal":{"name":"Foundations and Trends in Communications and Information Theory","volume":"1 1","pages":"1-112"},"PeriodicalIF":2.4,"publicationDate":"2012-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76142351","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}
1. Introduction 2. Polarization and Polar Coding 3. Complexity 4. Processes with Arbitrary Alphabets 5. Generalized Constructions 6. Joint Polarization of Multiple Processes 7. Conclusion and Related Work. References.
1. 介绍2。极化与极性编码复杂性4。任意字母的进程广义结构多过程联合极化结论及相关工作。参考文献
{"title":"Polarization and Polar Codes","authors":"Eren Sasoglu","doi":"10.1561/0100000041","DOIUrl":"https://doi.org/10.1561/0100000041","url":null,"abstract":"1. Introduction 2. Polarization and Polar Coding 3. Complexity 4. Processes with Arbitrary Alphabets 5. Generalized Constructions 6. Joint Polarization of Multiple Processes 7. Conclusion and Related Work. References.","PeriodicalId":45236,"journal":{"name":"Foundations and Trends in Communications and Information Theory","volume":"84 1","pages":"259-381"},"PeriodicalIF":2.4,"publicationDate":"2012-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80934545","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}
The present monograph studies the asymptotic behaviour of eigenvalues, products and functions of block Toeplitz matrices generated by the Fourier coefficients of a continuous matrix-valued function. This study is based on the concept of asymptotically equivalent sequences of non-square matrices. The asymptotic results on block Toeplitz matrices obtained are applied to vector asymptotically wide sense stationary processes. Therefore, this monograph is a generalization to block Toeplitz matrices of the Gray monograph entitled “Toeplitz and circulant matrices: A review”, which was published in the second volume of Foundations and Trends in Communications and Information Theory, and which is the simplest and most famous introduction to the asymptotic theory on Toeplitz matrices.
{"title":"Block Toeplitz Matrices: Asymptotic Results and Applications","authors":"Jesús Gutiérrez-Gutiérrez, P. Crespo","doi":"10.1561/0100000066","DOIUrl":"https://doi.org/10.1561/0100000066","url":null,"abstract":"The present monograph studies the asymptotic behaviour of eigenvalues, products and functions of block Toeplitz matrices generated by the Fourier coefficients of a continuous matrix-valued function. This study is based on the concept of asymptotically equivalent sequences of non-square matrices. The asymptotic results on block Toeplitz matrices obtained are applied to vector asymptotically wide sense stationary processes. Therefore, this monograph is a generalization to block Toeplitz matrices of the Gray monograph entitled “Toeplitz and circulant matrices: A review”, which was published in the second volume of Foundations and Trends in Communications and Information Theory, and which is the simplest and most famous introduction to the asymptotic theory on Toeplitz matrices.","PeriodicalId":45236,"journal":{"name":"Foundations and Trends in Communications and Information Theory","volume":"29 1","pages":"179-257"},"PeriodicalIF":2.4,"publicationDate":"2012-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90613870","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}
This monograph is devoted to random-set theory, which allows unordered collections of random elements, drawn from an arbitrary space, to be handled. After illustrating its foundations, we focus on Random Finite Sets, i.e., unordered collections of random cardinality of points from an arbitrary space, and show how this theory can be applied to a number of problems arising in wireless communication systems. Three of these problems are: (1) neighbor discovery in wireless networks, (2) multiuser detection in which the number of active users is unknown and time-varying, and (3) estimation of multipath channels where the number of paths is not known a priori and which are possibly time-varying. Standard solutions to these problems are intrinsically suboptimum as they proceed either by assuming a fixed number of vector components, or by first estimating this number and then the values taken on by the components. It is shown how random-set theory provides optimum solutions to all these problems. The complexity issue is also examined, and suboptimum solutions are presented and discussed.
{"title":"Random-Set Theory and Wireless Communications","authors":"E. Biglieri, E. Grossi, M. Lops","doi":"10.1561/0100000054","DOIUrl":"https://doi.org/10.1561/0100000054","url":null,"abstract":"This monograph is devoted to random-set theory, which allows unordered collections of random elements, drawn from an arbitrary space, to be handled. After illustrating its foundations, we focus on Random Finite Sets, i.e., unordered collections of random cardinality of points from an arbitrary space, and show how this theory can be applied to a number of problems arising in wireless communication systems. Three of these problems are: (1) neighbor discovery in wireless networks, (2) multiuser detection in which the number of active users is unknown and time-varying, and (3) estimation of multipath channels where the number of paths is not known a priori and which are possibly time-varying. Standard solutions to these problems are intrinsically suboptimum as they proceed either by assuming a fixed number of vector components, or by first estimating this number and then the values taken on by the components. It is shown how random-set theory provides optimum solutions to all these problems. The complexity issue is also examined, and suboptimum solutions are presented and discussed.","PeriodicalId":45236,"journal":{"name":"Foundations and Trends in Communications and Information Theory","volume":"24 1","pages":"317-462"},"PeriodicalIF":2.4,"publicationDate":"2012-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84214247","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}
O. Simeone, Nathan Levy, A. Sanderovich, O. Somekh, B. M. Zaidel, H. Poor, S. Shamai
In this monograph, the impact of cooperation on the performance of wireless cellular systems is studied from an information-theoretic standpoint, focusing on simple formulations typically referred to as Wynertype models. Following ongoing research and standardization efforts, the text covers two main classes of cooperation strategies. The first class is cooperation at the base station (BS) level, which is also known as Multi-Cell Processing (MCP), network Multiple-Input MultipleOutput (MIMO), or Coordinated Multi-Point transmission/reception (CoMP). With MCP, cooperative decoding, for the uplink, or encoding, for the downlink, is enabled at the BSs. MCP is made possible by the presence of an architecture of, typically wired, backhaul links connecting individual BSs to a central processor (CP) or to one another. The second class of cooperative strategies allows cooperation in the form of relaying for conveying data between Mobile Stations (MSs) and BSs in either the uplink or the downlink. Relaying can be enabled by two possible architectures. A first option is to deploy dedicated Relay Stations (RSs) that are tasked with forwarding uplink or downlink traffic. The second option is for the MSs to act as RSs for other MSs. MCP is first studied under ideal conditions on the backhaul links, namely by assuming that all BSs are connected to a CP with unlimitedcapacity links. Both Gaussian (nonfading) and flat-fading channels are analyzed, for the uplink and the downlink, and analytical insights are drawn into the performance advantages of MCP in different relevant operating regimes. Performance comparison is performed with standard Single-Cell Processing (SCP) techniques, whereby each BS decodes, in the uplink, or encodes, in the downlink, independently, as implemented with different spatial reuse factors. Then, practical constraints on the backhaul architecture enabling MCP are introduced. Specifically, three common settings are studied. In the first, all the BSs are connected to a CP via finite-capacity links. In the second, only BSs in adjacent cells are connected via (finite-capacity) backhaul links. In the third, only a subset of BSs is connected to a CP for joint encoding/decoding (clustered cooperation). Achievable rates for the three settings are studied and compared for both the uplink and the downlink. The performance advantages of relaying are analyzed for cellular systems with dedicated RSs and with cooperative MSs. Different techniques are reviewed that require varying degrees of information about system parameters at the MSs, RSs, and BSs. Performance is investigated with both MCP and SCP, revealing a profound interplay between cooperation at the BS level and relaying. Finally, various open problems are pointed out.
{"title":"Cooperative Wireless Cellular Systems: An Information-Theoretic View","authors":"O. Simeone, Nathan Levy, A. Sanderovich, O. Somekh, B. M. Zaidel, H. Poor, S. Shamai","doi":"10.1561/0100000048","DOIUrl":"https://doi.org/10.1561/0100000048","url":null,"abstract":"In this monograph, the impact of cooperation on the performance of wireless cellular systems is studied from an information-theoretic standpoint, focusing on simple formulations typically referred to as Wynertype models. Following ongoing research and standardization efforts, the text covers two main classes of cooperation strategies. The first class is cooperation at the base station (BS) level, which is also known as Multi-Cell Processing (MCP), network Multiple-Input MultipleOutput (MIMO), or Coordinated Multi-Point transmission/reception (CoMP). With MCP, cooperative decoding, for the uplink, or encoding, for the downlink, is enabled at the BSs. MCP is made possible by the presence of an architecture of, typically wired, backhaul links connecting individual BSs to a central processor (CP) or to one another. The second class of cooperative strategies allows cooperation in the form of relaying for conveying data between Mobile Stations (MSs) and BSs in either the uplink or the downlink. Relaying can be enabled by two possible architectures. A first option is to deploy dedicated Relay Stations (RSs) that are tasked with forwarding uplink or downlink traffic. The second option is for the MSs to act as RSs for other MSs. MCP is first studied under ideal conditions on the backhaul links, namely by assuming that all BSs are connected to a CP with unlimitedcapacity links. Both Gaussian (nonfading) and flat-fading channels are analyzed, for the uplink and the downlink, and analytical insights are drawn into the performance advantages of MCP in different relevant operating regimes. Performance comparison is performed with standard Single-Cell Processing (SCP) techniques, whereby each BS decodes, in the uplink, or encodes, in the downlink, independently, as implemented with different spatial reuse factors. Then, practical constraints on the backhaul architecture enabling MCP are introduced. Specifically, three common settings are studied. In the first, all the BSs are connected to a CP via finite-capacity links. In the second, only BSs in adjacent cells are connected via (finite-capacity) backhaul links. In the third, only a subset of BSs is connected to a CP for joint encoding/decoding (clustered cooperation). Achievable rates for the three settings are studied and compared for both the uplink and the downlink. The performance advantages of relaying are analyzed for cellular systems with dedicated RSs and with cooperative MSs. Different techniques are reviewed that require varying degrees of information about system parameters at the MSs, RSs, and BSs. Performance is investigated with both MCP and SCP, revealing a profound interplay between cooperation at the BS level and relaying. Finally, various open problems are pointed out.","PeriodicalId":45236,"journal":{"name":"Foundations and Trends in Communications and Information Theory","volume":"8 1","pages":"1-177"},"PeriodicalIF":2.4,"publicationDate":"2012-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90808639","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}
The issue of biometric security has become a major research area recently. While systems based on iris-recognition, DNA analysis and fingerprinting are being deployed, there are instances where these alone cannot provide fool-proof security. Biometric Security from an Information-Theoretical Perspective provides an overview of the state-of-the-art of biometric security systems. Using information theoretic techniques it discusses some of the most promising methods to provide practical, but safe, systems. Biometric Security from an Information-Theoretical Perspective studies a number of problems related to the design of biometric secrecy systems for both authentication and identification. First, it reviews the problem of secret sharing in order to set theoretical grounds for the subsequent discussion of secret-key rates and privacy leakage in biometric secrecy systems. Biometric authentication systems are discussed in depth using discrete and Gaussian biometric sources, before describing biometric identification techniques in detail. Since biometric data are typically used for both identification and authentication purposes, the trade-off between identification, secret-key and privacy-leakage rates are determined. Finally, practical considerations are treated. The realization of binary biometric authentication systems with chosen secret keys, called fuzzy commitment, is analyzed. The monograph concludes by investigating how binary quantization of biometric sequences influences the performance of biometric secrecy systems with respect to secret-key rates and privacy leakage. Biometric Security from an Information-Theoretical Perspective is an in-depth review of the topic, which gives the reader an excellent starting point for further research.
{"title":"Biometric Security from an Information-Theoretical Perspective","authors":"T. Ignatenko, F. Willems","doi":"10.1561/0100000051","DOIUrl":"https://doi.org/10.1561/0100000051","url":null,"abstract":"The issue of biometric security has become a major research area recently. While systems based on iris-recognition, DNA analysis and fingerprinting are being deployed, there are instances where these alone cannot provide fool-proof security. Biometric Security from an Information-Theoretical Perspective provides an overview of the state-of-the-art of biometric security systems. Using information theoretic techniques it discusses some of the most promising methods to provide practical, but safe, systems. Biometric Security from an Information-Theoretical Perspective studies a number of problems related to the design of biometric secrecy systems for both authentication and identification. First, it reviews the problem of secret sharing in order to set theoretical grounds for the subsequent discussion of secret-key rates and privacy leakage in biometric secrecy systems. Biometric authentication systems are discussed in depth using discrete and Gaussian biometric sources, before describing biometric identification techniques in detail. Since biometric data are typically used for both identification and authentication purposes, the trade-off between identification, secret-key and privacy-leakage rates are determined. Finally, practical considerations are treated. The realization of binary biometric authentication systems with chosen secret keys, called fuzzy commitment, is analyzed. The monograph concludes by investigating how binary quantization of biometric sequences influences the performance of biometric secrecy systems with respect to secret-key rates and privacy leakage. Biometric Security from an Information-Theoretical Perspective is an in-depth review of the topic, which gives the reader an excellent starting point for further research.","PeriodicalId":45236,"journal":{"name":"Foundations and Trends in Communications and Information Theory","volume":"1 1","pages":"135-316"},"PeriodicalIF":2.4,"publicationDate":"2012-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82048483","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}
This monograph introduces to the reader the idea of interference alignment, traces its origins, reviews a variety of interference alignment schemes, summarizes the diverse settings where the idea of interference alignment is applicable and highlights the common principles that cut across these diverse applications. The focus is on theoretical aspects. Full text available at: http://dx.doi.org/10.1561/0100000047
{"title":"Interference Alignment: A New Look at Signal Dimensions in a Communication Network","authors":"S. Jafar","doi":"10.1561/0100000047","DOIUrl":"https://doi.org/10.1561/0100000047","url":null,"abstract":"This monograph introduces to the reader the idea of interference alignment, traces its origins, reviews a variety of interference alignment schemes, summarizes the diverse settings where the idea of interference alignment is applicable and highlights the common principles that cut across these diverse applications. The focus is on theoretical aspects. Full text available at: http://dx.doi.org/10.1561/0100000047","PeriodicalId":45236,"journal":{"name":"Foundations and Trends in Communications and Information Theory","volume":"6 1","pages":"1-136"},"PeriodicalIF":2.4,"publicationDate":"2011-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75452291","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：