Singular Solutions with Exponential Growth for the (3+1)-D Wave Equation

Недю И. Попиванов, Тодор П. Попов, Рудолф Шерер - Разглеждат се четиримерни гранични задачи за нехомогенното вълново уравнение. Те са предложени от М. Протер като многомерни аналози на задачата на Дарбу в равнината. Известно е, че единственото обобщено решение може да има силна степенна особеност само в една гранична точка. Тази сингулярност е изолирана във върха на характеристичния конус и не се разпространява по конуса. Друг аспект на проблема е, че задачата не е фредхолмова, тъй като има безкрайномерно коядро. Предишни резултати сочат, че решението може да има най-много експоненциален ръст, но оставят открит въпроса дали наистина съществуват такива решения. Показваме, че отговора на този въпрос е положителен и строим обобщено решение на задачата на Протер с експоноциална особеност.

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.

Note on an Improvement of the Griesmer Bound for q-ary Linear Codes

Let nq(k, d) denote the smallest value of n for which an [n, k, d]q code exists for given integers k and d with k ≥ 3, 1 ≤ d ≤ q^(k−1) and a prime or a prime power q. The purpose of this note is to show that there exists a series of the functions h3,q, h4,q, ..., hk,q such that nq(k, d) can be expressed.