Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “binary operation”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 379 records · Page 21

Good trellises for IC implementation of viterbi decoders for linear block codes

This paper investigates trellis structures of linear block codes for the IC (integrated circuit) implementation of Viterbi decoders capable of achieving high decoding speed while satisfying a constraint on the structural complexity of the trellis in terms of the maximum number of states at any particular depth. Only uniform sectionalizations of the code trellis diagram are considered. An upper bound on the number of parallel and structurally identical (or isomorphic) subtrellises in a proper trellis for a code without exceeding the maximum state complexity of the minimal trellis of the code is first derived. Parallel structures of trellises with various section lengths for binary BCH and Reed-Muller (RM) codes of lengths 32 and 64 are analyzed. Next, the complexity of IC implementation of a Viterbi decoder based on an L-section trellis diagram for a code is investigated. A structural property of a Viterbi decoder called ACS-connectivity which is related to state connectivity is introduced. This parameter affects the complexity of wire-routing (interconnections within the IC). The effect of five parameters namely: (1) effective computational complexity; (2) complexity of the ACS-circuit; (3) traceback complexity; (4) ACS-connectivity; and (5) branch complexity of a trellis diagram on the VLSI complexity of a Viterbi decoder is investigated. It is shown that an IC implementation of a Viterbi decoder based on a non-minimal trellis requires less area and is capable of operation at higher speed than one based on the minimal trellis when the commonly used ACS-array architecture is considered.

Moorthy, H. T.↗

Good trellises for IC implementation of viterbi decoders for linear block codes

This paper investigates trellis structures of linear block codes for the IC (integrated circuit) implementation of Viterbi decoders capable of achieving high decoding speed while satisfying a constraint on the structural complexity of the trellis in terms of the maximum number of states at any particular depth. Only uniform sectionalizations of the code trellis diagram are considered. An upper bound on the number of parallel and structurally identical (or isomorphic) subtrellises in a proper trellis for a code without exceeding the maximum state complexity of the minimal trellis of the code is first derived. Parallel structures of trellises with various section lengths for binary BCH and Reed-Muller (RM) codes of lengths 32 and 64 are analyzed. Next, the complexity of IC implementation of a Viterbi decoder based on an L-section trellis diagram for a code is investigated. A structural property of a Viterbi decoder called ACS-connectivity which is related to state connectivity is introduced. This parameter affects the complexity of wire-routing (interconnections within the IC). The effect of five parameters namely: (1) effective computational complexity; (2) complexity of the ACS-circuit; (3) traceback complexity; (4) ACS-connectivity; and (5) branch complexity of a trellis diagram on the VLSI complexity of a Viterbi decoder is investigated. It is shown that an IC implementation of a Viterbi decoder based on a non-minimal trellis requires less area and is capable of operation at higher speed than one based on the minimal trellis when the commonly used ACS-array architecture is considered.

Lin, Shu↗

Protograph LDPC Codes for the Erasure Channel

This viewgraph presentation reviews the use of protograph Low Density Parity Check (LDPC) codes for erasure channels. A protograph is a Tanner graph with a relatively small number of nodes. A "copy-and-permute" operation can be applied to the protograph to obtain larger derived graphs of various sizes. For very high code rates and short block sizes, a low asymptotic threshold criterion is not the best approach to designing LDPC codes. Simple protographs with much regularity and low maximum node degrees appear to be the best choices Quantized-rateless protograph LDPC codes can be built by careful design of the protograph such that multiple puncturing patterns will still permit message passing decoding to proceed

long erasure codes↗

Good Trellises for IC Implementation of Viterbi Decoders for Linear Block Codes

This paper investigates trellis structures of linear block codes for the integrated circuit (IC) implementation of Viterbi decoders capable of achieving high decoding speed while satisfying a constraint on the structural complexity of the trellis in terms of the maximum number of states at any particular depth. Only uniform sectionalizations of the code trellis diagram are considered. An upper-bound on the number of parallel and structurally identical (or isomorphic) subtrellises in a proper trellis for a code without exceeding the maximum state complexity of the minimal trellis of the code is first derived. Parallel structures of trellises with various section lengths for binary BCH and Reed-Muller (RM) codes of lengths 32 and 64 are analyzed. Next, the complexity of IC implementation of a Viterbi decoder based on an L-section trellis diagram for a code is investigated. A structural property of a Viterbi decoder called add-compare-select (ACS)-connectivity which is related to state connectivity is introduced. This parameter affects the complexity of wire-routing (interconnections within the IC). The effect of five parameters namely: (1) effective computational complexity; (2) complexity of the ACS-circuit; (3) traceback complexity; (4) ACS-connectivity; and (5) branch complexity of a trellis diagram on the very large scale integration (VISI) complexity of a Viterbi decoder is investigated. It is shown that an IC implementation of a Viterbi decoder based on a nonminimal trellis requires less area and is capable of operation at higher speed than one based on the minimal trellis when the commonly used ACS-array architecture is considered.

