Title :
Minimization process of the encoder states
Author :
El-Azm, Atef Abou
Author_Institution :
Fac. of Electron. Eng., Menoufia Univ., Egypt
Abstract :
This paper deals with an algorithmic method of the assignment of lower limits on the number of the encoder states to different coded signals. The model of the encoder defined in this paper is universal as it is well suited for most of practical transmission codes, and it specifies spaces of Markov chains describing the process in the encoder. State probabilities for some codes are computed for the case of statistically independent data. It is advantageous to minimize the number of states in order to simplify the coding and decoding circuits, and successful logic circuits can be designed for the block encoding
Keywords :
Markov processes; computational complexity; encoding; finite automata; minimisation; probability; sequential machines; Markov chains; algorithmic method; block encoding; coding; decoding; encoder states; finite state model; logic circuits; minimization; state probabilities; statistically independent data; transmission codes; Automata; Costs; Decoding; Digital systems; Input variables; Logic circuits; Minimization; State-space methods;
Conference_Titel :
Instrumentation and Measurement Technology Conference, 1994. IMTC/94. Conference Proceedings. 10th Anniversary. Advanced Technologies in I & M., 1994 IEEE
Conference_Location :
Hamamatsu
Print_ISBN :
0-7803-1880-3
DOI :
10.1109/IMTC.1994.352088
