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

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

筛选
英文 中文
Sensor Location through Linear Programming with Arrival Angle Constraints 基于到达角约束的线性规划传感器定位
2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298378
C. Gentile, John Shiu
{"title":"Sensor Location through Linear Programming with Arrival Angle Constraints","authors":"C. Gentile, John Shiu","doi":"10.1109/CISS.2007.4298378","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298378","url":null,"abstract":"In previous work, we established a linear programming framework to determine sensor location from measured link distances between neighboring nodes in a network. Besides providing greater accuracy compared to other techniques, linear programs in particular suit large networks since they can be solved efficiently through distributed computing over the nodes without compromising the optimality of the objective function. This work extends our framework to determine sensor location from measured arrival angles instead. An extensive simulation suite substantiates the performance of the algorithm according to several network parameters, including noise up to 15% the maximum error; the proposed algorithm reduces the error up to 84% depending on the noise level.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"19 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":"115109970","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
Co-ordinate Interleaving over Parallel Gaussian Channels 平行高斯通道上的坐标交错
2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298370
K. V. Srinivas, K. Giridhar, R. D. Koilpillai
{"title":"Co-ordinate Interleaving over Parallel Gaussian Channels","authors":"K. V. Srinivas, K. Giridhar, R. D. Koilpillai","doi":"10.1109/CISS.2007.4298370","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298370","url":null,"abstract":"Co-ordinate interleaving (CI) along with rotated constellations improves diversity gain over fading channels. We propose employing CI over parallel Gaussian channels for improving the sum mutual information.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"70 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":"123282193","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
Estimation of block-fading channels with reduced-rank correlation matrix 基于降阶相关矩阵的块衰落信道估计
2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298355
O. Simeone, U. Spagnolini
{"title":"Estimation of block-fading channels with reduced-rank correlation matrix","authors":"O. Simeone, U. Spagnolini","doi":"10.1109/CISS.2007.4298355","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298355","url":null,"abstract":"In block-fading transmission, the discrete-time taps of time-varying channels can be generally modelled as a stationary random vector process with unknown and rank-deficient correlation matrix. The model applies to single/multi-antenna systems for single/multi-carrier modulation. In this paper, we propose a hybrid estimator that sequentially estimates the (deterministic) rank-deficient channel correlation matrix and the (random) channel taps. In addition, we derive a bound on the corresponding estimation error by adapting the Cramer Rao bound (CRB) to the case of mixed deterministic and random parameters (hybrid CRB). Finally, we assess that the proposed estimator is statistically efficient through comparison with the hybrid CRB.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"35 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":"129471192","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}
引用次数: 3
On the Stability of Hybrid ALOHA 杂交ALOHA的稳定性研究
2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298373
Huahui Wang, Tongtong Li
{"title":"On the Stability of Hybrid ALOHA","authors":"Huahui Wang, Tongtong Li","doi":"10.1109/CISS.2007.4298373","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298373","url":null,"abstract":"In this paper, we investigate the stability of a general N-user hybrid ALOHA system. Based on the multipacket reception model, the hybrid ALOHA protocol was proposed and the stability region in the case of N = 2 was presented. Utilizing the result for N = 2, in this paper, by means of stochastic dominance and mathematical induction, we find out the sufficient condition for the stability of the more general N > 2 system. In particular, the N = 3 case is closely studied. It is shown that the stability inner bound of the N = 3 system can be obtained by solving a general Riemann-Hilbert problem.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"53 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":"129662901","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
On the Achievable Secrecy Throughput of Block Fading Channels with No Channel State Information at Transmitter 发射机无信道状态信息的块衰落信道可实现保密吞吐量研究
2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298441
Xiaojun Tang, Ruoheng Liu, P. Spasojevic
{"title":"On the Achievable Secrecy Throughput of Block Fading Channels with No Channel State Information at Transmitter","authors":"Xiaojun Tang, Ruoheng Liu, P. Spasojevic","doi":"10.1109/CISS.2007.4298441","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298441","url":null,"abstract":"We study the block fading wire-tap channel, where a transmitter sends confidential messages to a legitimate receiver over a block fading channel in the presence of an eavesdropper, which listens to the transmission through another independent block fading channel. We assume that the transmitter has no channel state information (CSI) available from either the main channel or the eavesdropper channel. The transmitter uses an in advance given Wyner secrecy code (instead of adapting the code based on CSI). In this case, both reliability and perfect secrecy can be achieved only for a subset of channel states. We identify this channel state set and provide an achievable average secrecy throughput of the block fading wire-tap channel for given reliability and secrecy outage probabilities.","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":"128877277","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}
引用次数: 18
Optimal Progressive Error Recovery for Wireless Sensor Networks using Irregular LDPC Codes 基于不规则LDPC码的无线传感器网络最优渐进错误恢复
2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298305
Saad B. Qaisar, H. Radha
{"title":"Optimal Progressive Error Recovery for Wireless Sensor Networks using Irregular LDPC Codes","authors":"Saad B. Qaisar, H. Radha","doi":"10.1109/CISS.2007.4298305","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298305","url":null,"abstract":"We study the problem of providing reliable data transmission in energy constrained wireless sensor networks (WSNs). Low rate channel coding can increase reliability and eliminate the need of costly retransmissions for sensor data. However, low rate channel coding on end to end basis puts a considerable burden in terms of transmit energy on resource constrained sensor nodes. We propose a scheme that progressively provides error resilience as information reaches the final destination. Precisely, we present a novel framework for processing within the network (in-network) using irregular low density parity check (LDPC) codes for channel coding, in which nodes progressively decode the information at intermediate nodes. We not only present the in-network processing setup, but also an optimal progressive error recovery algorithm (OPERA) that optimally maps the decoding iterations to attain maximum throughput at the destination node. We use density evolution algorithm for belief propagation decoding of LDPC codes to cast the optimization problem and use dynamic programming to reach the solution. We compare the performance of our scheme with end to end channel coding and establish the efficiency of proposed solution for a given energy budget. Finally, we give a comparison between our scheme and random iteration assignment for decoding at intermediate nodes, and show that our scheme performs considerably better.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"15 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":"128284014","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}
引用次数: 14
Belief Propagation Based Multihead Multitrack Detection over Conventional and Bit-Patterned Media Storage Systems 基于信念传播的传统和位模式媒体存储系统多头多道检测
2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298276
Jun Hu, T. Duman, E. Kurtas, M. F. Erden
{"title":"Belief Propagation Based Multihead Multitrack Detection over Conventional and Bit-Patterned Media Storage Systems","authors":"Jun Hu, T. Duman, E. Kurtas, M. F. Erden","doi":"10.1109/CISS.2007.4298276","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298276","url":null,"abstract":"We propose a low complexity detection technique for multihead multitrack recording systems. By exploiting the sparseness of the two dimensional (2-D) partial response channel, we start with the development of an algorithm which performs belief propagation (BP) over the corresponding factor graph. We consider the BP-based detector not only for the partial response channel, but also for the more practical conventional media and bit-patterned media storage systems, with and without media noise. Compared to the maximum likelihood detector which has a prohibitively high complexity that is exponential with both the number of tracks and the number of ISI taps, the proposed detector has a much lower complexity and a fast parallel structure which come at a small performance penalty.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"142 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":"116594766","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
Multiuser Diversity in Wireless Networks: A Diversity-Multiplexing Perspective 无线网络中的多用户分集:分集-多路复用的视角
2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298340
K. Josiam, D. Rajan
{"title":"Multiuser Diversity in Wireless Networks: A Diversity-Multiplexing Perspective","authors":"K. Josiam, D. Rajan","doi":"10.1109/CISS.2007.4298340","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298340","url":null,"abstract":"We derive a simple characterization of the diversity-multiplexing (D-MG) tradeoff in three multiuser scenarios -multiple access, broadcast and relay assuming channel knowledge at the transmitters. Specifically, we study the D-MG tradeoff of protocols in literature that opportunistically use the channel knowledge to maximize the information rate. We show that for the multiple access channel with K users, a feedback of log K\" bits is sufficient to maximize the multiuser diversity gain. The multiuser diversity gains in all three channels are obtained without explicit cooperation between users.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"120 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":"115807546","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}
引用次数: 11
Achievable Rate Region of a Two Phase Bidirectional Relay Channel 两相双向中继信道的可达速率区域
2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298338
T. Oechtering, C. Schnurr, I. Bjelakovic, H. Boche
{"title":"Achievable Rate Region of a Two Phase Bidirectional Relay Channel","authors":"T. Oechtering, C. Schnurr, I. Bjelakovic, H. Boche","doi":"10.1109/CISS.2007.4298338","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298338","url":null,"abstract":"In this work, the capacity region of the broadcast channel in a two phase bidirectional relay communication scenario is proved. Thereby, each receiving node has perfect knowledge about the message intended for the other node. The capacity region can be achieved using an auxiliary random variable taking two values, i.e., by the principle of time-sharing. The resulting achievable rate region of the two-phase bidirectional relaying includes the region which can be achieved by network coding applying XOR on the decoded messages at the relay node.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"77 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":"126725562","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}
引用次数: 47
Design of An Ultra Wideband Transmitter in 0.18μm 3D Silicon on Insulator CMOS 基于0.18μm三维硅绝缘体CMOS的超宽带发射机设计
2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298407
Z. Zhang, A. Andreou
{"title":"Design of An Ultra Wideband Transmitter in 0.18μm 3D Silicon on Insulator CMOS","authors":"Z. Zhang, A. Andreou","doi":"10.1109/CISS.2007.4298407","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298407","url":null,"abstract":"The three-dimensional (3D) integration of silicon on insulator (SOI) wafers has provided us with a tremendous opportunity for ultra-high density, high performance and low-power integrated circuits. We present in this paper an ultra wideband transmitter fabricated in a fully depleted 3D SOI technology. It operates below 960 MHz with small ominidirectional antennas, such as a dipole.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"53 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":"127446471","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
首页 上一页
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学术官方微信