Moorthy, Hari T.↗

The volumetric rate of normal type Ia supernovae in the local Universe discovered by the Palomar Transient Factory

We present the volumetric rate of normal type Ia supernovae (SNe Ia) discovered by the Palomar Transient Factory (PTF). Using strict data-quality cuts, and considering only periods when the PTF maintained a regular cadence, PTF discovered 90 SNe Ia at z ≤ 0.09 in a well-controlled sample over three years of operation (2010–2012). We use this to calculate the volumetric rate of SN Ia events by comparing this sample to simulations of hundreds of millions of SN Ia light curves produced in statistically representative realizations of the PTF survey. This quantifies the recovery efficiency of each PTF SN Ia event, and thus the relative weighting of each event. From this, the volumetric SN Ia rate was found to be r(v) = 2.43 ± 0.29 (stat)(+0.33,−0.19)(sys) × 10^(−5) SNe per yr Mpc^(-3) h(3,70). This represents the most precise local measurement of the SNIa rate. We fit a simple SNIa delay-time distribution model, ∝ t^(−β) , to our PTF rate measurement combined with a literature sample of rate measurements from surveys at higher redshifts. We find β ∼ 1, consistent with a progenitor channel governed by the gravitational inspiral of binary white dwarfs.

C. Frohmaier↗

VVNRS: Variable phenomena in VV Cephei

The current research project (VVNRS) involves VV Cephei, which is a binary system in which a 20 solar mass main sequence star orbits within the extended atmosphere of the 40 solar mass M-type supergiant primary. Although the period of the system is 20.3 years, the components are close enough for a stream of matter from the primary to form an accretion disk around the hot secondary. We had previously completed an ADP-sponsored study of twelve years of archival spectra of this system and were surprised to find intermittent changes in the line profiles of the chromosphere-like absorption spectrum. This we think may be related to the accretion process. The previously existing spectra were not closely spaced enough in time to clearly delineate the nature of these changes. Therefore, we proposed and were granted eleven half-shifts to obtain closely spaced IUE spectra during IUE's 14th year of operations (1991/1992).

Stencel, Robert E.↗

Discovery of a transient MeV range gamma-ray source

The University of California, San Diego (UCSD)/MIT hard X-ray and gamma-ray instrument on the HEAO 1 surveyed the region near the Galactic center 3 times during its lifetime in 1977-1979. During the 1977 September-October scan, a gamma-ray source was detected south of the Galactic center. The source was below the threshold sensitivity in the spring and fall of 1978. The source was detected with the medium energy phoswich scintillation counters which operated over the 80 keV-2 MeV range, had an area of 42 sq cm each, and a 17 deg FWHM aperture. The error box for the source is centered on l = 2.4 deg, b = -12.2 deg, with a 90% confidence error circle of approximately 3.5 deg radius. The flux in the 333-635 keV range was (1.89 +/- 0.29) x 10(exp -5) photons/(sq cm s keV) and was constant within statistics during the 1 month period the source was in the field of view. The spectrum can be characterized as a Gaussian in the range 300 less than or = E less than or = 650 keV, with a FWHM of 249 +/- 51 keV centered on 461 +/- 22 keV. The flux of this broad Gaussian is (6.6 +/- 1.1) x 10(exp -3) photons/(sq cm s). The source is tentatively identified with the 5.57 hr period low-mass X-ray-emitting binary system 1H 1822-371. Assuming this is correct, the ratio of gamma-ray to X-ray luminosity during the outburst was about 5; at a distance of 8 kpc, the gamma ray luminosity is 4 x 10(exp 37) ergs. The emission may be interpreted as a positron-pair plasma ejected from a compact object, possibly a black hole, and annihilating in a thick accretion disk surrounding the object.

