2014 Information Theory and Applications Workshop (ITA)最新文献

{"title":"A class of compression systems with model-free encoding","authors":"Ying-zong Huang, G. Wornell","doi":"10.1109/ITA.2014.6804206","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804206","url":null,"abstract":"Practical compression systems are constrained by their bit-stream standards, which define the source model together with the coding method used. We introduce a model-free coding architecture that separates the two aspects of compression and allows the design of potentially more powerful source models, as well as more flexible use of the compressed information stream. We show that this architecture is capable of producing competitive performance while supporting new use cases.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"26 11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132828427","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":"Virtual pilot signal for massive MIMO-OFDM systems","authors":"S. Park, J. Choi, J. Seol, B. Shim","doi":"10.1109/ITA.2014.6804285","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804285","url":null,"abstract":"A technology exploiting large number of antennas into the wireless transceiver, often called massive MIMO technology, has been received great attention in recent years. The benefits of this approach, however, can be realized only when the quality of estimated channel is ensured at both transmitter and receiver. In this paper, we propose a new channel estimation technique dealing with the pilot shortage in the massive MIMO systems. In a nutshell, we employ reliable data tones obtained from the iterative deteciton and decoding (IDD) as well as pilot signals in the estimation of channels. We show that the proposed method achieves substantial performance gain over conventional approaches employing pilot signals exclusively.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"375 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131935709","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":"Quickest anomaly detection: A case of active hypothesis testing","authors":"Kobi Cohen, Qing Zhao","doi":"10.1109/ITA.2014.6804268","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804268","url":null,"abstract":"The problem of quickest detection of an anomalous process among M processes is considered. At each time, a subset of the processes can be observed, and the observations follow two different distributions, depending on whether the process is normal or abnormal. The objective is a sequential search strategy that minimizes the expected detection time subject to an error probability constraint. This problem can be considered as a special case of active hypothesis testing first considered by Chernoff in 1959, where a randomized test was proposed and shown to be asymptotically optimal. For the special case considered in this paper, we show that a simple deterministic test achieves asymptotic optimality and offers better performance in the finite regime.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"264 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133250166","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":"On the diversity-multiplexing tradeoff of unconstrained MIMO fading channels","authors":"Y. Yona, M. Feder","doi":"10.1109/ITA.2014.6804261","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804261","url":null,"abstract":"In this work the optimal diversity-multiplexing tradeoff (DMT) is studied for the multiple-input multiple-output fading multiple-access channel with no power constraints (infinite constellations). For K users (K > 1), M transmit antennas for each user, and N receive antennas, infinite constellations in general and lattices in particular are shown to attain the optimal DMT of finite constellations for the case N ≥ (K + 1)M - 1, i.e. user limited regime. On the other hand for the case N <; (K + 1) M - 1 it is shown that infinite constellations can not attain the optimal DMT. This is in contrast to the point-to-point case where infinite constellations are DMT optimal for any M and N. In general, this work shows that when the network is heavily loaded, i.e. K > max (1, N - M + 1/ M), taking into account the shaping region in the decoding process plays a crucial role in pursuing the optimal DMT.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120964810","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":"Symmetric two-user MIMO BC with evolving feedback","authors":"Jinyuan Chen, P. Elia","doi":"10.1109/ITA.2014.6804277","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804277","url":null,"abstract":"Extending recent findings on the two-user MISO broadcast channel (BC) with imperfect and delayed channel state information at the transmitter (CSIT), the work here explores the performance of the two user MIMO BC, in the presence of feedback with evolving quality and timeliness. Under standard assumptions, and in the presence of M antennas at the transmitter and N antennas per receiver, the work derives the DoF region, which is optimal for a large range of current and delayed CSIT quality. This region concisely captures the effect of having predicted, current and delayed-CSIT, as well as concisely captures the effect of the quality of CSIT offered at any time, about any channel realization. In addition to the progress towards describing the limits of using such imperfect and delayed feedback in MIMO settings, the work offers different insights that include the fact that DoF optimality, in the presence of an increased number of receiving antennas, can be achieved with reduced quality feedback.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129389518","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":"Traffic management in random cellular networks","authors":"Kostas Stamatiou, M. Haenggi","doi":"10.1109/ITA.2014.6804282","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804282","url":null,"abstract":"We consider a cellular network where base stations are randomly deployed according to a Poisson point process and new jobs arrive in time and space according to a Poisson space-time point process, and are assigned to base stations according to different assignment schemes with/without base station cooperation. We derive “macroscopic” spatial averages of local base station performance metrics, such as traffic load, utilization factor, and delay, under different models on the service time distribution which include dependence on distance. Moreover, we determine and derive properties of the traffic capacity of the network, defined as the maximum spatio-temporal job density under a given constraint on the percentage of unstable base stations. The proposed model provides a baseline for the study of irregular cellular networks with bursty spatio-temporal data traffic.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129964618","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":"Spectrum pricing games with correlated bandwidth availabilities and demands","authors":"G. Kasbekar, S. Sarkar","doi":"10.1109/ITA.2014.6804274","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804274","url":null,"abstract":"We study price competition among primaries in a Cognitive Radio Network (CRN) with multiple primaries and secondaries located in a large region. In a given slot, some of the primaries have unused bandwidth, which they can potentially lease out to secondaries in exchange for a fee. There is uncertainty in whether a given primary has unused bandwidth in a given slot as well as in the number of secondaries that require bandwidth, with the above random quantities being mutually correlated. Each primary tries to attract secondaries by setting a lower price for its bandwidth than the other primaries. Radio spectrum has the distinctive feature that transmissions at neighboring locations on the same channel interfere with each other, whereas the same channel can be used at far-off locations without mutual interference. So in the above price competition scenario, each primary must jointly select a set of mutually non-interfering locations within the region (which corresponds to an independent set in the conflict graph representing the region) at which to offer bandwidth and the price at each location. In this paper, we analyze this price competition scenario as a game and seek a Nash Equilibrium (NE). We analyze the game at a single location as well as the game at multiple locations. We characterize NE for the cases of (i) symmetric bandwidth availability events of different primaries and (ii) asymmetric bandwidth availability events with a special correlation structure.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133044899","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":"Decomposition of large-scale MDPs for wireless scheduling with load- and channel-awareness","authors":"Huasen Wu, Xiaojun Lin, Xin Liu, Kun Tan, Yongguang Zhang","doi":"10.1109/ITA.2014.6804222","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804222","url":null,"abstract":"Scheduling delay-tolerant tasks based on both load-and channel-awareness can significantly reduce the peak demand in cellular networks. However, solving the optimal scheduling problem leads to a large-scale Markov Decision Process (MDP) with extremely high complexity. In this work, we propose a scalable and distributed approach to this problem, called Coordinated Scheduling (CoSchd). CoSchd decomposes the large-scale MDP problem into many individual MDP problems, each of which can be solved independently by each user under a limited amount of coordination signal from the BS. We show that CoSchd is close to optimal when the number of users becomes large. Further, we propose an online version of CoSchd that iteratively updates the scheduling policy based on online measurements. Simulation results demonstrate that exploiting load- and channel-awareness with CoSchd can effectively alleviate cellular network congestion.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134098212","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":"Burst or random error correction based on fire and BCH codes","authors":"Wei Zhou, Shu Lin, K. Abdel-Ghaffar","doi":"10.1109/ITA.2014.6804214","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804214","url":null,"abstract":"A class of codes obtained by combining Fire codes, which are burst correcting codes, with BCH codes, which are random error correcting codes, is proposed. The proposed codes are subcodes of both Fire codes and BCH codes. Lower bounds on the burst error-correcting capabilities of the proposed codes are derived. The codes can be used over a compound channel that causes burst errors or random errors.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128261086","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":"HRTF phase synthesis via sparse representation of anthropometric features","authors":"I. Tashev","doi":"10.1109/ITA.2014.6804239","DOIUrl":"https://doi.org/10.1109/ITA.2014.6804239","url":null,"abstract":"We propose a method for the synthesis of the phases of Head-Related Transfer Functions (HRTFs) using a sparse representation of anthropometric features. Our approach treats the HRTF synthesis problem as finding a sparse representation of the subjects anthropometric features w.r.t. the anthropometric features in the training set. The fundamental assumption is that the group delay of a given HRTF set can be described by thWe propose a method for the synthesis of the phases of Head-Related Transfer Functions (HRTFs) using a sparse representation of anthropometric features. Our approach treats the HRTF synthesis problem as finding a sparse representation of the subjects anthropometric features w.r.t. the anthropometric features in the training set. The fundamental assumption is that the group delay of a given HRTF set can be described by the same sparse combination as the anthropometric data. Thus, we learn a sparse vector that represents the subjects anthropometric features as a linear superposition of the anthropometric features of a small subset of subjects from the training data. Then, we apply the same sparse vector directly on the HRTF group delay data. For evaluation purpose we use a new dataset, containing both anthropometric features and HRTFs. We compare the proposed sparse representation based approach with ridge regression and with the data of a manikin (which was designed based on average anthropometric data), and we simulate the best and the worst possible classifiers to select one of the HRTFs from the dataset. For objective evaluation we use the mean square error of the group delay scaling factor. Experiments show that our sparse representation outperforms all other evaluated techniques, and that the synthesized HRTFs are almost as good as the best possible HRTF classifier.e same sparse combination as the anthropometric data. Thus, we learn a sparse vector that represents the subjects anthropometric features as a linear superposition of the anthropometric features of a small subset of subjects from the training data. Then, we apply the same sparse vector directly on the HRTF group delay data. For evaluation purpose we use a new dataset, containing both anthropometric features and HRTFs. We compare the proposed sparse representation based approach with ridge regression and with the data of a manikin (which was designed based on average anthropometric data), and we simulate the best and the worst possible classifiers to select one of the HRTFs from the dataset. For objective evaluation we use the mean square error of the group delay scaling factor. Experiments show that our sparse representation outperforms all other evaluated techniques, and that the synthesized HRTFs are almost as good as the best possible HRTF classifier.","PeriodicalId":338302,"journal":{"name":"2014 Information Theory and Applications Workshop (ITA)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115673045","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}