Anna Witenberg

Dr. Anna Witenberg

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
23 October 2024 in Electronics
Verified
Journal Article
Open access
PDF file
MPMarina Polyakova
Marina Polyakova
AWAnna Witenberg
Anna Witenberg
Aleksandr CariowAleksandr Cariow
Aleksandr Cariow
Fast algorithms for type-five discrete cosine transform (DCT-V) for sequences of input data of short length in the range of two to eight are elaborated in the paper. A matrix–vector product representation of the DCT-V is the starting point for designing the algorithms. In each specific case, the DCT-V matrices have remarkable structural properties that follow from the localization of identical entries within the matrices. Each matrix of the DCT-V has only a few distinct entries that are repeated at different positions in its structure. Using simple transformations such as permutations of the rows and/or columns of this matrix or its favorable decomposition into two or more matrix components, it is possible to obtain efficient matrix structures that lead to useful factorization schemes. Based on the suitable factorization schemes we obtained, we developed fast algorithms that reduce the number of arithmetic operations when calculating the DCT-V. The correctness of the obtained algorithmic solutions was justified theoretically using a strict mathematical background of each of them. The developed algorithms were then further tested using MATLAB R2023b software to finally confirm their correctness. Finally, an evaluation of the computational complexity for each obtained solution is presented. The evaluation results were compared with the computational complexity of the direct calculation of matrix–vector products. The resulting factorizations of the matrices of the DCT-V reduce the average number of multiplications by 57% but increase the number of additions by 29%.

19 February 2025 in Bulletin Of The Polish Academy Of Sciences-Technical Sciences
Verified
Journal Article
Open access
MPMarina Polyakova
Marina Polyakova
AWAnna Witenberg
Anna Witenberg
Aleksandr CariowAleksandr Cariow
Aleksandr Cariow
The fast algorithms of discrete sinusoidal transform of the fourth type (DST-IV) for small-length input data in the range of lengths from 2 to 9 are developed. Fast algorithms for short input data sequences are subsequently used as building blocks for designing fast algorithms of large-sized discrete transforms. Applying the fast DST-IV algorithms for small-size block processing can reduce overall system complexity and delay, allowing detailed signal processing. As a result of the literature review, two main approaches to developing fast discrete sine transform (DST) algorithms were identified, namely, the polynomial algebraic approach and the matrix factorization approach. In the paper, the last approach is exploited. A matrix-vector product expression of the DST-IV is the starting point for designing the fast algorithms. Then based on the repetition and arranging of the matrix elements, the factorisation of the matrices of coefficients of DST-IV is produced to reduce computational complexity. The correctness of the obtained algorithmic solutions was justified theoretically using a strict mathematical background of each of them. The elaborated algorithms were then further tested using MATLAB R2023b software to finally confirm their performance. The resulting factorizations of the DST-IV matrices reduce the number of multiplications by 63% but increase the number of additions by 8% on average in the range of signal sample numbers from 3 to 9. It has been observed that for even-length input sequences, the reduction in the number of multiplications is not as significant as for odd-length sequences. For some other well-known discrete trigonometric transforms (discrete Fourier transform, discrete Hartley transform) the opposite situation holds. The proposed DST-IV fast algorithms do not limit the length of the input data sequence to powers of two or three. The data flow graphs constructed for the proposed algorithms reveal their modular space-time structure suitable for VLSI implementation. Keywords: discrete sine transform; matrix factorization; fast algorithms; computational complexity; digital signal processing.

2 February 2017 in Journal of Marine Engineering & Technology
Verified
Journal Article
Closed access
KJKatarzyna Jagodzinska
Katarzyna Jagodzinska
AWAnna Witenberg
Anna Witenberg
MWMaciej Walkowiak
Maciej Walkowiak
The aim of this paper is to present a new method for generating self-supporting structures of a linear wire antenna. Antenna structure resembles monopole and consists of several sections connected in series. This type of antenna is suitable for marine radiocommunication systems. The generation method proposed in this paper is called TGA (tuned genetic algorithm) and it is based on two algorithms. First one is a typical genetic algorithm, while the second one allows us to modify antenna structure founded by the first algorithm. Mentioned modification involves rotating antenna sections. In this way, antenna parameters such as VSWR can be improved. What is more, with TGA, antenna susceptibility to changes in its geometry can be determined, which is helpful in antenna manufacture. To predict the performance of antennas, we used FEKO.

28 June 2019 in Journal of Telecommunications and Information Technology
Verified
Journal Article
Closed access
AWAnna Witenberg
Anna Witenberg
The paper presents a new hybrid method relied upon to solve integral equations of the electric field in time domain and to model linear antennas with pulse excitation. The method consists in a mixed, numerical-analytical description of the process that helps maintain the stability of calculations during the late time phase. As described in the analytical part, the modified spherical Bessel function of the first kind allows for extrapolation with a high degree of accuracy and loworder expressions. The modified spherical Bessel functions of the first kind are of the oscillating character, and their combination with the exponential factor makes them convenient for extrapolation of the answer of the antenna with pulse excitation. New functions are introduced to computational practice.

1 March 2017
Verified
Conference Paper
Closed access
MWMaciej Walkowiak
Maciej Walkowiak
AWAnna Witenberg
Anna Witenberg
KJKatarzyna Jagodzinska
Katarzyna Jagodzinska

24 August 2026 in Scientific Reports
Verified
Journal Article
Open access
PDF file
MPMarina Polyakova
Marina Polyakova
AWAnna Witenberg
Anna Witenberg
ACAleksandr Cariow
Aleksandr Cariow
A new discrete orthogonal transform for input data sequences of composite length is proposed in this paper. The introduced transform is called the discrete Tchebichef-like transform (DTLT). This transform generalizes the discrete Tchebichef transform (DTT). The DTLT matrix is constructed as a Kronecker product of small-sized DTT matrices. A fast algorithm for computing the proposed transform was developed. An example of constructing a DTLT algorithm for a source data sequence whose length is the product of positive integers is presented, and the corresponding data-flow graph is shown. The proposed transform was applied to speech signal denoising. A comparison of the DTLT with the discrete cosine transform (DCT) showed that the DTLT is more robust to white Gaussian noise. In addition, the DTLT has lower computational complexity than the DCT. For signals corrupted by correlated noise, the performance of the transform-domain approach depends on the noise power spectral density. It is more effective when the noise exhibits dominant spectral peaks. Among the considered transforms, the DTT provides the best overall performance, while the DTLT closely follows and demonstrates behavior comparable to that of the DTT. Experimental results demonstrate that the proposed DTLT and DTT achieve better speech enhancement than wavelet denoising on speech signals corrupted by low-level additive white Gaussian noise. However, wavelet denoising shows an advantage at higher noise levels (0-5 dB). For speech signals corrupted by additive colored noise, the proposed DTLT and DTT achieve speech intelligibility and perceptual quality comparable to wavelet denoising while providing more effective noise suppression, since wavelet denoising yields ISNR values close to zero. In addition, the DTLT requires significantly fewer arithmetic operations than the DCT and the discrete wavelet transform, particularly in terms of the number of multiplications, making it an efficient solution for speech denoising.