IEEE Information Theory Workshop, 2005.最新文献

Boneh-Shaw fingerprinting and soft decision decoding Boneh-Shaw指纹识别和软决策解码

IEEE Information Theory Workshop, 2005. Pub Date : 2005-11-14 DOI: 10.1109/ITW.2005.1531884

H. G. Schaathun, Marcel Fernandez-Muñoz

引用次数: 13

A unified framework for tree search decoding: rediscovering sequential decoding 统一的树搜索解码框架:重新发现顺序解码

IEEE Information Theory Workshop, 2005. Pub Date : 2005-11-14 DOI: 10.1109/ITW.2005.1531875

Arul D. Murugan, H. E. Gamal, M. O. Damen, G. Caire

{"title":"A unified framework for tree search decoding: rediscovering sequential decoding","authors":"Arul D. Murugan, H. E. Gamal, M. O. Damen, G. Caire","doi":"10.1109/ITW.2005.1531875","DOIUrl":"https://doi.org/10.1109/ITW.2005.1531875","url":null,"abstract":"We consider receiver design for coded transmission over linear Gaussian channels. We restrict ourselves to the class of lattice codes and formulate the joint detection and decoding problem as a closest lattice point search (CLPS). Here, a tree search framework for solving the CLPS is adopted. In our framework, the CLPS algorithm decomposes into preprocessing and tree search stages. The role of the preprocessing stage is to expose the tree structure in a form matched to the search stage. Here, it is argued that the minimum mean square error decision feedback (MMSE-DFE) frontend is instrumental for solving the joint detection and decoding problem in a single search stage. It is further shown that MMSE-DFE filtering allows for using lattice reduction methods to reduce complexity, at the expense of a marginal performance loss, and solving under-determined linear systems. For the search stage, we present a generic method, based on the branch and bound (BB) algorithm, and show that it encompasses all existing sphere decoders as special cases. The proposed generic algorithm further allows for an interesting classification of tree search decoders, sheds more light on the structural properties of all known sphere decoders, and inspires the design of more efficient decoders. In particular, an efficient decoding algorithm that resembles the well known Fano sequential decoder is identified. The excellent performance-complexity tradeoff achieved by the proposed MMSE-Fano decoder is established via simulation results and analytical arguments in several MIMO and ISI scenarios.","PeriodicalId":291012,"journal":{"name":"IEEE Information Theory Workshop, 2005.","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126284492","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

Periodic Oppermann sequences for spread spectrum systems 扩频系统的周期Oppermann序列

IEEE Information Theory Workshop, 2005. Pub Date : 2005-11-14 DOI: 10.1109/ITW.2005.1531852

G. Cresp, H. Zepernick, H. H. Dam

引用次数: 1

Generalized signature delegation algorithm 广义签名委托算法

IEEE Information Theory Workshop, 2005. Pub Date : 2005-11-14 DOI: 10.1109/ITW.2005.1531870

Chih-Yin Lin, Chen-Hwa Song

引用次数: 0

Achieving MIMO channel capacity using multirate layered space-time coding architectures 利用多速率分层空时编码架构实现MIMO信道容量

IEEE Information Theory Workshop, 2005. Pub Date : 2005-11-14 DOI: 10.1109/ITW.2005.1531886

M. Sellathurai, T. Ratnarajah

引用次数: 1

BEAST decoding - asymptotic complexity BEAST解码-渐近复杂度

IEEE Information Theory Workshop, 2005. Pub Date : 2005-11-14 DOI: 10.1109/ITW.2005.1531846

I. Bocharova, B. Kudryashov, R. Johannesson

引用次数: 0

Mutual information of non-coherent Rayleigh fading channels with Gaussian input 高斯输入非相干瑞利衰落信道的互信息

IEEE Information Theory Workshop, 2005. Pub Date : 2005-11-14 DOI: 10.1109/ITW.2005.1531879

R. Perera, T. Pollock, T. Abhayapala

引用次数: 1

Viterbi algorithm motives in turbo decoding Viterbi算法在turbo译码中的应用

IEEE Information Theory Workshop, 2005. Pub Date : 2005-11-14 DOI: 10.1109/ITW.2005.1531865

M. Kerner, O. Amrani

引用次数: 1

On the capacity of erasure relay channel: multi-relay case 关于擦除继电器通道的容量:多继电器情况

IEEE Information Theory Workshop, 2005. Pub Date : 2005-11-14 DOI: 10.1109/ITW.2005.1531866

R. Khalili, Kave Salamatian

引用次数: 18

The mutual information constellation 互信息星座

IEEE Information Theory Workshop, 2005. Pub Date : 2005-11-14 DOI: 10.1109/ITW.2005.1531877

A. Nilsson, T. Aulin

引用次数: 0