检索结果-内蒙古大学图书馆

IEEE International Conference on Acoustics, Speech, and Signal Processing

作者： Jiangli Zhu Xinmiao Zhang Case Western Reserve University Cleveland OH 44106-7071

ISBN: (纸本)9781424442959

Generalized minimum distance (GMD) decoding of Reed-Solomon (RS) codes can correct more errors than conventional hard-decision decoding by running error-and-erasure decoding multiple times for different erasure patterns. The latency of the GMD decoding can be reduced by the Kotter's one-pass decoding scheme. This scheme first carries out an error-only hard-decision decoding. Then all pairs of error-erasure locators and evaluators are derived iteratively in one run based on the result of the error-only decoding. In this paper, a more efficient interpolation-based one-pass GMD decoding scheme is studied. Applying the re-encoding and coordinate transformation, the result of erasure-only decoding can be directly derived. Then the locator and evaluator pairs for other erasure patterns are generated iteratively by applying interpolation. In addition, a simplified polynomial selection scheme is proposed to pass only one pair of locator and evaluator to succesive decoding steps. Efficient architectures are employed for the interpolation-based GMD decoder and detailed analysis is provided for the area requirement and decoding latency. With 15percent less hardware requirement, the interpolation-based one-pass GMD decoder can reduce the decoding latency to 96percent of the Kotter's decoder for a (255, 239) RS code. In terms of speed-over-area ratio, our design is 22percent more efficient.

关键词： Generalized minimum distance (GMD) decoder Interpolation Reed-Solomon (RS) codes VLSI architecture Reed-Solomon codes Interpolation decoding GMDS gene Evaluators Locators decoders one way hard-decision decoding decoding scheme

来源：评论

学校读者我要写书评

暂无评论

LT Network Codes

LT Network Codes

引用

IEEE International Conference on Distributed Computing Systems

作者： Mary-Luc Champel Kevin Huguenin Anne-Marie Kermarrec Nicolas Le Scouarnec Technicolor FRISA/Universite de Rennes 1 INRIA Rennes - Bretagne Atlantique

ISBN: (纸本)9781424472611;9780769540597

Network coding has been successfully applied in large-scale content dissemination systems. While network codes provide optimal throughput, its current forms suffer from a high decoding complexity. This is an issue when applied to systems composed of nodes with low processing capabilities, such as sensor networks. In this paper, we propose a novel network coding approach based on LT codes, initially introduced in the context of erasure coding. Our coding scheme, called LTNC, fully benefits from the low complexity of belief propagation decoding. Yet, such decoding schemes are extremely sensitive to statistical properties of the code. Maintaining such properties in a fully decentralized way with only a subset of encoded data is challenging. This is precisely what the recoding algorithms of LTNC achieve. We evaluate LTNC against random linear network codes in an epidemic content-dissemination application. Results show that LTNC increases communication overhead (20%) and convergence time (30%) but greatly reduces the decoding complexity (99%) when compared to random linear network codes. In addition, LTNC consistently outperforms dissemination protocols without codes, thus preserving the benefit of coding.

关键词： Network Code Codes Level Trigger Network coding decoding scheme encode data Linear networks Belief propagation decoding labeling scheme

来源：评论

学校读者我要写书评

暂无评论

Control of a brain-computer interface without spike sorting

引用

JOURNAL OF NEURAL ENGINEERING 2009年第5期6卷 055004:1-055004:8页

作者： Fraser, George W. Chase, Steven M. Whitford, Andrew Schwartz, Andrew B. Univ Pittsburgh Dept Neurobiol Pittsburgh PA 15213 USA Univ Pittsburgh Ctr Neural Basis Cognit Pittsburgh PA 15213 USA Carnegie Mellon Univ Dept Stat Pittsburgh PA 15213 USA Univ Pittsburgh Dept Bioengn Pittsburgh PA 15261 USA

Two rhesus monkeys were trained to move a cursor using neural activity recorded with silicon arrays of 96 microelectrodes implanted in the primary motor cortex. We have developed a method to extract movement information from the recorded single and multi-unit activity in the absence of spike sorting. By setting a single threshold across all channels and fitting the resultant events with a spline tuning function, a control signal was extracted from this population using a Bayesian particle-filter extraction algorithm. The animals achieved high-quality control comparable to the performance of decoding schemes based on sorted spikes. Our results suggest that even the simplest signal processing is sufficient for high-quality neuroprosthetic control.

关键词： brain–computer rhesus monkeys neuroprosthetic control Brain-Computer Interfaces Macaca mulatta Unit activity signal processing Primary Motor Cortex sorting programs decoding scheme

来源：评论

学校读者我要写书评

暂无评论

\Spiking neural network inter-spike time based decoding scheme

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2005年第8期E88D卷 1893-1902页

作者： Amin, HH Fujii, RH Aizu Univ Dept Comp Engn Aizu Wakamatsu 9658580 Japan

Information transmission among biological neurons is carried out by a complex series of spike signals. The input inter-spike arrival times at a neuron are believed to carry information which the neurons utilize to carry out a task. In this paper, a new scheme which utilizes the input inter-spike intervals (ISI) for decoding an input spike train is proposed. A spike train consists of a sequence on input spikes with various interspike times. This decoding scheme can also be used for neurons which have multiple synaptic inputs but for which each synapse receives a single spike within one input time window. The ISI decoding neural network requires only a few neurons. Example applications show the usefulness of the decoding scheme.

关键词： spike train spatio-temporal decoding scheme inter-spike interval

来源：评论

学校读者我要写书评

暂无评论

