Gurantor department | Department of Computer Science | Credits | 7 |

Subject guarantor | prof. Ing. Ivan Zelinka, Ph.D. | Subject version guarantor | prof. Ing. Ivan Zelinka, Ph.D. |

Study level | undergraduate or graduate | Requirement | Optional |

Year | 1 | Semester | summer |

Study language | Czech | ||

Year of introduction | 2010/2011 | Year of cancellation | 2011/2012 |

Intended for the faculties | FEI | Intended for study types | Follow-up Master |

Instruction secured by | |||
---|---|---|---|

Login | Name | Tuitor | Teacher giving lectures |

MIL051 | Ing. Martin Milata |

Extent of instruction for forms of study | ||
---|---|---|

Form of study | Way of compl. | Extent |

Full-time | Credit and Examination | 2+3 |

Part-time | Credit and Examination | 4+6 |

General introduction to conditions of digital signal processing, which are called multimedia.
The frequentant will be introduced into actual technology of multimedia processing, as well as in the perspective methodologies in data processing. The circuit solutions of individual methods are introduced as block, as well as circuit sechemas and models.

Lectures

Tutorials

Theoretical basics of discipline "Multimedia Data Processing" are formed in the two Shannon theorems. The first theorem on coding without the error occurring forms the conditions of data compression. The key variable is entropy of source of messages or in other words the amount of redundancy in the message or data set. Entropy is a criterion for decision of the compression type. The compression will be without lost of information, if the value of entropy is not exceed, and it is with the lost of information if it is exceed. The second theorem is called on coding with the error occurring. This theorem is formed as conditions of error-control coding, which differ in the way of encoding and decoding calculation. The error occurring in the records is defined by conditions of physical properties of memory medium. The explanations are defined in general mathematical form, and it is abstracted from the fact, if the medium is the communication channel or memory. It is necessary to consider the both characters of media properties in the praxis.
The course is streamed to practical and effective processing of multimedia data in databases. Due to it interests in modern technologies based on the optical principles. These technologies are typical by the burst-errors. It is the reason for application the codes with non-binary alphabet as well as convolution codes. These methods are necessary for use in another applications, namely in error-control methods of video signal. The special chapter on the end of course on error-control coding is introduced so called turbo-codes, which are used in radio transmission of data and are considered as the new trend for producers of mobile devices of UMTS generation. Necessary part of data processing is its protection against enemy. The basic methods of ciphering of data are introduced in overview.

Adámek, J.: Foundations of Coding, John Wiley and Sons, Inc., ISBN 0-471-62187-0
Peterson, W.W.: Encoding and Error-Correcting Procedures, IEEE Trans. Inf. Theory (1960)
Shannon C. E.: A Mathematical Theory of Communication, Bell Syst. Tech. J. 27 (1948)

Vlček, K.: Turbo Codes and Implementation, Proc. of Internat. Conf. EDS'Y2K, ISBN 80-214-1780-3.

Subject has no prerequisities.

Subject has no co-requisities.

