Multiantenna Channels: Capacity, Coding and Signal Processing最新文献

Distribution of MIMO capacity in the presence of correlated signals and interferers: A (not so) large N analysis 存在相关信号和干扰时MIMO容量的分布:A(不是那么大)N分析

Multiantenna Channels: Capacity, Coding and Signal Processing Pub Date : 1900-01-01 DOI: 10.1090/dimacs/062/03

A. L. Moustakas, S. Simon, Anirvan M. Sengupta

引用次数: 1

Broadband MIMO channel model for realistic capacity and system performance evaluations 用于实际容量和系统性能评估的宽带MIMO信道模型

Multiantenna Channels: Capacity, Coding and Signal Processing Pub Date : 1900-01-01 DOI: 10.1090/dimacs/062/01

Hao Xu, D. Chizhik, Howard C. Huang, R. Valenzuela

引用次数: 0

Maximum-likelihood decoding and integer least-squares: The expected complexity 最大似然解码和整数最小二乘:期望的复杂度

Multiantenna Channels: Capacity, Coding and Signal Processing Pub Date : 1900-01-01 DOI: 10.1090/dimacs/062/10

B. Hassibi, H. Vikalo

{"title":"Maximum-likelihood decoding and integer least-squares: The expected complexity","authors":"B. Hassibi, H. Vikalo","doi":"10.1090/dimacs/062/10","DOIUrl":"https://doi.org/10.1090/dimacs/062/10","url":null,"abstract":"The problem of finding the least-squares solution to a system of linear equations where the unknown \u0000vector is comprised of integers, but the matrix coefficient and given vector are comprised of real numbers, \u0000arises in many applications: communications, cryptography, GPS, to name a few. The problem is equivalent \u0000to finding the closest lattice point to a given point and is known to be NP-hard. In communications \u0000applications, however, the given vector is not arbitrary, but rather is an unknown lattice point that has been \u0000perturbed by an additive noise vector whose statistical properties are known. Therefore in this paper, rather \u0000than dwell on the worst-case complexity of the integer-least-squares problem, we study its expected complexity, \u0000averaged over the noise and over the lattice. For the “sphere decoding” algorithm of Fincke and \u0000Pohst we find a closed-form expression for the expected complexity and show that, for a wide range of noise \u0000variances and dimensions, the expected complexity is polynomial, in fact often roughly cubic. Since many \u0000communications systems operate at noise levels for which the expected complexity turns out to be polynomial, \u0000this suggests that maximum-likelihood decoding, which was hitherto thought to be computationally \u0000intractable, can in fact be implemented in real-time—a result with many practical implications.","PeriodicalId":400366,"journal":{"name":"Multiantenna Channels: Capacity, Coding and Signal Processing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131459767","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}

引用次数: 27

Slowing the time-fluctuating MIMO channel 减慢时间波动MIMO信道

Multiantenna Channels: Capacity, Coding and Signal Processing Pub Date : 1900-01-01 DOI: 10.1090/dimacs/062/11

D. Chizhik

引用次数: 5

Writing on dirty tape with LDPC codes 用LDPC代码在脏磁带上书写

Multiantenna Channels: Capacity, Coding and Signal Processing Pub Date : 1900-01-01 DOI: 10.1090/dimacs/062/08

G. Caire, S. Shamai

引用次数: 22

Challenges in UWB signaling for adhoc networking 自组网中UWB信令的挑战

Multiantenna Channels: Capacity, Coding and Signal Processing Pub Date : 1900-01-01 DOI: 10.1090/dimacs/062/16

Y. Souilmi, R. Knopp

引用次数: 9

Dirty paper coding: Perturbing off the infinite dimensional lattice limit 脏纸编码:干扰无限维晶格极限

Multiantenna Channels: Capacity, Coding and Signal Processing Pub Date : 1900-01-01 DOI: 10.1090/dimacs/062/09

G. Foschini, A. Diaz

引用次数: 28

Efficient multihop broadcast for wideband systems 宽带系统的高效多跳广播

Multiantenna Channels: Capacity, Coding and Signal Processing Pub Date : 1900-01-01 DOI: 10.1090/dimacs/062/17

I. Marić, R. Yates

{"title":"Efficient multihop broadcast for wideband systems","authors":"I. Marić, R. Yates","doi":"10.1090/dimacs/062/17","DOIUrl":"https://doi.org/10.1090/dimacs/062/17","url":null,"abstract":"In this paper we address the minimum-energy broadcast problem. To increase the energy efficiency, we allow nodes that are out of the transmission range of a transmitter to collect the energy of unreliably received overheard signals. As a message is forwarded through the network, a node will have multiple opportunities to reliably receive the message by collecting energy during each retransmission. We refer to this strategy as accumulative broadcast. Under the assumption that the nodes reliably forward messages, we formulate the minimum-energy accumulative broadcast problem. We present a solution employing two subproblems. First, we identify the ordering in which nodes should transmit. Second, we determine the optimum power levels for that ordering. While the second subproblem can be solved by means of linear programming, the ordering subproblem is found to be NP-complete. We devise a heuristic algorithm to find a good ordering and evaluate the performance of the algorithm. Preliminary results show the performance of the heuristic algorithm is generally close to the optimum solution. Results also show a significant improvement compared to the well known BIP algorithm for constructing an energy-efficient broadcast tree.","PeriodicalId":400366,"journal":{"name":"Multiantenna Channels: Capacity, Coding and Signal Processing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121206506","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}

引用次数: 39

Space-time coding with iterative receiver interfaces 具有迭代接收接口的空时编码

Multiantenna Channels: Capacity, Coding and Signal Processing Pub Date : 1900-01-01 DOI: 10.1090/dimacs/062/13

E. Biglieri, A. Nordio, G. Taricco

引用次数: 0

A spacetime architectural superstructure enabling efficient multiple antenna communication 一种时空建筑上层结构，可实现高效的多天线通信

Multiantenna Channels: Capacity, Coding and Signal Processing Pub Date : 1900-01-01 DOI: 10.1090/dimacs/062/12

G. Foschini, M. Sellathurai

引用次数: 3