Briggs, M. S.↗

Data Validation in the Kepler Science Operations Center Pipeline

We present an overview of the Data Validation (DV) software component and its context within the Kepler Science Operations Center (SOC) pipeline and overall Kepler Science mission. The SOC pipeline performs a transiting planet search on the corrected light curves for over 150,000 targets across the focal plane array. We discuss the DV strategy for automated validation of Threshold Crossing Events (TCEs) generated in the transiting planet search. For each TCE, a transiting planet model is fitted to the target light curve. A multiple planet search is conducted by repeating the transiting planet search on the residual light curve after the model flux has been removed; if an additional detection occurs, a planet model is fitted to the new TCE. A suite of automated tests are performed after all planet candidates have been identified. We describe a centroid motion test to determine the significance of the motion of the target photocenter during transit and to estimate the coordinates of the transit source within the photometric aperture; a series of eclipsing binary discrimination tests on the parameters of the planet model fits to all transits and the sequences of odd and even transits; and a statistical bootstrap to assess the likelihood that the TCE would have been generated purely by chance given the target light curve with all transits removed. Keywords: photometry, data validation, Kepler, Earth-size planets

Wu, Hayley↗

Applications of the Dynamic N-Dimensional K-Vector

The n-dimensional k-vector (NDKV) is an appealing alternative to binary tress for resolving complex queries in large relational databases. The method has excelled in several applications involving static databases. The present paper extends the theory supporting the NDKV to handle dynamic databases, where the data is updated frequently. This includes deleting records, adding new entries, or editing existing elements. The merit of this new version of the NDKV, the dynamic n-dimensional k-vector (DNDKV), is that it is no longer necessary to recompute the entire k-vector (the main structure that indexes the data) every time a record changes. The algorithm updates the four constituents of the standard NDKV on the fly: the database, sorted database, index, and k-vector tables. As a result, the DNDKV becomes comparable in terms of capabilities and flexibility to stateof-the-art storage engines relying on structured query languages (SQL). The performance of the DNDKV is assessed by running typical read/write operations on a database that contains millions of pre-computed missions to celestial bodies. This database requires frequent updates whenever an orbit solution is refined or new bodies are discovered. The DNDKV is faster than rebuilding the k-vector tables completely, provided that the number of elements being added or removed is not excessively large. Direct runtime comparisons with MySQL suggest that the DNDKV is several times faster for reading but might be slower for writing and updating the database. One limit of the technique is the elements being added must be within the range of the current k-vector tables. If this is not the case, the technique cannot be used and the k-vector tables must be rebuilt from scratch.

Mortari, Daniele↗

Low-Cost, User-Friendly, Rapid Analysis of Dynamic Data System Established

An issue of primary importance to the development of new jet and certain other airbreathing combined-cycle powered aircraft is the advancement of airframe-integrated propulsion technologies. Namely, engine inlets and their systems and subsystems are required to capture, convert, and deliver the atmospheric airflow demanded by such engines across their operating envelope in a form that can be used to provide efficient, stable thrust. This must be done while also minimizing aircraft drag and weight. Revolutionary inlet designs aided by new technologies are needed to enable new missions. An unwanted byproduct of pursuing these inlet technologies is increased time-variant airflow distortion. Such distortions reduce propulsion system stability, performance, operability, and life. To countermand these limitations and fully evaluate the resulting configurations, best practices dictate that this distortion be experimentally measured at large scale and analyzed. The required measurements consist of those made by an array of high-response pressure transducers located in the flow field at the aerodynamic interface plane (AIP) between the inlet and engine. Although the acquisition of the necessary pitot-pressure time histories is relatively straight-forward, until recent years, the analysis has proved to be very time-consuming, tedious, and expensive. To transform the analysis of these data into a tractable and timely proposition, researchers at the NASA Glenn Research Center created and established the Rapid Analysis of Dynamic Data (RADD) system. The system provides complete, near real-time analysis of time-varying inlet airflow distortion datasets with report quality output. This fully digital approach employs Institute of Electrical and Electronics Engineers (IEEE) binary data file format standardization to establish data-acquisition-system-independent processing on low cost personal computers. Features include invalid instrumentation code-out, logging, and multiple replacement schemes as needed for each channel of instrumentation. The AIP pressure distribution can be interpolated to simulate measurements by alternate AIP probe arrays, if desired. In addition, the RADD system provides for the application of filters that can be used to focus the analysis on the frequency range of interest.

Arend, David J.↗

Large-scale variations in ozone and polar stratospheric clouds measured with airborne lidar during formation of the 1987 ozone hole over Antarctica

A joint field experiment between NASA and NOAA was conducted during August to September 1987 to obtain in situ and remote measurements of key gases and aerosols from aircraft platforms during the formation of the ozone (O3) hole over Antarctica. The ER-2 (advanced U-2) and DC-8 aircraft from the NASA Ames Research Center were used in this field experiment. The NASA Langley Research Center's airborne differential absorption lidar (DIAL) system was operated from the DC-8 to obtain profiles of O3 and polar stratospheric clouds in the lower stratosphere during long-range flights over Antarctica from August 28 to September 29, 1987. The airborne DIAL system was configured to transmit simultaneously four laser wavelengths (301, 311, 622, and 1064 nm) above the DC-8 for DIAL measurements of O3 profiles between 11 to 20 km ASL (geometric altitude above sea level) and multiple wavelength aerosol backscatter measurements between 11 to 24 km ASL. A total of 13 DC-8 flights were made over Antarctica with 2 flights reaching the South Pole. Polar stratospheric clouds (PSC's) were detected in multiple thin layers in the 11 to 21 km ASL altitude range with each layer having a typical thickness of less than 1 km. Two types of PSC's were found based on aerosol backscattering ratios: predominantly water ice clouds (type 2) and clouds with scattering characteristics consistent with binary solid nitric acid/water clouds (type 1). Large-scale cross sections of O3 distributions were obtained. The data provides additional information about a potentially important transport mechanism that may influence the O3 budget inside the vortex. There is also some evidence that strong low pressure systems in the troposphere are associated with regions of lower stratospheric O3. This paper discusses the spatial and temporal variations of O3 inside and outside the polar vortex region during the development of the O3 hole and relates these data to other measurements obtained during this field experiment.

Browell, Edward V.↗

Foraging with MUSHROOMS: A Mixed-integer Linear Programming Scheduler for Multimessenger Target of Opportunity Searches with the Zwicky Transient Facility

Electromagnetic follow-up of gravitational-wave detections is very resource intensive, taking up hours of limited observation time on dozens of telescopes. Creating more efficient schedules for follow-up will lead to a commensurate increase in counterpart location efficiency without using more telescope time. Widely used in operations research and telescope scheduling, mixed-integer linear programming is a strong candidate to produce these higher-efficiency schedules, as it can make use of powerful commercial solvers that find globally optimal solutions to provided problems. We detail a new target-of-opportunity scheduling algorithm designed with Zwicky Transient Facility in mind that uses mixed-integer linear programming. We compare its performance to gwemopt, the tuned heuristic scheduler used by the Zwicky Transient Facility and other facilities during the third LIGO–Virgo gravitational-wave observing run. This new algorithm uses variable-length observing blocks to enforce cadence requirements and to ensure field observability, along with having a secondary optimization step to minimize slew time. We show that by employing a hybrid method utilizing both this scheduler and gwemopt, the previous scheduler used, in concert, we can achieve an average improvement in detection efficiency of 3%–11% over gwemopt alone for a simulated binary neutron star merger data set consistent with LIGO–Virgo's third observing run, highlighting the potential of mixed-integer target of opportunity schedulers for future multimessenger follow-up surveys.

B Parazin↗

Observations of x ray pulsars from the Kvant module

The Roentgen international x ray observatory on the Kvant module of the Mir space station has been successfully operating since the beginning of June 1987. Many x ray sources were observed and among them were several x ray pulsars. Four telescopes mounted on board the Kvant module cover a wide energy range with good timing resolution. Timing analysis of the Kvant module data suffers from the presence of only short continuous intervals of source observations, separated by 90 min gaps (90 min is the orbital period of the Mir space station around the Earth). The presence of 90 min gaps leads to the appearance of beat frequencies v=v sub 0 + or - n/90 min (n = 1, 2, 3). Special analysis was applied to avoid this difficulty. Results are presented of the pulsation period measurements of the x ray pulsars Her X-1, Cen X-3, SMC X-1, Vela X-1, A0535 + 26 by the instruments on board the Kvant module in 1987 to 1989. The values of the periods are reduced to the solar system barycenter and to the binary system barycenter (excluding A0535 + 26).

