On the Error-Free Computation of Fast Cosine Transform

We extend our previous work into error-free representations of transform basis functions by presenting a novel error-free encoding scheme for the fast implementation of a Linzer-Feig Fast Cosine Transform (FCT) and its inverse. We discuss an 8x8 L-F scaled Discrete Cosine Transform where the architecture uses a new algebraic integer quantization of the 1-D radix-8 DCT that allows the separable computation of a 2-D DCT without any intermediate number representation conversions. The resulting architecture is very regular and reduces latency by 50% compared to a previous error-free design, with virtually the same hardware cost.

Multiplierless DCT Algorithm for Image Compression Applications

This paper presents a novel error-free (infinite-precision) architecture for the fast implementation of 8x8 2-D Discrete Cosine Transform. The architecture uses a new algebraic integer encoding of a 1-D radix-8 DCT that allows the separable computation of a 2-D 8x8 DCT without any intermediate number representation conversions. This is a considerable improvement on previously introduced algebraic integer encoding techniques to compute both DCT and IDCT which eliminates the requirements to approximate the transformation matrix ele- ments by obtaining their exact representations and hence mapping the transcendental functions without any errors. Apart from the multiplication-free nature, this new mapping scheme fits to this algorithm, eliminating any computational or quantization errors and resulting short-word-length and high-speed-design.

Symplectic Representation of a Braid Group on 3-Sheeted Covers of the Riemann Sphere

We define Picard cycles on each smooth three-sheeted Galois cover C of the Riemann sphere. The moduli space of all these algebraic curves is a nice Shimura surface, namely a symmetric quotient of the projective plane uniformized by the complex two-dimensional unit ball. We show that all Picard cycles on C form a simple orbit of the Picard modular group of Eisenstein numbers. The proof uses a special surface classification in connection with the uniformization of a classical Picard-Fuchs system. It yields an explicit symplectic representation of the braid groups (coloured or not) of four strings.

The Knowledge in Automotive Field Representation with Modern Technologies

Modern technologies have changed the way of presenting information in archives. This makes it possible to introduce new services, which was unimaginable a few years ago. Digitalization, security and virtual presentation of objects in the sphere of motoring by application of technologies, based on knowledge about how to create digital resources is the theme of this project. The aim of AutoKnow project is to carry out a research and create a multi- media digital archive AutoKnow and Experimental Virtual Motor Laboratory (EVML) with Motor Library (ML) from digital multi-media patterns from a selected group of objects in the sphere of automobile technology, presented by NMU. This makes it possible to widely apply multi-media collections in automobile engineering, teaching, research work in that sphere and serve the interests of a large number of auto-amateurs as well in Bulgaria. The research and development of АutoKnow is in the following mutually related fields: - Creation and annotation of collections of objects in the sphere of automobiles; - Creation, analysis and security of a digital archive AutoKnow; - Design and creation of Digital Motor Library; - Socially-oriented applications in education, scientific studies and Experimental Virtual Motor Laboratory; - Informational System for teaching and testing of knowledge in the sphere of automobiles MindCheck.