Wyszukiwarka
Wyniki wyszukiwania dla: POLYNOMIAL RESIDUE NUMBER SYSTEM
-
Computation of the convolution with use of the polynomial residue number system.
PublikacjaPrzedstawiono użycie wielomianowych systemów resztowych do obliczania splotu w cyfrowych układach dużej skali integracji VLSI.
-
Complex multiplier based on the polynomial residue number system
PublikacjaPrzedstawiono próbę zaprojektowania mnożnika zespolonego 4x4 opartego na algorytmie Skavantzosa i Stouraitisa. W algorytmie stosuje siękodowanie liczb n-bitowych jako wielomianów stopnia 7 w pierścieniu wielomianów modulo (x^8-1) z n/4-bitowymi współczynnikami. Mnożenie zespolone jest wykonywane jako 8-punktowy splot cykliczny. Podanoopóżnienie i złożoność sprzętową jak również porównanie ze standardowym.rozwiązaniem.
-
Design of a complex multiplier based on the convolution with the use of the polynomial residue number system
Publikacjazaproponowano realizację mnożnika zespolonego opartego na algorytmie dekompozycyjnym skavantzosa i stouraitisa. mnożenie zespolone jest wykonywane jako splot 8-punktowy. przedstawiono przykład obliczeniowy i architekturę mnożnika dla małych liczb.
-
Radix-4 dft butterfly realization with the use of the modified quadratic residue number system
PublikacjaW pracy zaprezentowano projektowanie i realizację obliczenia motylkowego dft dla podstawy 4 z użyciem zespolonego systemu resztowego (CRNS) i zmodyfikowanego kwadratowego systemu resztowego (MQRNS). System MQRNS oprócz własności dekompozycyjnych pozwala na realizację mnożenia zespolonego przy zastosowaniu trzech mnożeń rzeczywistych. Przedstawiono konwertery wejściowy CRNS/MQRNS i wyjściowy MQRNS/CRNS, mnożenie zespolone w MQRNS,...
-
Radix-4 dft butterfly realization with the use of the modified quadratic residue number system
PublikacjaW pracy przedstawiono algorytm realizacji mnożenia zespolonego z użyciem zmodyfikowanego kwadratowego zmodyfikowanego systemu liczbowego (mqrns) oraz jego zastosowanie do wykonania obliczenia motylkowego dft dla podstawy 4. pokazano też wstępne rezultaty implementacji w układzie xilinx fpga.
-
Implementation of discrete convolution using polynomial residue representation
PublikacjaConvolution is one of the main algorithms performed in the digital signal processing. The algorithm is similar to polynomial multiplication and very intensive computationally. This paper presents a new convolution algorithm based on the Polynomial Residue Number System (PRNS). The use of the PRNS allows to decompose the computation problem and thereby reduce the number of multiplications. The algorithm has been implemented in Xilinx...
-
Discrete convolution based on polynomial residue representation
PublikacjaThis paper presents the study of fast discrete convolution calculation with use of the Polynomial Residue Number System (PRNS). Convolution can be based the algorithm similar to polynomial multiplication. The residue arithmetic allows for fast realization of multiplication and addition, which are the most important arithmetic operations in the implementation of convolution. The practical aspects of hardware realization of PRNS...
-
Implementation of discrete convolution using polynomial residue representation
Publikacja -
improved noniterative residue division for small number ranges
Publikacjaw pracy zaprezentowano multiplikatywny algorytm dzielenia w systemie resztowym i projekt 12-bitowego dzielnika dla modułów 5-bitowych. w algorytmie zastosowano obliczanie przybliżonej odwrotności dzielnika i mnozenie przez dzielną. binarna reprezentacja dzielnika jest dekomponowana na dwa segmenty 6-bitowe, co umożliwia obliczenie w środowisku fpga poprzez odwzorowanie realizowane jako odczyt pamięci. w pracy podano udoskonalony...
-
A self-stabilizing algorithm for finding a spanning tree in a polynomial number of moves
PublikacjaW pracy rozważa się rozproszony model obliczeń, w którym struktura systemu jest reprezentowana przez graf bezpośrednich połączeń komunikacyjnych. W tym modelu podajemy nowy samostabilizujący algorytm znajdowania drzewa spinającego. Zgodnie z naszą wiedzą jest to pierwszy algorytm dla tego problemu z gwarantowaną wielomianową liczbą ruchów.
-
Pipelined division of signed numbers with the use of residue arithmetic for small number range with the programmable gate array
PublikacjaIn this work an architecture of the pipelined signed residue divider for the small number range is presented. Its operation is based on reciprocal calculation and multiplication by the dividend. The divisor in the signed binary form is used to compute the approximated reciprocal in the residue form by the table look-up. In order to limit the look-up table address an algorithm based on segmentation of the divisor into two segments...
-
The prns butterfly synthesis in the FPGA
Publikacjaw pracy przedstawiono sprzętową implementację elementarnych obliczeń, określanych jako obliczenia motylkowe, dla splotu realizowanego z użyciem wielomianowego systemu resztowego(ang. polynomial residue number system - prns). obliczenia są wykonywane z zastosowaniem reprezentacji systemu diminished-1. opisano syntezę układu realizującego obliczenie motylkowe w środowisku xilinx w układzie virtex 4. podano również wymaganą ilość...
-
Mersenne Number Finding and Collatz Hypothesis Verification in the Comcute Grid System
PublikacjaIn this chapter, some mathematic applications have been described to test scalability of the Comcute grid system. Especially, a verification of the Collatz hypothesis and finding Mersenne numbers were applied to prove the scalability and high performance of this grid system. Results were compared with outcomes obtained by the other grid systems.
-
Accuracy Of The GPS Positioning System In The Context Of Increasing The Number Of Satellites In The Constellation
Publikacja -
Evaluation of a 10 nm Particle Number Portable Emissions Measurement System (PEMS)
Publikacja -
The influence of oscillatory low pressure on bacteria number in groundwater supplied to distribution system
PublikacjaPrzedstawiono wyniki wstępnych badań laboratoryjnych nad wpływem stałego podwyższonego ciśnienia oraz częstych i gwałtownych jego zmian na liczbę bakterii w wodzie podziemnej. Określono zmiany liczby bakterii heterotroficznych (na agarze R2A) oraz całkowitej liczby bakterii (DAPI) w wodzie podziemnej (w temperaturze 20 st.C w okresie 96 h) poddawanej ciągłemu ciśnieniu 0,6 MPa i porównano z uzyskanymi w wodzie poddanej gwałtownym...
-
Analysis of pesticide residue in tomato samples using analytical protocol based on application of QuEChERS technique and GC-ECD system
PublikacjaQuEChERS sample preparation method was used for the determination of 10 pesticides and their metabolites in tomato samples, coupled to gas chromatography with electron capture detector (GCECD). The experimental parameters including oven temperature program, amount of the sample and purifying agent were optimized. The GC-ECD method was validated in terms of linearity, selectivity and recovery. The limits of detection (LODs) of the...
-
Person Tracking in Ultra-Wide Band Hybrid Localization System Using Reduced Number of Reference Nodes
PublikacjaIn this article a novel method of positional data integration in an indoor hybrid localization system combining inertial navigation with radio distance measurements is presented. A point of interest is the situation when the positional data and the radio distance measurements are obtained from less than thee reference nodes and it is impossible to unambiguously localize the moving person due to undetermined set of positional equations....
-
Analysis of pesticide residue in fruits and vegetables using analytical analytical protocol based on application of QuEChERS technique and GC-ECD system
PublikacjaQuEChERS sample preparation method was used for the determination of 10 pesticides and their metabolites in fruits (apple, grape) and vegetables (tomato, paprika), coupled to gas chromatography with electron capture detector (GC-ECD). The experimental parameters including amount of the sample, types of solvents, extraction time and types of sorbent at the purification stage were optimized. The GC-ECD method was validated in terms...
-
Jakub Miler dr inż.
OsobyKariera akademicka: 2000: mgr inż. Wydział ETI, Politechnika Gdańska, praca pt. "Computer system for supporting risk management in a software engineering project", promotor prof. Janusz Górski 2005: dr inż. Wydział ETI, Politechnika Gdańska, rozprawa pt. "A Method of Software Project Risk Identification and Analysis", obroniona z wyróżnieniem, dziedzina nauki techniczne, dyscyplina informatyka, promotor prof. Janusz Górski Zainteresowania...
-
Magdalena Szuflita-Żurawska
OsobyMagdalena Szuflita-Żurawska jest kierownikiem Sekcji Informacji Naukowo-Technicznej na Politechnice Gdańskiej oraz Liderem Centrum Kompetencji Otwartej Nauki przy Bibliotece Politechniki Gdańskiej. Jej główne zainteresowania badawcze koncentrują się w obszarze komunikacji naukowej oraz otwartych danych badawczych, a także motywacji i produktywności naukowej. Jest odpowiedzialna między innymi za prowadzenie szkoleń dla pracowników...
-
Pipelined Two-Operand Modular Adders
PublikacjaPipelined two-operand modular adder (TOMA) is one of basic components used in digital signal processing (DSP) systems that use the residue number system (RNS). Such modular adders are used in binary/residue and residue/binary converters, residue multipliers and scalers as well as within residue processing channels. The structure of pipelined TOMAs is usually obtained by inserting an appropriate number of pipeline register layers within...
-
On simplification of residue scaling process in pipelined Radix-4 MQRNS FFT processor
PublikacjaResidue scaling is needed in pipelined FFT radix-4 processors based on the Modified Quadratic Residue Number System (MQRNS) at the output of each butterfly. Such processor uses serial connection of radix-4 butterflies. Each butterfly comprises n subunits, one for each modulus of the RNS base and generates four complex residue numbers. In order to prevent arithmetic overflow intermediate results after each butterfly have to be...
-
On configuration of residue scaling process in pipelined radix-4 MQRNS FFT processor
PublikacjaResidue scaling is needed in pipelined FFT radix-4 processors based on the Modified Quadratic Residue Number System (MQRNS) at the output of each butterfly. Such processor uses serial connection of radix-4 butterflies. Each butterfly comprises n subunits, one for each modulus of the RNS base and outputs four complex residue numbers. In order to prevent the arithmetic overflow in the succesive stage, every number has to be scaled,...
-
Scaling of signed residue numbers with mixed-radix conversion in FPGA with extended scaling factor selection
PublikacjaA scaling technique of signed residue numbers in FPGA is proposed. The technique is based on conversion of residue numbers to the Mixed-Radix System (MRS). The scaling factor is assumed to be a moduli product from the Residue Number System (RNS) base. Scaling is performed by scaling of MRS terms, the subsequent generation of residue representations of scaled terms, binary addition of these representations and generation of residues...
-
Digital structures for high-speed signal processing
PublikacjaThe work covers several issues of realization of digital structures for pipelined processing of real and complex signals with the use of binary arithmetic and residue arithmetic. Basic rules of performing operations in residue arithmetic are presented along with selected residue number systems for processing of complex signals and computation of convolution. Subsequently, methods of conversion of numbers from weighted systems to...
-
The chapter analyses the K-Means algorithm in its parallel setting. We provide detailed description of the algorithm as well as the way we paralellize the computations. We identified complexity of the particular steps of the algorithm that allows us to build the algorithm model in MERPSYS system. The simulations with the MERPSYS have been performed for different size of the data as well as for different number of the processors used for the computations. The results we got using the model have been compared to the results obtained from real computational environment.
PublikacjaThe chapter analyses the K-Means algorithm in its parallel setting. We provide detailed description of the algorithm as well as the way we paralellize the computations. We identified complexity of the particular steps of the algorithm that allows us to build the algorithm model in MERPSYS system. The simulations with the MERPSYS have been performed for different size of the data as well as for different number of the processors used...
-
Pipelined sceling of signed residue numbers with the mixed-radix conversion in the programmable gate array
PublikacjaIn this work a scaling technique of signed residue numbers is proposed. The method is based on conversion to the Mixed-Radix System (MRS) adapted for the FPGA implementation. The scaling factor is assumed to be a moduli product from the Residue Number System (RNS) base. Scaling is performed by scaling of terms of the mixed-radix expansion, generation of residue reprezentation of scaled terms, binary addition of these representations...
-
The PRNS butterfly in the FPGA technology
PublikacjaW publikcaji zaprezentowano koncepcję realizacji motylka konwesji wejściowej w Wielomianowym Systemie Resztowym (Polynoamil Residue Number System, PRNS). Omówiono wykorzystanie reprezentacji liczb w systemie diminished-1 w prezentowanym rozwiązaniu oraz przedstawiono wynik syntezy ukłądu w środowisku Xilinx ISE.
-
Scaling of numbers in residue arithmetic with the flexible selection of scaling factor
PublikacjaA scaling technique of numbers in resudue arithmetic with the flexible selection of the scaling factor is presented. The required scaling factor can be selected from the set of moduli products of the Residue Number System (RNS) base. By permutation of moduli of the number system base it is possible to create many auxilliary Mixed-Radix Systems associated with the given RNS with respect to the base, but they have different sets...
-
Polynomial description of dynamic impedance spectrogram—introduction to a new impedance analysis method
PublikacjaThis paper presents a polynomial description of spectrograms obtained using Dynamic Electrochemical Impedance Spectroscopy. A method to fit the polynomial degree correctly is discussed. A simple electrical system of a diode connected in parallel with a capacitor was used for testing. Dynamic impedance measurements during potentiodynamic polarization were conducted. This paper presents an alternative analysis method that allows...
-
RNS/TCS CONVERTER DESIGN USING HIGH-LEVEL SYNTHESIS IN FPGA
PublikacjaAn experimental high-level synthesis (HLS) of the residue number system (RNS) to two’s-complement system (TCS) converter in the Vivado Xilinx FPGA environment is shown. The assumed approach makes use of the Chinese Remainder Theorem I (CRT I). The HLS simplifies and accelerates the design and implementation process, moreover the HLS synthesized architecture requires less hardware by about 20% but the operational frequency is smaller...
-
Pipelined division of signed numbers with the use of residue arithmetic in FPGA
PublikacjaAn architecture of a pipelined signed residue divider for small number ranges is presented. The divider makes use of the multiplicative division algorithm where initially the reciprocal of the divisor is calculated and subsequently multiplied by the dividend. The divisor represented in the signed binary form is used to compute the approximated reciprocal in the residue form by the table look-up. In order to reduce the needed length...
-
Bounds on isolated scattering number
PublikacjaThe isolated scattering number is a parameter that measures the vulnerability of networks. This measure is bounded by formulas de- pending on the independence number. We present new bounds on the isolated scattering number that can be calculated in polynomial time.
-
Bounds on isolated scattering number
PublikacjaThe isolated scattering number is a parameter that measures the vulnerability of networks. This measure is bounded by formulas de- pending on the independence number. We present new bounds on the isolated scattering number that can be calculated in polynomial time.
-
Local basis function estimators for identification of nonstationary systems
PublikacjaThe problem of identification of a nonstationary stochastic system is considered and solved using local basis function approximation of system parameter trajectories. Unlike the classical basis function approach, which yields parameter estimates in the entire analysis interval, the proposed new identification procedure is operated in a sliding window mode and provides a sequence of point (rather than interval) estimates. It is...
-
FIReWORK: FIR Filters Hardware Structures Auto-Generator
PublikacjaThe paper presents application called FIReWORK, that allows for automatic creation of the VHDL hardware structures of FIR filters. Automat- ically generated specialized hardware solutions dedicated to the FPGA and ASIC are commonly known as Intellectual Property Cores. The essential fu- ture of the application is easy initialization of FIR filter parameters in GUI, and then automatically design, calculate and generate the IP Core...
-
Tight bounds on global edge and complete alliances in trees
PublikacjaIn the talk the authors present some tight upper bounds on global edge alliance number and global complete alliance number of trees. Moreover, we present our NP-completeness results from [8] for global edge alliances and global complete alliances on subcubic bipartite graphs without pendant vertices. We discuss also polynomial time exact algorithms for finding the minimum global edge alliance on trees [7] and complete alliance...
-
2-Coloring number revisited
Publikacja2-Coloring number is a parameter, which is often used in the literature to bound the game chromatic number and other related parameters. However, this parameter has not been precisely studied before. In this paper we aim to fill this gap. In particular we show that the approximation of the game chromatic number by the 2-coloring number can be very poor for many graphs. Additionally we prove that the 2-coloring number may grow...
-
Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines: Complexity and Algorithms
PublikacjaIn this paper, the problem of scheduling on parallel machines with a presence of incompatibilities between jobs is considered. The incompatibility relation can be modeled as a complete multipartite graph in which each edge denotes a pair of jobs that cannot be scheduled on the same machine. The paper provides several results concerning schedules, optimal or approximate with respect to the two most popular criteria of optimality:...
-
Infinite chromatic games
PublikacjaIn the paper we introduce a new variant of the graph coloring game and a new graph parameter being the result of the new game. We study their properties and get some lower and upper bounds, exact values for complete multipartite graphs and optimal, often polynomial-time strategies for both players provided that the game is played on a graph with an odd number of vertices. At the end we show that both games, the new and the classic...
-
Equitable coloring of corona multiproducts of graphs
PublikacjaWe give some results regarding the equitable chromatic number for l-corona product of two graphs: G and H, where G is an equitably 3- or 4-colorable graph and H is an r-partite graph, a cycle or a complete graph. Our proofs lead to polynomial algorithms for equitable coloring of such graph products provided that there is given an equitable coloring of G.
-
Andrzej Chybicki dr inż.
OsobyZ wykształcenia informatyk, absolwent Wydziału Elektroniki, Telekomunikacji i Informatyki Politechniki Gdańskiej, doktor nauk technicznych w dziedzinie informatyka specjalizujący się w przetwarzaniau danych przestrzennych w rozproszonych systemach informatycznych. Ukierunkowany na wykorzystywanie osiągnięć i wiedzy zakresu prowadzonych badań w przemyśle. Współpracował z szeregiem podmiotów przemysłu informatycznego, geodezyjnego...
-
Application of shifted Chebyshev polynomial-based Rayleigh–Ritz method and Navier’s technique for vibration analysis of a functionally graded porous beam embedded in Kerr foundation
PublikacjaPresent study is dealt with the applicability of shifted Chebyshev polynomial based Rayleigh-Ritz method and Navier’s technique on free vibration of Functionally Graded (FG) beam with uniformly distributed porosity along the thickness of the beam. The material properties such as Young’s modulus, mass density, and Poisson’s ratio are also considered to vary along the thickness of the FG beam as per the power-law exponent model....
-
Chromogenic azomacrocycles with imidazole residue: Structure vs. properties
PublikacjaNew diazo macrocycles linked by hydrocarbon chain bearing imidazole or 4-methylimidazole residue have been synthetized with satisfactory yield (24–55%). The structure of macrocycles was confirmed by X-ray analysis and spectroscopic methods (1H NMR, MS, FTIR). Metal cation complexation studies were carried out in acetonitrile and acetonitrile-water system. It was found that azomacrocyles form triple-decker complexes with lead(II)....
-
Interval incidence graph coloring
PublikacjaIn this paper we introduce a concept of interval incidence coloring of graphs and survey its general properties including lower and upper bounds on the number of colors. Our main focus is to determine the exact value of the interval incidence coloring number χii for selected classes of graphs, i.e. paths, cycles, stars, wheels, fans, necklaces, complete graphs and complete k-partite graphs. We also study the complexity of the...
-
Equitable coloring of hypergraphs
PublikacjaA hypergraph is equitablyk-colorable if its vertices can be partitioned into k sets/colorclasses in such a way that monochromatic edges are avoided and the number of verticesin any two color classes differs by at most one. We prove that the problem of equitable 2-coloring of hypergraphs is NP-complete even for 3-uniform hyperstars. Finally, we apply the method of dynamic programming for designing a polynomial-time algorithm to...
-
Total Completion Time Minimization for Scheduling with Incompatibility Cliques
PublikacjaThis paper considers parallel machine scheduling with incompatibilities between jobs. The jobs form a graph equivalent to a collection of disjoint cliques. No two jobs in a clique are allowed to be assigned to the same machine. Scheduling with incompatibilities between jobs represents a well-established line of research in scheduling theory and the case of disjoint cliques has received increasing attention in recent...
-
On Computational Aspects of Greedy Partitioning of Graphs
PublikacjaIn this paper we consider a problem of graph P-coloring consisting in partitioning the vertex set of a graph such that each of the resulting sets induces a graph in a given additive, hereditary class of graphs P. We focus on partitions generated by the greedy algorithm. In particular, we show that given a graph G and an integer k deciding if the greedy algorithm outputs a P-coloring with a least k colors is NP-complete for an infinite...
-
Eqiuitable coloring of corona products of cubic graphs is harder than ordinary coloring
PublikacjaA graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest k for which such a coloring exists is known as the equitable chromatic number of G. In this paper the problem of determinig the equitable coloring number for coronas of cubic graphs is studied. Although the problem of ordinary coloring of coronas...