The convoluted history of minimal encoders
نویسنده
چکیده
Kalman’s classic formula “minimal ⇔ controllable and observable” fundamentally solves the minimality problem of linear systems theory. However, it took 35 years until Kalman’s formula was found to apply also to convolutional encoders.
منابع مشابه
Robust Distributed Source Coding with Arbitrary Number of Encoders and Practical Code Design Technique
The robustness property can be added to DSC system at the expense of reducing performance, i.e., increasing the sum-rate. The aim of designing robust DSC schemes is to trade off between system robustness and compression efficiency. In this paper, after deriving an inner bound on the rate–distortion region for the quadratic Gaussian MDC based RDSC system with two encoders, the structure of...
متن کاملHigh-rate systematic recursive convolutional encoders: minimal trellis and code search
We consider high-rate systematic recursive convolutional encoders to be adopted as constituent encoders in turbo schemes. Douillard and Berrou showed that, despite its complexity, the construction of high-rate turbo codes by means of high-rate constituent encoders is advantageous over the construction based on puncturing rate-1/2 constituent encoders. To reduce the decoding complexity of high-r...
متن کاملHigh-Speed and Low-Power Flash ADCs Encoder
This paper presents a high-speed, low-power and low area encoder for implementation of flash ADCs. Key technique for design of this encoder is performed by convert the conventional 1-of-N thermometer code to 2-of-M codes (M = ¾ N). The proposed encoder is composed from two-stage; in the first stage, thermometer code are converted to 2-of-M codes by used 2-input AND and 4-i...
متن کاملSystematic encoders for convolutional codes and their application to turbo codes
Abst rac t Systematic recursive convolutional encoders have been shown to play a crucial role in the design and implementation ofparallel concatenated codes (“turbo codes77). We present here a canonical structure of minimal linear systematic rate k / n encoders and use it in the search for good constituent codes of parallel concatenated codes. Tables of the best encoders for various rates are a...
متن کاملA linear algebra approach to minimal convolutional encoders
This semitutorial paper starts with a review of some of Fomey’s contributions on the algebraic structure of convolutional encoders on which some new results on minimal convolutional encoders rest. An example is given of a basic convolutional encoding matrix whose number of abstract states is minimal over all equivalent encoding matrices. However, this encoding matrix can be realized with a mini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997