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ę "Fourier transform" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-7 z 7
    Tytuł:
    Template Matching Using Improved Rotations Fourier Transform Method
    Autorzy:
    Wijaya, Marvin Chandra
    Powiązania:
    https://bibliotekanauki.pl/articles/2200717.pdf
    Data publikacji:
    2022
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    template matching
    Fourier transform
    three shear rotations
    image rotation
    Opis:
    Template matching is a process to identify and localize a template image on an original image. Several methods are commonly used for template matching, one of which uses the Fourier transform. This study proposes a modification of the method by adding an improved rotation to the Fourier transform. Improved rotation in this study uses increment rotation and three shear methods for the template image rotation process. The three shear rotation method has the advantage of precise and noisefree rotation results, making the template matching process even more accurate. Based on the experimental results, the use of 10°angle increments has increased template matching accuracy. In addition, the use of three shear rotations can improve the accuracy of template matching by 13% without prolonging the processing time.
    Źródło:
    International Journal of Electronics and Telecommunications; 2022, 68, 4; 881--888
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Construction of Generalized Rademacher Functions in Terms of Ternary Logic : Solving the Problem of Visibility of Using Galois Fields for Digital Signal Processing
    Autorzy:
    Vitulyova, Elizaveta S.
    Matrassulova, Dinara K.
    Suleimenov, Ibragim E.
    Powiązania:
    https://bibliotekanauki.pl/articles/2055235.pdf
    Data publikacji:
    2022
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    digital signal processing
    non-binary Galois fields
    fourier transform
    rademacher functions
    walsh function
    multivalued logic
    visibility problem
    algebraic extensions
    ternary representation of number
    Opis:
    Generalized Rademacher functions, constructed as a sequence of elements of Galois fields are intended to find the spectral representation of signals with levels. These functions form a complete basis on the interval corresponding to -1 discrete time intervals and for passing into the classical Rademacher functions. The advantage of such spectra obtained using Galois Fields Fourier Transform is that the range of variation of the spectrum amplitudes remains the same as the range of variation of the original signal, which is modeled on discrete time functions taking values in the Galois field.
    Źródło:
    International Journal of Electronics and Telecommunications; 2022, 68, 2; 237--244
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The New Insight into the Theory of 2-D Complex and Quaternion Analytic Signals
    Autorzy:
    Snopek, K. M.
    Powiązania:
    https://bibliotekanauki.pl/articles/226235.pdf
    Data publikacji:
    2011
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    2-D Fourier transform
    quaternion Fourier transforms
    2-D Hilbert transforms
    2-D analytic signals
    Opis:
    The paper presents the overview of the theory of 2-D complex and quaternion analytic signals with the 1st-quadrant spectrum support. Both signals are expressed as complex/hypercomplex sums of partial and total 2-D Hilbert transforms. Moreover, starting with the definition of 2-D complex and quaternion Fourier transforms, the 2-D Hilbert transforms are derived in the form of sums of parts of different parity with respect to signal-domain variables. Some new relations for Hilbert quaternion spectra have been derived. The paper is illustrated with the example of the 2-D separable Cauchy signal.
    Źródło:
    International Journal of Electronics and Telecommunications; 2011, 57, 3; 285-291
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Optical Correlation Using Four Wave Mixing in a Highly Nonlinear Fibre for Real-Time Serialized Ultrafast Systems
    Autorzy:
    Shalihah, F.
    Mitchell, A.
    Bui, L.
    Powiązania:
    https://bibliotekanauki.pl/articles/226196.pdf
    Data publikacji:
    2013
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    broadband
    Dispersive Fourier Transform
    four wave mixing
    nonlinearity
    optical correlation
    Optical Signal Processing
    Real-Time Ultrafast Systems
    Opis:
    A method of all-optical correlation is proposed using the nonlinear phenomena Four Wave Mixing (FWM) of two different signals. The method shows a serial solution where correlation of an ultrafast real-time serialized broadband source is demonstrated using a Highly Non-Linear Fibre (HNLF) with correlation rate reaching 200MHz.
    Źródło:
    International Journal of Electronics and Telecommunications; 2013, 59, 3; 207-212
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A Comparative Analysis of Evolutionary Algorithms for Synthesis of Scanned Linear Array of Mutually Coupled Parallel Dipole Antennas
    Autorzy:
    Patidar, H.
    Mahanti, G. K.
    Muralidharan, R.
    Powiązania:
    https://bibliotekanauki.pl/articles/227212.pdf
    Data publikacji:
    2017
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    antenna array
    comparative analysis
    evolutionary algorithms
    inverse fast Fourier transform
    scanning
    Opis:
    This paper presents a comparative analysis of three evolutionary algorithms, namely, Backtracking Search Algorithm, Cuckoo Search Algorithm and Artificial Bee Colony Algorithms for synthesis of a scanned linear array of uniformly spaced parallel half wavelength dipole antennas. Here, antenna parameters, namely Side Lobe Level, reflection coefficient and wide null depth are taken into consideration for comparison between algorithms. In addition to it, statistical parameters, namely best fitness value, mean and standard deviation of the fitness values obtained from algorithms are compared. Mutual coupling that exists among the antenna elements is included in obtaining radiation patterns and the self-impedances along with the mutual impedances are calculated by induced Electro-Motive Force method. Two different examples are shown in this paper to validate the effectiveness of the utilized approach. Although, this approach is applied to a linear array of dipole antennas; this can be utilized for other array geometries as well.
    Źródło:
    International Journal of Electronics and Telecommunications; 2017, 63, 2; 151-157
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    High Performance DIF-FFT Using Dissimilar Partitioned LUT Based Distributed Arithmetic
    Autorzy:
    Cheepurupalli, Kusma Kumari
    Charan, Muntha
    Rao, Jammu Bhaskara
    Noor, Mahammad S.
    Powiązania:
    https://bibliotekanauki.pl/articles/2055270.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    fast Fourier transform
    adders
    distributed arithmetic
    DSP
    Opis:
    Real-time data processing systems utilize Digital Signal Processing (DSP) functions as the base modules. Most of the DSP functions involve the implementation of Fast Fourier Transform (FFT) to convert the signals from one domain to another domain. The major bottleneck of Decimation in frequency - Fast Fourier Transform (DIF-FFT) implementation lies in using a number of Multipliers. Distributed arithmetic (DA) is considered as one of the efficient techniques to implement DIF-FFT. In this approach, the multipliers are not used. The proposed technique exploits the very advantage of the look-up table by storing the Twiddle factors, thereby avoiding the multipliers required in the butterfly structure. DIF-FFT using Distributed Arithmetic (DIF-FFT DA) models, with different adders such as Ripple carry adder (RCA), Carry-lookahead adder (CLA), and Sklansky prefix graph adder, are proposed in this paper. The three proposed models are synthesized using Cadence 6.1 EDA tools with a 45nm CMOS technology. Compared to the traditional method, it is observed that the area is improved by 53.11%, 53.35%, and 50.15%, power is improved by 42.31%, 42.52%, and 40.39%, and delay is improved by 45.26%, 45.42%, 41.80%, respectively.
    Źródło:
    International Journal of Electronics and Telecommunications; 2021, 67, 4; 631--637
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Filtering Property of Signal Sampling in General and Under-Sampling as a Specific Operation of Filtering Connected with Signal Shaping at the Same Time
    Autorzy:
    Borys, Andrzej
    Powiązania:
    https://bibliotekanauki.pl/articles/226441.pdf
    Data publikacji:
    2020
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    signal sampling
    filtering
    discrete-time Fourier transform
    Opis:
    In this paper, we show that signal sampling operation can be considered as a kind of all-pass filtering in the time domain, when the Nyquist frequency is larger or equal to the maximal frequency in the spectrum of a signal sampled. We demonstrate that this seemingly obvious observation has wide-ranging implications. They are discussed here in detail. Furthermore, we discuss also signal shaping effects that occur in the case of signal under-sampling. That is, when the Nyquist frequency is smaller than the maximal frequency in the spectrum of a signal sampled. Further, we explain the mechanism of a specific signal distortion that arises under these circumstances. We call it the signal shaping, not the signal aliasing, because of many reasons discussed throughout this paper. Mainly however because of the fact that the operation behind it, called also the signal shaping here, is not a filtering in a usual sense. And, it is shown that this kind of shaping depends upon the sampling phase. Furthermore, formulated in other words, this operation can be viewed as a one which shapes the signal and performs the low-pass filtering of it at the same time. Also, an interesting relation connecting the Fourier transform of a signal filtered with the use of an ideal low-pass filter having the cut frequency lying in the region of under-sampling with the Fourier transforms of its two under-sampled versions is derived. This relation is presented in the time domain, too.
    Źródło:
    International Journal of Electronics and Telecommunications; 2020, 66, 3; 589-594
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-7 z 7

      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