Young-Sik Kim, Jiwoong Jang, Sang-Hyo Kim, Jong-Seon No
{"title":"New construction of quaternary sequences with ideal autocorrelation from Legendre sequences","authors":"Young-Sik Kim, Jiwoong Jang, Sang-Hyo Kim, Jong-Seon No","doi":"10.1109/ISIT.2009.5205767","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205767","url":null,"abstract":"In this paper, for an odd prime p, new quaternary sequences of even period 2p with ideal autocorrelation property are constructed using the Legendre sequences of period p. The distribution of autocorrelation function of the proposed quaternary sequences is also derived.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114634966","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":"Z-connectable complete complementary codes and its application in CDMA systems","authors":"Chenggao Han, T. Hashimoto","doi":"10.1109/ISIT.2009.5205752","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205752","url":null,"abstract":"A code-division multiple access (CDMA) communication system achieves the maximum spectral efficiency over multipath fading channels if employed spreading sequences have ideal correlations, i.e., the ideal auto-correlation that are zero except for zero shift and the ideal cross-correlations that are zero for all shifts. Unfortunately, such sequences are known non-existent and, Suehiro and Hatori proposed a sequence family with ideal correlation sum called the complete complementary code (CCC). For (quasi-) synchronous CDMA systems, the ideal correlation sum of CCC provides an inter-channel interference (ICI)-free communication and CCC based CDMA (CCC-CDMA) improves spectral efficiency significantly. In previous work, we have proposed a general and systematic construction of the optimal CCC. However, in special cases, the proposed construction results in CCCs with extra interesting properties. In this paper, we propose a new type of CCC called the Z-connectable CCC (Z-CCC), which gives a sequence set with zero correlation zone (ZCZ) by connecting codes in its complementary codes. We also present two Z-CCCs which consist of rows of the discrete Fourier transform (DFT) and Hadamard matrices. Due to Z-CCC provides the guard-part reduced sub-packet structure, Z-CCC based CDMA (Z-CCC-CDMA) realizes higher spectral efficiency than the traditional CCC-CDMA and, intimate relationships of the present Z-CCCs and the DFT matrix or Hadamard matrix allows low implementation complexity.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114777061","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":"Capacity of relay channels with ISI and colored Gaussian noise","authors":"Chiranjib Choudhuri, U. Mitra","doi":"10.1109/ISIT.2009.5205400","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205400","url":null,"abstract":"The capacity of a degraded relay channel with inter-symbol interference and additive colored Gaussian noise is examined under an input power constraint. Using the classical methodology, a related channel and signal model is developed - the circular degraded relay channel - the capacity of which is shown to be equivalent to that of the channel of interest in the limit of infinite block length. The capacity of circular relay channel is, in turn, determined by the decomposition into parallel degraded relay channels whose individual capacities are given by prior results. Two case studies based on the degraded relay channel with memory and white noise are examined: Common transmission bandwidths on each link and different effective transmission bandwidth over each link.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114792548","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}
Milad Sefidgaran, Bahareh Akhbari, Y. Mohsenzadeh, M. Aref
{"title":"Reliable source transmission over relay networks with Side Information","authors":"Milad Sefidgaran, Bahareh Akhbari, Y. Mohsenzadeh, M. Aref","doi":"10.1109/ISIT.2009.5205672","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205672","url":null,"abstract":"In this paper, we consider reliable transmission of a discrete memoryless source over multi-relay networks with correlated Side Information (SI) available at the relay nodes and the final receiver. We obtain a necessary condition for reliable source transmission over a multi-terminal network with SI, which results in a necessary condition for a multi-relay network with SI, as a special case. We also propose a separate source-channel coding scheme, and based on it, a sufficient condition for a multi-relay network with SI is derived. Based on a partitioning method and the nature of a degraded relay network, we propose another coding scheme which results in a sufficient condition for a degraded relay network with SI. We show that these proposed schemes which are based on operational separation, achieve the same rates as the joint source-channel codes and these sufficient conditions are indeed necessary conditions for the degraded relay networks with degraded SI.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114826489","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":"Selective Mapping for channel inversion precoding in multiple-antenna broadcast systems","authors":"A. Mobasher, M. Maddah-ali, A. Khandani","doi":"10.1109/ISIT.2009.5205772","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205772","url":null,"abstract":"In this paper, a new Selective Mapping (SLM) technique is introduced for a Multiple-Input Multiple-Output (MIMO) broadcast (or MIMO point-to-point) system with channel inversion. We present a unified framework which links the problem of minimizing the average transmit energy from the constellation point of view, to the sum-rate maximization problem from the capacity viewpoint. First, we consider the point-to-point setup and derive the average transmit energy that can asymptotically be achieved by the proposed SLM technique. It is established that SLM achieves the minimum theoretical average transmit energy achievable by constellation shaping. Then, using the same idea, the average transmit energy in a broadcast system is derived and the relation between this value and the transmission rate is established. Finally, it is shown that the proposed SLM method can achieve the sum-capacity of the MIMO broadcast (or capacity of a MIMO point-to-point) channel at high SNR values.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128066951","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}
Stefan Ruzika, A. Tanatmis, F. Kienle, H. Hamacher, N. Wehn, Mayur Punekar
{"title":"Valid inequalities for binary linear codes","authors":"Stefan Ruzika, A. Tanatmis, F. Kienle, H. Hamacher, N. Wehn, Mayur Punekar","doi":"10.1109/ISIT.2009.5205846","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205846","url":null,"abstract":"We study an integer programming (IP) based separation approach to find the maximum likelihood (ML) codeword for binary linear codes. An algorithm introduced in Tanatmis et al. is extended and improved with respect to decoding performance without increasing the worst case complexity. This is demonstrated on the LDPC and the BCH code classes. Moreover, we propose an integer programming formulation to calculate the minimum distance of a binary linear code. We exemplarily compute the minimum distance of the (204, 102) LDPC code and the (576, 288) WIMAX code. Using the minimum distance of a code, a new class of valid inequalities is introduced.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125636249","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":"Coding stimulus information with cooperative neural populations","authors":"M. Aghagolzadeh, S. Eldawlatly, K. Oweiss","doi":"10.1109/ISIT.2009.5205813","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205813","url":null,"abstract":"Understanding the mechanism underlying distributed neural coding is a fundamental goal in computational neuroscience. With the ability to simultaneously observe the activity of large networks of neurons in response to external stimuli, a natural question arises: how the outside world is represented in the collective activity of these neurons? In this work, we provide an information theoretic approach for determining the role of cooperation among neurons in encoding external stimuli. Specifically, we show that statistical independence between neuronal outputs may not provide the best coding strategy when these outputs depend on the history of other neuronal constituents in the network. Rather, cooperation among neurons can provide a near optimal and lossless coding strategy under specific constraints governing their network structure. Using a statistical learning model, we demonstrate the performance of the proposed approach in decoding a motor task with both discrete targets and continuous trajectory using spike trains from a small subset of a large network. We demonstrate its superiority in minimizing the decoding error compared to a statistically independent model and to other classical decoders reported in the literature.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"145 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115908977","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":"New QAM Golay complementary pairs with unequal sequence power","authors":"Ying Li, Yen-Wen Huang","doi":"10.1109/ISIT.2009.5205751","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205751","url":null,"abstract":"A collection of new length four 16-QAM Golay complementary pairs are presented. Most of the new pairs have pairing sequences with unequal sequence power. These pairs are variations of 13 basic pairs, including ([A A A A], [A B −B −A]), where A is any complex number and B= (1+2j)A. Note that the constant sequence [A A A A] was considered not to be a Golay sequence when PSK alphabets are employed. There are 1440 length four 16-QAM new Golay sequences and 11264 new Golay pairs associated with the 13 basic pairs, in addition to the 2432 Golay sequences and 20480 Golay pairs constructed by Chong, et. al.. These new pairs can be used as primitive pairs to recursively generate longer new QAM Golay sequences and pairs. The construction of Golay pairs/sequences from variations of the basic pair ([A A A A], [A B −B −A]) is discussed. OFDM peak-to-mean envelope power ratio upper bounds for Golay sequences generated from that basic pair is 0.8 for sequence lengths n=2m, m≫1. Constructions and bounds for sequences/pairs associated with the other basic pairs can be derived in a similar manner.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115932007","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":"To code or not to code: Rate optimality in node-capacitated networks","authors":"S. Jaggi, Ziyu Shao, S. Li","doi":"10.1109/ISIT.2009.5205274","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205274","url":null,"abstract":"Node-capacitated networks are networks in which the capacity constraint is put on every node. They have recently attract attention as a good model for Peer-to-Peer (P2P) overlay networks. Existing work gives results on networks with constraints of node upload capacities. In this paper, we consider networks with constraints on both node upload and node download capacity. For such networks, we investigate the rate optimality of routing versus network coding. In general, network coding achieves a larger rate region than routing. However, for some important communication scenarios, routing achieves the same rate region as network coding.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"298 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132015688","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":"Information transfer by energy-efficient neurons","authors":"T. Berger, W. Levy","doi":"10.1109/ISIT.2009.5205816","DOIUrl":"https://doi.org/10.1109/ISIT.2009.5205816","url":null,"abstract":"We introduce and analyze a biologically motivated mathematical model of a neuron in primary cortex that we call neuron j, or just j. Our goal is to ascertain how j maximizes the ratio of the information it conveys to the energy it expends.","PeriodicalId":412925,"journal":{"name":"2009 IEEE International Symposium on Information Theory","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132207747","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}