The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Programs for Research Experience for Undergraduates are now offered in a variety of topics. At Utah State University, a unique program was offered in the summer of 2008 with the topic area of Coding and Communications. Eight students from around the country were selected to participate. The program began with three weeks of intensive introduction to a variety of technical topics. This background set...
We propose an improved wavelet-based embedded image coding scheme using dynamic index reordering vector quantization. The successive approximation process in embedded image coding is defined as a temporal process, and dynamic index reordering vector quantization is applied to the temporal domain. In this method, the redundancy in consecutive angle or pattern transition is exploited. An efficient encoding...
This paper explores two alternatives to the standard message passing approach to decoding LDPC codes: regression trees and random forests. Regression trees are capable of approximating complicated functions. This paper reports on the performance of a tree-based low-density parity-check code (LDPC) decoder in which a regression tree is trained to approximate the message passing update function. This...
Suboptimal decoding of convolutional codes, motivated by the need to deal with large constraint length codes, has in the past been achieved by stack algorithms or sequential decoding, which typically do not produce soft outputs, which may be desirable in some modern iterative decoding frame-works. Motivated by an approximate posterior equalizer, we present a suboptimal decoder which employs a similar...
Two iterative decoding algorithms, which are alternatives to belief propagation (BP) decoding LDPC codes, are introduced in this paper. In parity augmentation (PA) decoding, probabilities are modifled in such a way that the probability of even parity is increased at every iteration. This is a low-complexity algorithm which does not require both row and column interleavers. We also examine the nature...
Rateless codes for erasure channels were recently proposed by Luby with very efficient coding and decoding schemes. However, designing an efficient decoding rateless code for binary error channel (BEC), still remains a difficult problem. In this work we propose a rateless decoding algorithm for the BEC using a coding matrix G with a high level of sparsity. The distribution used to generate the elements...
This paper outlines a space-time duality study started in 2003 and leading to a latency-information theory (LIT) that unifies information theory with a novel latency theory revealed as time-dual. While information theory guides the design of communication systems, latency theory does the same for recognition systems. A unified recognition-communication system is an intelligence system and LIT illuminates...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.