Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.最新文献_第4页

Complexity Analysis of MMSE Detector Architectures for MIMO OFDM Systems MIMO OFDM系统中MMSE检测器结构的复杂性分析

Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005. Pub Date : 2005-11-01 DOI: 10.1109/ACSSC.2005.1599705

M. Myllyla, J.-H. Hintikka, Joseph R. Cavallaro, M. Juntti, M. Limingoja, A. Byman

引用次数: 57

Analysis of Decision-Feedback Based Broadband OFDM Systems 基于决策反馈的宽带OFDM系统分析

Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005. Pub Date : 2005-11-01 DOI: 10.1109/ACSSC.2005.1599840

A. de Baynast, A. Sabharwal, B. Aazhang

引用次数: 8

FPGA Implementation of Matrix Inversion Using QRD-RLS Algorithm 基于QRD-RLS算法的矩阵反演FPGA实现

Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005. Pub Date : 2005-11-01 DOI: 10.1109/ACSSC.2005.1600043

M. Karkooti, Joseph R. Cavallaro, C. Dick

引用次数: 159

Modelling Heterogeneous DSP-FPGA Based System Partitioning with Extensions to the Spinach Simulation Environment 基于异构DSP-FPGA的系统划分建模及其对菠菜仿真环境的扩展

Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005. Pub Date : 2005-11-01 DOI: 10.1109/ACSSC.2005.1600044

M. Brogioli, Joseph R. Cavallaro

引用次数: 6

A Cross-Layer Approach to Cognitive MAC for Spectrum Agility 面向频谱敏捷性的认知MAC跨层方法

Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005. Pub Date : 2005-11-01 DOI: 10.1109/ACSSC.2005.1599732

Qing Zhao, L. Tong, A. Swami

引用次数: 16

Symbol Synchronisation Implementation for Low-Power RF Communication in Wireless Sensor Networks 无线传感器网络中低功耗射频通信的符号同步实现

Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005. Pub Date : 2005-11-01 DOI: 10.1109/ACSSC.2005.1599787

N. MacEwen, L. Crockett, E. Pfann, R. Stewart

引用次数: 4

Optimized Message Passing Schedules for LDPC Decoding LDPC解码的优化消息传递调度

Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005. Pub Date : 2005-11-01 DOI: 10.1109/ACSSC.2005.1599818

P. Radosavljevic, A. de Baynast, Joseph R. Cavallaro

引用次数: 74

Self-Orthogonalizing Overlap-Save GSC 自正交重叠-节省GSC

Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005. Pub Date : 2005-11-01 DOI: 10.1109/ACSSC.2005.1600057

C. L. Koh, S. Weiss, J. M. Peterson, S. Bharitkar

引用次数: 0

Variable-Rate Universal Slepian-Wolf Coding with Feedback 带反馈的可变速率通用睡狼编码

Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005. Pub Date : 2005-11-01 DOI: 10.1109/ACSSC.2005.1599690

S. Sarvotham, D. Baron, Richard Baraniuk

{"title":"Variable-Rate Universal Slepian-Wolf Coding with Feedback","authors":"S. Sarvotham, D. Baron, Richard Baraniuk","doi":"10.1109/ACSSC.2005.1599690","DOIUrl":"https://doi.org/10.1109/ACSSC.2005.1599690","url":null,"abstract":"Traditional Slepian-Wolf coding assumes known statistics and relies on asymptotically long sequences. However, in practice the statistics are unknown, and the input sequences are of finite length. In this finite regime, we must allow a non-zero probability of codeword error isin and also pay a penalty by adding redundant bits in the encoding process. In this paper, we develop a universal scheme for Slepian-Wolf coding that allows encoding at variable rates close to the Slepian-Wolf limit. We illustrate our scheme in a setup where we encode a uniform Bernoulli source sequence and the second sequence, which is correlated to the first via a binary symmetric correlation channel, is available as side information at the decoder. This specific setup is easily extended to more general settings. For length n source sequences and a fixed isin, we show that the redundancy of our scheme is O(radicnPhi-1(isin)) bits over the Slepian-Wolf limit. The prior art for Slepian-Wolf coding with known statistics shows that the redundancy is Omega(radicnPhi-1(isin)). Therefore, we infer that for Slepian-Wolf coding, the penalty needed to accommodate universality is thetas(radicnPhi-1(isin))","PeriodicalId":326489,"journal":{"name":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130184573","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}

引用次数: 16

Simple Seed Architectures for Reciprocal and Square Root Reciprocal 倒数和平方根倒数的简单种子结构

Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005. Pub Date : 2005-10-28 DOI: 10.1109/ACSSC.2005.1599944

M. Ercegovac, J. Muller, A. Tisserand

引用次数: 16