发布求助
文献互助 智能选刊 最新文献

2007 41st Annual Conference on Information Sciences and Systems最新文献

筛选
英文 中文
On The Pascal Transform and Threshold Selection 帕斯卡变换与阈值选择
2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298362
T. Goodman, M. Aburdene
{"title":"On The Pascal Transform and Threshold Selection","authors":"T. Goodman, M. Aburdene","doi":"10.1109/CISS.2007.4298362","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298362","url":null,"abstract":"The Pascal transform has been introduced recently and it has applications in signal processing and image processing. Applications of the Pascal transform to edge or bump detection often require processing of noisy signals. Since noise can seriously distort the values of the signal transform coefficients, it is important to understand the effects of noise on the Pascal transform of a signal. We focus on evaluating the mean square of the transform coefficients of Gaussian noise and the magnitude of the transform coefficients of the noise. An analytical expression is found for mean square of the transform coefficients of zero mean Gaussian noise. Simulation results are presented for the magnitude of the Pascal transform coefficients of the noise from which models are developed for predicting the magnitude of the transform coefficients. We also present an approach for selecting a threshold to determine a bump using the Pascal transform.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128482133","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}
引用次数: 4
Universal Quadratic Lower Bounds on Source Coding Error Exponents 源编码误差指数的通用二次下界
2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298398
Cheng Chang, A. Sahai
{"title":"Universal Quadratic Lower Bounds on Source Coding Error Exponents","authors":"Cheng Chang, A. Sahai","doi":"10.1109/CISS.2007.4298398","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298398","url":null,"abstract":"We consider the problem of block-size selection to achieve a desired probability of error for universal source coding. While Baron, et al. (2004; 1973) studied this question for rates in the vicinity of entropy for known distributions using central-limit-theorem techniques, we are interested in all rates for unknown distributions and use error-exponent techniques. By adapting a technique of Gallager from the exercises of Gallager (1971), we derive a universal lower bound to the source-coding error exponent that depends only on the alphabet size and is quadratic in the gap to entropy.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128662797","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}
引用次数: 9
Estimating a Function from Noisy Sensor Data: A Factor Graph Approach 从噪声传感器数据估计函数:因子图方法
2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298413
J. Barros, M. Tüchler
{"title":"Estimating a Function from Noisy Sensor Data: A Factor Graph Approach","authors":"J. Barros, M. Tüchler","doi":"10.1109/CISS.2007.4298413","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298413","url":null,"abstract":"The combination of graphical models and belief propagation algorithms has found wide acceptance in the design of communication systems. We extend the general framework of joint source-channel decoding on graphs to account for estimation problems in which the goal is not to decode the entire data set but to estimate a function of the transmitted data. This problem is deemed relevant e.g. in the context of wireless sensor networks.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"260 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120956371","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}
引用次数: 0
Performance Evaluation of Quantized Feedback Beamforming in IEEE 802.11n Wireless Networks IEEE 802.11n无线网络量化反馈波束成形性能评价
2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298435
Xiantao Sun, L. Cimini, L. Greenstein, D. Chan, Brett Douglas
{"title":"Performance Evaluation of Quantized Feedback Beamforming in IEEE 802.11n Wireless Networks","authors":"Xiantao Sun, L. Cimini, L. Greenstein, D. Chan, Brett Douglas","doi":"10.1109/CISS.2007.4298435","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298435","url":null,"abstract":"In this paper, we study the quantized feedback beamforming techniques presented in the IEEE 802.11n joint proposal. Specifically, we compare three different quantized feedback schemes (channel state information matrix feedback, non-compressed steering matrix feedback, and compressed steering matrix feedback) and evaluate their relative merits in terms of bit error ratio (BER) degradation and overhead. Our numerical analysis and simulation results show that both non-compressed steering matrix feedback and compressed steering matrix feedback are good candidates that provide significant diversity gain with moderate complexity and small feedback overhead.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121323062","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}
引用次数: 4
Towards Optimal Design of Data Hiding Algorithms Against Nonparametric Adversary Models 面向非参数对手模型的数据隐藏算法优化设计
2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298440
A. Cárdenas, G. Moustakides, J. Baras
{"title":"Towards Optimal Design of Data Hiding Algorithms Against Nonparametric Adversary Models","authors":"A. Cárdenas, G. Moustakides, J. Baras","doi":"10.1109/CISS.2007.4298440","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298440","url":null,"abstract":"This paper presents a novel zero-sum watermarking game between a detection algorithm and a data hiding adversary. Contrary to previous research, the detection algorithm and the adversary we consider are both nonparametric in a continuous signal space, and thus they have no externally imposed limitations on their allowed strategies except for some distortion constraints. We show that in this framework no deterministic detection algorithm is optimal. We then find optimal randomized detection algorithms for different distortion levels and introduce a new performance tradeoff between completeness and accuracy when a detection algorithm does not have enough evidence to make an accurate decision.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114323527","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}
引用次数: 1
A Game-Theoretic Analysis of Decode-and-Forward Cooperation in Rayleigh Fading Channels 瑞利衰落信道中译码转发合作的博弈论分析
2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298318
Yingda Chen, S. Kishore
{"title":"A Game-Theoretic Analysis of Decode-and-Forward Cooperation in Rayleigh Fading Channels","authors":"Yingda Chen, S. Kishore","doi":"10.1109/CISS.2007.4298318","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298318","url":null,"abstract":"A game-theoretic analysis of decode and forward cooperative communications is presented for Rayleigh fading channels. The channel is studied as a two-state Markov model and cooperation is modeled as a repeated game in which selfish user terminals seek to maximize their own payoff, a utility function that monotonically increases with signal-to-noise ratio. Nash equilibria are investigated for both convex and concave utility functions. Results show a mutually cooperative Nash Equilibrium can always be obtained when convex utility functions* are used and users care somewhat about future performance. Concave utility functions may not always support a mutually cooperative Nash Equilibrium, especially under adverse channel conditions. Examinations of two widely-applied concave utility functions, however, demonstrate that mutual cooperation is more likely when users place more value on future performance. Additionally, techniques that improve effective channel conditions, e.g., use of multiple transmit antennas, further encourage cooperation.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125985682","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}
引用次数: 6
Coherent Optical CDMA with low MAI 低MAI相干光CDMA
2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298390
A. Cooper, J. Khurgin, Shuangmei Xu, Jin-U. Kang
{"title":"Coherent Optical CDMA with low MAI","authors":"A. Cooper, J. Khurgin, Shuangmei Xu, Jin-U. Kang","doi":"10.1109/CISS.2007.4298390","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298390","url":null,"abstract":"A novel coherent optical code division multiple access (OCDMA) network based on phase and polarization diversity balanced reception of spectrally encoded optical pulses is proposed. Spectral efficiencies of 1 bps/Hz and beyond can be achieved by minimizing multiple access interference (MAI) and by cancelling beat noise. While the system achieves full capacity under bit synchronism, it also offers competitive performance at up to 25% of full capacity, even when completely asynchronous. Tree and ring network configurations can assure synchronization, making the proposed system robust in the presence of dispersion and phase noise.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"75 3-4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132062416","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}
引用次数: 0
Approach to Optimum Performance in Random Spreading CDMA by Linear-Complex LAS Detectors 线性复LAS检测器在随机扩频CDMA中的最优性能研究
2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298299
Yi Sun
{"title":"Approach to Optimum Performance in Random Spreading CDMA by Linear-Complex LAS Detectors","authors":"Yi Sun","doi":"10.1109/CISS.2007.4298299","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298299","url":null,"abstract":"In this paper, we first present a BER upper bound for the family of LAS detectors. Then the upper bound is applied to analyze the performance of local maximum likelihood (LML) detectors in large random spreading CDMA (LRS-CDMA) channels where user number A' and spreading gain N tend to infinity and KIN keeps a constant. The LRS-CDMA channels are shown to possess the LML characteristic. In the regime of K/N < 1/2 - 1/(4ln2) and Nsigma2 equal to a constant where sigma2 is the noise power, an LML point is almost surely a global maximum likelihood (GML) point and the asymptotic multiuser efficiency of all the LML detectors converges almost surely to one. Given a practical CDMA system with fixed finite K and N, we then propose to construct a quasi-LRS-CDMA channel where bits are extended by a factor of B and spread by unit-length BN-chip sequences and each user transmits B extended bits. Simulation results show that in the regime of BK > 1000, K/N < 1.0 and SNR ges 4 dB, while their average per-bit complexity is less than 0.79BK, the LAS detectors can achieve the BER indistinguishable from the large-system limit BER of the GML detector.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134535438","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}
引用次数: 1
Nonparametric Probability Density Estimation for Sensor Networks Using Quantized Measurements 基于量化测量的传感器网络非参数概率密度估计
2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298410
Aleksandar Dogandzic, Benhong Zhang
{"title":"Nonparametric Probability Density Estimation for Sensor Networks Using Quantized Measurements","authors":"Aleksandar Dogandzic, Benhong Zhang","doi":"10.1109/CISS.2007.4298410","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298410","url":null,"abstract":"We develop a nonparametric method for estimating the probability distribution function (pdf) describing the physical phenomenon measured by a sensor network. The measurements are collected by sensor-processor elements (nodes) deployed in the region of interest; the nodes quantize these measurements and transmit only one bit per observation to a fusion center. We model the measurement pdf as a Gaussian mixture and develop a Fisher scoring algorithm for computing the maximum likelihood (ML) estimates of the unknown mixture probabilities. We also estimate the number of mixture components as well as their means and standard deviation. Numerical simulations demonstrate the performance of the proposed method.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130978609","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}
引用次数: 9
Interference Mitigating in Wireless Networks Using Prior Knowledge 基于先验知识的无线网络干扰抑制
2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298388
Kejing Liu, S. Bohacek, J. Garcia-Frías
{"title":"Interference Mitigating in Wireless Networks Using Prior Knowledge","authors":"Kejing Liu, S. Bohacek, J. Garcia-Frías","doi":"10.1109/CISS.2007.4298388","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298388","url":null,"abstract":"We propose a framework to mitigate the interference in high data rate mobile wireless networking. Interference is a fundamental obstacle to achieve high data rates in wireless networking. However, a systematic approach to deal with this problem has not yet been addressed in the context of routing in multi-hop networks. In traditional decoding schemes, interference is assumed as additive white Gaussian noise (AWGN), even though in many occasions it is in fact correlated with previous available data. Thus, in order to optimize performance, it is necessary to exploit such correlation in the decoding process. This is done by interpreting the problem as one of transmission over multiple access channels with a priori information.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132819521","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}
引用次数: 2
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信