Lectures:
Shannon's coding theorem. Compression and safety codes.
Linear codes.
Hamming codes.
Golayovy codes.
Reed - Muller codes.
Decoding of Reed - Müller codes.
Cyclic codes.
Finite fields and polynomials.
BCH - codes for double and triple error correction.
Convolutional codes, turbo codes
Reed - Solomon codes. BCH code decoding algorithm. Euclid codes.
Encryption.
Encryption using public keys.
Multidimensional data structures.
Image database and its operations.
The database of video sequences, organization and retrieval.
Database with audio data.
Multidimensional database architecture, query languages.
Excursion.
Exercise:
Shannon's coding theorem. Compression and safety codes.
Linear codes.
Golayovy codes.
Reed - Muller codes.
Decoding of Reed - Müller codes.
Finite fields and polynomials.
BCH - codes for double and triple error correction.
Convolutional codes, turbo codes
Encryption.
Projects:
Design chain drives and multimedia processing algorithms.
Computer labs:
Information code components, construction safety codes, encoders and decoders.
Introduction to VHDL simulation system. Design and simulation of basic gates OR, AND, NOR and NAND.
Binary linear codes, code distance, body, generating matrix, control matrix, detection and localization errors. Simulation of complex logic functions of the EX-OR, design and simulations of the encoder and decoder parity code.
Construction of Hamming codes, repair of simple errors, the construction of encoders and decoders of Hamming codes. Simulation models of Hamming code encoder.
Properties codes G23 and G24; triple error correction procedure. Operations using the codes G23 and G24 and their use. Design and simulation blocks Hamming decoder.
Semester work: Design and Simulation of Hamming code decoder
Boolean functions, logic operations, Boolean polynomials. Individual work on semester project. Simulation of channel noise model using VHDL.
Repetition codes, RM codes of the first order, General RM-codes. The calculation procedure to decode the R-M-codes. Design algorithm decoder R-M-codes.
Operations with polynomials, addition, multiplication and division of binary polynomials. The rest of the division. Generating polynomial. Control polynomial. LFSR simulation.
Roots of polynomials and primitive elements of procedure, characteristics of housing, minimal polynomials, finite fields.
Written mid-term exam.
Matrix decoding method, determining the syndrome, and multiplying the sum of geometric series. Determination of the locator error. Procedure for repairs.
Linearity, time invariance and causality convolutional codes. Free distance code, sequential decoding, multi-level decoding, Viterbi algorithm, Viterbi algorithm implementation using DSP and ASIC circuits.
Code with distance d. The planned BCH - code of length q-1. Creating a good binary codes. Simulation of the RS decoder block code using VHDL functional models. Determining the greatest common divisor. Assumptions BCH decoding - code. Locator and evaluator error, make repairs. External and internal codes and their
ties.
Single encryption key, use simplexového code encryption using random words. Simulation and code breaker encryptor using pseudo-random encryption words. Reed - Muller code R (1,3).
The method of large prime numbers, the implementation methods. A method based on the luggage problem. DES - algorithm and its use in banking. Midterm exam. Submitting the semester work.

Task name | Type of task | Max. number of points
(act. for subtasks) | Min. number of points | Max. počet pokusů |
---|---|---|---|---|

Exercises evaluation and Examination | Credit and Examination | 100 | 51 | |

Exercises evaluation | Credit | |||

Examination | Examination | 3 |

Show history

Conditions for subject completion and attendance at the exercises within ISP:

Show history

Academic year | Programme | Branch/spec. | Spec. | Zaměření | Form | Study language | Tut. centre | Year | W | S | Type of duty | |
---|---|---|---|---|---|---|---|---|---|---|---|---|

2011/2012 | (N2647) Information and Communication Technology | (2612T025) Computer Science and Technology | P | Czech | Ostrava | 1 | Optional | study plan | ||||

2011/2012 | (N2647) Information and Communication Technology | (2612T025) Computer Science and Technology | K | Czech | Ostrava | 1 | Optional | study plan | ||||

2011/2012 | (N2647) Information and Communication Technology | (2612T059) Mobile Technology | P | Czech | Ostrava | 1 | Optional | study plan | ||||

2011/2012 | (N2647) Information and Communication Technology | (2612T059) Mobile Technology | K | Czech | Ostrava | 1 | Optional | study plan | ||||

2010/2011 | (N2647) Information and Communication Technology | (2612T025) Computer Science and Technology | P | Czech | Ostrava | 1 | Optional | study plan | ||||

2010/2011 | (N2647) Information and Communication Technology | (2612T025) Computer Science and Technology | K | Czech | Ostrava | 1 | Optional | study plan | ||||

2010/2011 | (N2647) Information and Communication Technology | (2612T059) Mobile Technology | P | Czech | Ostrava | 1 | Optional | study plan | ||||

2010/2011 | (N2647) Information and Communication Technology | (2612T059) Mobile Technology | K | Czech | Ostrava | 1 | Optional | study plan |

Block name | Academic year | Form of study | Study language | Year | W | S | Type of block | Block owner |
---|

Předmět neobsahuje žádné hodnocení.