{"title":"Quaternary low correlation zone sequence set with flexible parameters","authors":"Jiwoong Jang, Jung-Soo Chung, Jong-Seon No","doi":"10.1109/ISIT.2008.4595496","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595496","url":null,"abstract":"In this paper, we proposed a new quaternary low correlation zone(LCZ) sequence set with parameters (2(2n - 1),M, L, 2). The new LCZ sequence set is constructed from the binary sequence with ideal autocorrelation of period 2n - 1. The proposed construction method corresponds to the generalization of the construction method of binary LCZ sequence set by using binary sequence with ideal autocorrelation proposed by Kim, Jang, No, and Chung [1].","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"139 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116615001","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":"High-rate, single-symbol decodable distributed STBCs for partially-coherent cooperative networks","authors":"D. Sreedhar, A. Chockalingam, B. Rajan","doi":"10.1109/ISIT.2008.4595449","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595449","url":null,"abstract":"Space-time block codes (STBCs) that are single-symbol decodable (SSD) in a co-located multiple antenna setting need not be SSD in a distributed cooperative communication setting. A relay network with N relays and a single source-destination pair is called a partially-coherent relay channel (PCRC) if the destination has perfect channel state information (CSI) of all the channels and the relays have only the phase information of the source-to-relay channels. In our earlier work, we had derived a set of necessary and sufficient conditions for a distributed STBC (DSTBC) to be SSD for a PCRC. Using these conditions, in this paper we show that the possibility of channel phase compensation operation at the relay nodes using partial CSI at the relays increases the possible rate of SSD DSTBCs from 2/N when the relays do not have CSI to 1/2 , which is independent of N. We also show that when a DSTBC is SSD for a PCRC, then arbitrary coordinate interleaving of the in-phase and quadrature-phase components of the variables does not disturb its SSD property. Using this property we are able to construct codes that are SSD and have higher rate than 2/N but giving full diversity only for signal constellations satisfying certain conditions.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121656939","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 minimization of entropy functionals under moment constraints","authors":"I. Csiszár, F. Matús","doi":"10.1109/ISIT.2008.4595360","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595360","url":null,"abstract":"Minimization problems for entropy-like integrals and Bregman distances subject to a finite number of moment constraints are addressed in a general setting. Analogues of the authors' previous results on information projections to families determined by linear constraints, and reverse information projections to exponential families, are established. No constraint qualification is assumed.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121673937","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 code reverse engineering problem","authors":"M. Cluzeau, J. Tillich","doi":"10.1109/ISIT.2008.4595063","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595063","url":null,"abstract":"This article deals with the problem of quantifying how many noisy codewords have to be eavesdropped in order to reverse engineer a code. The main result of this paper is a lower bound on this quantity and the proof that this number is logarithmic in the length for LDPC codes.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123880391","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 approximating the rate regions for lossy source coding with coded and uncoded side information","authors":"Wei-Hsin Gu, S. Jana, M. Effros","doi":"10.1109/ISIT.2008.4595373","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595373","url":null,"abstract":"We derive new algorithms for approximating the rate regions for a family of source coding problems that includes lossy source coding, lossy source coding with uncoded side information at the receiver (the Wyner-Ziv problem), and an achievability bound for lossy source coding with coded side in formation at the receiver. The new algorithms generalize a recent approximation algorithm by Go and Effros from lossless to lossy coding. In each case, prior information theoretic descriptions of the desired regions are available but difficult to evaluate for example sources due to their dependence on auxiliary random variables. Our algorithm builds a linear program whose solution is no less than the desired lower bound and no greater than (1 + isin) times that optimal value. These guarantees are met even when the optimal value is unknown. Here isin > 0 is a parameter chosen by the user; the algorithmic complexity grows as O(isin-M) as e approaches 0, where M > 4 is a constant that depends on the source coding problem and the alphabet sizes of the sources.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"73 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116675001","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":"Compressed sensing of approximately sparse signals","authors":"M. Stojnic, Weiyu Xu, B. Hassibi","doi":"10.1109/ISIT.2008.4595377","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595377","url":null,"abstract":"It is well known that compressed sensing problems reduce to solving large under-determined systems of equations. If we choose the compressed measurement matrix according to some appropriate distribution and the signal is sparse enough the l1 optimization can exactly recover the ideally sparse signal with overwhelming probability by Candes, E. and Tao, T., [2], [1]. In the current paper, we will consider the case of the so-called approximately sparse signals. These signals are a generalized version of the ideally sparse signals. Letting the zero valued components of the ideally sparse signals to take the values of certain small magnitude one can construct the approximately sparse signals. Using a different but simple proof technique we show that the claims similar to those of [2] and [1] related to the proportionality of the number of large components of the signals to the number of measurements, hold for approximately sparse signals as well. Furthermore, using the same technique we compute the explicit values of what this proportionality can be if the compressed measurement matrix A has a rotationally invariant distribution of the null-space. We also give the quantitative tradeoff between the signal sparsity and the recovery robustness of the l1 minimization. As it will turn out in an asymptotic case of the number of measurements the threshold result of [1] corresponds to a special case of our result.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125103312","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":"Diversity-multiplexing tradeoff optimal codes for OFDM-based asynchronous cooperative networks","authors":"Hsiao-feng Lu","doi":"10.1109/ISIT.2008.4595278","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595278","url":null,"abstract":"An asynchronous cooperative network where different time delays among nodes exist is considered in this paper. With OFDM modulation, it is first shown that the diversity-multiplexing tradeoff (DMT) achieved by the non-orthogonal selection decode-and-forward (NSDF) protocol for this network is the same as that for the synchronous one. In sharp contrast to the currently available complicated approximately universal \"matrix\" codes, a systematic construction of an extremely simple \"vector\" code is proposed. Given the transmitted codeword vector, the same codeword will be sent by all nodes during transmission, hence it will greatly reduce the complexities of relay deployment and decoding. Furthermore, it is proved that the proposed scheme achieves the optimal DMT of the NSDF protocol for this asynchronous cooperative network.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"389 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122816964","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":"Stochastic optimization approach for entropic image alignment","authors":"Waleed Mohamed, Ying Zhang, A. Hamza, N. Bouguila","doi":"10.1109/ISIT.2008.4595365","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595365","url":null,"abstract":"In this paper, we introduce an image alignment method by maximizing a Tsallis entopy-based divergence using a modified simultaneous perturbation stochastic approximation algorithm. Due to its convexity property, this divergence measure attains its maximum value when the conditional intensity probabilities between the reference image and the transformed target image are degenerate distributions. Experimental results are provided to show the registration accuracy of the proposed approach in comparison with existing entropic image alignment techniques.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"267 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122946104","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":"A spectrum-shaping perspective on cognitive radio: Uncoded primary transmission case","authors":"Wenyi Zhang, U. Mitra","doi":"10.1109/ISIT.2008.4595205","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595205","url":null,"abstract":"A new perspective on cognitive radio is presented for the case where the primary transmission is in uncoded analog form. The basic idea is to exploit signal-to-noise ratio margins in primary receivers, and to optimize cognitive signals by appropriately shaping their spectrum. It is shown that coexistence of primary and cognitive users is possible even without message-sharing, and furthermore, the cognitive user is no longer interference-limited, but can always transmit at its full available power thus achieving logarithmic growth of its information rate as its average power constraint grows large.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133699466","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":"Balanced multiple description scalar quantization","authors":"Ivana Radulovic, P. Frossard","doi":"10.1109/ISIT.2008.4595339","DOIUrl":"https://doi.org/10.1109/ISIT.2008.4595339","url":null,"abstract":"This paper tackles the problem of the generation of an arbitrary number of balanced descriptions with multiple description scalar quantization (MDSQ). We show how, with a very low complexity, we can vary the number of descriptions and the redundancy between them, in order to adapt to different channel characteristics. A comparison with state-of-the-art MDSQ schemes shows a better performance of our solution in terms of an average distortion at the receiver, which comes from the flexibility of our solution to better adapt to various lossy conditions.","PeriodicalId":194674,"journal":{"name":"2008 IEEE International Symposium on Information Theory","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133039795","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}