DMDorota Majorkowska-Mech

Dorota Majorkowska-Mech

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Dorota Majorkowska-Mech has a total of 6 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Small-Size Algorithms for Quaternion Discrete Fourier Transform

    by Aleksandr Cariow, Dorota Majorkowska-Mech

    The quaternion discrete Fourier transform (QDFT) is a powerful tool in modern digital signal processing, even though until recently this transformation seemed exotic. In recent years, quite a lot of publications have appeared devoted to effective ways to calculate this transformation. In particular, in one of our previous publications, we presented an economical algorithm for calculating one-dimensional QDFT and showed that this algorithm has the lowest computational complexity among all known algorithms of this type. This generalized algorithm is suitable for computing the QDFT of any sequence in which the number of elements is a power of two. However, as it turned out, there are additional possibilities that make it possible to further reduce the computational complexity of the developed algorithm for each specific N. In this article, we provide some examples of the synthesis of such algorithms for short-length input sequences (samples of signals). In particular, algorithms for N ∊ {2, 3, 4, 5, 6, 7, 8} are presented. A parallel implementation of the proposed algorithm allows for saving more than half of the number of required multipliers in each case compared with the parallel implementation of the naive methods of calculation.

  • Open Access

    One-Dimensional Quaternion Discrete Fourier Transform and an Approach to Its Fast Computation

    by Dorota Majorkowska-Mech, Aleksandr Cariow

    This paper proposes a new method for calculating the quaternion discrete Fourier transform for one-dimensional data. Although the computational complexity of the proposed method still belongs to the O(Nlog2N) class, it allows us to reduce the total number of arithmetic operations required to perform it compared to other known methods for computing this transform. Moreover, compared to the method using symplectic decomposition, the presented method does not require changing the basis in the subspace of pure quaternions and, consequently, calculating the new basis vectors and change-of-basis matrix.


  • Open Access

    Some FFT Algorithms for Small-Length Real-Valued Sequences

    by Dorota Majorkowska-Mech, Aleksandr Cariow

    This paper proposes fast algorithms for computing the discrete Fourier transform for real-valued sequences of lengths from 3 to 9. Since calculating the real-valued DFT using the complex-valued FFT is redundant regarding the number of needed operations, the developed algorithms do not operate on complex numbers. The algorithms are described in matrix–vector notation and their data flow diagrams are shown.


  • Open Access

    Discrete Pseudo-Fractional Fourier Transform and Its Fast Algorithm

    by Dorota Majorkowska-Mech, Aleksandr Cariow

    In this article, we introduce a new discrete fractional transform for data sequences whose size is a composite number. The main kernels of the introduced transform are small-size discrete fractional Fourier transforms. Since the introduced transformation is not, in the generally known sense, a classical discrete fractional transform, we call it discrete pseudo-fractional Fourier transform. We also provide a generalization of this new transform, which depends on many fractional parameters. A fast algorithm for computing the introduced transform is developed and described.


  • Discrete Pseudo-Fractional Hadamard Transform and its Fast Algorithm

    by Dorota Majorkowska-Mech, Aleksandr Cariow

    In this paper a new discrete fractional transform for data vectors whose size N is a power of two is proposed. The basic operation of the introduced transform is a discrete fractional Hadamard transform. Since the described transform is not a classical discrete fractional Hadamard transform in its pure form, we called it a pseudo-fractional discrete Hadamard transform. A generalization of the new transform is also defined so that it depends on many parameters. Fast algorithm for calculating the proposed transform is developed.


  • Open Access

    An algorithm for quaternion-based 3D rotation

    by Aleksandr Cariow, Galina Cariowa, Dorota Majorkowska-Mech

    In this work a new algorithm for quaternion-based spatial rotation is presented which reduces the number of underlying real multiplications. The performing of...


  • Open Access

    Some Structures of Parallel VLSI-Oriented Processing Units for Implementation of Small Size Discrete Fractional Fourier Transforms

    by Aleksandr Cariow, Janusz Papliński, Dorota Majorkowska-Mech

    Discrete orthogonal transforms such as the discrete Fourier transform, discrete cosine transform, discrete Hartley transform, etc., are important tools in numerical analysis, signal processing, and statistical methods. The successful application of transform techniques relies on the existence of efficient fast algorithms for their implementation. A special place in the list of transformations is occupied by the discrete fractional Fourier transform (DFrFT). In this paper, some parallel algorithms and processing unit structures for fast DFrFT implementation are proposed. The approach is based on the resourceful factorization of DFrFT matrices. Some parallel algorithms and processing unit structures for small size DFrFTs such as N = 2, 3, 4, 5, 6, and 7 are presented. In each case, we describe only the most important part of the structures of the processing units, neglecting the description of the auxiliary units and the control circuits.


  • Open Access

    Gear and Runge–Kutta Numerical Discretization Methods in Differential Equations of Adsorption in Adsorption Heat Pump

    by Katarzyna Zwarycz-Makles, Dorota Majorkowska-Mech

    The main aim of this paper was to find the correct method of calculating equations of heat and mass transfer for the adsorption process and to calculate it numerically in reasonable time and with proper accuracy. An adsorption heat pump with a silica gel adsorbent and water adsorbate is discussed. We developed a mathematical model of temperature and uptake changes in the adsorber/desorber comprising the set of heat and mass balance partial differential equations (PDEs), together with the initial and boundary conditions and solved it by the numerical method of lines (NMOL). Spatial discretization was performed with equally spaced axial nodes and the PDEs were reduced to a set of ordinary differential equations (ODEs). We focused on the comparison of results obtained when the set of heat and mass balance ODEs for an adsorber was solved using: (1) the Runge–Kutta fixed step size fourth-order method (RKfixed), (2) the Runge–Kutta–Fehlberg 4.5th-order method with a variable step size (RK45), and (3) the Gear Backward Differentiation Formulae numerical (Gear BDF) methods. In our experience, all three types of ODE numerical methods (RKfixed, RK45, and Gear BDF) can be applied in simple models to model an adsorber with attention on their limitations. The Gear BDF method usually requires much fewer steps than the RK45 method for almost the same calculating time. RK methods require many more steps to obtain results, and the calculating time depends on accuracy or defined time step. Moreover, one should pay attention to the number of nodes or possible oscillations.


  • A Fast Algorithm for Quaternion-Based 4D Rotation

    by Aleksandr Cariow, Galina Cariowa, Dorota Majorkowska-Mech