It is shown that multiple complementary techniques for trading BER performance for cost reduction in the Viterbi algorithm for multipleinput/multiple-output joint demodulation can be merged to obtain substantial and efficient cost reduction. Quantitative results for application to the separation of GSM cochannel signals are presented. It is shown that up to six signals can be separated at a GSM...

Cooperation between nodes in a wireless network will increasingly become necessary to achieve performance goals when nodes employ the same resource spectrum. The question of feasibility of cooperation between rational nodes in a wireless network and whether there exists a fair division of the benefits of cooperation is unknown even for simple multi-terminal networks such as multiple access and ...

A stream processor is a power-efficient, high-level-language programmable option for embedded applications that are computation intensive and admit high levels of data parallelism. Many signal-processing algorithms for communications are well matched to stream-processor architectures, including partially parallel implementations of layered decoding algorithms such as the turbo-decoding message-...

In practice, LDPC codes are decoded using message passing methods. These methods offer good performance but tend to converge slowly and sometimes fail to converge and to decode the desired codewords correctly. Recently, tree-reweighted message passing methods have been modified to improve the convergence speed at little or no additional complexity cost. This paper extends this line of work and ...

To realize the low power consumption and low-cost equipment needed to decode high definition broadcasts, Fujitsu has developed a single-chip multicore processor FR1000 that integrates four 8-way, Very Long Instruction Word (VLIW) FR-V processor cores. This new multicore processor is fabricated using a 90 nm, nine-metal-layer CMOS process and a 900-pin flip-chip package. The processor cores oper...

The Stack algorithm, which is a best-first search algorithm widely used in speech recognition, is modified for application to the problem of recognizing machine printed text in the Document Image Decoding (DID) framework. An iterative scheme is described wherein successively more stringent Stack searches are performed, each time using a model of the image that is updated on the basis of what wa...

Abstract: Two different ways of obtaining generalized low-density parity-check codes are considered. Lower bounds on the minimum distance, stopping distance, and pseudodistance are derived for these codes using graph based analysis. These bounds are generalizations of Tanner’s bit-oriented and parity-oriented bound for simple LDPC codes. The new bounds are useful in predicting the performance o...

Yu BM, Kemere C, Santhanam G, Afshar A, Ryu SI, Meng TH, Sahani M, Shenoy KV. Mixture of trajectory models for neural decoding of goal-directed movements. J Neurophysiol 97: 3763–3780, 2007. First published February 28, 2007; doi:10.1152/jn.00482.2006. Probabilistic decoding techniques have been used successfully to infer time-evolving physical state, such as arm trajectory or the path of a for...

An important problem for secure group communication is key distribution. Most of the centralized group key management schemes employ high rekeying cost. Here we introduce a novel approach for computation efficient rekeying for multicast key distribution. This approach reduces the rekeying cost by employing a hybrid group key management scheme (involving both centralized and contributory key man...