Gilfanov, M.↗

Evaluating MODIS Snow Products Using an Extensive Wildlife Camera Network

Snow covers a maximum of 47 million km 2 of Earth's northern hemisphere each winter and is an important component of the planet's energy balance, hydrology cycles, and ecosystems. Monitoring regional and global snow cover has increased in urgency in recent years due to warming temperatures and declines in snow cover extent. Optical satellite instruments provide large-scale observations of snow cover, but cloud cover and dense forest canopy can reduce accuracy in mapping snow cover. Remote camera networks deployed for wildlife monitoring operate below cloud cover and in forests, representing a virtually untapped source of snow cover observations to supplement satellite observations. Using images from 1,181 wildlife cameras deployed by the Norwegian Institute for Nature Research (NINA), we compared snow cover extracted from camera images to Moderate Resolution Imaging Spectroradiometer (MODIS) snow cover products during winter months of 2018–2020. Ordinal snow classifications (scale = 0–4) from cameras were closely related to normalized difference snow index (NDSI) values from the MODIS Terra Snow Cover Daily L3 Global 500m (MOD10A1) Collection 6 product (R 2 = 0.70). Tree canopy cover, the normalized difference vegetation index (NDVI), and image color mode influenced agreement between camera images and MOD10A1 NDSI values. For MOD10A1F, MOD10A1's corresponding cloud-gap filled product, agreement with cloud-gap filled values decreased from 78.5% to 56.4% in the first three days of cloudy periods and stabilized thereafter. Using our camera data as validation, we derived a threshold to create daily binary maps of snow cover from the MOD10A1 product. The threshold corresponding to snow presence was an NDSI value of 40.50, which closely matched a previously defined global binary threshold of 40 using the MOD10A2 8-day product. These analyses demonstrate the utility of camera trap networks for validation of snow cover products from satellite remote sensing, as well as their potential to identify sources of inaccuracy.

Validation↗

Adaptive-Sweep Algorithm for Spacecraft Carrier Acquisition and Tracking: System Analysis and Implementation

This paper presents an adaptive-sweep algorithm that can be used in conjunction with a Phased-Lock Loop to acquire and track the carrier of a Binary Phase-shift Keying signal with residual carrier. This algorithm is useful in proximity links where no Doppler pre-compensation is available at the transmitter, and allows the receiver to acquire the incoming carrier even if the experienced Doppler shift is several orders of magnitude larger than the PLL bandwidth. Other applications for this algorithm include Multiple Uplink per Antenna at the Deep Space Network, and generation of observables (Doppler shift, Doppler rate, range rate) for in-situ navigation purposes. This paper enhances a previously presented adaptive-sweep algorithm and its performance analysis in two fronts. First, the algorithm now uses the direction function to automatically estimate the required frequency jump to achieve PLL lock. This enables a fully adaptive-sweep scheme in which system implementer does not need to manually select thresholds. On the other hand, we study the system performance in the presence of Additive White Gaussian Noise and derive necessary conditions for the system to operate at low signal-to-noise conditions. This allows us to create design rules that specify all parameters of the algorithm given a set of system-level requirements. To test the performance of the proposed algorithm, we implement it in GNU Radio, an open-source Software-Defined Radio that interfaces with several commercial radio peripherals. We use this implementation to demonstrate carrier lock and quantify system performance under different noise conditions. We also test the algorithm using open-loop recordings of two downlinks between the Lunar Reconnaissance Orbiter and the Deep Space Network. We show that even after large frequency jumps (tens of kHz), the proposed system is able to rapidly reacquire the carrier and continue operation.

Divsalar, Dariush↗

Prospects for Exoplanet Imaging in Multi-Star Systems with Starshades

We explore the capabilities of a starshade mission to directly image multi-star systems. In addition to the diffracted and scattered light for the on-axis star, a multi-star system features additional starlight leakage from the off-axis star that must also be controlled. A basic option is for additional starshades to block the off- axis stars. An interesting option takes the form of hybrid operation of a starshade in conjunction with an internal starlight suppression. Two hybrid scenarios are considered. One such scenario includes the coronagraph instrument blocking the on-axis star, with the starshade blocking off-axis starlight. Another scenario uses the wavefront control system in the coronagraph instrument and using a recent Super-Nyquist Wavefront Control (SNWC) technique can remove the off-axis stars leakage to enable a region of high-contrast around the on-axis star blocked by the starshade. We present simulation results relevant for the WFIRST telescope.

