{"title":"Technologies for future broadband wireless evolution","authors":"D. Calin","doi":"10.1109/CWIT.2015.7255152","DOIUrl":"https://doi.org/10.1109/CWIT.2015.7255152","url":null,"abstract":"The paper discusses some of the available technologies for evolution of broadband wireless systems, including carrier aggregation, MIMO, HetNets and small cells. Of particular interest are small cell technologies, thanks to their merits to increase system capacity. To that extent, small cells deployment aspects and a specialized case for small cells deployment in high density traffic public venues such as stadiums are addressed. We conclude with a reference to salient aspects of the fifth generation (5G) mobile networks research.","PeriodicalId":426245,"journal":{"name":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122034361","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}
{"title":"Using bit recycling to reduce the redundancy in plurally parsable dictionaries","authors":"Ahmad Al-Rababa'a, Danny Dubé","doi":"10.1109/CWIT.2015.7255153","DOIUrl":"https://doi.org/10.1109/CWIT.2015.7255153","url":null,"abstract":"Tunstall proposed an efficient algorithm for constructing the optimal dictionary of any particular size to obtain a variable-to-fixed code. More accurately, the algorithm constructs the optimal uniquely parsable dictionary. In fact, Savari showed that, if one allows herself to consider plurally parsable dictionaries, better codes may be constructed. Savari found a class of plurally parsable dictionaries that outperform the Tunstall code for memoryless, highly skewed, binary sources. This work addresses the redundancy in plurally parsable dictionaries and proposes the use of bit recycling as the means to reduce this redundancy, extending the range of random binary sources that may benefit from a plurally parsable dictionary at the same time. We present a theoretical analysis that evaluates the performance of variable-to-fixed codes based on the Tunstall dictionary and ones based on plurally parsable dictionaries, using Savari's coding on the one hand and coding with bit recycling on the other hand.","PeriodicalId":426245,"journal":{"name":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128897259","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}
{"title":"Construction and decoding of generalized skew-evaluation codes","authors":"Siyu Liu, Felice Manganiello, F. Kschischang","doi":"10.1109/CWIT.2015.7255141","DOIUrl":"https://doi.org/10.1109/CWIT.2015.7255141","url":null,"abstract":"Skew polynomials are elements of a noncommutative ring that, in recent years, have found applications in coding theory and cryptography. Skew polynomials have a well-defined evaluation map. This map leads to the definition of a class of codes called Generalized Skew-Evaluation codes that contains Gabidulin codes as a special case as well as other related codes with additional desirable properties. A Berlekamp-Welch-type decoder for an important class of these codes can be constructed using Kötter interpolation in skew polynomial rings.","PeriodicalId":426245,"journal":{"name":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117003955","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}
{"title":"Single-source two-terminal multicast networks with overlapping demands over the binary erasure channel","authors":"Arghavan Modiri, S. Yousefi","doi":"10.1109/CWIT.2015.7255169","DOIUrl":"https://doi.org/10.1109/CWIT.2015.7255169","url":null,"abstract":"Wireless sensor networks (WSN) provide attractive solutions for data exchange in a variety of applications from military surveillance to medical and environmental monitoring. The commonality in all such applications is that the data collected in some nodes of the network is needed at some other nodes, for instance in a data collector node. The nodes are typically limited in terms of power, memory, and processing capability. In this work, we formulate a single-source two-terminal WSN subproblem and design efficient fountain-based transmission protocols aiming to minimize the total number of source transmissions.","PeriodicalId":426245,"journal":{"name":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131399400","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}
{"title":"Ocean current measurement using acoustic sensor network: ‘Challenges, simulation, deployement’","authors":"Samareh Attarsharghi, V. Mašek","doi":"10.1109/CWIT.2015.7255166","DOIUrl":"https://doi.org/10.1109/CWIT.2015.7255166","url":null,"abstract":"Underwater Acoustic Sensor Networks (UASNs) are increasingly attracting researchers' attention as they have a wide range of applications among which we can name oceanography and disaster prevention being the main focus of our research. In connection with the principal topics, in this paper, we review the most challenging issues of UASNs that have been discussed in recent publications. These include simulating the underwater environment and networks as well as practical issues and deployment concerns. After investigating the main subjects, we address open areas for research in this field.","PeriodicalId":426245,"journal":{"name":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128554666","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}
{"title":"Gaussian multiple-access relay channels with non-causal side information at the transmitters","authors":"Assadallah Sahebalam, S. Beheshti","doi":"10.1109/CWIT.2015.7255183","DOIUrl":"https://doi.org/10.1109/CWIT.2015.7255183","url":null,"abstract":"The multiple-access relay channel (MARC) and its Gaussian version are important models in cellular, ad hoc communication systems, and sensor networks and also, this channel is a comprehensive model which consist of two important channels: Relay Channel (RC) and Multiple Access Channel (MAC). In this paper, we study and analyse the two-user state-dependent discrete and memoryless MARC in which the independent states of channel are known non-causally only at the encoders. An achievable rate region by using binning and decode-and-forward (DF) schemes and an outer bound for this model are obtained. We also by using our results obtain an inner bound for two-user Gaussian MARC with identical non-causal side information. Our model includes discrete and continuous (Gaussian) multiple access channel rate region and relay channel rate with non-causal side information. Finally, we evaluate our bounds for Gaussian MARC numerically and illustrate the effect of interference power on bounds.","PeriodicalId":426245,"journal":{"name":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","volume":"15 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131488476","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}
{"title":"Adaptive block-length partitioned Viterbi algorithm","authors":"Mohamed Haroun, Sébastien Roy","doi":"10.1109/CWIT.2015.7255164","DOIUrl":"https://doi.org/10.1109/CWIT.2015.7255164","url":null,"abstract":"To improve wireless system performance using co-channel signals and multiple receiver antennas, we develop a new adaptive block-length partitioned Viterbi algorithm (ABL-PVA) receiver for the MIMO frequency-selective fading channel. The classic PVA has a trellis detector for each transmit antenna and feeds back tentative decisions between these trellis detectors which can cause error propagation. The proposed receiver selects a trace-back length based on an instantaneous SNR level to optimize its performance. Computer simulation results indicate that when compared with PVA, the proposed receiver improves the BER performance without any complexity increase.","PeriodicalId":426245,"journal":{"name":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128679565","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}
M. Khaled, P. Fortier, M. Ammari, Mohamed Hai Taieb
{"title":"Capacity of the millimeter wave underground mine channel","authors":"M. Khaled, P. Fortier, M. Ammari, Mohamed Hai Taieb","doi":"10.1109/CWIT.2015.7255167","DOIUrl":"https://doi.org/10.1109/CWIT.2015.7255167","url":null,"abstract":"In this paper, we are interested in the capacity computations of an underground mine channel in the millimeter wave band. A model of the channel based on the power delay profile (PDP) between transmitter and receiver is obtained from the channel measurements in the CANMET mine at the 70 m level. The channel model is examined under two scenarios, namely horn-horn and horn-omni antennas, in a line of sight (LOS) situation. The channel model is used to compute the capacity for two polarizations, namely HH and VV. The channel capacity of the model is compared with the channel capacity computed using the frequency response. The results show the pertinence of the model for the two measurement scenarios and for both polarizations. Results show that the differences in antennas and their polarisation play an important role in the design of millimeter wave radio systems.","PeriodicalId":426245,"journal":{"name":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128804902","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}
{"title":"Enhancing secrecy of the Gaussian wiretap channel using rate compatible LDPC codes with error amplification","authors":"M. H. Taieb, J. Chouinard","doi":"10.1109/CWIT.2015.7255148","DOIUrl":"https://doi.org/10.1109/CWIT.2015.7255148","url":null,"abstract":"This paper proposes a physical layer coding scheme to secure communications over the Gaussian wiretap channel. This scheme is based on non-systematic Rate-Compatible Low-Density-Parity-Check (RC-LDPC) codes. The rate compatibility involves the presence of a feedback channel that allows transmission at the minimum rate required for legitimate successful decoding. Whenever the decoding is unsuccessful, a feedback request is sent back by the intended receiver, favoring the legitimate recipient over an unauthorized receiver (eavesdropper). The proposed coding scheme uses a finer granularity rate compatible code to increase the eavesdropper decoding failure rate. However, finer granularity also implies longer decoding delays. For this reason, a rate estimator based on the wiretap channel capacity is used. For this purpose, a set of packets is sent at once and then successive small packets are added subsequently as needed until successful decoding by the legitimate receiver is achieved. Since the secrecy level can be assessed through the bit error rate (BER) at the unintended receiver, an error amplifier is proposed to convert the loss of only few packets in the wiretap channel into much higher BERs for the eavesdroppers. Simulation results show the secrecy improvements obtained in terms of error amplification with the proposed coding scheme. Negative security gaps can also be achieved at the physical layer.","PeriodicalId":426245,"journal":{"name":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130063806","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}
{"title":"Optimal CDMA signatures for correlated sources with a multi-antenna receiver","authors":"C. Illangakoon, P. Yahampath","doi":"10.1109/CWIT.2015.7255173","DOIUrl":"https://doi.org/10.1109/CWIT.2015.7255173","url":null,"abstract":"This paper presents an approach to optimizing CDMA signatures for multiple correlated sources in a sensor network when the common receiver is equipped with multiple antennas. An algorithm for determining optimal CDMA signatures under individual transmitter power constrains is presented. The numerical results show that the optimum signatures outperform orthogonal signatures by exploiting the inter-source correlation and the channel state information. Furthermore, the results show that the optimum signatures are most effective when the product of the number of receiver antennas and the bandwidth expansion is equal to the number of sources.","PeriodicalId":426245,"journal":{"name":"2015 IEEE 14th Canadian Workshop on Information Theory (CWIT)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122669514","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}