{"title":"网络编码实时信息的近似恢复","authors":"Minhae Kwon, Hyunggon Park","doi":"10.1109/ICOIN.2014.6799741","DOIUrl":null,"url":null,"abstract":"In this paper, we consider real-time voice transmission or speech communication systems, where voice information is encoded based on network coding techniques. For real-time delivery of data encoded by network coding techniques, the All-Or-Nothing problem of network coding is one of the most important challenges in order to guarantee quality of service (QoS) requirements. In order to overcome the problem, approximate decoding is used for immediate data recovery. In this paper, we focus on optimizing parameters for the best performance of approximate decoding algorithm by explicitly considering the information about source correlation. In particular, we consider the case where consecutive source data sets have symmetric distributions. We analytically show that the best strategy for the approximate decoding algorithm is to use mean of the distributions. Moreover, the performance of the proposed algorithm can improve as the variance of the distributions becomes lower.","PeriodicalId":388486,"journal":{"name":"The International Conference on Information Networking 2014 (ICOIN2014)","volume":"118 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Approximate recovery of network coded real-time information\",\"authors\":\"Minhae Kwon, Hyunggon Park\",\"doi\":\"10.1109/ICOIN.2014.6799741\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we consider real-time voice transmission or speech communication systems, where voice information is encoded based on network coding techniques. For real-time delivery of data encoded by network coding techniques, the All-Or-Nothing problem of network coding is one of the most important challenges in order to guarantee quality of service (QoS) requirements. In order to overcome the problem, approximate decoding is used for immediate data recovery. In this paper, we focus on optimizing parameters for the best performance of approximate decoding algorithm by explicitly considering the information about source correlation. In particular, we consider the case where consecutive source data sets have symmetric distributions. We analytically show that the best strategy for the approximate decoding algorithm is to use mean of the distributions. Moreover, the performance of the proposed algorithm can improve as the variance of the distributions becomes lower.\",\"PeriodicalId\":388486,\"journal\":{\"name\":\"The International Conference on Information Networking 2014 (ICOIN2014)\",\"volume\":\"118 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-04-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The International Conference on Information Networking 2014 (ICOIN2014)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICOIN.2014.6799741\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The International Conference on Information Networking 2014 (ICOIN2014)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOIN.2014.6799741","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Approximate recovery of network coded real-time information
In this paper, we consider real-time voice transmission or speech communication systems, where voice information is encoded based on network coding techniques. For real-time delivery of data encoded by network coding techniques, the All-Or-Nothing problem of network coding is one of the most important challenges in order to guarantee quality of service (QoS) requirements. In order to overcome the problem, approximate decoding is used for immediate data recovery. In this paper, we focus on optimizing parameters for the best performance of approximate decoding algorithm by explicitly considering the information about source correlation. In particular, we consider the case where consecutive source data sets have symmetric distributions. We analytically show that the best strategy for the approximate decoding algorithm is to use mean of the distributions. Moreover, the performance of the proposed algorithm can improve as the variance of the distributions becomes lower.