High-Contrast Imaging↗

Binary space partitioning trees and their uses

Binary Space Partitioning (BSP) trees have some qualities that make them useful in solving many graphics related problems. The purpose is to describe what a BSP tree is, and how it can be used to solve the problem of hidden surface removal, and constructive solid geometry. The BSP tree is based on the idea that a plane acting as a divider subdivides space into two parts with one being on the positive side and the other on the negative. A polygonal solid is then represented as the volume defined by the collective interior half spaces of the solid's bounding surfaces. The nature of how the tree is organized lends itself well for sorting polygons relative to an arbitrary point in 3 space. The speed at which the tree can be traversed for depth sorting is fast enough to provide hidden surface removal at interactive speeds. The fact that a BSP tree actually represents a polygonal solid as a bounded volume also makes it quite useful in performing the boolean operations used in constructive solid geometry. Due to the nature of the BSP tree, polygons can be classified as they are subdivided. The ability to classify polygons as they are subdivided can enhance the simplicity of implementing constructive solid geometry.

Bell, Bradley N.↗

Bit-Serial Adder Based on Quantum Dots

A proposed integrated circuit based on quantum-dot cellular automata (QCA) would function as a bit-serial adder. This circuit would serve as a prototype building block for demonstrating the feasibility of quantum-dots computing and for the further development of increasingly complex and increasingly capable quantum-dots computing circuits. QCA-based bit-serial adders would be especially useful in that they would enable the development of highly parallel and systolic processors for implementing fast Fourier, cosine, Hartley, and wavelet transforms. The proposed circuit would complement the QCA-based circuits described in "Implementing Permutation Matrices by Use of Quantum Dots" (NPO-20801), NASA Tech Briefs, Vol. 25, No. 10 (October 2001), page 42 and "Compact Interconnection Networks Based on Quantum Dots" (NPO-20855), which appears elsewhere in this issue. Those articles described the limitations of very-large-scale-integrated (VLSI) circuitry and the major potential advantage afforded by QCA. To recapitulate: In a VLSI circuit, signal paths that are required not to interact with each other must not cross in the same plane. In contrast, for reasons too complex to describe in the limited space available for this article, suitably designed and operated QCA-based signal paths that are required not to interact with each other can nevertheless be allowed to cross each other in the same plane without adverse effect. In principle, this characteristic could be exploited to design compact, coplanar, simple (relative to VLSI) QCA-based networks to implement complex, advanced interconnection schemes. To enable a meaningful description of the proposed bit-serial adder, it is necessary to further recapitulate the description of a quantum-dot cellular automation from the first-mentioned prior article: A quantum-dot cellular automaton contains four quantum dots positioned at the corners of a square cell. The cell contains two extra mobile electrons that can tunnel (in the quantum-mechanical sense) between neighboring dots within the cell. The Coulomb repulsion between the two electrons tends to make them occupy antipodal dots in the cell. For an isolated cell, there are two energetically equivalent arrangements (denoted polarization states) of the extra electrons. The cell polarization is used to encode binary information. Because the polarization of a nonisolated cell depends on Coulomb-repulsion interactions with neighboring cells, universal logic gates and binary wires could be constructed, in principle, by arraying QCA of suitable design in suitable patterns. Again, for reasons too complex to describe here, in order to ensure accuracy and timeliness of the output of a QCA array, it is necessary to resort to an adiabatic switching scheme in which the QCA array is divided into subarrays, each controlled by a different phase of a multiphase clock signal. In this scheme, each subarray is given time to perform its computation, then its state is frozen by raising its inter-dot potential barriers and its output is fed as the input to the successor subarray. The successor subarray is kept in an unpolarized state so it does not influence the calculation of preceding subarray. Such a clocking scheme is consistent with pipeline computation in the sense that each different subarray can perform a different part of an overall computation. In other words, QCA arrays are inherently suitable for pipeline and, moreover, systolic computations. This sequential or pipeline aspect of QCA would be utilized in the proposed bit-serial adders.

Fijany, Amir↗