SISO algorithms based on Max-Log-MAP and Log-MAP turbo decoding

引用

IET COMMUNICATIONS 2007年第1期1卷 49-54页

作者： Papaharalabos, S. Sweeney, P. Evans, B. G. Univ Surrey Ctr Commun Syst Res Guildford GU2 7XH Surrey England Inst Space App & Remote Sensing Natl Oberv Athens Athens Greece

Novel soft-input soft-output (SISO) decoding algorithms suitable for turbo codes are proposed with good compromise between complexity and bit error rate (BER) performance. The algorithms are based on the application of the max/max* (i.e. Jacobian logarithm) operations at different levels when computing the decoder soft-output value. It is observed that some decoding schemes from the authors' previously published work fall into the family of methods described here. The effect is to provide a range of possibilities allowing system designers to make their own choices for turbo code BER performance against complexity.

关键词： Worm gears Complexity bit error rate performance Turbo algorithms decoding turbo codes decoding scheme

来源：评论

学校读者我要写书评

暂无评论

Joint Network and Channel Coding for Cooperative Networks

Joint Network and Channel Coding for Cooperative Networks

引用

Australasian Telecommunication Networks and Applications Conference

作者： Johnson, Sarah J. Kellett, Christopher M. Univ Newcastle Sch Elect Engn & Comp Sci Callaghan NSW 2308 Australia

ISBN: (纸本)9781424415571

In this paper we propose joint network and channel coding schemes for cooperative networks. The joint decoding schemes require no adjustment to either the sending or intermediary network nodes, but are achieved by describing joint network code / channel code Tanner graphs at the receiving node and applying iterative sum-product decoding. The performance of the proposed schemes are simulated on a simple "butterfly" network and very promising results are obtained.

关键词： Channel coding receiving node labeling scheme Network Code Network decoding scheme send network node

来源：评论

学校读者我要写书评

暂无评论

Iterative decoding of parallel and serial concatenated single parity check product codes

引用

ELECTRONICS LETTERS 2006年第15期42卷 869-870页

作者： Ma, X. R. Xu, Y. Y. Shanghai Jiao Tong Univ Inst Wireless Commun Dept Elect Engn Shanghai 200240 Peoples R China

An efficient, iterative soft-in-soft-out decoding scheme is employed for the parallel and serially concatenated single parity check (SPC) product codes, which has very low complexity, requiring only two addition-equivalent-operations per information bit. For a rate 0.8637 of parallel concatenated SPC product code, a performance of BER = 10(-5) at E-b/N-0 = 3.66 dB can be achieved using this decoding scheme, which is within 1 dB from the Shannon limit.

关键词： bit error rate performance Parity check Iterative decoding Parallel Lines Shannon limit Product codes information bit decoding scheme

来源：评论

学校读者我要写书评

暂无评论

Lee metric decoding of alternant codes over Z_q

引用

ELECTRONICS LETTERS 2005年第10期41卷 601-602页

作者： Armand, MA Natl Univ Singapore Dept Elect & Comp Engn Singapore 117576 Singapore

A multi-stage Lee metric list decoding approach for alternant codes over Z(pl) where p is prime and l >= 2 is proposed. It is demonstrated that the error-correcting capability of such a decoding scheme increasingly... 详细信息

关键词： decoding error correction codes Lee metric decoding alternant codes decoding scheme error-correction

来源：评论

学校读者我要写书评

暂无评论

Token-based error diffusion for high quality halftoning with good compression and low complexity

引用

JOURNAL OF ELECTRONIC IMAGING 2004年第2期13卷 303-314页

作者： Lee, JH Allebach, JP Hewlett Packard Corp Vancouver WA 98683 USA Purdue Univ Sch Elect & Comp Engn W Lafayette IN 47907 USA

This paper presents a combined halftoning and compression approach which achieves high quality halftones and compression ratios comparable to those of JBIG and JBIG2 with much simpler encoding and decoding schemes. We use tone-dependent error diffusion and a tree structure to efficiently develop the halftone texture from a limited set of binary one-dimensional tokens. Local estimation of tone further restricts the candidate set of tokens. In areas of the image containing edges or detail, the token is not constrained. A Huffman code is used to efficiently encode the tokens with minimal complexity. Experimental results show that visual quality is very close to that of regular tone-dependent error diffusion. (C) 2004 SPIE and IST.

关键词： token Error diffusion compression ratio JBIG Huffman codes halftones decoding scheme

来源：评论

学校读者我要写书评

暂无评论

Serial concatenation of space-time and recursive convolutional codes

引用

ETRI JOURNAL 2003年第2期25卷 144-147页

作者： Ko, YJ Kim, JI ETRI Basic Res Lab Taejon South Korea ETRI Mobile Telecommun Res Lab Taejon South Korea

We propose a new serial concatenation seheme for space-time and recursive convolutional codes, in which a space-time code is used as the outer code and a single recursive convolutional code as the inner code. We discuss previously proposed serial concatenation schemes employing multiple inner codes and compare them with the new one. The proposed method and the previous one with joint decoding, both performing a combined decoding of the simultaneous output signals from multiple antennas, give a large performance gain over the separate decoding method. In decoding complexity, the new concatenation scheme has a lower complexity compared with the multiple encoding/joint decoding scheme due to the use of the single inner coded Simulation results for a communication system with two transmit and one receive antennas in a quasi-static Rayleigh fading channel show that the proposed scheme outperforms the previous schemes.

关键词： space-time codes Serial Publications decoding Codes scheme decoding scheme Recursive COMMUNICATION SYSTEMS multiple antenna convolutional coding

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：