2007 41st Annual Conference on Information Sciences and Systems最新文献_第8页

Constant Envelope Orthogonal Frequency-Division Multiplexing Phase Modulation for Radar Pulse Compression 雷达脉冲压缩中的恒包络正交频分复用相位调制

2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298369

J. P. Stralka, G. Meyer

引用次数: 4

On Asymptotic Efficiency for Asynchronous CDMA 异步CDMA的渐近效率

2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298295

G. Romano, D. Ciuonzo, F. Palmieri, P. Rossi

引用次数: 2

Subspace Sequence Estimation 子空间序列估计

2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298273

M. Tinston, Y. Ephraim

引用次数: 0

A Multiplying Digital-to-Analog Convertor (MDAC) by Charge-Domain Operation 一种基于电荷域运算的倍增数模转换器(MDAC)

2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298406

J. Ikari, Y. Nagazumi, S. Nakamura

引用次数: 0

Differential Space-Frequency Group Codes for MIMO-OFDM MIMO-OFDM差分空频组码

2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298366

E. Zeydan, U. Tureli

{"title":"Differential Space-Frequency Group Codes for MIMO-OFDM","authors":"E. Zeydan, U. Tureli","doi":"10.1109/CISS.2007.4298366","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298366","url":null,"abstract":"In recent years, coherent space-frequency (SF) coded multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) systems have attracted great attention. However, obtaining perfect channel estimates for frequency-selective channels with lots of taps is challenging and computationally complex. In this paper, we present a transmission scheme that uses differential space-frequency group codes (DSFC) for MIMO-OFDM systems. Our proposed scheme is based on the theory of space-frequency group codes. We use the group properties of space-frequency codes that has recently been investigated and obtain a differential transmission rule incorporated with subcarrier allocation method that allows data to be sent without channel estimates at the transmitter or receiver. Recently proposed noncoherent space-frequency codes using MIMO-OFDM have exponential computational complexity with code rate in frequency-selective channels. Compared to existing noncoherent space-frequency codes, our proposed code design is computationally more efficient and is easier to implement. We also demonstrate that the presence of additional resolvable channel taps does not monotonically improve the performance of DSFCs, which shows that obtaining full space-frequency diversity order for increasing number of channel taps decreases the performance of the receivers with lack of channel state information (CSI). This result is completely different from the coherent case of space frequency group codes in which additional channel taps increase the BER performance due to the exploitation of frequency diversity present in MIMO-OFDM frequency-selective channels.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"18 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":"114826450","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

Some Analogies Between Thermodynamics and Shannon Theory 热力学与香农理论的类比

2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298293

D. Samardzija

引用次数: 5

Discrete Memoryless Interference Channels with Fee back 带回费的离散无记忆干扰信道

2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298375

Jinhua Jiang, Yan Xin, H. K. Garg

引用次数: 14

Performance Study of Various Sparse Representation Methods Using Redundant Frames 利用冗余帧的各种稀疏表示方法的性能研究

2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298400

M. Akçakaya, V. Tarokh

{"title":"Performance Study of Various Sparse Representation Methods Using Redundant Frames","authors":"M. Akçakaya, V. Tarokh","doi":"10.1109/CISS.2007.4298400","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298400","url":null,"abstract":"Sparse representations have recently received wide attention because of their numerous potential applications. In this paper, we consider sparse representations of signals with at most L non-zero coefficients using a frame F of size M in CN. We bound the average distortion of such a representation for any arbitrary frame F by a numerical lower bound that is only a function of the sparsity epsiv = L/N of the representation, and the redundancy (r-1) = M/N-1 of F. This numerical lower bound is shown to be much stronger than the analytical and asymptotic bounds of in low dimensions (e.g. N = 6,8, 10), but it is much less straightforward to compute. We then study the performance of randomly generated frames with respect to this numerical lower bound, and to the analytical and asymptotic bounds. When the optimal sparse representation algorithm is used, it is observed that randomly generated frames perform about 2 dB away from the theoretical lower bound in low dimensions. We use the greedy orthogonal matching pursuit (OMP) algorithm to study the performance of randomly generated frames in higher dimensions. For small values of epsiv, randomly generated frames using OMP perform close to the lower bound and the results suggest that the loss of the sub-optimal search using orthogonal matching pursuit algorithm grows as a function of epsiv. As N grows, a concentration phenomenon for the performance of randomly generated frames about their average is observed in all cases, even when using the OMP algorithm.","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":"123821930","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

A New Approach to Energy Efficient Signal Detection 一种新的节能信号检测方法

2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298301

Rick S. Blum, Brian M. Sadler

引用次数: 5

A Proposal for the Security of Peer-to-Peer (P2P) Networks: a pricing model inspired by the theory of complex networks 点对点(P2P)网络的安全建议:一个受复杂网络理论启发的定价模型

2007 41st Annual Conference on Information Sciences and Systems Pub Date : 2007-03-14 DOI: 10.1109/CISS.2007.4298420

Daniel O. Rice

{"title":"A Proposal for the Security of Peer-to-Peer (P2P) Networks: a pricing model inspired by the theory of complex networks","authors":"Daniel O. Rice","doi":"10.1109/CISS.2007.4298420","DOIUrl":"https://doi.org/10.1109/CISS.2007.4298420","url":null,"abstract":"This short research note proposes a peer-to-peer (P2P) network security pricing model that promotes the growth of P2P networks with an increased resistance to malicious code propagation. The security pricing model integrates findings from recent developments in complex network theory with incentive compatible pricing. The model links file download prices in P2P networks with a metric called the Pearson coefficient. The calculation of the Pearson coefficient indicates a structural dimension of networks called \"preferential attachment\". The security pricing model employs a mechanism that charges nodes (network users) higher prices for choosing \"bad\" links, that is links that decrease the Pearson coefficient, because these links inhibit preferential attachment in networks and ultimately degrade networks' resistance to malicious code propagation. The security pricing model provides incentives for nodes to choose the lower priced \"good\" links (that is, links that increase the Pearson coefficient). Continuing research will focus on formalizing and validating the P2P network security model. Simulation will be used to test the resistance of networks grown under this model to malicious code propagation. We demonstrate a different approach to P2P network security and hope that the final analysis will provide insights and provide a significant contribution to the future study of the security of distributed transient networks (DTN) including P2P, ad hoc, and other computer based networks.","PeriodicalId":151241,"journal":{"name":"2007 41st Annual Conference on Information Sciences and Systems","volume":"14 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":"130472451","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}

引用次数: 5