Patent application number | Description | Published |
20110132715 | CLUTCH ASSEMBLY - The invention relates to a clutch assembly, comprising at least one friction clutch ( | 06-09-2011 |
20120156543 | MULTI-CELL BATTERY MODULE WITH INTEGRAL COOLING AND ASSEMBLY AIDS - A battery pack includes a frame member, first and second lithium ion cells, and an isolation plate. The frame member includes a floor, walls formed perpendicular to the floor, and an aperture defined by the walls. The frame member is formed from an electrically non-conductive plastic. The first lithium ion cell includes a first positive terminal, a first negative terminal, and a first electrically conductive housing. The first positive terminal is electrically connected to the first electrically conductive housing. The second lithium ion cell includes a second positive terminal, a second negative terminal, and a second electrically conductive housing. The second positive terminal is electrically connected to the second electrically conductive housing. The isolation plate directly contacts both the first and second electrically conductive housings and electrically isolates the first electrically conductive housing from the second electrically conductive housing. The isolation plate is formed from the electrically non-conductive plastic. | 06-21-2012 |
20130209853 | BATTERY HAVING A COOLING PLATE AND MOTOR VEHICLE HAVING A CORRESPONDING BATTERY - A battery includes at least one battery module having a lower face, a cooling plate having an upper face, and a fixing system configured for the at least one battery module. The at least one battery module is arranged on the upper face of the cooling plate and connected to the cooling plate. The fixing system has at least one fixing strap. The at least one battery module is fixed on the cooling plate by the at least one fixing strap in such a way that the lower face of the battery module is in direct contact with the upper face of the cooling plate. A motor vehicle includes the battery. | 08-15-2013 |
20130295423 | BATTERY HAVING REDUCED CONDENSATE FORMATION DUE TO WATER SEPARATION - A battery includes an essentially airtight housing having an air-permeable opening for pressure compensation. The battery also includes a plurality of battery cells arranged in the housing. The battery also includes an active cooling device configured to cool the battery cells in the housing. The cooling device includes a coolant and a distributor block configured to distribute the coolant. The battery also includes an air duct integrated in the distributor block. The air duct is configured and arranged such that the air-permeable opening of the housing is connected to ambient air via the air duct. | 11-07-2013 |
20130323554 | BATTERY MANAGEMENT SYSTEM FOR A BATTERY CELL WITH A PRESSURE-SENSITIVE FILM SENSOR - A battery management system is configured for use with a battery having at least one battery cell with a cell housing and an electrode winding arranged inside the cell housing. The battery management system includes a battery state detection mechanism. The electrode winding is covered at least partially by a pressure-sensitive film sensor. The battery state detection mechanism is configured to read in a measured value, provided by the pressure-sensitive film sensor, or a variable derived from this measured value. The battery state detection mechanism uses the measured value/variable as an evaluation parameter to determine the battery state. The battery state detection mechanism is configured to determine a swelling force from swelling of the electrode winding due to the state of charge thereof by using the measured value/variable. The swelling force is used to further determine the state of charge or state of health of the battery cell. | 12-05-2013 |
20140023896 | Battery Cell Module, Method for Producing a Battery Cell Module, Battery and Motor Vehicle - The disclosure relates to a battery cell module including a plurality of lithium ion battery cells, each having a degassing opening, and a cover substantially sealingly connected to a corresponding surface of each of the battery cells. The cover defines a gas receiving space configured to at least temporarily receive gas escaping from the battery cells. The gas receiving space is open in the direction of the battery cells. The opening area of the gas receiving space extends across a plurality of the battery cells. The disclosure further relates to a method for producing a battery cell module, to a battery, and to a motor vehicle having the battery cell module or the battery. | 01-23-2014 |
Patent application number | Description | Published |
20100240465 | SHAFT ARRANGEMENT FOR A TRANSMISSION - A shaft arrangement for a transmission comprises a shaft having an axial bore into which oil can be introduced via an oil supply system, at least one loose wheel which is rotatably supported on the shaft via a bearing, and a shift clutch arrangement which is arranged for connecting the loose wheel with the shaft in a rotationally fixed manner. The shift clutch arrangement comprises a guide sleeve which is connected with the shaft via a tooth engagement in a rotationally fixed manner. The axial bore is connected via at least one transversal bore with the outer circumference of the shaft, so as to supply oil to the bearing and to the shift clutch arrangement. The transversal bore is arranged in an area of the tooth engagement between the guide sleeve and the shaft. A channel is provided in at least one of an area of a toothing of the guide sleeve and an area of the toothing of the shaft, which, together with the guide sleeve toothing, forms the tooth engagement. The channel connects the transversal bore with an area between the guide sleeve and the bearing. | 09-23-2010 |
20120316023 | MOTOR VEHICLE DRIVE TRAIN - Drive train for a motor vehicle, having an electric machine for providing motive power, and a transmission arrangement. The transmission arrangement has a transmission input shaft and a first and a second gear stage. The transmission input shaft is connected to the electric machine. The drive train has a differential, which is connected to an output of the transmission and is set up to distribute motive power to two drive shafts. The differential is connected to a helically toothed driving gear, which is in engagement with a helically toothed pinion of the transmission output. A pressure pad arrangement absorbs axial forces arising from the helical toothing. | 12-13-2012 |
20130056322 | CLUTCH ARRANGEMENT, MOTOR VEHICLE DRIVE TRAIN AND CLUTCH ACTIVATION METHOD - A clutch arrangement for connecting two components, which can rotate relative to one another, of a motor vehicle drive train, in particular for connecting two shafts of a transmission or a shaft to an idler gear rotatably mounted on the shaft. The clutch arrangement has a clutch and an actuator arrangement. The clutch is opened in a first actuator position of an actuator section of the actuator arrangement. The clutch arrangement has a locking device for locking the actuator section in a locked position to keep the clutch closed. The locking device has a slotted-link guide with a first guide section and a second guide section for the actuator section, wherein the locked position can be reached from the first actuator position via the first guide section, and wherein the first actuator position can be reached from the locked position via the second guide section. | 03-07-2013 |
20130059668 | SHAFT ARRANGEMENT FOR A TRANSMISSION - A shaft arrangement for a transmission comprises a shaft having an axial bore connected to an oil supply system, at least one loose wheel rotatably supported on the shaft via a bearing, and a shift clutch arrangement which connects the loose wheel for rotation with the shaft. The shift clutch arrangement comprises a guide sleeve connected for rotation with the shaft via a tooth engagement. The axial bore supplies oil to the bearing and shift clutch arrangement via a transversal bore in an area of the tooth engagement between the guide sleeve and the shaft. A channel in at least one of an area of a toothing of the guide sleeve and an area of the toothing of the shaft, which, together with the guide sleeve toothing, forms the tooth engagement connects the transversal bore with an area between the guide sleeve and the bearing. | 03-07-2013 |
20130104683 | SHIFT ARRANGEMENT FOR A MOTOR VEHICLE GEARBOX | 05-02-2013 |
20130192948 | DRIVETRAIN-CLUTCH ARRANGEMENT AND FLUID CYLINDER THEREFOR - Fluid cylinder for activating an element of a drivetrain of a motor vehicle. The fluid cylinder has a cylinder housing and a piston. The piston is sealed off from the cylinder housing by means of a piston seal. At least one fluid chamber is formed between the cylinder housing and the piston, which fluid chamber can be connected via at least a first fluid connection to a fluid supply device. The piston in a piston stop position rests against a stop surface of the cylinder housing. The first fluid connection is formed in the region of the stop surface of the cylinder housing. The piston is connected to a sealing device which seals off the first fluid connection in the piston stop position. | 08-01-2013 |
20130305861 | CLUTCH ARRANGEMENT AND TWO-SPEED GEARBOX - Clutch arrangement for a motor vehicle gearbox. The clutch arrangement has a housing and a clutch. The clutch is arranged in the housing and is arranged concentrically with a shaft, which extends in a longitudinal axis. The shaft is supported on the housing by means of a first shaft bearing adjacent to the clutch and by means of a second shaft bearing spaced at an axial distance from the clutch. The clutch arrangement has an actuator arrangement for actuating the clutch. The actuator arrangement is designed to exert an actuating force on the clutch in a first longitudinal direction. The actuator arrangement here being axially braced on the housing and a force flux being introduced into the shaft as a result of the actuating force. The first shaft bearing is arranged so that the force flux introduced into the shaft can be axially braced on the housing by way of the first shaft bearing. | 11-21-2013 |
20130306431 | ACTUATOR ARRANGEMENT FOR A MOTOR VEHICLE DRIVE TRAIN - Actuator arrangement for a drive train, which has at least one friction clutch for transmitting drive torque and has a transmission. The friction clutch can be actuated by means of a hydraulic clutch cylinder, which is connected directly to a pump port of a pump driven by an electric motor in order to actuate the friction clutch, such that the friction clutch can be actuated by varying the speed of the pump. The actuator arrangement has a parking lock actuator device for actuating a parking lock arrangement of the drive train. The parking lock actuator device has at least one hydraulic parking lock cylinder, which can be connected to the pump, such that the parking lock arrangement can be actuated by varying at least one of the direction of rotation or the speed of the pump. | 11-21-2013 |
20140033844 | STEP-VARIABLE TRANSMISSION FOR A MOTOR VEHICLE - Step-variable transmission for a motor vehicle. The transmission has a gearbox inlet, which can be connected to a drive motor, and has a gearbox outlet, which can be connected to a driven axle of the motor vehicle. The step-variable transmission is designed for establishing at least a first gear and a further gear. Power in the first gear is transmitted from the gearbox inlet to the gearbox outlet by way of a first clutch arrangement. Power in the further gear is transmitted from the gearbox inlet to the gearbox outlet by way of a second clutch arrangement. The second clutch arrangement comprises a powershift clutch. The first clutch arrangement comprises an overrunning clutch. | 02-06-2014 |
20140041986 | ACTUATOR ARRANGEMENT FOR A DRIVE TRAIN - Actuator arrangement for a drive train. The actuator arrangement has an actuator pump driven by electric motor, and a clutch actuator, which is designed for actuation of a friction clutch of the drive train and which is connected to a discharge port of the actuator pump. The actuator arrangement has a parking lock actuator, which is designed for actuation of a parking lock arrangement of the drive train. The parking lock actuator has an open position, in which the parking lock arrangement is released, and a closed position, in which the parking lock arrangement is closed. The parking lock actuator is likewise connected to the discharge port of the actuator pump. The parking lock arrangement can be retained in at least one of the open position and the closed position by means of a retaining device. | 02-13-2014 |
20150176682 | HYBRID DRIVE TRAIN FOR A MOTOR VEHICLE - Hybrid drive train for a motor vehicle, comprising an internal combustion engine, an electric machine and a dual clutch transmission. The transmission has a dual clutch arrangement and a spur gear transmission arrangement with two part-transmissions. The spur gear transmission arrangement is configured to set exactly three forward gear stages, or is configured to set exactly four forward gear stages. The spur gear transmission arrangement being configured with three parallel shaft arrangements which are connected to one another via gear set arrangements in such a way that motive power is transmitted via at least two of the shaft arrangements, depending on the forward gear stage engaged. | 06-25-2015 |
Patent application number | Description | Published |
20130046784 | BEGIN ANCHOR ANNOTATION IN DFAs - Disclosed is a method and system of matching a string of symbols to a ruleset. The ruleset comprise a set of rules. The method includes ignoring begin anchor requirements when constructing a DFA from all the rules of the ruleset, annotating the accepting states of the DFA with the begin anchor information, executing the DFA, and checking begin anchor annotations to determine if begin anchor requirement are satisfied if an accepting state is reached. Embodiments also include rulesets with begin anchors on matches, rulesets with early exit information on non-accepting states, and rulesets with accept begin anchors in accepting states. | 02-21-2013 |
20130046954 | MULTI-THREADED DFA ARCHITECTURE - Disclosed is an architecture, system and method for performing multi-thread DFA descents on a single input stream. An executer performs DFA transitions from a plurality of threads each starting at a different point in an input stream. A plurality of executers may operate in parallel to each other and a plurality of thread contexts operate concurrently within each executer to maintain the context of each thread which is state transitioning. A scheduler in each executer arbitrates instructions for the thread into an at least one pipeline where the instructions are executed. Tokens may be output from each of the plurality of executers to a token processor which sorts and filters the tokens into dispatch order. | 02-21-2013 |
20140101176 | BLENDED MATCH MODE DFA SCANNING - Disclosed is a method for simultaneously finding matches for rules that require greedy matching and comprehensive matching by executing a single Deterministic Finite Automaton (DFA). DFAs annotations are used to enable a single DFA to represent rules that require greedy and comprehensive matching. DFA descents are performed from various positions in an input stream, match information is recorded and match results are selectively generated (filtered) to achieve the greedy or comprehensive match behavior required by individual rules. | 04-10-2014 |
20140101185 | START POINTER TRACKING IN NFAs - In a hardware engine, finding rule matches within an input stream by executing a Nondeterministic Finite Automaton (NFA) with active states tracked in parallel cells, a Start Pointer (SP) is captured by the cell beginning a match and passed from cell to cell until the match completes, when it is reported by the cell ending the match. For multiple overlapping matches, different cells may hold different SPs, and a cell representing multiple NFA states may hold multiple SPs. Methods are given to select one SP when multiple SPs collide in the same state. | 04-10-2014 |
20140114996 | NFA CHARACTER CLASS MATCHING - Disclosed is method of matching a character class to a symbol of an input stream. A character class, or a plurality of character classes, is defined into an accessible format which when accessed is compared to a symbol in an input stream. The format may be stored in an NFA array cell or it may be broadcast to the cell array with an input symbol for comparison. | 04-24-2014 |
20140115263 | CHILD STATE PRE-FETCH IN NFAs - Disclosed is a method and apparatus for pre-fetching child states in an NFA cell array. A pre-fetch depth value is determined for each transition in an NFA graph. The pre-fetch depth value is accessed for transition from an active state in the NFA graph. The child states of the active state are pre-fetched to the depth of the pre-fetch depth value recursively. A loader loads the pre-fetched states into the NFA cell array. | 04-24-2014 |
20140129775 | CACHE PREFETCH FOR NFA INSTRUCTIONS - Disclosed is a method of pre-fetching NFA instructions to an NFA cell array. The method and system fetch instructions for use in an L1 cache during NFA instruction execution. Successive instructions from a current active state are fetched and loaded in the L1 cache. Disclosed is a system comprising an external memory, a cache line fetcher, and an L1 cache where the L1 cache is accessible and searchable by an NFA cell array and where successive instructions from a current active state in the NFA are fetched from external memory in an atomic cache line manner into a plurality of banks in the L1 cache. | 05-08-2014 |
20140143195 | COMPLEX NFA STATE MATCHING - Disclosed is a method and system for matching a complex NFA state comprising a spinner followed by a character class sequence which may be represented by the general regular expression form [S] {N,M}[A0][A1] . . . [Ak−1]. An input transition activates the spinner and the spin count increments with successive matches of the spin class [S]. When the spin count is between N and M, sequence matching begins. Several base sequence CCLs are compared in parallel with a corresponding window of input symbols. If all match, a signal enters a delay line until the end of the base sequence. When the signal exits the delay line, extended sequence CCLs are accessed from a table sequentially and compared with successive input symbols. After the final extension CCL matches, an output transition is signaled. For short sequences, unused base sequence CCLs may be configured with look-ahead classes. | 05-22-2014 |
20140149439 | DFA-NFA HYBRID - Disclosed is a hybrid architecture combining DFA and NFA based engines. The DFA engine and NFA engine scan the same input stream. The DFA engine may be a multi-threaded engine. Fragments of rules are assigned to the DFA engine and portions of rules are assigned to the NFA engine. Fragments matched by the DFA engine may be sorted by a sorter into NFA launch positions before activating NFA states. A dynamically reconfigurable NFA cell array may be used. An NFA state signaled by a DFA fragment match is loaded into NFA cell(s). The DFA fragments may be adjacent to start state positions or following high-branching NFA states. Look-around assertions may be used by the DFA to signal to the NFA to either prevent or permit continued matching of a rule. | 05-29-2014 |
20140164309 | NON-DETERMINISTIC FINITE AUTOMATON OVERFLOW RECOVERY - Disclosed is a method of recovering from overflow of a hardware dynamically reconfigurable NFA cell array, to find matches within a symbol stream to regular expression or similar rules without missing matches due to overflow. Upon overflow, active states are selected to spill from the cell array, saving state information and spill position. Scanning continues a limited distance, with additional overflow spills possible, to a selected end of segment position where all active end states are removed and recorded. A re-scan of the segment from the first overflow position begins with each previously spilled state re-injected at the same position it was spilled from. At the end of the segment, saved end states are re-injected and scanning continues. RE-scans may iterate if there was additional overflow. NFA states may be assigned color codes, with connected states receiving the same color, to aid in efficient overflow recovery. | 06-12-2014 |
20140173254 | CACHE PREFETCH FOR DETERMINISTIC FINITE AUTOMATON INSTRUCTIONS - In a DFA scanning engine used to match regular expressions or similar rules, instructions to execute DFA state transitions are accessed through an instruction cache. Each DFA instruction may indicate varying numbers of transitions or branches from a current state. The cache pre-fetches a requested number of additional instructions consecutively following an accessed instruction. The DFA engine accesses an instruction from the cache corresponding to a state within a small number of transitions from the root state. When a low-branching instruction is executed to access a next instruction from the root state, or when a low-branching instruction is executed to access a next instruction from the cache, a fixed or configurable pre-fetch length is requested. Some instructions such as low-branching instructions may contain a pre-fetch hint. | 06-19-2014 |
20140173603 | MULTIPLE STEP NON-DETERMINISTIC FINITE AUTOMATON MATCHING - Disclosed is a hardware NFA cell array used to find matches to regular expressions or other rules in an input symbol stream scans multiple symbols per clock cycle by comparing multiple symbol classes against multiple input symbols per cycle in parallel, signaling bundles of multiple transitions from parent cells to child cells and updating NFA state status by multiple steps. To retain high frequency operation, the cell array will not resolve transition chains from a first cell to a second cell to a third cell in a single cycle. When a chain is required, the cell array takes fewer steps in one cycle to break the chain into separate cycles. To detect multi-transition chains, each cell compares symbol classes to future symbols in advance and back-communicates future match positions to parent cells in the array as launch hazards. | 06-19-2014 |
20140208076 | DFA COMPRESSION AND EXECUTION - A character class (CCL) memory containing simple CCLs represented by encoding contained symbols or minimum and maximum symbols of a range, complex CCLs represented by bit-masks indicating contained symbols, and equivalence class (EC) maps represented as tables of ED values for each symbol value. Determining a next DFA transition by comparing multiple CCLs with a single input symbol, and selecting a transition according to the first matching CCL, or selecting a transition corresponding to a vector of CCL match result bits. Comparing CCLs from one DFA instruction to determine a transition and if no CCLs match, comparing CCLs from a second DDFA instruction to determine the transition. Matching linear sequence of two or more DFA states using a sequence of multiple CCLs encoded in a single DFA instruction. | 07-24-2014 |
20140214748 | INCREMENTAL DFA COMPILATION WITH SINGLE RULE GRANULARITY - A composite DFA for multiple regular expressions or other rules may be generated in a two-step process—first compiling single rule DFAs, then performing subset construction on those DFAs to generate the composite DFA, with subset information retained. A new batch of one or more rules may be added by another subset construction from the old composite DFA and new single rule DFAs, with subset information for the new composite DFA compressed into sets of states from old and new single rule DFAs. A batch of one or more rules is deleted by deleting references to single rule DFA states from composite DFA subsets, deleting composite DFA states with empty subsets and merging composite DFA states with identical subsets. Rules are changed by deleting the old versions and then adding the new versions. | 07-31-2014 |
20140214749 | SYSTEM AND METHOD FOR DFA-NFA SPLITTING - Cost factors are utilized and may be estimated to determine split points in a DFA-NFA hybrid. The cost factors may comprise NFA start states, DFA backup factor, DFA-NFA token frequency, DFA steps to match, and NFA states to match. Other cost factors may be used as necessary. The cost factors are multiplied by tunable coefficients and summed. NFA states at minimum cost points are determined for entrance states in the NFA. A DFA is compiled from the entrance paths to the entrance states. NFA states and transitions needed only to reach entrance states may be deleted and all remaining NFA states are made available for execution by the NFA engine. An NFA representation of an NFA is examined by bounded depth-first recursion from each start state. | 07-31-2014 |
20140215090 | DFA SUB-SCANS - In a DFA, a sub-scan is executed during a DFA scan. The sub-scan consumes input symbols out of sequence relative to the DFA scan, either forward or in reverse. An input symbol in the DFA scan is matched. A sub-scan command is supplied to the DFA. The sub-scan command is executed and at least one symbol is consumed in the sub-scan. | 07-31-2014 |
20150286927 | COMPLEX NFA STATE MATCHING METHOD THAT MATCHES INPUT SYMBOLS AGAINST CHARACTER CLASSES (CCLS), AND COMPARES SEQUENCE CCLS IN PARALLEL - Disclosed is a method and system for matching a complex NFA state comprising a spinner followed by a character class sequence which may be represented by the general regular expression form [S] {N,M}[A0][A1] . . . [Ak-1]. An input transition activates the spinner and the spin count increments with successive matches of the spin class [S]. When the spin count is between N and M, sequence matching begins. Several base sequence CCLs are compared in parallel with a corresponding window of input symbols. If all match, a signal enters a delay line until the end of the base sequence. When the signal exits the delay line, extended sequence CCLs are accessed from a table sequentially and compared with successive input symbols. After the final extension CCL matches, an output transition is signaled. For short sequences, unused base sequence CCLs may be configured with look-ahead classes. | 10-08-2015 |
Patent application number | Description | Published |
20140200166 | BIOINFORMATICS SYSTEMS, APPARATUSES, AND METHODS EXECUTED ON AN INTEGRATED CIRCUIT PROCESSING PLATFORM - A system, method and apparatus for executing a sequence analysis pipeline on genetic sequence data includes an integrated circuit formed of a set of hardwired digital logic circuits that are interconnected by physical electrical interconnects. One of the physical electrical interconnects forms an input to the integrated circuit connected with an electronic data source for receiving reads of genomic data. The hardwired digital logic circuits are arranged as a set of processing engines, each processing engine being formed of a subset of the hardwired digital logic circuits to perform one or more steps in the sequence analysis pipeline on the reads of genomic data. Each subset of the hardwired digital logic circuits is formed in a wired configuration to perform the one or more steps in the sequence analysis pipeline. | 07-17-2014 |
20140236490 | BIOINFORMATICS SYSTEMS, APPARATUSES, AND METHODS EXECUTED ON AN INTEGRATED CIRCUIT PROCESSING PLATFORM - A system, method and apparatus for executing a sequence analysis pipeline on genetic sequence data includes an integrated circuit formed of a set of hardwired digital logic circuits that are interconnected by physical electrical interconnects. One of the physical electrical interconnects forms an input to the integrated circuit connected with an electronic data source for receiving reads of genomic data. The hardwired digital logic circuits are arranged as a set of processing engines, each processing engine being formed of a subset of the hardwired digital logic circuits to perform one or more steps in the sequence analysis pipeline on the reads of genomic data. Each subset of the hardwired digital logic circuits is formed in a wired configuration to perform the one or more steps in the sequence analysis pipeline. | 08-21-2014 |
20140309944 | BIOINFORMATICS SYSTEMS, APPARATUSES, AND METHODS EXECUTED ON AN INTEGRATED CIRCUIT PROCESSING PLATFORM - A system, method and apparatus for executing a sequence analysis pipeline on genetic sequence data includes an integrated circuit formed of a set of hardwired digital logic circuits that are interconnected by physical electrical interconnects. One of the physical electrical interconnects forms an input to the integrated circuit connected with an electronic data source for receiving reads of genomic data. The hardwired digital logic circuits are arranged as a set of processing engines, each processing engine being formed of a subset of the hardwired digital logic circuits to perform one or more steps in the sequence analysis pipeline on the reads of genomic data. Each subset of the hardwired digital logic circuits is formed in a wired configuration to perform the one or more steps in the sequence analysis pipeline. | 10-16-2014 |
20150339437 | DYNAMIC GENOME REFERENCE GENERATION FOR IMPROVED NGS ACCURACY AND REPRODUCIBILITY - A “dynamic” reference is presented that utilizes population level information to improve reference-based alignment to detect novel, deleterious, or functional variants in clinical sequencing applications. An automatically updated database of known genetic variants is provided to a memory connected with an integrated circuit configured for genetic sequence data with the dynamic reference and reference variants. | 11-26-2015 |
20160078170 | Bioinformatics Systems, Apparatuses, And Methods Executed On An Integrated Circuit Processing Platform - A system, method and apparatus for executing a sequence analysis pipeline on genetic sequence data includes a structured ASIC formed of a set of hardwired digital logic circuits that are interconnected by physical electrical interconnects. One of the physical electrical interconnects forms an input to the structured ASIC connected with an electronic data source for receiving reads of genomic data. The hardwired digital logic circuits are arranged as a set of processing engines, each processing engine being formed of a subset of the hardwired digital logic circuits to perform one or more steps in the sequence analysis pipeline on the reads of genomic data. Each subset of the hardwired digital logic circuits is formed in a wired configuration to perform the one or more steps in the sequence analysis pipeline. | 03-17-2016 |
Patent application number | Description | Published |
20140371109 | Bioinformatics Systems, Apparatuses, and Methods Executed on an Integrated Circuit Processing Platform - A system, method and apparatus for executing a sequence analysis pipeline on genetic sequence data includes a structured ASIC formed of a set of hardwired digital logic circuits that are interconnected by physical electrical interconnects. One of the physical electrical interconnects forms an input to the structured ASIC connected with an electronic data source for receiving reads of genomic data. The hardwired digital logic circuits are arranged as a set of processing engines, each processing engine being formed of a subset of the hardwired digital logic circuits to perform one or more steps in the sequence analysis pipeline on the reads of genomic data. Each subset of the hardwired digital logic circuits is formed in a wired configuration to perform the one or more steps in the sequence analysis pipeline. | 12-18-2014 |
20140371110 | BIOINFORMATICS SYSTEMS, APPARATUSES, AND METHODS EXECUTED ON AN INTEGRATED CIRCUIT PROCESSING PLATFORM - A system, method and apparatus for executing a sequence analysis pipeline on genetic sequence data includes a structured ASIC formed of a set of hardwired digital logic circuits that are interconnected by physical electrical interconnects. One of the physical electrical interconnects forms an input to the structured ASIC connected with an electronic data source for receiving reads of genomic data. The hardwired digital logic circuits are arranged as a set of processing engines, each processing engine being formed of a subset of the hardwired digital logic circuits to perform one or more steps in the sequence analysis pipeline on the reads of genomic data. Each subset of the hardwired digital logic circuits is formed in a wired configuration to perform the one or more steps in the sequence analysis pipeline. | 12-18-2014 |
20160132638 | BIOINFORMATICS SYSTEMS, APPARATUSES, AND METHODS EXECUTED ON AN INTEGRATED CIRCUIT PROCESSING PLATFORM - A system, method and apparatus for executing a sequence analysis pipeline on genetic sequence data includes an integrated circuit formed of a set of hardwired digital logic circuits that are interconnected by physical electrical interconnects. One of the physical electrical interconnects forms an input to the integrated circuit connected with an electronic data source for receiving reads of genomic data. The hardwired digital logic circuits are arranged as a set of processing engines, each processing engine being formed of a subset of the hardwired digital logic circuits to perform one or more steps in the sequence analysis pipeline on the reads of genomic data. Each subset of the hardwired digital logic circuits is formed in a wired configuration to perform the one or more steps in the sequence analysis pipeline. | 05-12-2016 |
20160140290 | Bioinformatics Systems, Apparatuses, and Methods Executed on an Integrated Circuit Processing Platform - A system, method and apparatus for executing a sequence analysis pipeline on genetic sequence data includes a structured ASIC formed of a set of hardwired digital logic circuits that are interconnected by physical electrical interconnects. One of the physical electrical interconnects forms an input to the structured ASIC connected with an electronic data source for receiving reads of genomic data. The hardwired digital logic circuits are arranged as a set of processing engines, each processing engine being formed of a subset of the hardwired digital logic circuits to perform one or more steps in the sequence analysis pipeline on the reads of genomic data. Each subset of the hardwired digital logic circuits is formed in a wired configuration to perform the one or more steps in the sequence analysis pipeline. | 05-19-2016 |