Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "orthogonal transform" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-12 z 12
    Tytuł:
    Autofocusing with the help of orthogonal series transforms
    Autorzy:
    Śliwiński, P.
    Powiązania:
    https://bibliotekanauki.pl/articles/226176.pdf
    Data publikacji:
    2010
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    autofocusing
    discrete orthogonal systems
    fast orthogonal transform
    transform coding
    Opis:
    An autofocus algorithm employing orthogonal series expansions is proposed. Several instances of the generic algorithm, based on discrete trigonometric, polynomial and wavelet series, are reviewed. The algorithms are easy to implement in the transform coders used in digital cameras. Formal analysis of the algorithm properties is illustrated in experiments. Some practical issues are also discussed.
    Źródło:
    International Journal of Electronics and Telecommunications; 2010, 56, 1; 33-39
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Execution time prediction model for parallel GPU realizations of discrete transforms computation algorithms
    Autorzy:
    Puchala, Dariusz
    Stokfiszewski, Kamil
    Wieloch, Kamil
    Powiązania:
    https://bibliotekanauki.pl/articles/2173530.pdf
    Data publikacji:
    2022
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    graphics processing unit
    GPU
    execution time prediction model
    discrete wavelet transform
    DWT
    lattice structure
    convolution-based approach
    orthogonal transform
    orthogonal filter banks
    time effectiveness
    prediction accuracy
    Opis:
    Parallel realizations of discrete transforms (DTs) computation algorithms (DTCAs) performed on graphics processing units (GPUs) play a significant role in many modern data processing methods utilized in numerous areas of human activity. In this paper the authors propose a novel execution time prediction model, which allows for accurate and rapid estimation of execution times of various kinds of structurally different DTCAs performed on GPUs of distinct architectures, without the necessity of conducting the actual experiments on physical hardware. The model can serve as a guide for the system analyst in making the optimal choice of the GPU hardware solution for a given computational task involving particular DT calculation, or can help in choosing the best appropriate parallel implementation of the selected DT, given the limitations imposed by available hardware. Restricting the model to exhaustively adhere only to the key common features of DTCAs enables the authors to significantly simplify its structure, leading consequently to its design as a hybrid, analytically–simulational method, exploiting jointly the main advantages of both of the mentioned techniques, namely: time-effectiveness and high prediction accuracy, while, at the same time, causing mutual elimination of the major weaknesses of both of the specified approaches within the proposed solution. The model is validated experimentally on two structurally different parallel methods of discrete wavelet transform (DWT) computation, i.e. the direct convolutionbased and lattice structure-based schemes, by comparing its prediction results with the actual measurements taken for 6 different graphics cards, representing a fairly broad spectrum of GPUs compute architectures. Experimental results reveal the overall average execution time and prediction accuracy of the model to be at a level of 97.2%, with global maximum prediction error of 14.5%, recorded throughout all the conducted experiments, maintaining at the same time high average evaluation speed of 3.5 ms for single simulation duration. The results facilitate inferring the model generality and possibility of extrapolation to other DTCAs and different GPU architectures, which along with the proposed model straightforwardness, time-effectiveness and ease of practical application, makes it, in the authors’ opinion, a very interesting alternative to the related existing solutions.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2022, 70, 1; e139393, 1--30
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Execution time prediction model for parallel GPU realizations of discrete transforms computation algorithms
    Autorzy:
    Puchala, Dariusz
    Stokfiszewski, Kamil
    Wieloch, Kamil
    Powiązania:
    https://bibliotekanauki.pl/articles/2173636.pdf
    Data publikacji:
    2022
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    graphics processing unit
    GPU
    execution time prediction model
    discrete wavelet transform
    DWT
    lattice structure
    convolution-based approach
    orthogonal transform
    orthogonal filter banks
    time effectiveness
    prediction accuracy
    procesor graficzny
    model przewidywania czasu wykonania
    dyskretna transformata falkowa
    struktura sieciowa
    podejście oparte na splotach
    przekształcenia ortogonalne
    ortogonalne banki filtrów
    efektywność czasowa
    dokładność przewidywania
    Opis:
    Parallel realizations of discrete transforms (DTs) computation algorithms (DTCAs) performed on graphics processing units (GPUs) play a significant role in many modern data processing methods utilized in numerous areas of human activity. In this paper the authors propose a novel execution time prediction model, which allows for accurate and rapid estimation of execution times of various kinds of structurally different DTCAs performed on GPUs of distinct architectures, without the necessity of conducting the actual experiments on physical hardware. The model can serve as a guide for the system analyst in making the optimal choice of the GPU hardware solution for a given computational task involving particular DT calculation, or can help in choosing the best appropriate parallel implementation of the selected DT, given the limitations imposed by available hardware. Restricting the model to exhaustively adhere only to the key common features of DTCAs enables the authors to significantly simplify its structure, leading consequently to its design as a hybrid, analytically–simulational method, exploiting jointly the main advantages of both of the mentioned techniques, namely: time-effectiveness and high prediction accuracy, while, at the same time, causing mutual elimination of the major weaknesses of both of the specified approaches within the proposed solution. The model is validated experimentally on two structurally different parallel methods of discrete wavelet transform (DWT) computation, i.e. the direct convolutionbased and lattice structure-based schemes, by comparing its prediction results with the actual measurements taken for 6 different graphics cards, representing a fairly broad spectrum of GPUs compute architectures. Experimental results reveal the overall average execution time and prediction accuracy of the model to be at a level of 97.2%, with global maximum prediction error of 14.5%, recorded throughout all the conducted experiments, maintaining at the same time high average evaluation speed of 3.5 ms for single simulation duration. The results facilitate inferring the model generality and possibility of extrapolation to other DTCAs and different GPU architectures, which along with the proposed model straightforwardness, time-effectiveness and ease of practical application, makes it, in the authors’ opinion, a very interesting alternative to the related existing solutions.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2022, 70, 1; art. no. e139393
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Execution time prediction model for parallel GPU realizations of discrete transforms computation algorithms
    Autorzy:
    Puchala, Dariusz
    Stokfiszewski, Kamil
    Wieloch, Kamil
    Powiązania:
    https://bibliotekanauki.pl/articles/2173537.pdf
    Data publikacji:
    2022
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    graphics processing unit
    GPU
    execution time prediction model
    discrete wavelet transform
    DWT
    lattice structure
    convolution-based approach
    orthogonal transform
    orthogonal filter banks
    time effectiveness
    prediction accuracy
    procesor graficzny
    model przewidywania czasu wykonania
    dyskretna transformata falkowa
    struktura sieciowa
    podejście oparte na splotach
    przekształcenia ortogonalne
    ortogonalne banki filtrów
    efektywność czasowa
    dokładność przewidywania
    Opis:
    Parallel realizations of discrete transforms (DTs) computation algorithms (DTCAs) performed on graphics processing units (GPUs) play a significant role in many modern data processing methods utilized in numerous areas of human activity. In this paper the authors propose a novel execution time prediction model, which allows for accurate and rapid estimation of execution times of various kinds of structurally different DTCAs performed on GPUs of distinct architectures, without the necessity of conducting the actual experiments on physical hardware. The model can serve as a guide for the system analyst in making the optimal choice of the GPU hardware solution for a given computational task involving particular DT calculation, or can help in choosing the best appropriate parallel implementation of the selected DT, given the limitations imposed by available hardware. Restricting the model to exhaustively adhere only to the key common features of DTCAs enables the authors to significantly simplify its structure, leading consequently to its design as a hybrid, analytically–simulational method, exploiting jointly the main advantages of both of the mentioned techniques, namely: time-effectiveness and high prediction accuracy, while, at the same time, causing mutual elimination of the major weaknesses of both of the specified approaches within the proposed solution. The model is validated experimentally on two structurally different parallel methods of discrete wavelet transform (DWT) computation, i.e. the direct convolutionbased and lattice structure-based schemes, by comparing its prediction results with the actual measurements taken for 6 different graphics cards, representing a fairly broad spectrum of GPUs compute architectures. Experimental results reveal the overall average execution time and prediction accuracy of the model to be at a level of 97.2%, with global maximum prediction error of 14.5%, recorded throughout all the conducted experiments, maintaining at the same time high average evaluation speed of 3.5 ms for single simulation duration. The results facilitate inferring the model generality and possibility of extrapolation to other DTCAs and different GPU architectures, which along with the proposed model straightforwardness, time-effectiveness and ease of practical application, makes it, in the authors’ opinion, a very interesting alternative to the related existing solutions.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2022, 70, 1; e139393, 1--30
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Execution time prediction model for parallel GPU realizations of discrete transforms computation algorithms
    Autorzy:
    Puchala, Dariusz
    Stokfiszewski, Kamil
    Wieloch, Kamil
    Powiązania:
    https://bibliotekanauki.pl/articles/2173635.pdf
    Data publikacji:
    2022
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    graphics processing unit
    GPU
    execution time prediction model
    discrete wavelet transform
    DWT
    lattice structure
    convolution-based approach
    orthogonal transform
    orthogonal filter banks
    time effectiveness
    prediction accuracy
    procesor graficzny
    model przewidywania czasu wykonania
    dyskretna transformata falkowa
    struktura sieciowa
    podejście oparte na splotach
    przekształcenia ortogonalne
    ortogonalne banki filtrów
    efektywność czasowa
    dokładność przewidywania
    Opis:
    Parallel realizations of discrete transforms (DTs) computation algorithms (DTCAs) performed on graphics processing units (GPUs) play a significant role in many modern data processing methods utilized in numerous areas of human activity. In this paper the authors propose a novel execution time prediction model, which allows for accurate and rapid estimation of execution times of various kinds of structurally different DTCAs performed on GPUs of distinct architectures, without the necessity of conducting the actual experiments on physical hardware. The model can serve as a guide for the system analyst in making the optimal choice of the GPU hardware solution for a given computational task involving particular DT calculation, or can help in choosing the best appropriate parallel implementation of the selected DT, given the limitations imposed by available hardware. Restricting the model to exhaustively adhere only to the key common features of DTCAs enables the authors to significantly simplify its structure, leading consequently to its design as a hybrid, analytically–simulational method, exploiting jointly the main advantages of both of the mentioned techniques, namely: time-effectiveness and high prediction accuracy, while, at the same time, causing mutual elimination of the major weaknesses of both of the specified approaches within the proposed solution. The model is validated experimentally on two structurally different parallel methods of discrete wavelet transform (DWT) computation, i.e. the direct convolutionbased and lattice structure-based schemes, by comparing its prediction results with the actual measurements taken for 6 different graphics cards, representing a fairly broad spectrum of GPUs compute architectures. Experimental results reveal the overall average execution time and prediction accuracy of the model to be at a level of 97.2%, with global maximum prediction error of 14.5%, recorded throughout all the conducted experiments, maintaining at the same time high average evaluation speed of 3.5 ms for single simulation duration. The results facilitate inferring the model generality and possibility of extrapolation to other DTCAs and different GPU architectures, which along with the proposed model straightforwardness, time-effectiveness and ease of practical application, makes it, in the authors’ opinion, a very interesting alternative to the related existing solutions.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2022, 70, 1; art. no. e139393
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Effective lattice structures for separable two-dimensional orthogonal wavelet transforms
    Autorzy:
    Puchala, Dariusz
    Powiązania:
    https://bibliotekanauki.pl/articles/2173687.pdf
    Data publikacji:
    2022
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    two-dimensional orthogonal discrete wavelet transform
    lattice structures
    image processing
    VLSI circuits
    dwuwymiarowa ortogonalna dyskretna transformata falkowa
    struktury kratowe
    przetwarzanie obrazu
    obwód VLSI
    Opis:
    Discrete two-dimensional orthogonal wavelet transforms find applications in many areas of analysis and processing of digital images. In a typical scenario the separability of two-dimensional wavelet transforms is assumed and all calculations follow the row-column approach using one-dimensional transforms. For the calculation of one-dimensional transforms the lattice structures, which can be characterized by high computational efficiency and non-redundant parametrization, are often used. In this paper we show that the row-column approach can be excessive in the number of multiplications and rotations. Moreover, we propose the novel approach based on natively two-dimensional base operators which allows for significant reduction in the number of elementary operations, i.e., more than twofold reduction in the number of multiplications and fourfold reduction of rotations. The additional computational costs that arise instead include an increase in the number of additions, and introduction of bit-shift operations. It should be noted, that such operations are significantly less demanding in hardware realizations than multiplications and rotations. The performed experimental analysis proves the practical effectiveness of the proposed approach.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2022, 70, 3; art. no. e141005
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Implementation of the Wavelet Transform with SSE Extensions
    Autorzy:
    Łyszkowski, T.
    Wiechno, T.
    Yatsymirskyy, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/108711.pdf
    Data publikacji:
    2013
    Wydawca:
    Społeczna Akademia Nauk w Łodzi
    Tematy:
    Orthogonal Filters
    discrete wavelet transform
    SSE extensions
    Opis:
    It has been shown that application of assembly implementation of Streaming SIMD Extensions (SSE) shortens the time needed to apply filtration in twochannel filter bank by tenfold, comparing to non-optimized version, written in Microsoft Visual C++ 2010 Express, without assembler extensions. The implementation described in this paper can be applied to computation of Discrete Wavelet Transform on general-purpose processors.
    Źródło:
    Journal of Applied Computer Science Methods; 2013, 5 No. 2; 123-135
    1689-9636
    Pojawia się w:
    Journal of Applied Computer Science Methods
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Performance analysis of DFT-S-OFDM waveform for Li-Fi systems
    Autorzy:
    Hussin, S.
    Shalaby, E. Mansour
    Powiązania:
    https://bibliotekanauki.pl/articles/2063891.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Stowarzyszenie Elektryków Polskich
    Tematy:
    light-fidelity
    visible light communications
    orthogonal frequency division multiplexing
    discrete Fourier transform spread
    peak-to-average power ratio
    Opis:
    In this paper, the effect of an indoor visible light communication channel is studied. Moreover, the analysis of the received power distribution of the photodiode in the line of sight and the first reflection of the channel without line of sight with several parameters is simulated. Two different waveforms are explained in detail. Orthogonal frequency division multiplexing has been widely adopted in radio frequency and optical communication systems. One of the most important disadvantages of the orthogonal frequency division multiplexing signal is the high peak-to-average power ratio. Therefore, it is important to minimize the peak-to-average power ratio in the visible light communication systems more than in radio-frequency wireless applications. In the visible light communication systems, the high peak-to-average power ratio produces a high DC bias which reduces power efficiency of the system. A discrete Fourier transform spread orthogonal frequency division multiplexing is proposed to be used in wireless communication systems; its ability to minimize peak-to-average power ratio has been tested. The analysis of two different subcarrier allocation methods for the discrete Fourier transform-spread subcarriers, as well as the examination of two distinct subcarrier allocation strategies, distributed and localized mapping, are investigated and studied. The effects of an accurate new sub-band mapping for the localized discrete Fourier transform spread orthogonal frequency division multiplexing scheme are presented in this paper. The light-fidelity system performance of the orthogonal frequency division multiplexing and discrete Fourier transform spread orthogonal frequency division multiplexing with different sub-mapping techniques are simulated with Matlab™. A system performance size of bit error rate and peak-to-average power ratio are obtained, as well.
    Źródło:
    Opto-Electronics Review; 2021, 29, 4; 167--174
    1230-3402
    Pojawia się w:
    Opto-Electronics Review
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Performance evaluation of UFMC-based VLC systems using a modified SLM technique
    Autorzy:
    Mansour Shalaby, E.
    Dessouky, M.
    Hussin, S.
    Powiązania:
    https://bibliotekanauki.pl/articles/1818194.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Stowarzyszenie Elektryków Polskich
    Tematy:
    universal filtered multi-carrier
    orthogonal frequency division
    multiplexing
    peak-to-average power ratio
    selected-mapping
    discrete Hartley transform precoding
    Opis:
    Universal filtered multi-carrier (UFMC) is being studied as the favourable waveforms supporting the visible light communication broadcasting systems. However, the UFMC system faces a serious performance degradation on the transmitter side due to its high peak-to-average power ratio (PAPR). High PAPR of the signal is an analytical intention parameter for mobile networks, and it is necessary to minimize it as much as possible. This paper focuses on the PAPR reduction of the UFMC scheme. An efficient hybrid method of the PAPR reduction has been proposed and analysed through the Matlab™ simulation. The proposed hybrid scheme consists of a mixture of the selected-mapping method and the discrete Hartley transform precoding for a UFMC system (SLM-DHT-P-UFMC). The simulation results show that the proposed hybrid system has a better PAPR reduction performance compared to traditional SLM-UFMC and DHT-P-UFMC systems. Hence, LM-DHT-P-UFMC is considered to be the suggested scheme in visible light communication broadcasting systems.
    Źródło:
    Opto-Electronics Review; 2021, 29, 3; 85--90
    1230-3402
    Pojawia się w:
    Opto-Electronics Review
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Performance evaluation of UFMC-based VLC systems using a modified SLM technique
    Autorzy:
    Mansour Shalaby, E.
    Dessouky, M.
    Hussin, S.
    Powiązania:
    https://bibliotekanauki.pl/articles/1818201.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Stowarzyszenie Elektryków Polskich
    Tematy:
    universal filtered multi-carrier
    orthogonal frequency division
    multiplexing
    peak-to-average power ratio
    selected-mapping
    discrete Hartley transform precoding
    Opis:
    Universal filtered multi-carrier (UFMC) is being studied as the favourable waveforms supporting the visible light communication broadcasting systems. However, the UFMC system faces a serious performance degradation on the transmitter side due to its high peak-to-average power ratio (PAPR). High PAPR of the signal is an analytical intention parameter for mobile networks, and it is necessary to minimize it as much as possible. This paper focuses on the PAPR reduction of the UFMC scheme. An efficient hybrid method of the PAPR reduction has been proposed and analysed through the Matlab™ simulation. The proposed hybrid scheme consists of a mixture of the selected-mapping method and the discrete Hartley transform precoding for a UFMC system (SLM-DHT-P-UFMC). The simulation results show that the proposed hybrid system has a better PAPR reduction performance compared to traditional SLM-UFMC and DHT-P-UFMC systems. Hence, LM-DHT-P-UFMC is considered to be the suggested scheme in visible light communication broadcasting systems.
    Źródło:
    Opto-Electronics Review; 2021, 29, 3; 85--90
    1230-3402
    Pojawia się w:
    Opto-Electronics Review
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Determining the weights of a Fourier series neural network on the basis of the multidimensional discrete Fourier transform
    Autorzy:
    Halawa, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/907904.pdf
    Data publikacji:
    2008
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    sieć neuronowa ortogonalna
    szereg Fouriera
    transformata Fouriera
    aproksymacja
    system nieliniowy
    orthogonal neural networks
    Fourier series
    fast Fourier transform
    approximation
    nonlinear system
    Opis:
    This paper presents a method for training a Fourier series neural network on the basis of the multidimensional discrete Fourier transform. The proposed method is characterized by low computational complexity. The article shows how the method can be used for modelling dynamic systems.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2008, 18, 3; 369-375
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Multisine Approximation of Multivariate Orthogonal Random Processes
    Autorzy:
    Figwer, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/908295.pdf
    Data publikacji:
    1999
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    proces stochastyczny
    procesy wielowymarowe
    transformata Fouriera
    simulation random processes
    multivariate orthogonal random processes
    simulated indentification
    multisine random time-series
    fast Fourier transform
    Opis:
    An approach to the synthesis and simulation of wide-sense stationary multivariate orthogonal random processes defined by their power spectral density matrices is presented. The approach is based on approximating the non-parametric power spectral density representation by the periodogram matrix of a multivariate orthogonal multisine random time-series. This periodogram matrix is used to construct the corresponding spectrum of the multivariate orthogonal multisine random time-series (synthesis). Application of the inverse finite discrete Fourier transform to this spectrum results in a multivariate orthogonal multisine random time-series with the predefined periodogram matrix (simulation). The properties of multivariate orthogonal multisine random process approximations obtained in this way are discussed. Attention is paid to asymptotic gaussianess.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 1999, 9, 2; 401-419
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-12 z 12

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies