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

Annual Allerton Conference on Communication, Control, and Computing

作者： Yi Lu Andrea Montanari Balaji Prabhakar Department of Electrical Engineering Stanford University Departments of Electrical Engineering and Statistics Stanford University

ISBN: (纸本)9781424429257

A novel counter architecture, called Counter Braids, has recently been proposed for per-flow counting on high-speed links. Counter Braids has a layered structure and compresses the flow sizes as it counts. It has been shown that with a Maximum Likelihood (ML) decoding algorithm, the number of bits needed to store the size of a flow matches the entropy lower bound. As ML decoding is too complex to implement, an efficient message passing decoding algorithm has been proposed for practical purposes. The layers of Counter Braids are decoded sequentially, from the most significant to the least significant bits. In each layer, the message passing decoder solves a sparse signal recovery problem. In this paper we analyze the threshold dimensionality reduction rate (d-rate) of the message passing algorithm, and prove that it is correctly predicted by density evolution. Given a signal in R_+~n with TIE non-vanishing entries, we prove that one layer of Counter Braids can reduce its dimensionality by a factor 2.08·εlog(l/ε) + O(ε). This essentially matches the rate for sparse signal recovery via L_1 minimization, while keeping the overall complexity linear in n.

关键词： decoding algorithm message passing BRAIDING Signal restoration Counters Drill bits Pheromone a-Factor one layer

来源：评论

学校读者我要写书评

暂无评论

Trait-Based Hypothesis Selection For Machine Translation 12

Trait-Based Hypothesis Selection For Machine Translation

引用

Conference of the North American Chapter of the Association for Computational Linguistics: human language technologies

作者： Jacob Devlin Spyros Matsoukas Raytheon BBN Technologies Cambridge MA

ISBN: (纸本)9781937284206

In the area of machine translation (MT) system combination, previous work on generating input hypotheses has focused on varying a core aspect of the MT system, such as the decoding algorithm or alignment algorithm. In this paper, we propose a new method for generating diverse hypotheses from a single MT system using traits. These traits are simple properties of the MT output such as "average output length" and "average rule length." Our method is designed to select hypotheses which vary in trait value but do not significantly degrade in BLEU score. These hypotheses can be combined using standard system combination techniques to produce a 1.2-1.5 BLEU gain on the Arabic-English NIST MT06/MT08 translation task.

关键词： machine translation Belgo-Luxembourg Economic Union MT decoding algorithm new methods

来源：评论

学校读者我要写书评

暂无评论

Erasure decoding for Gabidulin Codes

引用

Journal of Mathematical Modelling and algorithms 2011年第3期10卷 277-291页

作者： Babindamana, Regis F. Gueye, Cheikh Thiecoumba Departement de Mathématiques Informatique Faculté des Sciences et Techniques Universite Cheikh Anta Diop Dakar Senegal

We present a new approach of the decoding algorithm for Gabidulin Codes. In the same way as efficient erasure decoding for Generalized Reed Solomon codes by using the structure of the inverse of the VanderMonde matrices, we show that, the erasure(t erasures mean that t components of a code vector are erased) decoding Gabidulin code can be seen as a computation of three matrice and an affine permutation, instead of computing an inverse from the generator or parity check matrix. This significantly reduces the decoding complexity compared to others algorithms. For t erasures with t ≤ r, where r = n - k, the erasure algorithm decoding for Gab_{n, k}(g) Gabidulin code compute the t symbols by simple multiplication of three matrices. That requires rt + r(k - 1) Galois field multiplications, t(r - 1) + (t + r)k field additions, r² + r(k + 1) field negations and t(k + 1) field inversions. © 2011 Springer Science+Business Media B.V.

关键词： Cauchy matrix decoding algorithm Gabidulin codes Generalized Reed Solomon codes Vandermonde matrix

来源：评论

学校读者我要写书评

暂无评论

Unified scaling factor approach for turbo decoding algorithms

引用

IET COMMUNICATIONS 2010年第8期4卷 905-914页

作者： Yue, D. -W. Nguyen, H. H. Dalian Maritime Univ Coll Informat Sci & Technol Dalian Peoples R China Univ Saskatchewan Dept Elect & Comp Engn Saskatoon SK S7N 5A9 Canada

Turbo (iterative) decoding can be implemented with a large family of soft- input soft-output (SISO) algorithms, including suboptimal but practical algorithms such as the soft- output Viterbi algorithm (SOVA) and max-log-MAP algorithm. The performance with these practical algorithms can be improved with simple scaling factor methods. However, their theoretical analysis was mainly based on the relaxed assumption proposed by Papke et al. that the extrinsic information is Gaussian distributed. This study proposes a novel scaling factor approach for reducing both the overestimation of reliability values and the correlation between the intrinsic and extrinsic information. Explicit formulae for computing the scaling factors are derived based on mathematical statistics. A key difference compared to the scaling factor method of Papke et al. is that the proposed scaling factors can be computed off-line. The numerical results show that when implemented in the decoding algorithm of block component codes, the proposed scaling factor approach improves the performance of turbo decoding over additive white Gaussian noise and Rayleigh fading channels. It is superior than the method by Papke et al. in both performance and complexity.

关键词： Turbo Raleigh fading channels Scale factor decoding AWGN large family Worm gears decoding algorithm

来源：评论

学校读者我要写书评

暂无评论

High-speed Transmission of Overlay Coding for Road-to-Vehicle Visible Light Communication Using LED Array and High-Speed Camera

High-speed Transmission of Overlay Coding for Road-to-Vehicl...

引用

Institute of Electrical and Electronics Engineers Globecom Workshops

作者： Sayaka NISHIMOTO Takaya YAMAZATO Hiraku OKADA Toshiaki FUJIT Tomohiro YENDO Shintaro ARAI Nagoya University Nagaoka University of Technology Kagawa National College of Technology

ISBN: (纸本)9781467349420

This paper aims to the improve the data rate for the visible light communication system using LED array and high-speed camera. Previously, we have proposed the decoding algorithm using inverted signals for driving situation. However, using this method the data rate become a half, because we transmit original signals and inverted signals alternately for LED array tracking. In this paper, we propose the data rate improving method for overlay coding which is coding method that overlay two data which are called as the long range data and the short range data. In the proposed method, for the long range data, we transmit original signals and inverted signals alternately. On the other hand, for the short range data, we transmit only original signals while we transmit inverted signals of long range data. We confirm that we can improve data rate as compared with the previous method.

关键词： original signal Cameras-High speed Range of a function Data transfer rates Overlay SMIM10L2A gene Light emitting diodes TRANSMITTING high speed transmission decoding algorithm signals

来源：评论

学校读者我要写书评

暂无评论

The l_1 penalized decoder and its reweighted LP

The l_1 penalized decoder and its reweighted LP

引用

Annual Allerton Conference on Communication, Control, and Computing

作者： Xishuo Liu Stark C. Draper Benjamin Recht Department of Electrical and Computer Engineering University of Wisconsin Department of Computer Sciences University of Wisconsin

ISBN: (纸本)9781467345378

Linear programming (LP) decoding for low density parity check (LDPC) codes proposed by Feldman et al. has attracted considerable attention in recent years. Despite having theoretical guarantees in some regimes, at low SNRs LP decoding is observed to have worse error performance than belief propagation (BP) decoding. In this paper, we present a novel decoding algorithm obtained by trying to solve a non-convex optimization problem using the alternating direction method of multipliers (ADMM). This non-convex problem is constructed by adding an l_1 penalty term to the LP decoding objective. The goal of the penalty term is to make "pseudocodewords", which are the non-integer vertices of the LP relaxation to which the LP decoder fails, more costly. We name this the "l_1 penalized decoder". We also develop a reweighted LP decoding algorithm base on this l_1 penalized objective. We show that this reweighted LP has an improved theoretical recovery threshold compared to the original LP. In addition, simulations show that, in comparison to LP decoding, these two decoders both achieve significantly lower error rates and are not observed to have an "error floor". In particular, the l_1 penalized decoder meets or outperforms the BP decoder at all SNRs.

