نتایج جستجو برای: minimal basic encoder

تعداد نتایج: 426738  

2013
Ali M. Reza

Hardware implementation of the JPEG 2000 image compression standard for real-time image compression requires implementation of the adaptive arithmetic encoder among other related algorithms. In this work, a system level design for the adaptive arithmetic encoder used in the JPEG 2000 standard is proposed. This design is based on the assumption that the bit-sequence and its corresponding context...

1998
Frans M. J. Willems

First we modify the basic (binary) context-tree weighting method such that the past symbols x1 D; x2 D; ; x0 are not needed by the encoder and the decoder. Then we describe how to make the context-tree depth D infinite, which results in optimal redundancy behavior for all tree sources, while the number of records in the context tree is not larger than 2T 1: Here T is the length of the source se...

Journal: :Neurocomputing 2007
Christian A. Morillas Samuel F. Romero Antonio Martínez-Álvarez Francisco J. Pelayo Leonardo Maria Reyneri Markus Bongard Eduardo Fernández

The cooperation between neuroscience and biomedical engineering gave rise to a recent, but growing research field, known as neuroengineering. We follow its principles to have a system providing basic descriptions of the visual world to the brain’s cortex. We describe a set of software and hardware tools to interface with neural tissue, in order to transmit visual information encoded into a bioi...

2000
Jong Il PARK Yeongyoon CHOI

In a wireless cellular system the equalizer can be regarded as an inner decoder in the serially concatenated convolutional coding systems. In the proposed system, ui ∈ {0, 1} is the input symbol and si is the state in the trellis diagram. yi is the output of 1/n convolutional encoder and ri is the output of the memoryless channel. Let Ll be the set of all possible information sequences of lengt...

Journal: :IEEE Trans. Information Theory 1998
Frans M. J. Willems

First we modify the basic (binary) context-tree weighting method such that the past symbols x1 D; x2 D; ; x0 are not needed by the encoder and the decoder. Then we describe how to make the context-tree depth D infinite, which results in optimal redundancy behavior for all tree sources, while the number of records in the context tree is not larger than 2T 1: Here T is the length of the source se...

2008
DAVID JIMÉNEZ YANG WANG

The β-encoder, introduced as an alternative to binary encoding in A/D conversion, creates a quantization scheme robust with respect to quantizer imperfections by the use of a β-expansion, where 1 < β < 2. In this paper we introduce a more general encoder called the βα-encoder, that can offer more flexibility in design and robustness without any significant drawback on the exponential rate of co...

Journal: :IEEE Trans. Industrial Electronics 2000
Pragasen Pillay Yaguang Liu Ormonde G. Durham

Due to the magnetic nonlinearities, SRM drive control is complicated and normally requires a microprocessor or a DSP. This paper presents a simple and reliable SRM drive using an innovative encoder based on optical graphical programming technology. There is no microprocessor in the drive, no A/D or D/A circuitry, with a drive system that matches the simplicity of the motor construction. It feat...

2005
YAGNESWARAN SRIRAJA Tanja Karp Sunanda Mitra Brian Nutter Eric Sinzinger John Borrelli Y. Sriraja Jiangling Guo Philip King Roopesh Kumar Yeshwanth Srinivasan

The reliable transmission of compressed images across noisy transmission channels and networks prone to packet losses is considered. The problem is viewed from a source coding perspective, where the main constraints are maximum coding efficiency and minimum redundancy. Error-resilient mechanisms are incorporated into wavelet-based image encoding schemes to obtain robust data streams that withst...

2007
Tsvi Tlusty

In principle, to nd the optimal code one needs to optimize the tness functionH with respect to all its 2 m s degrees of freedom, the m s entries of the encoder e i and the m s entries of the decoder dj!, taking into account the m conservation relations for the encoder P i e i = 1 and the s conservation relations for the decoder P ! dj! = 1. However, although the degrees of freedom of the encode...

2002
Manjeet Singh Ian J. Wassell

A generic M-ary continuous phase modulation (CPM) scheme, with a modulation index of h = 1/M, can be decomposed into a continuous-phase encoder (CPE) followed by a memoryless modulator (MM), where the CPE is linear over the ring of integers modulo M. By using a channel encoder (CE), which is a convolutional encoder, to operate over the same ring of integers modulo M, the CE and the CPE can be c...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید