Pub Date : 2006-03-22DOI: 10.1109/CISS.2006.286524
O. Moreno, S. Golomb
This paper presents a new optimal double periodical construction of optical orthogonal codes for multiple and two-dimensional double-periodic arrays with auto and cross correlation constraints. The new construction is optimal in the Johnson bound to obtain an optimal family of extended sonar type arrays with the property of double periodicity. The equivalence theorem used to obtain the signal pattern provides families of multiple target arrays.
{"title":"A new optimal double periodical construction of one target two-dimensional arrays","authors":"O. Moreno, S. Golomb","doi":"10.1109/CISS.2006.286524","DOIUrl":"https://doi.org/10.1109/CISS.2006.286524","url":null,"abstract":"This paper presents a new optimal double periodical construction of optical orthogonal codes for multiple and two-dimensional double-periodic arrays with auto and cross correlation constraints. The new construction is optimal in the Johnson bound to obtain an optimal family of extended sonar type arrays with the property of double periodicity. The equivalence theorem used to obtain the signal pattern provides families of multiple target arrays.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122708373","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-11-29DOI: 10.1109/GLOCOM.2004.1378064
T. Holliday, A. Goldsmith, P. Glynn, N. Bambos
This paper presents new distributed power and admission control algorithms for ad-hoc wireless networks in random channel environments. Previous work in this area has focused on distributed control for ad-hoc networks with fixed channels. We show that the algorithms resulting from such formulations do not accurately capture the dynamics of a time-varying channel. Hence, algorithms designed for fixed channels may perform quite poorly in random channels. In order to address these issues, this work proposes new algorithms, based on stochastic approximation, for optimal distributed power and admission control in random channels
{"title":"Distributed power and admission control for time-varying wireless networks","authors":"T. Holliday, A. Goldsmith, P. Glynn, N. Bambos","doi":"10.1109/GLOCOM.2004.1378064","DOIUrl":"https://doi.org/10.1109/GLOCOM.2004.1378064","url":null,"abstract":"This paper presents new distributed power and admission control algorithms for ad-hoc wireless networks in random channel environments. Previous work in this area has focused on distributed control for ad-hoc networks with fixed channels. We show that the algorithms resulting from such formulations do not accurately capture the dynamics of a time-varying channel. Hence, algorithms designed for fixed channels may perform quite poorly in random channels. In order to address these issues, this work proposes new algorithms, based on stochastic approximation, for optimal distributed power and admission control in random channels","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126158870","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-10-20DOI: 10.1109/ISIT.2004.1365558
H. Vikalo, B. Hassibi
Maximum-likelihood (ML) decoding of linear block codes on a symmetric channel is studied. Exact ML decoding is known to be computationally difficult. We propose an algorithm that finds the exact solution to the ML decoding problem by performing a depth-first search on a tree. The tree is designed from the code generator matrix and pruned based on the statistics of the channel noise. The complexity of the algorithm is a random variable. We characterize the complexity by means of its first moment, which for binary symmetric channels we find in closed-form. The obtained results indicate that the expected complexity of the algorithm is low over a wide range of system parameters.
{"title":"Statistical approach to ML decoding of linear block codes on symmetric channels","authors":"H. Vikalo, B. Hassibi","doi":"10.1109/ISIT.2004.1365558","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365558","url":null,"abstract":"Maximum-likelihood (ML) decoding of linear block codes on a symmetric channel is studied. Exact ML decoding is known to be computationally difficult. We propose an algorithm that finds the exact solution to the ML decoding problem by performing a depth-first search on a tree. The tree is designed from the code generator matrix and pruned based on the statistics of the channel noise. The complexity of the algorithm is a random variable. We characterize the complexity by means of its first moment, which for binary symmetric channels we find in closed-form. The obtained results indicate that the expected complexity of the algorithm is low over a wide range of system parameters.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115598745","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-10-20DOI: 10.1109/ISIT.2004.1365164
P. V. Kumar, Hsiao-feng Lu, S. Pawar
Bounds on the diversity-multiplexing gain tradeoff of a recent space-time block code construction are provided. This construction makes use of binary codes which is optimum in terms of the rate-diversity tradeoff. The code can be decoded using sphere decoding techniques.
{"title":"On the decoding and diversity-multiplexing gain tradeoff of a recent multilevel construction of space-time codes","authors":"P. V. Kumar, Hsiao-feng Lu, S. Pawar","doi":"10.1109/ISIT.2004.1365164","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365164","url":null,"abstract":"Bounds on the diversity-multiplexing gain tradeoff of a recent space-time block code construction are provided. This construction makes use of binary codes which is optimum in terms of the rate-diversity tradeoff. The code can be decoded using sphere decoding techniques.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117056902","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-10-20DOI: 10.1109/ISIT.2004.1365231
Hua Wang, P. Viswanath
In this paper, the meaning of duality in terms of the coding operations and the corresponding performance measures are examined. In this paper, operational duality to the channel and source coding problems with side information are extended. A class of deterministic maximal binning schemes is constructed. Each bin corresponds to a maximal channel code and the collection of the codewords in all the bins forms a maximal channel code. The construction of the binning scheme from the individual channel codes is greedy and provides an alternative proof of the coding theorem for the two side information problems.
{"title":"Fixed binning schemes: an operational duality between channel and source coding problems with side information","authors":"Hua Wang, P. Viswanath","doi":"10.1109/ISIT.2004.1365231","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365231","url":null,"abstract":"In this paper, the meaning of duality in terms of the coding operations and the corresponding performance measures are examined. In this paper, operational duality to the channel and source coding problems with side information are extended. A class of deterministic maximal binning schemes is constructed. Each bin corresponds to a maximal channel code and the collection of the codewords in all the bins forms a maximal channel code. The construction of the binning scheme from the individual channel codes is greedy and provides an alternative proof of the coding theorem for the two side information problems.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"211 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122807390","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-10-20DOI: 10.1109/ISIT.2004.1365200
E. Ordentlich, G. Seroussi, S. Verdú, K. Viswanathan, M. Weinberger, T. Weissman
This paper describes the channel decoding of systematically encoded unknown redundant sources. The redundancy of the data is known at the decoder and the channel decoder incorporates the statistics of the data to enhance the performance. The practical decoders are designed which takes the advantage of the source redundancy of systematically encoded for transmission over a discrete memoryless channel (DMC). The performance is achieved by operating discrete universal denoiser (DUDE) and the experiments involving Reed-Solomon codes show that DUDE-enhanced decoding is very effective at high rates.
{"title":"Channel decoding of systematically encoded unknown redundant sources","authors":"E. Ordentlich, G. Seroussi, S. Verdú, K. Viswanathan, M. Weinberger, T. Weissman","doi":"10.1109/ISIT.2004.1365200","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365200","url":null,"abstract":"This paper describes the channel decoding of systematically encoded unknown redundant sources. The redundancy of the data is known at the decoder and the channel decoder incorporates the statistics of the data to enhance the performance. The practical decoders are designed which takes the advantage of the source redundancy of systematically encoded for transmission over a discrete memoryless channel (DMC). The performance is achieved by operating discrete universal denoiser (DUDE) and the experiments involving Reed-Solomon codes show that DUDE-enhanced decoding is very effective at high rates.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124663198","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-10-20DOI: 10.1109/ISIT.2004.1365502
Joel B. Predd, S. Kulkarni, H. Poor
Motivated by sensor networks and traditional methods of statistical pattern recognition, a model for distributed learning is formulated. The model is in line with learning models considered in the context of Stone-type classifiers, but differs in the dependency structure of the sampling process; questions of universal consistency are addressed.
{"title":"Consistency in a model for distributed learning with specialists","authors":"Joel B. Predd, S. Kulkarni, H. Poor","doi":"10.1109/ISIT.2004.1365502","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365502","url":null,"abstract":"Motivated by sensor networks and traditional methods of statistical pattern recognition, a model for distributed learning is formulated. The model is in line with learning models considered in the context of Stone-type classifiers, but differs in the dependency structure of the sampling process; questions of universal consistency are addressed.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"376 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116325109","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-10-20DOI: 10.1109/ISIT.2004.1365285
R. Berry
In a wireless system with stochastically arriving traffic, scheduling the amount of data transmitted at any time is a basic technique for improving the energy efficiency. A discrete-time model for transmission scheduling over a fading channel is considered in this paper. The arrived data is placed into a transmission buffer, once the data is removed after the buffer; it is transmitted over the fading channel. The channel is modeled as a block-fading channel with Gaussian noise. For this model the optimal trade-off between the average queueing delay and the long-term average power was characterized in the asymptotic regime of large delays. The average power decreases as the average delay increases at the optimal rate. This rate can be achieved by a sequence of policies on the buffer occupancy via a simple threshold rule.
{"title":"Order optimal energy efficient transmission policies in the small delay regime","authors":"R. Berry","doi":"10.1109/ISIT.2004.1365285","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365285","url":null,"abstract":"In a wireless system with stochastically arriving traffic, scheduling the amount of data transmitted at any time is a basic technique for improving the energy efficiency. A discrete-time model for transmission scheduling over a fading channel is considered in this paper. The arrived data is placed into a transmission buffer, once the data is removed after the buffer; it is transmitted over the fading channel. The channel is modeled as a block-fading channel with Gaussian noise. For this model the optimal trade-off between the average queueing delay and the long-term average power was characterized in the asymptotic regime of large delays. The average power decreases as the average delay increases at the optimal rate. This rate can be achieved by a sequence of policies on the buffer occupancy via a simple threshold rule.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"1 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131492050","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-10-20DOI: 10.1109/ISIT.2004.1365169
R. Drost, A. Singer
This paper apply the factor graph framework to the techniques of linear equalization and decision feedback equalization to obtain a new class of low complexity equalization algorithms. The estimation of Gaussian processes has been studied in previous work, and the application of factor graphs to this problem is a recent extension. Here it uses a factor graph model for the specific estimation problem of equalization and use the sum-product algorithm to obtain the desired estimate. The reduced complexity message passing update equations are derived and detail the complexity of the resulting algorithms.
{"title":"Linear equalization via factor graphs","authors":"R. Drost, A. Singer","doi":"10.1109/ISIT.2004.1365169","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365169","url":null,"abstract":"This paper apply the factor graph framework to the techniques of linear equalization and decision feedback equalization to obtain a new class of low complexity equalization algorithms. The estimation of Gaussian processes has been studied in previous work, and the application of factor graphs to this problem is a recent extension. Here it uses a factor graph model for the specific estimation problem of equalization and use the sum-product algorithm to obtain the desired estimate. The reduced complexity message passing update equations are derived and detail the complexity of the resulting algorithms.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126869180","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-10-20DOI: 10.1109/ISIT.2004.1365580
M. C. Gursoy, H. Poor, S. Verdú
In this paper, the capacity and spectral efficiency of peak power limited Rician block-fading channels when neither the receiver nor the transmitter knows the fading coefficients is studied. The capacity-achieving input amplitude distribution of the average power limited memoryless unknown Rayleigh fading channel is discrete with a finite number of mass points is proved. The spectral-efficiency and the bit energy tradeoff in the low power regime is studied.
{"title":"Spectral efficiency of peak power limited Rician block-fading channels","authors":"M. C. Gursoy, H. Poor, S. Verdú","doi":"10.1109/ISIT.2004.1365580","DOIUrl":"https://doi.org/10.1109/ISIT.2004.1365580","url":null,"abstract":"In this paper, the capacity and spectral efficiency of peak power limited Rician block-fading channels when neither the receiver nor the transmitter knows the fading coefficients is studied. The capacity-achieving input amplitude distribution of the average power limited memoryless unknown Rayleigh fading channel is discrete with a finite number of mass points is proved. The spectral-efficiency and the bit energy tradeoff in the low power regime is studied.","PeriodicalId":269907,"journal":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2004-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122929153","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
扫码关注我们
求助内容：
应助结果提醒方式：