Pub Date : 2004-06-27DOI: 10.1109/ISIT.2004.1365552
C. Bi, J. Hui, L. Bodenheimer, Holger Spielberg
In this paper, a novel method is proposed to do turbo coding for pulse (pattern) position modulation, for ultra wideband radio system. Such systems maps multiple PPM slot detections into the probabilities of those bits to be "1", then turbo decoding can be done. The noise model in this coding scheme and the discrete interference model to replace the AWGN model to improve the coding performance are discussed.
{"title":"Embedded turbo coding in pattern position modulation for ultra wideband radio systems","authors":"C. Bi, J. Hui, L. Bodenheimer, Holger Spielberg","doi":"10.1109/ISIT.2004.1365552","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365552","url":null,"abstract":"In this paper, a novel method is proposed to do turbo coding for pulse (pattern) position modulation, for ultra wideband radio system. Such systems maps multiple PPM slot detections into the probabilities of those bits to be \"1\", then turbo decoding can be done. The noise model in this coding scheme and the discrete interference model to replace the AWGN model to improve the coding performance are discussed.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126554478","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 : 2004-06-27DOI: 10.1109/ISIT.2004.1365223
Genyuan Wang, X. Xia
An optimization of cyclotomic lattices based diagonal/single-layer space-time block codes is discussed. The concrete full diversity cyclotomic generating matrices are used to generalize the lattices and also studies the optimality in the sense that for a fixed diversity product and thus the transmission signal power is minimized.
{"title":"On optimal cyclotomic lattices and diagonal-single-layer space-time block codes","authors":"Genyuan Wang, X. Xia","doi":"10.1109/ISIT.2004.1365223","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365223","url":null,"abstract":"An optimization of cyclotomic lattices based diagonal/single-layer space-time block codes is discussed. The concrete full diversity cyclotomic generating matrices are used to generalize the lattices and also studies the optimality in the sense that for a fixed diversity product and thus the transmission signal power is minimized.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132459879","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 : 2004-06-27DOI: 10.1109/ISIT.2004.1365325
D. Hoesli, A. Lapidoth
For a MIMO Ricean fading channel with perfect side information at the receiver we derive an analytic upper bound on the difference between capacity and the mutual information that is induced by an isotropic Gaussian input. We show that if the number of receiver antennas is at least equal to the number of transmitter antennas, then, as the signal-to-noise ratio tends to infinity, such an input is asymptotically optimal. But otherwise such an isotropic input might be suboptimal. We also propose an iterative algorithm to calculate the optimal power allocation.
{"title":"How good is an isotropic gaussian input on a MIMO Ricean channel?","authors":"D. Hoesli, A. Lapidoth","doi":"10.1109/ISIT.2004.1365325","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365325","url":null,"abstract":"For a MIMO Ricean fading channel with perfect side information at the receiver we derive an analytic upper bound on the difference between capacity and the mutual information that is induced by an isotropic Gaussian input. We show that if the number of receiver antennas is at least equal to the number of transmitter antennas, then, as the signal-to-noise ratio tends to infinity, such an input is asymptotically optimal. But otherwise such an isotropic input might be suboptimal. We also propose an iterative algorithm to calculate the optimal power allocation.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133996688","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 : 2004-06-27DOI: 10.1109/ISIT.2004.1365314
R. Smarandache, P. Vontobel
In the past, several authors have considered quasicyclic LDPC codes whose circulant matrices in the parity-check matrix are cyclically shifted identity matrices. By composing a parity-check matrix not only with such matrices but also with sums of two cyclically shifted identity matrices and with zero matrices, one can increase the minimum distance while keeping the same regularity. Specifically, whereas for (3, 4)-regular codes in the first class the best minimum distance is 24, the best minimum distance in the second class is 32. We give examples of codes that achieve these bounds.
{"title":"On regular quasicyclic LDPC codes from binomials","authors":"R. Smarandache, P. Vontobel","doi":"10.1109/ISIT.2004.1365314","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365314","url":null,"abstract":"In the past, several authors have considered quasicyclic LDPC codes whose circulant matrices in the parity-check matrix are cyclically shifted identity matrices. By composing a parity-check matrix not only with such matrices but also with sums of two cyclically shifted identity matrices and with zero matrices, one can increase the minimum distance while keeping the same regularity. Specifically, whereas for (3, 4)-regular codes in the first class the best minimum distance is 24, the best minimum distance in the second class is 32. We give examples of codes that achieve these bounds.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131802346","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 : 2004-06-27DOI: 10.1109/ISIT.2004.1365437
R. Gowaikar, A. Dana, R. Palanki, B. Hassibi, M. Effros
We determine the capacity of a certain class of wireless erasure relay networks. We first find a suitable definition for the "cut-capacity" of erasure networks with broadcast at transmission and no interference at reception. With this definition, a maxflow mincut capacity result holds for the capacity of these networks.
{"title":"On the capacity of wireless erasure networks","authors":"R. Gowaikar, A. Dana, R. Palanki, B. Hassibi, M. Effros","doi":"10.1109/ISIT.2004.1365437","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365437","url":null,"abstract":"We determine the capacity of a certain class of wireless erasure relay networks. We first find a suitable definition for the \"cut-capacity\" of erasure networks with broadcast at transmission and no interference at reception. With this definition, a maxflow mincut capacity result holds for the capacity of these networks.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130919764","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 : 2004-06-27DOI: 10.1109/ISIT.2004.1365282
M. Sharif, B. Hassibi
We consider a single-antenna broadcast fading channel with n backlogged users. Assuming the transmission is packet-based, we define the delay as the minimum number of channel uses that guarantees all n users successfully receive m packets. A delay optimal strategy such as round-robin achieves the delay of mn. For the optimal throughput strategy (i.e. transmitting to the user with the best channel condition at each channel use), we derive the mean and variance of the delay for any m and n. For large n, it is proved that the expected delay in receiving the first packet in all users scales like n log n as opposed to n for the round-robin scheduling.
{"title":"Delay guarantee versus throughput in broadcast fading channels","authors":"M. Sharif, B. Hassibi","doi":"10.1109/ISIT.2004.1365282","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365282","url":null,"abstract":"We consider a single-antenna broadcast fading channel with n backlogged users. Assuming the transmission is packet-based, we define the delay as the minimum number of channel uses that guarantees all n users successfully receive m packets. A delay optimal strategy such as round-robin achieves the delay of mn. For the optimal throughput strategy (i.e. transmitting to the user with the best channel condition at each channel use), we derive the mean and variance of the delay for any m and n. For large n, it is proved that the expected delay in receiving the first packet in all users scales like n log n as opposed to n for the round-robin scheduling.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130977351","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 : 2004-06-27DOI: 10.1109/ISIT.2004.1365353
A. Vosoughi, A. Scaglione
Adopting affine precoding as the transmission strategy, we investigate the effect of channel estimation error on the mutual information between the input and the output of a frequency selective fading MIMO channel. For Bayesian receivers which perform joint channel and symbol estimation there is asymptotically no loss in information rate. In contrast, for the receivers which obtain the channel estimation and use it to estimate the symbols, the lower bound on information rate is maximized by enforcing a form of orthogonality between symbols and training
{"title":"On the effect of channel estimation error with superimposed training upon information rates","authors":"A. Vosoughi, A. Scaglione","doi":"10.1109/ISIT.2004.1365353","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365353","url":null,"abstract":"Adopting affine precoding as the transmission strategy, we investigate the effect of channel estimation error on the mutual information between the input and the output of a frequency selective fading MIMO channel. For Bayesian receivers which perform joint channel and symbol estimation there is asymptotically no loss in information rate. In contrast, for the receivers which obtain the channel estimation and use it to estimate the symbols, the lower bound on information rate is maximized by enforcing a form of orthogonality between symbols and training","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133602735","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 : 2004-06-27DOI: 10.1109/ISIT.2004.1365175
M. Christandl, R. Renner
This paper introduces the public Eve scenario and shows that the secret key rate in this scenario is bounded by the intrinsic information. This elucidates previous results and gives new insights in the gap between formation and extraction of secret information. Intrinsic information, in its function as an upper bound on the secret key rate, is generalized to secret key agreement from arbitrary tripartite quantum states.
{"title":"On intrinsic information","authors":"M. Christandl, R. Renner","doi":"10.1109/ISIT.2004.1365175","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365175","url":null,"abstract":"This paper introduces the public Eve scenario and shows that the secret key rate in this scenario is bounded by the intrinsic information. This elucidates previous results and gives new insights in the gap between formation and extraction of secret information. Intrinsic information, in its function as an upper bound on the secret key rate, is generalized to secret key agreement from arbitrary tripartite quantum states.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132093065","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 : 2004-06-27DOI: 10.1109/ISIT.2004.1365163
V. Shashidhar, B. Rajan, B. Sethuraman
This work presents the construction of STBCs, using crossed-product algebras, for arbitrary number of transmit antennas over an a priori specified signal set. It obtains a condition under which these STBCs from arbitrary crossed-product algebras are information-lossless.
{"title":"Information-lossless STBCs from crossed-product algebras","authors":"V. Shashidhar, B. Rajan, B. Sethuraman","doi":"10.1109/ISIT.2004.1365163","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365163","url":null,"abstract":"This work presents the construction of STBCs, using crossed-product algebras, for arbitrary number of transmit antennas over an a priori specified signal set. It obtains a condition under which these STBCs from arbitrary crossed-product algebras are information-lossless.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132385668","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 : 2004-06-27DOI: 10.1109/ISIT.2004.1365192
Jun Shi, R. Wesel
The rotationally invariant space time constellation (RISTC) is defined. Both linear and affine constellations are studied. The RISTC is shown to be generalization of space time codes from the orthogonal design. A space time constellation is said rotationally invariant if for any pair in the set, the squared Euclidean distance is independent of the eigenvectors.
{"title":"Rotationally invariant space time constellations","authors":"Jun Shi, R. Wesel","doi":"10.1109/ISIT.2004.1365192","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365192","url":null,"abstract":"The rotationally invariant space time constellation (RISTC) is defined. Both linear and affine constellations are studied. The RISTC is shown to be generalization of space time codes from the orthogonal design. A space time constellation is said rotationally invariant if for any pair in the set, the squared Euclidean distance is independent of the eigenvectors.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128885073","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
扫码关注我们
求助内容：
应助结果提醒方式：