bit string

(redirected from Bit array)
Also found in: Wikipedia.

bit string

[′bit ‚striŋ]
(computer science)
A set of consecutive binary digits representing data in coded form, in which the significance of each bit is determined by its position in the sequence and its relation to the other bits.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.

bit string

(programming, data)
An ordered sequence of bits. This is very similar to a bit pattern except that the term "string" suggests an arbitrary length sequence as opposed to a pre-determined length "pattern".
This article is provided by FOLDOC - Free Online Dictionary of Computing (foldoc.org)
References in periodicals archive ?
Once the number of elements of this bit array is known, the array is converted to 1 and zero values.
The elements of the bit array are summed, and the sum of the values is converted into a byte value to obtain the bit array.
An 32 bit array multiplier is designed with three different adders RCA, CLA and CSLA and their performance analysis is compared.
Figure 4 and 5 shows the simulation results of 8 bit array multiplier and 8 bit KM using polynomial multiplication.
,[h.sub.k] and a bit array with m length, denoted as B.
When d dimensions of an element are mapped into d BFs and HTs by k hash functions, the locations of the bit array in the PBFs are set to 1, and the attenuation hash values are summed up: F(1) = [[SIGMA].sup.k.sub.i=1] h[j][i]([a.sub.j])/[2.sup.i].
Each is 21'2" square, coated with DuPont photopolymer, on which are recorded about 3,000 holograms of 1mm spot size, each hologram a stack of 40 angle-multiplexed pages, each page containing a 256x256 bit array.
The result and performance analysis of IQSERL based inverter and 4 x 4 bit array multiplier circuit are carried out in Section 4.
Since a 4 x 4 bit array multiplier is a large complex circuit, so number of transistors on a chip (transistor count) is also an important parameter to be discussed.
Let R be a bit array of size m (the size of the pattern).
Bob Floyd described several possible data structures to implement the set S in Algorithm F2: "A bit array is appropriae if N is no more than perhaps 100M; if b is the number of bits per word, then the run time is virtually constant at O(,) + O(N/b).
Bit arrays OUT, IN, GEN, and KILL shall be defined, and equations shall be developed leading to an algorithm to optimize the number of data definitions.