Pub Date : 2018-09-01DOI: 10.1109/ASMS-SPSC.2018.8510722
B. Tauran, E. Lochin, J. Lacan, F. Arnal, Mathieu Gineste, N. Kuhn
Satellite transmissions can suffer from high channel impairments, especially on the link between a satellite and a mobile end-user. To cope with these errors, physical and link layer reliability schemes have been introduced at the price of an end-to-end delay increase resulting in high jitter. Unfortunately, both the delay and the jitter negatively impacts on multimedia traffic. As a matter of fact, not taking into account the channel state greatly decreases the Quality of Experience (QoE) of VoIP users. In this paper, we propose to solve this issue by scheduling data transmission as a function of the channel condition. We first investigate existing scheduling mechanisms and analyze their performance for VoIP traffic with the objective to lower both latency and jitter, which are the most important metrics to achieve a consistent VoIP service. We select the best candidate among several schedulers and propose a novel algorithm specifically designed to carry VoIP over LEO constellations. Our simulations show that in some scenarios, we double the QoE of VoIP users.
{"title":"Controlled Delay Scheduler for VoIP over LEO constellations on LMS channels","authors":"B. Tauran, E. Lochin, J. Lacan, F. Arnal, Mathieu Gineste, N. Kuhn","doi":"10.1109/ASMS-SPSC.2018.8510722","DOIUrl":"https://doi.org/10.1109/ASMS-SPSC.2018.8510722","url":null,"abstract":"Satellite transmissions can suffer from high channel impairments, especially on the link between a satellite and a mobile end-user. To cope with these errors, physical and link layer reliability schemes have been introduced at the price of an end-to-end delay increase resulting in high jitter. Unfortunately, both the delay and the jitter negatively impacts on multimedia traffic. As a matter of fact, not taking into account the channel state greatly decreases the Quality of Experience (QoE) of VoIP users. In this paper, we propose to solve this issue by scheduling data transmission as a function of the channel condition. We first investigate existing scheduling mechanisms and analyze their performance for VoIP traffic with the objective to lower both latency and jitter, which are the most important metrics to achieve a consistent VoIP service. We select the best candidate among several schedulers and propose a novel algorithm specifically designed to carry VoIP over LEO constellations. Our simulations show that in some scenarios, we double the QoE of VoIP users.","PeriodicalId":362263,"journal":{"name":"2018 9th Advanced Satellite Multimedia Systems Conference and the 15th Signal Processing for Space Communications Workshop (ASMS/SPSC)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114877059","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}
Pub Date : 2018-09-01DOI: 10.1109/ASMS-SPSC.2018.8510721
D. Donev, Georg Böcherer
A polar-coded modulation scheme for deep-space optical communication is proposed. The photon counting Poisson channel with pulse position modulation (PPM) is considered. We use the fact that PPM is particularly well suited to be used with multilevel codes to design a polar-coded modulation scheme for the system in consideration. The construction of polar codes for the Poisson channel based on Gaussian approximation is demonstrated to be accurate. The proposed scheme uses a cyclic redundancy check outer code and a successive cancellation decoder with list decoding and it is shown that it outperforms the competing schemes.
{"title":"Polar-Coded Pulse Position Modulation for the Poisson Channel","authors":"D. Donev, Georg Böcherer","doi":"10.1109/ASMS-SPSC.2018.8510721","DOIUrl":"https://doi.org/10.1109/ASMS-SPSC.2018.8510721","url":null,"abstract":"A polar-coded modulation scheme for deep-space optical communication is proposed. The photon counting Poisson channel with pulse position modulation (PPM) is considered. We use the fact that PPM is particularly well suited to be used with multilevel codes to design a polar-coded modulation scheme for the system in consideration. The construction of polar codes for the Poisson channel based on Gaussian approximation is demonstrated to be accurate. The proposed scheme uses a cyclic redundancy check outer code and a successive cancellation decoder with list decoding and it is shown that it outperforms the competing schemes.","PeriodicalId":362263,"journal":{"name":"2018 9th Advanced Satellite Multimedia Systems Conference and the 15th Signal Processing for Space Communications Workshop (ASMS/SPSC)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125166380","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}
Pub Date : 2018-09-01DOI: 10.1109/ASMS-SPSC.2018.8510732
Selma Zamoum, J. Lacan, M. Boucheret, Jean-Baptiste Dupe, Mathieu Gineste
In this paper we propose a new random access (RA) channel technique for the return link of satellite communications. It concerns slotted transmissions. This proposed method called Shared Position Technique for Interfered random Transmissions (SPOTiT), is based on a shared knowledge between the receiver and each of the terminals. The shared information is about the time slot locations on which the terminal transmits its replicas as well as the preamble to use. The presented random version of SPOTiT aims to reduce the complexity of replicas localization process of the legacy technique Multireplica Decoding using Correlation based Localisation (MARSALA). It presents a less complex system without degrading performance and with no extra signaling information. Thus, SPOTiT is applied at the same level as MARSALA, i.e., when Contention Resolution Diversity Slotted Aloha (CRDSA) fails in retrieving more packets. This technique combined with CRDSA significantly reduces the number of data localization correlations, while maintaining the same performance as in CRDSA/MARSALA in terms of packet loss ratio and throughput.
{"title":"Shared Position Technique for Interfered Random Transmissions in Satellite Communications","authors":"Selma Zamoum, J. Lacan, M. Boucheret, Jean-Baptiste Dupe, Mathieu Gineste","doi":"10.1109/ASMS-SPSC.2018.8510732","DOIUrl":"https://doi.org/10.1109/ASMS-SPSC.2018.8510732","url":null,"abstract":"In this paper we propose a new random access (RA) channel technique for the return link of satellite communications. It concerns slotted transmissions. This proposed method called Shared Position Technique for Interfered random Transmissions (SPOTiT), is based on a shared knowledge between the receiver and each of the terminals. The shared information is about the time slot locations on which the terminal transmits its replicas as well as the preamble to use. The presented random version of SPOTiT aims to reduce the complexity of replicas localization process of the legacy technique Multireplica Decoding using Correlation based Localisation (MARSALA). It presents a less complex system without degrading performance and with no extra signaling information. Thus, SPOTiT is applied at the same level as MARSALA, i.e., when Contention Resolution Diversity Slotted Aloha (CRDSA) fails in retrieving more packets. This technique combined with CRDSA significantly reduces the number of data localization correlations, while maintaining the same performance as in CRDSA/MARSALA in terms of packet loss ratio and throughput.","PeriodicalId":362263,"journal":{"name":"2018 9th Advanced Satellite Multimedia Systems Conference and the 15th Signal Processing for Space Communications Workshop (ASMS/SPSC)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131733326","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}
Pub Date : 2018-09-01DOI: 10.1109/ASMS-SPSC.2018.8510750
J. Flávio, F. Cuervo, M. Schönhuber, Michael Schmidt, D. Vanhoenacker-Janvier, A. Martin-Polegre, A. Martellucci
In the next generation of satellites, innovative services are intended to be offered by the communications operators. Due to the congestion of the spectrum, the implementation of such services is only possible at high frequency bands. However, at these frequencies, the atmospheric channel has more impact on the propagating signals, compromising the quality-of-service (QoS). In order to study the Earth-space link, several experimental campaigns have been performed below the Q-band with GEO satellites. This paper addresses a new propagation experiment which will permit to extend the understanding of the Earth-space channel up to the W-band and LEO orbits.
{"title":"A New Earth-LEO Propagation Campaign at Q and W-band","authors":"J. Flávio, F. Cuervo, M. Schönhuber, Michael Schmidt, D. Vanhoenacker-Janvier, A. Martin-Polegre, A. Martellucci","doi":"10.1109/ASMS-SPSC.2018.8510750","DOIUrl":"https://doi.org/10.1109/ASMS-SPSC.2018.8510750","url":null,"abstract":"In the next generation of satellites, innovative services are intended to be offered by the communications operators. Due to the congestion of the spectrum, the implementation of such services is only possible at high frequency bands. However, at these frequencies, the atmospheric channel has more impact on the propagating signals, compromising the quality-of-service (QoS). In order to study the Earth-space link, several experimental campaigns have been performed below the Q-band with GEO satellites. This paper addresses a new propagation experiment which will permit to extend the understanding of the Earth-space channel up to the W-band and LEO orbits.","PeriodicalId":362263,"journal":{"name":"2018 9th Advanced Satellite Multimedia Systems Conference and the 15th Signal Processing for Space Communications Workshop (ASMS/SPSC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125823858","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}
Pub Date : 2018-07-15DOI: 10.1109/ASMS-SPSC.2018.8510726
Estefanía Recayte, Francisco Lázaro, G. Liva
We address the use of linear random fountain coded caching schemes in a heterogeneous satellite network. We consider a system composed of multiple hubs and a geostationary Earth orbit satellite. Coded content is memorized in hubs’ caches in order to serve immediately the user requests and reduce the usage of the satellite backhaul link. We derive the analytical expression of the average backhaul rate, as well as a tight upper bound to it with a simple expression. Furthermore, we derive the optimal caching strategy which minimizes the average backhaul rate and compare the performance of the linear random fountain code scheme to that of a scheme using maximum distance separable codes. Our simulation results indicate that the performance obtained using fountain codes is similar to that of maximum distance separable codes.
{"title":"Caching at the Edge with Fountain Codes","authors":"Estefanía Recayte, Francisco Lázaro, G. Liva","doi":"10.1109/ASMS-SPSC.2018.8510726","DOIUrl":"https://doi.org/10.1109/ASMS-SPSC.2018.8510726","url":null,"abstract":"We address the use of linear random fountain coded caching schemes in a heterogeneous satellite network. We consider a system composed of multiple hubs and a geostationary Earth orbit satellite. Coded content is memorized in hubs’ caches in order to serve immediately the user requests and reduce the usage of the satellite backhaul link. We derive the analytical expression of the average backhaul rate, as well as a tight upper bound to it with a simple expression. Furthermore, we derive the optimal caching strategy which minimizes the average backhaul rate and compare the performance of the linear random fountain code scheme to that of a scheme using maximum distance separable codes. Our simulation results indicate that the performance obtained using fountain codes is similar to that of maximum distance separable codes.","PeriodicalId":362263,"journal":{"name":"2018 9th Advanced Satellite Multimedia Systems Conference and the 15th Signal Processing for Space Communications Workshop (ASMS/SPSC)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121148802","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}
Pub Date : 2018-06-07DOI: 10.1109/ASMS-SPSC.2018.8510735
F. Kayhan, G. Montorsi
In this paper we propose a simple method for generating binary short-length rate-compatiblefamilies of codes that are robust to non-coherent detection for M-PSK constellations. We use a greedy algorithm to first construct a family of rotationally invariant codeswith respect to M-PSK modulation. Then, by properly modifying such codes we obtain codes that are robust to non-coherent detection. For a special case of QPSK constellation, we use our algorithm to create binary codes with lengths up to N = 256. Our method provides an upper bound for the length of optimal codes with a given desired non-coherent distance. We shortly discuss the optimality of our scheme and provide several simulationsto evaluate the performance. Finally, we discuss the code construction problem for the frame header with a desired codeword error probability (CEP) and derive a simple upper bound on CEP of codes with a given non-coherent distance.
{"title":"Code Design for Non-Coherent Detection of Frame Headers in Precoded Satellite Systems","authors":"F. Kayhan, G. Montorsi","doi":"10.1109/ASMS-SPSC.2018.8510735","DOIUrl":"https://doi.org/10.1109/ASMS-SPSC.2018.8510735","url":null,"abstract":"In this paper we propose a simple method for generating binary short-length rate-compatiblefamilies of codes that are robust to non-coherent detection for M-PSK constellations. We use a greedy algorithm to first construct a family of rotationally invariant codeswith respect to M-PSK modulation. Then, by properly modifying such codes we obtain codes that are robust to non-coherent detection. For a special case of QPSK constellation, we use our algorithm to create binary codes with lengths up to N = 256. Our method provides an upper bound for the length of optimal codes with a given desired non-coherent distance. We shortly discuss the optimality of our scheme and provide several simulationsto evaluate the performance. Finally, we discuss the code construction problem for the frame header with a desired codeword error probability (CEP) and derive a simple upper bound on CEP of codes with a given non-coherent distance.","PeriodicalId":362263,"journal":{"name":"2018 9th Advanced Satellite Multimedia Systems Conference and the 15th Signal Processing for Space Communications Workshop (ASMS/SPSC)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122888415","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}
Pub Date : 2018-04-18DOI: 10.1109/ASMS-SPSC.2018.8510728
A. Guidotti, A. Vanelli-Coralli
Current State-of-the-Art High Throughput Satellite systems provide wide-area connectivity through multi-beam architectures. Due to the tremendous system throughput requirements that next generation Satellite Communications (SatCom) expect to achieve, traditional 4-colour frequency reuse schemes are not sufficient anymore and more aggressive solutions as full frequency reuse are being considered for multi-beam SatCom. These approaches require advanced interference management techniques to cope with the significantly increased inter-beam interference both at the transmitter, e.g., precoding, and at the receiver, e.g., Multi User Detection (MUD). With respect to the former, several peculiar challenges arise when designed for SatCom systems. In particular, multiple users are multiplexed in the same transmission radio frame, thus imposing to consider multiple channel matrices when computing the precoding coefficients. In previous works, the main focus has been on the users’ clustering and precoding design. However, even though achieving significant throughput gains, no analysis has been performed on the impact of the system scheduling algorithm on multicast precoding, which is typically assumed random. In this paper, we focus on this aspect by showing that, although the overall system performance is improved, a random scheduler does not properly tackle specific scenarios in which the precoding algorithm can poorly perform. Based on these considerations, we design a Geographical Scheduling Algorithm (GSA) aimed at improving the precoding performance in these critical scenarios and, consequently, the performance at system level as well. Through extensive numerical simulations, we show that the proposed GSA provides a significant performance improvement with respect to the legacy random scheduling.
{"title":"Geographical Scheduling for Multicast Precoding in Multi-Beam Satellite Systems","authors":"A. Guidotti, A. Vanelli-Coralli","doi":"10.1109/ASMS-SPSC.2018.8510728","DOIUrl":"https://doi.org/10.1109/ASMS-SPSC.2018.8510728","url":null,"abstract":"Current State-of-the-Art High Throughput Satellite systems provide wide-area connectivity through multi-beam architectures. Due to the tremendous system throughput requirements that next generation Satellite Communications (SatCom) expect to achieve, traditional 4-colour frequency reuse schemes are not sufficient anymore and more aggressive solutions as full frequency reuse are being considered for multi-beam SatCom. These approaches require advanced interference management techniques to cope with the significantly increased inter-beam interference both at the transmitter, e.g., precoding, and at the receiver, e.g., Multi User Detection (MUD). With respect to the former, several peculiar challenges arise when designed for SatCom systems. In particular, multiple users are multiplexed in the same transmission radio frame, thus imposing to consider multiple channel matrices when computing the precoding coefficients. In previous works, the main focus has been on the users’ clustering and precoding design. However, even though achieving significant throughput gains, no analysis has been performed on the impact of the system scheduling algorithm on multicast precoding, which is typically assumed random. In this paper, we focus on this aspect by showing that, although the overall system performance is improved, a random scheduler does not properly tackle specific scenarios in which the precoding algorithm can poorly perform. Based on these considerations, we design a Geographical Scheduling Algorithm (GSA) aimed at improving the precoding performance in these critical scenarios and, consequently, the performance at system level as well. Through extensive numerical simulations, we show that the proposed GSA provides a significant performance improvement with respect to the legacy random scheduling.","PeriodicalId":362263,"journal":{"name":"2018 9th Advanced Satellite Multimedia Systems Conference and the 15th Signal Processing for Space Communications Workshop (ASMS/SPSC)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116989535","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
扫码关注我们
求助内容：
应助结果提醒方式：