Pub Date : 2017-06-01DOI: 10.1109/CWIT.2017.7994824
Limeng Dong, S. Loyka, Yong Li
Secure communications over cognitive radio (CR) MIMO channels is studied. The secrecy capacity, defined operationally as the maximum achievable secrecy rate subject to reliability and secrecy constraints, of CR MIMO wiretap channel is established under power and interference constraints, including a number of closed-form expressions, bounds and related properties. The secrecy capacity of this channel can be expressed as a minimax game between the transmitter (who selects the input covariance) and nature (who selects the noise covariance). Neither player can deviate from an optimal strategy without incurring a penalty.
{"title":"The operational secrecy capacity of cognitive radio MIMO channel","authors":"Limeng Dong, S. Loyka, Yong Li","doi":"10.1109/CWIT.2017.7994824","DOIUrl":"https://doi.org/10.1109/CWIT.2017.7994824","url":null,"abstract":"Secure communications over cognitive radio (CR) MIMO channels is studied. The secrecy capacity, defined operationally as the maximum achievable secrecy rate subject to reliability and secrecy constraints, of CR MIMO wiretap channel is established under power and interference constraints, including a number of closed-form expressions, bounds and related properties. The secrecy capacity of this channel can be expressed as a minimax game between the transmitter (who selects the input covariance) and nature (who selects the noise covariance). Neither player can deviate from an optimal strategy without incurring a penalty.","PeriodicalId":247812,"journal":{"name":"2017 15th Canadian Workshop on Information Theory (CWIT)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127938507","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 : 2017-06-01DOI: 10.1109/CWIT.2017.7994820
Danny Dubé, Mounir Mechqrane
We present a technique based on permutations, the well known arcade game Pacman, and limited-precision integers to encode data into balanced codewords. The redundancy that is introduced by the encoding is particularly low. The results are noticeably better than those of previous work. Still, the resources required by our technique remain modest: there is no need for costly calculations using large integers and the time and space complexity for encoding or decoding a block is linear.
{"title":"Almost minimum-redundancy construction of balanced codes using limited-precision integers","authors":"Danny Dubé, Mounir Mechqrane","doi":"10.1109/CWIT.2017.7994820","DOIUrl":"https://doi.org/10.1109/CWIT.2017.7994820","url":null,"abstract":"We present a technique based on permutations, the well known arcade game Pacman, and limited-precision integers to encode data into balanced codewords. The redundancy that is introduced by the encoding is particularly low. The results are noticeably better than those of previous work. Still, the resources required by our technique remain modest: there is no need for costly calculations using large integers and the time and space complexity for encoding or decoding a block is linear.","PeriodicalId":247812,"journal":{"name":"2017 15th Canadian Workshop on Information Theory (CWIT)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128114797","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 : 2017-06-01DOI: 10.1109/CWIT.2017.7994814
Adebola Olutayo, Julian Cheng, J. Holzman
A recently proposed fading model which can be used to describe both line-of-sight and non-line-of-sight components of a fading channel is analyzed. The outage probability and error rate performance of equal-gain combining over arbitrary correlated Beaulieu-Xie fading channels is considered. Asymptoticallytight closed-form lower and upper bounds are derived and these analytical results are verified via Monte Carlo simulations.
{"title":"Asymptotically tight performance bounds for equal-gain combining over a new correlated fading channel","authors":"Adebola Olutayo, Julian Cheng, J. Holzman","doi":"10.1109/CWIT.2017.7994814","DOIUrl":"https://doi.org/10.1109/CWIT.2017.7994814","url":null,"abstract":"A recently proposed fading model which can be used to describe both line-of-sight and non-line-of-sight components of a fading channel is analyzed. The outage probability and error rate performance of equal-gain combining over arbitrary correlated Beaulieu-Xie fading channels is considered. Asymptoticallytight closed-form lower and upper bounds are derived and these analytical results are verified via Monte Carlo simulations.","PeriodicalId":247812,"journal":{"name":"2017 15th Canadian Workshop on Information Theory (CWIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131347605","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 : 2017-06-01DOI: 10.1109/CWIT.2017.7994821
R. Barbi, P. Felber, H. Mercier, V. Schiavoni
Distributed storage systems often use erasure coding techniques to provide reliability while decreasing the storage overhead required by replication. Due to the drawbacks of standard MDS erasure-correcting codes, numerous coding schemes recently proposed for distributed storage systems target other metrics such as repair locality and repair bandwidth. Unfortunately, these schemes are not always practical, and for most of them locality covers information data only. In this article, we compare three explicit linear codes for three types of locality: a Reed-Solomon code for worst-case locality, a recently proposed pyramid code for information locality and the Hamming code HAM, an optimal locally repairable code directly built from its generator matrix for all-blocks locality. We also provide an efficient way for repairing HAM and show that for the same level of storage overhead HAM provides faster encoding, faster repair and lower repair bandwidth than the other two solutions while requiring less than fifty lines of code.
{"title":"Worst-case, information and all-blocks locality in distributed storage systems: an explicit comparison","authors":"R. Barbi, P. Felber, H. Mercier, V. Schiavoni","doi":"10.1109/CWIT.2017.7994821","DOIUrl":"https://doi.org/10.1109/CWIT.2017.7994821","url":null,"abstract":"Distributed storage systems often use erasure coding techniques to provide reliability while decreasing the storage overhead required by replication. Due to the drawbacks of standard MDS erasure-correcting codes, numerous coding schemes recently proposed for distributed storage systems target other metrics such as repair locality and repair bandwidth. Unfortunately, these schemes are not always practical, and for most of them locality covers information data only. In this article, we compare three explicit linear codes for three types of locality: a Reed-Solomon code for worst-case locality, a recently proposed pyramid code for information locality and the Hamming code HAM, an optimal locally repairable code directly built from its generator matrix for all-blocks locality. We also provide an efficient way for repairing HAM and show that for the same level of storage overhead HAM provides faster encoding, faster repair and lower repair bandwidth than the other two solutions while requiring less than fifty lines of code.","PeriodicalId":247812,"journal":{"name":"2017 15th Canadian Workshop on Information Theory (CWIT)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133941477","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 : 2017-06-01DOI: 10.1109/CWIT.2017.7994837
Toluwanimi Fagorusi, Yi Feng, J. Bajcsy
This paper considers a multicarrier faster-than-Nyquist (FTN) transceiver architecture when spectrally efficient frequency division multiplexing (SEFDM) is also utilized at the transmitter. The received symbols are corrupted by both the introduced inter-symbol interference (ISI) due to FTN and inter-carrier interference (ICI) due to SEFDM. The interferences have to be eliminated to recover the transmitted data at the receiver. We propose a receiver architecture using a specific matched filter architecture that yields uncorrelated noise samples at the receiver. We investigate the bit error rate (BER) performance of coded transmission when iterative (turbo) equalization is used. Finally, we also present EXIT curves and decoder trajectories for the simulated systems.
{"title":"An architecture for non-orthogonal multi-carrier faster-than-nyquist transmission","authors":"Toluwanimi Fagorusi, Yi Feng, J. Bajcsy","doi":"10.1109/CWIT.2017.7994837","DOIUrl":"https://doi.org/10.1109/CWIT.2017.7994837","url":null,"abstract":"This paper considers a multicarrier faster-than-Nyquist (FTN) transceiver architecture when spectrally efficient frequency division multiplexing (SEFDM) is also utilized at the transmitter. The received symbols are corrupted by both the introduced inter-symbol interference (ISI) due to FTN and inter-carrier interference (ICI) due to SEFDM. The interferences have to be eliminated to recover the transmitted data at the receiver. We propose a receiver architecture using a specific matched filter architecture that yields uncorrelated noise samples at the receiver. We investigate the bit error rate (BER) performance of coded transmission when iterative (turbo) equalization is used. Finally, we also present EXIT curves and decoder trajectories for the simulated systems.","PeriodicalId":247812,"journal":{"name":"2017 15th Canadian Workshop on Information Theory (CWIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133912585","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 : 2017-06-01DOI: 10.1109/CWIT.2017.7994826
G. Kraidy
In this work, the construction of non-recursive nonsystematic convolutional codes that allow to achieve secure transmission over a two-link compound wiretap channel is proposed. The code design goal is that, whenever an eavesdropper has access to one of the two links, he cannot recover any of the transmitted information bits. Secure transmission is achieved by considering a special family of convolutional codes (denoted as ambiguous) combined with channel multiplexing, initially designed for blockfading channels. Error rate curves over Gaussian noise channels and based on Monte Carlo simulations are finally shown.
{"title":"Convolutional code design for secure transmission on a two-link compound wiretap channel","authors":"G. Kraidy","doi":"10.1109/CWIT.2017.7994826","DOIUrl":"https://doi.org/10.1109/CWIT.2017.7994826","url":null,"abstract":"In this work, the construction of non-recursive nonsystematic convolutional codes that allow to achieve secure transmission over a two-link compound wiretap channel is proposed. The code design goal is that, whenever an eavesdropper has access to one of the two links, he cannot recover any of the transmitted information bits. Secure transmission is achieved by considering a special family of convolutional codes (denoted as ambiguous) combined with channel multiplexing, initially designed for blockfading channels. Error rate curves over Gaussian noise channels and based on Monte Carlo simulations are finally shown.","PeriodicalId":247812,"journal":{"name":"2017 15th Canadian Workshop on Information Theory (CWIT)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125765516","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 : 2017-06-01DOI: 10.1109/CWIT.2017.7994831
Pao-Sheng Chouy, Nuwan S. Ferdinand, Ihab Amerz, S. Draper
This paper presents an algorithm that achieves high quality video compression with low memory bandwidth of reference frame data and latency due to computation in motion estimation for screen content. Efficiency is attained by content-adaptive placement of the search windows within the reference frames. In our scheme, the center location of the search window is decided by k most prominent motion vectors under a low resolution pre-analysis of the video content. The algorithm leverages the motion hints obtained during pre-analysis to improve encoding efficiency, while keeping implementation complexity and power budget in an acceptable range. Experimental results show that without increasing the size of the search window when large motion is present, it is still possible to capture the motion and achieve within 1.3 dB BDPSNR compared to the HEVC Test Model HM through smart placement of the search window.
{"title":"Hardware-aware motion estimation via low-resolution motion hints","authors":"Pao-Sheng Chouy, Nuwan S. Ferdinand, Ihab Amerz, S. Draper","doi":"10.1109/CWIT.2017.7994831","DOIUrl":"https://doi.org/10.1109/CWIT.2017.7994831","url":null,"abstract":"This paper presents an algorithm that achieves high quality video compression with low memory bandwidth of reference frame data and latency due to computation in motion estimation for screen content. Efficiency is attained by content-adaptive placement of the search windows within the reference frames. In our scheme, the center location of the search window is decided by k most prominent motion vectors under a low resolution pre-analysis of the video content. The algorithm leverages the motion hints obtained during pre-analysis to improve encoding efficiency, while keeping implementation complexity and power budget in an acceptable range. Experimental results show that without increasing the size of the search window when large motion is present, it is still possible to capture the motion and achieve within 1.3 dB BDPSNR compared to the HEVC Test Model HM through smart placement of the search window.","PeriodicalId":247812,"journal":{"name":"2017 15th Canadian Workshop on Information Theory (CWIT)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123542051","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 : 2017-06-01DOI: 10.1109/CWIT.2017.7994816
Khaled F. Hayajneh, S. Yousefi
Fountain codes are used in many applications where the channels are time varying and it is difficult at the transmitter to predict the appropriate code rate. In this situation, fixedrate codes are not suitable. Despite the good performance of fountain codes, universally optimal codes do not exist in the finite-length regime. In this paper, we design new fountain codes that are robust to the communication system's parameters such as erasure probability as well as the source length. We employ density evolution together with linear programming to design robust fountain codes offering some of the attractive properties of universally optimal codes. Different objectives are used in the analysis such as minimizing the erasure probability and maximizing the code rate. Analytically, results indicate that fountain codes can decrease the failure probability to the level of 10-12 using the optimized parameters at source length k = 128, code rate R = 1/2 and erasure probability ϵ = 0. Further, simulation results show that the code rate can be improved significantly. For example, at a source length k = 512, Shokrollahi distribution [1] achieves code rate R = 0.7268 while our novel design provides a code rate R = 0.76331, that is, an improvement of 5%.
{"title":"Robust LT designs in binary erasures","authors":"Khaled F. Hayajneh, S. Yousefi","doi":"10.1109/CWIT.2017.7994816","DOIUrl":"https://doi.org/10.1109/CWIT.2017.7994816","url":null,"abstract":"Fountain codes are used in many applications where the channels are time varying and it is difficult at the transmitter to predict the appropriate code rate. In this situation, fixedrate codes are not suitable. Despite the good performance of fountain codes, universally optimal codes do not exist in the finite-length regime. In this paper, we design new fountain codes that are robust to the communication system's parameters such as erasure probability as well as the source length. We employ density evolution together with linear programming to design robust fountain codes offering some of the attractive properties of universally optimal codes. Different objectives are used in the analysis such as minimizing the erasure probability and maximizing the code rate. Analytically, results indicate that fountain codes can decrease the failure probability to the level of 10-12 using the optimized parameters at source length k = 128, code rate R = 1/2 and erasure probability ϵ = 0. Further, simulation results show that the code rate can be improved significantly. For example, at a source length k = 512, Shokrollahi distribution [1] achieves code rate R = 0.7268 while our novel design provides a code rate R = 0.76331, that is, an improvement of 5%.","PeriodicalId":247812,"journal":{"name":"2017 15th Canadian Workshop on Information Theory (CWIT)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134071997","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 : 2017-06-01DOI: 10.1109/CWIT.2017.7994822
A. Amirzadeh, M. H. Taieb, J. Chouinard
In communication systems, the transmitted data is corrupted by channel perturbations, such as noise and fading, which affect the reliability of the received data. Error correction codes are employed to mitigate channel perturbations. However, design and implementation of good and efficient error correction codes remains an open problem. In this paper, Low Density Parity Check (LDPC) codes are considered as they provide a reasonable trade-off between computational complexity and reliability. Good LDPC codes should ideally provide low complexity, close to capacity acheivable transmission rate, high coding threshold, and high decoding stability. In this paper, we investigate a joint LDPC code optimization algorithm using Genetic Algorithm (GA) and Linear Programming (LP) to determine the variable nodes and check nodes degrees distributions. EXIT chart analysis and Frame Error Rate (FER) performance are used to validate the proposed method.
{"title":"On the design of good LDPC codes with joint genetic algorithm and linear programming optimization","authors":"A. Amirzadeh, M. H. Taieb, J. Chouinard","doi":"10.1109/CWIT.2017.7994822","DOIUrl":"https://doi.org/10.1109/CWIT.2017.7994822","url":null,"abstract":"In communication systems, the transmitted data is corrupted by channel perturbations, such as noise and fading, which affect the reliability of the received data. Error correction codes are employed to mitigate channel perturbations. However, design and implementation of good and efficient error correction codes remains an open problem. In this paper, Low Density Parity Check (LDPC) codes are considered as they provide a reasonable trade-off between computational complexity and reliability. Good LDPC codes should ideally provide low complexity, close to capacity acheivable transmission rate, high coding threshold, and high decoding stability. In this paper, we investigate a joint LDPC code optimization algorithm using Genetic Algorithm (GA) and Linear Programming (LP) to determine the variable nodes and check nodes degrees distributions. EXIT chart analysis and Frame Error Rate (FER) performance are used to validate the proposed method.","PeriodicalId":247812,"journal":{"name":"2017 15th Canadian Workshop on Information Theory (CWIT)","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132466028","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 : 2017-06-01DOI: 10.1109/CWIT.2017.7994834
Yi Feng, J. Bajcsy
The envisioned future Fifth Generation (SG) communication systems need to provide high data link throughputs to support the emerging wireless applications. In order to achieve more efficient use of bandwidth, non-orthogonal communication schemes have been considered to be essential. This paper focuses on extending the non-orthogonal spectrally-efficient frequency-division multiplexing (SEFDM) transmission into transmission over multiple-input-multipleoutput (MIMO) channels. Then, we derive corresponding capacity formulas to evaluate the achievable information rate of the considered SEFDM-MIMO channel. Furthermore, for different continuous-time modulation pulses, we evaluate the capacity of the SEFDM-MIMO channels.
{"title":"Information rate of multi-antenna spectrally-efficient FDM communication","authors":"Yi Feng, J. Bajcsy","doi":"10.1109/CWIT.2017.7994834","DOIUrl":"https://doi.org/10.1109/CWIT.2017.7994834","url":null,"abstract":"The envisioned future Fifth Generation (SG) communication systems need to provide high data link throughputs to support the emerging wireless applications. In order to achieve more efficient use of bandwidth, non-orthogonal communication schemes have been considered to be essential. This paper focuses on extending the non-orthogonal spectrally-efficient frequency-division multiplexing (SEFDM) transmission into transmission over multiple-input-multipleoutput (MIMO) channels. Then, we derive corresponding capacity formulas to evaluate the achievable information rate of the considered SEFDM-MIMO channel. Furthermore, for different continuous-time modulation pulses, we evaluate the capacity of the SEFDM-MIMO channels.","PeriodicalId":247812,"journal":{"name":"2017 15th Canadian Workshop on Information Theory (CWIT)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130745697","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
扫码关注我们
求助内容：
应助结果提醒方式：