Wyszukiwarka
Wyniki wyszukiwania dla: RESIDUE NUMBERS SCALING
-
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...
-
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...
-
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...
-
Fast rns scaling of signed numbers based on the chinese remainder theorem
PublikacjaPrzedstawiono architekturę szybkiego skalera resztowego dla liczb ze znakiem dla modułów 5-bitowych opartego na chińskim twierdzeniu o resztach. W architekturze zastosowano wyznaczanie projekcji ortogonalnych przy użyciu funkcji logicznych 5 zmiennych, sumator kodulo m/k oraz wejściowy konwerter do systemu resztowego. Operacja modulo m/k jest wykonywana przy zastosowaniu drzewa 4-operandowych sumatorów modulo 2m/k i końcowego...
-
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,...
-
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...
-
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...
-
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...
-
Massively parallel linear-scaling Hartree–Fock exchange and hybrid exchange–correlation functionals with plane wave basis set accuracy
PublikacjaWe extend our linear-scaling approach for the calculation of Hartree–Fock exchange energy using localized in situ optimized orbitals [Dziedzic et al., J. Chem. Phys. 139, 214103 (2013)] to leverage massive parallelism. Our approach has been implemented in the ONETEP (Order-N Electronic Total Energy Package) density functional theory framework, which employs a basis of non-orthogonal generalized Wannier functions (NGWFs) to achieve...
-
Rapid and Reliable Re-Design of Miniaturized Microwave Passives by Means of Concurrent Parameter Scaling and Intermittent Local Tuning
PublikacjaRe-design of microwave passive components for the assumed operating frequencies or substrate parameters is an important yet a tedious process. It requires simultaneous tuning of relevant circuit variables, often over broad ranges thereof, to ensure satisfactory performance of the system. If the operating conditions at the available design are distant from the intended ones, local optimization is typically insufficient, whereas...
-
Investigation of Parallel Data Processing Using Hybrid High Performance CPU + GPU Systems and CUDA Streams
PublikacjaThe paper investigates parallel data processing in a hybrid CPU+GPU(s) system using multiple CUDA streams for overlapping communication and computations. This is crucial for efficient processing of data, in particular incoming data stream processing that would naturally be forwarded using multiple CUDA streams to GPUs. Performance is evaluated for various compute time to host-device communication time ratios, numbers of CUDA streams,...
-
Investigation of Performance and Configuration of a Selected IoT System—Middleware Deployment Benchmarking and Recommendations
PublikacjaNowadays Internet of Things is gaining more and more focus all over the world. As a concept it gives many opportunities for applications for society and it is expected that the number of software services deployed in this area will still grow fast. Especially important in this context are properties connected with deployment such as portability, scalability and balance between software requirements and hardware capabilities. In...
-
Expedited Acquisition of Database Designs for Reduced-Cost Performance-Driven Modeling and Rapid Dimension Scaling of Antenna Structures
PublikacjaFast replacement models have been playing an increasing role in high-frequency electronics, including the design of antenna structures. Their role is to improve computational efficiency of the procedures that normally entail large numbers of expensive full-wave electromagnetic (EM) simulations, e.g., parametric optimization or uncertainty quantification. Recently introduced performance-driven modeling methods, such as the nested...
-
Performance assessment of OpenMP constructs and benchmarks using modern compilers and multi-core CPUs
PublikacjaConsidering ongoing developments of both modern CPUs, especially in the context of increasing numbers of cores, cache memory and architectures as well as compilers there is a constant need for benchmarking representative and frequently run workloads. The key metric is speed-up as the computational power of modern CPUs stems mainly from using multiple cores. In this paper, we show and discuss results from running codes such as:...
-
Investigation of long-range dependencies in the stochastic part of daily GPS solutions
PublikacjaThe long-range dependence (LRD) of the stochastic part of GPS-derived topocentric coordinates change (North, East, Up) results with relatively high autocorrelation values with a focus on self-similarity. One of the reasons for such self-similarity in the GPS time series are noises that are commonly recognised to prevail in the form of the flicker noise model. To prove the self-similarity of the stochastic part of GPS time series...
-
On some Zarankiewicz numbers and bipartite Ramsey Numbers for Quadrilateral
PublikacjaThe Zarankiewicz number z ( m, n ; s, t ) is the maximum number of edges in a subgraph of K m,n that does not contain K s,t as a subgraph. The bipartite Ramsey number b ( n 1 , · · · , n k ) is the least positive integer b such that any coloring of the edges of K b,b with k colors will result in a monochromatic copy of K n i ,n i in the i -th color, for some i , 1 ≤ i ≤ k . If n i = m for all i , then we denote this number by b k ( m )....
-
Polyhedral Ramsey Numbers
PublikacjaGiven two polygons or polyhedrons P1 and P2, we can transform these figures to graphs G1 and G2, respectively. The polyhedral Ramsey number Rp(G1,G2) is the smallest integer n such that every graph, which represents polyhedron on n vertices either contains a copy of G1 or its complement contains a copy of G2. Using a computer search together with some theoretical results we have established some polyhedral Ramsey numbers, for example...
-
Generating sequences of Lefschetz numbers of iterates
PublikacjaDu, Huang and Li showed in 2003 that the class of Dold–Fermat sequences coincides with the class of Newton sequences, which are defined in terms of socalled generating sequences. The sequences of Lefschetz numbers of iterates form an important subclass of Dold–Fermat (thus also Newton) sequences. In this paper we characterize generating sequences of Lefschetz numbers of iterates.
-
On some open questions for Ramsey and Folkman numbers
PublikacjaWe discuss some of our favorite open questions about Ramsey numbers and a related problem on edge Folkman numbers. For the classical two-color Ramsey numbers, we first focus on constructive bounds for the difference between consecutive Ramsey numbers. We present the history of progress on the Ramsey number R(5,5) and discuss the conjecture that it is equal to 43.
-
On the connected and weakly convex domination numbers
PublikacjaIn this paper we study relations between connected and weakly convex domination numbers. We show that in general the difference between these numbers can be arbitrarily large and we focus on the graphs for which a weakly convex domination number equals a connected domination number. We also study the influence of the edge removing on the weakly convex domination number, in particular we show that a weakly convex domination number...
-
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...
-
A NOTE ON ON-LINE RAMSEY NUMBERS FOR QUADRILATERALS
PublikacjaWe consider on-line Ramsey numbers defined by a game played between two players, Builder and Painter. In each round Builder draws an the edge and Painter colors it either red or blue, as it appears. Builder’s goal is to force Painter to create a monochromatic copy of a fixed graph H in as few rounds as possible. The minimum number of rounds (assuming both players play perfectly) is the on-line Ramsey number \widetilde{r}(H) of...
-
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...
-
Loudness Scaling Tests in Hearing Problems Detection
PublikacjaThe number of people using portable audio players has increased significantly over the recent years. This implies the rise in the number of people having hearing loss problems. Therefore, there is a need to find appropriate procedures that simplify the process of the hearing problem detection. Investigations performed show that audiometric tests may not be sufficient to assess hearing in young people. Contrarily, the obtained results...
-
Fast geometry scaling of UWB band-notch antennas
PublikacjaImplementation of band-notch capability plays an important role in the design of ultra-wideband (UWB) antennas. At the same time, appropriate sizing of antenna geometry parameters in order to precisely allocate the notch at the required frequency as well as to ensure sufficient reflection level is quite challenging and has to be based—for reliability reasons—on full-wave electromagnetic (EM) simulations of the structure. In this...
-
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)....
-
On-line Ramsey Numbers of Paths and Cycles
PublikacjaConsider a game played on the edge set of the infinite clique by two players, Builder and Painter. In each round, Builder chooses an edge and Painter colours it red or blue. Builder wins by creating either a red copy of $G$ or a blue copy of $H$ for some fixed graphs $G$ and $H$. The minimum number of rounds within which Builder can win, assuming both players play perfectly, is the \emph{on-line Ramsey number} $\tilde{r}(G,H)$. In...
-
Inverse surrogate modeling for low-cost geometry scaling of microwave and antenna structures
PublikacjaPurpose–The purpose of this paper is to investigate strategies for expedited dimension scaling ofelectromagnetic (EM)-simulated microwave and antenna structures, exploiting the concept of variable-fidelity inverse surrogate modeling.Design/methodology/approach–A fast inverse surrogate modeling technique is described fordimension scaling of microwave and antenna structures. The model is established using referencedesigns obtained...
-
At the Limits of Criticality-Based Quantum Metrology: Apparent Super-Heisenberg Scaling Revisited
PublikacjaWe address the question of whether the super-Heisenberg scaling for quantum estimation is indeed realizable. We unify the results of two approaches. In the first one, the original system is compared with its copy rotated by the parameter-dependent dynamics. If the parameter is coupled to the one-body part of the Hamiltonian, the precision of its estimation is known to scale at most as N−1 (Heisenberg scaling) in terms of the number...
-
Graphs with equal domination and certified domination numbers
PublikacjaA setDof vertices of a graphG= (VG,EG) is a dominating set ofGif every vertexinVG−Dis adjacent to at least one vertex inD. The domination number (upper dominationnumber, respectively) ofG, denoted byγ(G) (Γ(G), respectively), is the cardinality ofa smallest (largest minimal, respectively) dominating set ofG. A subsetD⊆VGis calleda certified dominating set ofGifDis a dominating set ofGand every vertex inDhas eitherzero...
-
Loudness Scaling Test Based on Categorical Perception
PublikacjaThe main goal of this research study is focused on creating a method for loudness scaling based on categorical perception. Its main features, such as: way of testing, calibration procedure for securing reliable results, employing natural test stimuli, etc., are described in the paper and assessed against a procedure that uses 1/2-octave bands of noise (LGOB) for the loudness growth estimation. The Mann-Whitney U-test is employed...
-
Paired domination subdivision and multisubdivision numbers of graphs
PublikacjaThe paired domination subdivision number sdpr(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the paired domination number of G. We prove that the decision problem of the paired domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the paired domination muttisubdivision number of a nonempty graph...
-
Fast surrogate-assisted frequency scaling of planar antennas with circular polarisation
PublikacjaIn this work, the problem of computationally efficient frequency scaling (re-design) of circular polarisation antennas is addressed using surrogate-assisted techniques. The task is challenging and requires the identification of the optimum geometry parameters to enable the operation of the re-designed structure at a selected (required) centre frequency. This involves handling several performance figures such as the antenna gain,...
-
Rapid dimension scaling of triple-band antennas by means of inverse surrogate modeling
PublikacjaGeometry scaling of antennas, i.e., finding optimum dimensions of the structure for given operating conditions and material parameters is an important yet challenging problem. In this paper, we discuss fast dimension scaling of triple-band antennas with respect to operating frequencies. We adopt the inverse surrogate modeling approach where the surrogate model is a function of the three operating frequencies of the antenna and...
-
Multidimensional Scaling Analysis Applied to Music Mood Recognition
PublikacjaThe paper presents two experiments aimed at categorizing mood associated with music. Two parts of a listening test were designed and carried out with a group of students, most of whom where users of online social music services. The initial experiment was designed to evaluate the extent to which a given label describes the mood of the particular music excerpt. The second subjective test was conducted to collect the similarity data...
-
Fast geometry scaling of miniaturized microwave couplers with power split correction
PublikacjaRedesigning a microwave circuit for various operating conditions is a practically important yet challenging problem. The purpose of this article is development and presentation of a technique for fast geometry scaling of miniaturized microwave couplers with respect to operating frequency. Our approach exploits an inverse surrogate model constructed using several reference designs that are optimized for a set of operating frequencies...
-
Experimental research on evolutionary path planning algorithm with fitness function scaling for collision scenarios
PublikacjaThis article presents typical ship collision scenarios, simulated using the evolutionary path planning system and analyses the impact of the fitness function scaling on the quality of the solution. The function scaling decreases the selective pressure, which facilitates leaving the local optimum in the calculation process and further exploration of the solution space. The performed investigations have proved that the use of scaling...
-
Rapid EM-driven antenna dimension scaling through inverse modeling
PublikacjaIn this letter, a computationally feasible technique for dimension scaling of antenna structures is introduced. The proposed methodology is based on inverse surrogate modeling where the geometry parameters of the antenna structure of interest are explicitly related to the operating frequency. The surrogate model is identified based on a few antenna designs optimized for selected reference frequencies. For the sake of computational...
-
Rapid Microwave Design Optimization in Frequency Domain Using Adaptive Response Scaling
PublikacjaIn this paper, a novel methodology for cost-efficient microwave design optimization in the frequency domain is proposed. Our technique, referred to as adaptive response scaling (ARS), has been developed for constructing a fast replacement model (surrogate) of the high-fidelity electromagnetic-simulated model of the microwave structure under design using its equivalent circuit (low-fidelity model). The basic principle of ARS is...
-
On trees with equal domination and total outer-independent domination numbers
PublikacjaFor a graph G=(V,E), a subset D subseteq V(G) is a dominating set if every vertex of V(G)D has a neighbor in D, while it is a total outer-independent dominating set if every vertex of G has a neighbor in D, and the set V(G)D is independent. The domination (total outer-independent domination, respectively) number of G is the minimum cardinality of a dominating (total outer-independent dominating, respectively) set of G. We characterize...
-
Novel Diazocrowns with Pyrrole Residue as Lead(II) Colorimetric Probes
PublikacjaNovel 18- and 23-membered diazomacrocycles were obtained with satisfactory yields by diazocoupling of aromatic diamines with pyrrole in reactions carried under high dilution conditions. X-ray structure of macrocycle bearing five carbon atoms linkage was determined and described. Compounds were characterized as chromogenic heavy metal ions receptors. Selective color and spectral response for lead(II) was found in acetonitrile and...
-
Expedited two-objective dimension scaling of compact microwave passives using surrogate models
PublikacjaGeometry scaling of compact microwave structures is a challenging problem because of complex relationships between the physical dimensions and electrical characteristics, mostly caused by considerable cross-couplings in densely arranged layouts. Here, a procedure for expedited dimension scaling of compact microwave couplers with respect to two independent criteria has been presented. Our approach involves inverse surrogate models...
-
Inverse surrogate models for fast geometry scaling of miniaturized dual-band couplers
PublikacjaRe-design of microwave structures for various sets of performance specifications is a challenging task, particularly for compact components where considerable electromagnetic (EM) cross-couplings make the relationships between geometry parameters and the structure responses complex. Here, we address geometry scaling of miniaturized dual-band couplers by means of inverse surrogate modeling. Our approach allows for fast estimation...
-
Weakly convex and convex domination numbers of some products of graphs
PublikacjaIf $G=(V,E)$ is a simple connected graph and $a,b\in V$, then a shortest $(a-b)$ path is called a $(u-v)$-{\it geodesic}. A set $X\subseteq V$ is called {\it weakly convex} in $G$ if for every two vertices $a,b\in X$ exists $(a-b)$- geodesic whose all vertices belong to $X$. A set $X$ is {\it convex} in $G$ if for every $a,b\in X$ all vertices from every $(a-b)$-geodesic belong to $X$. The {\it weakly convex domination number}...
-
Shannon Capacity and Ramsey Numbers
PublikacjaRamsey-type theorems are strongly related to some results from information theory. In this paper we present these relations.
-
Turán numbers for odd wheels
PublikacjaThe Turán number ex(n,G) is the maximum number of edges in any n-vertex graph that does not contain a subgraph isomorphic to G. A wheel W_n is a graph on n vertices obtained from a C_{n−1} by adding one vertex w and making w adjacent to all vertices of the C_{n−1}. We obtain two exact values for small wheels: ex(n,W_5)=\lfloor n^2/4+n/2\rfloor, ex(n,W_7)=\lfloor n^2/4+n/2+1 \rfloor. Given that ex(n,W_6) is already known, this...
-
On trees with equal 2-domination and 2-outer-independent domination numbers
PublikacjaFor a graph G = (V,E), a subset D \subseteq V(G) is a 2-dominating set if every vertex of V(G)\D$ has at least two neighbors in D, while it is a 2-outer-independent dominating set if additionally the set V(G)\D is independent. The 2-domination (2-outer-independent domination, respectively) number of G, is the minimum cardinality of a 2-dominating (2-outer-independent dominating, respectively) set of G. We characterize all trees...
-
FPGA computation of magnitude of complex numbers using modified CORDIC algorithm
PublikacjaIn this work we present computation of the magnitude of complex numbers using a modified version of the CORDIC algorithm that uses only five iterations. The relationship between the computation error and the number of CORDIC iterations are presented for floating-point and integer arithmetics. The proposed modification of CORDIC for integer arithmetic relies upon the introduction of correction once basic computations are performed...
-
The ONETEP linear-scaling density functional theory program
PublikacjaWe present an overview of the ONETEP program for linear-scaling density functional theory (DFT) calculations with large basis set (planewave) accuracy on parallel computers. The DFT energy is computed from the density matrix, which is constructed from spatially localized orbitals we call Non-orthogonal Generalized Wannier Functions (NGWFs), expressed in terms of periodic sinc (psinc) functions. During the calculation, both the...