Methods or arrangements for processing data by operating upon the order or content of the data handled

GPHYSICS G06Computing G06FELECTRICAL DIGITAL DATA PROCESSING

G06F7/00Methods or arrangements for processing data by operating upon the order or content of the data handled

G06F7/02Comparing digital values G06F7/023adaptive G06F7/026Magnitude comparison, i.e. determining the relative order of operands based on their numerical value G06F7/06Arrangements for sorting, selecting, merging or comparing data on individual record carriers G06F7/08Sorting G06F7/10Selecting G06F7/12with provision for printing-out a list of selected items G06F7/14Merging G06F7/16Combined merging and sorting G06F7/20Comparing separate sets of record carriers arranged in the same sequence to determine whether at least some of the data in one set is identical with that in the other set or sets G06F7/22Arrangements for sorting or merging computer data on continuous record carriers G06F7/24Sorting G06F7/26the sorted data being recorded on the original record carrier within the same space in which the data had been recorded prior to their sorting, without using intermediate storage G06F7/32Merging G06F7/36Combined merging and sorting G06F7/38Methods or arrangements for performing computations using exclusively denominational number representation G06F7/381using cryogenic components G06F7/383using magnetic or similar elements G06F7/385magnetic bubbles G06F7/386decimal, radix 20 or 12 G06F7/388using other various devices such as electro-chemical, microwave, surface acoustic wave, neuristor, electron beam switching, resonant G06F7/40using contact- making devices G06F7/405binary G06F7/42Adding Subtracting G06F7/44Multiplying Dividing G06F7/443by successive additions or subtractions G06F7/446by partial product forming (with electric multiplication table) G06F7/46using electromechanical counter-type accumulators G06F7/461Adding; subtracting G06F7/462Multiplying; dividing G06F7/463by successive additions or subtractions G06F7/465by partial product forming (with electric multiplication table) G06F7/466by successive multiplication or division by 2 G06F7/467by using preset multiples of the multiplicand or the divisor G06F7/468for evaluating functions by calculation G06F7/48using non-contact-making devices G06F7/4806Computations with complex numbers G06F7/4812Complex multiplication G06F7/4818using coordinate rotation digital computer [CORDIC] G06F7/4824using signed-digit representation G06F7/483Computations with numbers represented by a non-linear combination of denominational numbers G06F7/4833Logarithmic number system G06F7/4836Computations with rational numbers G06F7/485Adding Subtracting G06F7/487Multiplying Dividing G06F7/4873Dividing G06F7/4876Multiplying G06F7/49Computations with a radix, other than binary, 8, 16 or decimal G06F7/491Computations with decimal numbers radix 12 or 20. G06F7/4912Adding; Subtracting G06F7/4915Multiplying; Dividing G06F7/4917Dividing G06F7/492using a binary weighted representation within each denomination G06F7/4925Adding; Subtracting G06F7/493the representation being the natural binary coded representation G06F7/494Adding Subtracting G06F7/495in digit-serial fashion G06F7/496Multiplying Dividing G06F7/498using counter-type accumulators G06F7/4981Adding; Subtracting G06F7/4983Multiplying; Dividing G06F7/4985by successive additions or subtractions G06F7/4986by successive multiplication or division by 2 G06F7/4988by table look-up G06F7/499Denomination or exception handling G06F7/49905Exception handling G06F7/4991Overflow or underflow G06F7/49915Mantissa overflow or underflow in handling floating-point numbers G06F7/49921Saturation G06F7/49926Division by zero G06F7/49931Modulo N reduction of final result G06F7/49936Normalisation mentioned as feature only G06F7/49942Significance control G06F7/49947Rounding G06F7/49952Sticky bit G06F7/49957Implementation of IEEE-754 Standard G06F7/49963Rounding to nearest G06F7/49968Rounding towards positive infinity G06F7/49973Rounding towards negative infinity G06F7/49978Rounding towards zero G06F7/49984Rounding away from zero G06F7/49989Interval arithmetic G06F7/49994Sign extension G06F7/50Adding Subtracting G06F7/501Half or full adders G06F7/5013using algebraic addition of the input signals G06F7/5016forming at least one of the output signals directly from the minterms of the input signals G06F7/502Half adders Full adders consisting of two cascaded half adders G06F7/503using carry switching G06F7/504in bit-serial fashion G06F7/5045for multiple operands G06F7/505in bit-parallel fashion G06F7/5052using carry completion detection, either over all stages or at sample stages only G06F7/5055in which one operand is a constant G06F7/5057using table look-up using programmable logic arrays G06F7/506with simultaneous carry generation for, or propagation over, two or more stages G06F7/507using selection between two conditionally calculated carry or sum values G06F7/508using carry look-ahead circuits G06F7/509for multiple operands G06F7/5095word-serial G06F7/52Multiplying Dividing G06F7/523Multiplying only G06F7/5235using indirect methods G06F7/525in serial-serial fashion G06F7/527in serial-parallel fashion G06F7/5272with row wise addition of partial products G06F7/5275using carry save adders G06F7/5277with column wise addition of partial products G06F7/53in parallel-parallel fashion G06F7/5306with row wise addition of partial products G06F7/5312using carry save adders G06F7/5318with column wise addition of partial products G06F7/5324partitioned G06F7/533Reduction of the number of iteration steps or stages G06F7/5332by skipping over strings of zeroes or ones G06F7/5334by using multiple bit scanning G06F7/5336overlapped, i.e. with successive bitgroups sharing one or more bits being recoded into signed digit representation G06F7/5338each bitgroup having two new bits G06F7/535Dividing only G06F7/537Reduction of the number of iteration steps or stages G06F7/5375Non restoring calculation, where each digit is either negative, zero or positive G06F7/544for evaluating functions by calculation G06F7/5443Sum of products G06F7/5446using crossaddition algorithms G06F7/548Trigonometric functions Co-ordinate transformations G06F7/552Powers or roots G06F7/5525Roots or inverse roots of single operands G06F7/556Logarithmic or exponential functions G06F7/57Arithmetic logic units [ALU] G06F7/575Basic arithmetic logic units G06F7/58Random or pseudo-random number generators G06F7/582Pseudo-random number generators G06F7/584using finite field arithmetic G06F7/586using an integer algorithm G06F7/588Random number generators G06F7/60Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix Computing devices using combinations of denominational and non-denominational quantity representations G06F7/602using delta-sigma sequences G06F7/605Additive or subtractive mixing of two pulse rates into one G06F7/607number-of-ones counters G06F7/62Performing operations exclusively by counting total number of pulses; Multiplication, division or derived operations using combined denominational and incremental processing by counters G06F7/64Digital differential analysers G06F7/66wherein pulses represent unitary increments only G06F7/68using pulse rate multipliers or dividers pulse rate multipliers or dividers per se G06F7/70using stochastic pulse trains G06F7/72using residue arithmetic G06F7/721Modular inversion, reciprocal or quotient calculation G06F7/722Modular multiplication G06F7/723Modular exponentiation G06F7/724Finite field arithmetic G06F7/725over elliptic curves G06F7/726Inversion; Reciprocal calculation; Division of elements of a finite field G06F7/727Modulo N arithmetic, with N being either (2**n)-1,2**n or (2**n)+1 G06F7/728using Montgomery reduction G06F7/729using representation by a residue number system G06F7/74Selecting or encoding within a word the position of one or more bits having a specified value G06F7/76Arrangements for rearranging, permuting or selecting data according to predetermined rules, independently of the content of the data G06F7/762having at least two separately controlled rearrangement levels G06F7/764Masking G06F7/766Generation of all possible permutations G06F7/768Data position reversal G06F7/78for changing the order of data flow G06F7/785having a sequence of storage locations each being individually accessible for both enqueue and dequeue operations