关键词： decoders decoding Error analysis error performance decoding algorithm Non-Convex penalty

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Constrained Coding for Floating-Gate to Floating-Gate Coupling Mitigation in Flash Memory

Hierarchical Constrained Coding for Floating-Gate to Floatin...

引用

54th Annual IEEE Global Telecommunications Conference (GLOBECOM)

作者： Motwani, Ravi Intel Corp NVM Solut Grp Santa Clara CA 95051 USA

ISBN: (纸本)9781424492688

Flash memory comprises of grid of cells arranged in a rectangular lattice. A cell is a floating gate and the information is stored as charge in these floating gates. A multi-level-cell (MLC) stores more than one bit per cell. Programming of a cell in NAND Flash is attained by Fowler-Nordhiem tunneling till the ideal programmed voltage is attained. However, due to programming time constraints, some tolerance is accepted and the actual programmed voltage is allowed to be within some range of the ideal value. The read level is a random variable with some distribution around the mean programming level. Errors occur during reads because of overlaps of the level distributions. If the raw bit error rate has to be kept low, the distributions must be narrow. One of the impairment which broadens the distributions is the capacitive coupling between neighboring cells. This phenomenon called as inter-cell-interference due to floating-gate to floating-gate coupling can be from mild to extreme. To combat this effect, constrained coding is a possible solution. Constrained coding entails forbidding certain adjacent-cell charge-level combinations. There can be various types of constrained codes, one type of constrained codes assumes that level information is available while decoding all pages [1]. However, due to read latency requirements, level information may not be available while reading all pages. In this paper, constrained codes are proposed which do not need level information while decoding all pages and hence the average read latency is reduced. Error propagation is a crucial degrading factor for constrained decoding and the codes proposed are robust to channel noise. A new decoding algorithm which keeps synchronization which is crucial to contain error propagation is also proposed.

关键词： decoding Encoding Flash memory Indexes Maximum likelihood estimation Noise measurement Synchronization capacitive coupling decoding algorithm error propagation flash memories flash memory floating-gate coupling mitigation hierarchical constrained coding hot-electron injection intercell-interference multilevel-cell neighboring cells programming time constraints rectangular lattice

来源：评论

学校读者我要写书评

暂无评论

Lensless Fluorescent On-Chip Microscopy using a Fiber-Optic Taper

Lensless Fluorescent On-Chip Microscopy using a Fiber-Optic ...

引用

33rd Annual International Conference of the IEEE Engineering-in-Medicine-and-Biology-Society (EMBS)

作者： Coskun, Ahmet F. Sencan, Ikbal Su, Ting-Wei Ozcan, Aydogan Univ Calif Los Angeles Dept Elect Engn Los Angeles CA 90095 USA

We demonstrate a lensfree on-chip fluorescent microscopy platform that can image fluorescently labeled cells over similar to 60 mm(2) field-of-view with 5-fold higher density of fiber-optic waveguides in its top face... 详细信息

ISBN: (纸本)9781424441228

