{"title":"多级放大转发中继网络的渐近容量","authors":"Shu-ping Yeh, O. Lévêque","doi":"10.1109/ISIT.2007.4557424","DOIUrl":null,"url":null,"abstract":"This paper analyzes the capacity of a wireless relay network composed of a large number of nodes that operate in an amplify-and-forward mode and that divide into a fixed number of levels. The capacity computation relies on the study of products of large random matrices, whose limiting eigenvalue distribution is computed via a set of recursive equations.","PeriodicalId":193467,"journal":{"name":"2007 IEEE International Symposium on Information Theory","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"61","resultStr":"{\"title\":\"Asymptotic Capacity of Multi-Level Amplify-and-Forward Relay Networks\",\"authors\":\"Shu-ping Yeh, O. Lévêque\",\"doi\":\"10.1109/ISIT.2007.4557424\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper analyzes the capacity of a wireless relay network composed of a large number of nodes that operate in an amplify-and-forward mode and that divide into a fixed number of levels. The capacity computation relies on the study of products of large random matrices, whose limiting eigenvalue distribution is computed via a set of recursive equations.\",\"PeriodicalId\":193467,\"journal\":{\"name\":\"2007 IEEE International Symposium on Information Theory\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-06-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"61\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2007.4557424\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2007.4557424","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Asymptotic Capacity of Multi-Level Amplify-and-Forward Relay Networks
This paper analyzes the capacity of a wireless relay network composed of a large number of nodes that operate in an amplify-and-forward mode and that divide into a fixed number of levels. The capacity computation relies on the study of products of large random matrices, whose limiting eigenvalue distribution is computed via a set of recursive equations.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
