{"title":"When can a relay reduce end-to-end communication delay?","authors":"A. Chaaban, A. Sezgin","doi":"10.1109/ICCSPA.2015.7081277","DOIUrl":null,"url":null,"abstract":"The impact of relaying on the latency of communication in a relay channel is studied. Both decode-forward (DF) and amplify-forward (AF) are considered, and are compared with the point-to-point (P2P) scheme which does not use the relay. The question as to whether DF and AF can decrease the latency of communicating a number of bits with a given reliability requirement is addressed. Latency expressions for the three schemes are derived. Although both DF and AF use a block-transmission structure which sends the information over multiple transmission blocks, they can both achieve latencies lower than P2P. Conditions under which this occurs are obtained. Interestingly, these conditions are more strict when compared to the conditions under which DF and AF achieve higher information-theoretic rates than P2P.","PeriodicalId":395644,"journal":{"name":"2015 International Conference on Communications, Signal Processing, and their Applications (ICCSPA'15)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Communications, Signal Processing, and their Applications (ICCSPA'15)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSPA.2015.7081277","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
The impact of relaying on the latency of communication in a relay channel is studied. Both decode-forward (DF) and amplify-forward (AF) are considered, and are compared with the point-to-point (P2P) scheme which does not use the relay. The question as to whether DF and AF can decrease the latency of communicating a number of bits with a given reliability requirement is addressed. Latency expressions for the three schemes are derived. Although both DF and AF use a block-transmission structure which sends the information over multiple transmission blocks, they can both achieve latencies lower than P2P. Conditions under which this occurs are obtained. Interestingly, these conditions are more strict when compared to the conditions under which DF and AF achieve higher information-theoretic rates than P2P.