We demonstrate a lensfree on-chip fluorescent microscopy platform that can image fluorescently labeled cells over similar to 60 mm(2) field-of-view with <4 mu m spatial resolution. In this lensfree imaging system, micro-objects of interest are directly located on tapered fiber-optic faceplate which has > 5-fold higher density of fiber-optic waveguides in its top facet compared to the bottom facet. For excitation, an incoherent compared to the bottom facet. For excitation, an incoherent light source (e.g. a simple light emitting diode - LED) is used to pump fluorescent objects through a glass hemi-sphere interface. Upon interacting with the entire sample volume, the excitation light is rejected by total internal reflection process occurring at the bottom of the sample substrate. Fluorescent emission from the objects is then collected by the smaller facet of the tapered faceplate and is delivered to a detector-array with an image magnification of similar to 2.4X. A compressive sampling based decoding algorithm is used for sparse signal recovery, which further increases the space-bandwidth-product of our lensfree on-chip fluorescent imager. We validated the performance of this lensfree imaging platform using fluorescent micro-particles as well as labeled water-borne parasites (e.g. Giardia Muris cysts). Such a compact and wide-field fluorescent microscopy platform could be valuable for cytometry and rare cell imaging applications as well as for micro array research.

关键词： Fluorescence Microscopy Optical fiber sensors Optical microscopy Spatial resolution System-on-a-chip biological techniques cellular biophysics cytometry decoding algorithm detector array fiber-optic taper fluorescence fluorescent microparticles image magn

来源：评论

学校读者我要写书评

暂无评论

In Search of More Robust decoding algorithms for Neural Prostheses, a Data Driven Approach

In Search of More Robust Decoding Algorithms for Neural Pros...

引用

32nd Annual International Conference of the IEEE Engineering-in-Medicine-and-Biology-Society (EMBC 10)

作者： Subasi, Erk Townsend, Benjamin Scherberger, Hansjorg Univ Zurich Inst Neuroinformat ETH Zurich CH-8057 Zurich Switzerland

ISBN: (纸本)9781424441242

In the past decade the field of neural interface systems has enjoyed an increase in attention from the scientific community and the general public, in part due to the enormous potential that such systems have to increase the quality of life for paralyzed patients. While significant progress has been made, serious challenges remain to be addressed from both biological and engineering perspectives. A key issue is how to optimize the decoding of neural information, such that neural signals are correctly mapped to effectors that interact with the outside world - like robotic hands and limbs or the patient's own muscles. Here we present some recent progress on tackling this problem by applying the latest developments in machine learning. Neural data was collected from macaque monkeys performing a real-time hand grasp decoding task. Signals were recorded via chronically implanted electrodes in the anterior intraparietal cortex (AIP) and ventral premotor cortex (F5), brain areas that are known to be involved in the transformation of visual signals into hand grasping instructions. We present a comparative study of different classical machine learning methods with an application of decoding of hand postures, as well as a new approach for more robust decoding. Results suggests that combining data-driven algorithmic approaches with well-known parametric methods could lead to better performing and more robust learners, which may have direct implications for future clinical devices.

关键词： AIP anterior intraparietal cortex biomedical electrodes brain chronically implanted electrodes data driven approach decoding algorithm effectors hand grasping instructions learning (artificial intelligence) macaque monkeys machine learning medical control systems medical signal processing neural information decoding optimization neural interface systems neural prostheses neural signals neurophysiology prosthetics real time hand grasp decoding task ventral premotor cortex visual signal transformation

来源：评论

学校读者我要写书评

暂无评论

A unified decoding algorithm for linear codes based on partitioned parity-check matrices

A unified decoding algorithm for linear codes based on parti...

引用

IEEE Information Theory Workshop

作者： Ma, Xiao Bai, Baoming Sun Yat Sen Univ Dept Elect & Commun Engn Guangzhou 510275 Guangdong Peoples R China Xidian Univ State Key Lab ISN Xian 710071 Peoples R China

ISBN: (纸本)9781424415632

In this paper, we propose a unified decoding algorithm for linear codes, named doubly extended sum-product algorithm (DESPA). The DESPA is described as a belief propagation algorithm over a generalized normal graph that represents the code based on a partitioned parity-check matrix. In one extreme case, the DESPA minimizes the frame-error-rate;while in another extreme case, the DESPA minimizes the bit-error-rate. In practice, the DESPA can be implemented to make trade-offs between decoding complexity and decoding performance.

关键词： check matrix linear codes decoding algorithm Belief propagation extreme case partitions decoding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：