Abstract: An H-bridge circuit includes a supply voltage node, a first pair of transistors and a second pair of transistors. First transistors in each pair have the current paths therethrough included in current flow lines between the supply node and, respectively, a first output node and a second output node. Second transistors in each pair have the current paths therethrough coupled to a third output node and a fourth output node, respectively. The first and third output nodes are mutually isolated from each other and the second and fourth output nodes are mutually isolated from each other. The H-bridge circuit is operable in a selected one of a first, second and third mode.

Abstract: An embodiment circuit includes a plurality of heat-generating circuits, a heat-sensitive circuit exposed to heat generated during operation of the plurality of heat-generating circuit, and a temperature sensor disposed at a location between the heat-sensitive circuit and the plurality of heat-generating circuits, the temperature sensor being configured to generate an over-temperature signal as a function of temperature sensed at the location. The plurality of heat-generating circuits may be selectively deactivatable in an ordered sequence based on deactivation weights respectively assigned to the plurality of heat-generating circuits and in response to the over-temperature signal.

Abstract: An embodiment circuit includes a plurality of heat-generating circuits, a heat-sensitive circuit exposed to heat generated during operation of the plurality of heat-generating circuit, and a temperature sensor disposed at a location between the heat-sensitive circuit and the plurality of heat-generating circuits, the temperature sensor being configured to generate an over-temperature signal as a function of temperature sensed at the location. The plurality of heat-generating circuits may be selectively deactivatable in an ordered sequence based on deactivation weights respectively assigned to the plurality of heat-generating circuits and in response to the over-temperature signal.

Abstract: QCA assemblies, in which basic cells are formed on the basis of graphene in order to provide a coupling field distribution in the form of an electrostatic field, a magnetic field, and the like which allows a unique association between field distribution and logic state. Moreover, the corresponding energy structure may be selected so as to allow operation of the QCA assemblies at ambient temperature. Hence, the signal processing capabilities of QCA assemblies may be obtained at significantly reduced complexity compared to conventional quantum-based QCA assemblies, which typically operate at very low temperatures.

Abstract: A method for control of an internal combustion engine includes generating, with a microelectromechanical system (MEMS) accelerometer, an acceleration signal representing vibrations of the internal combustion engine. An engine crank angle signal is generated based on the acceleration signal. The engine crank angle signal is compared with a target value. The internal combustion engine is adjusted based upon the comparing.

Abstract: QCA assemblies, in which basic cells are formed on the basis of graphene in order to provide a coupling field distribution in the form of an electrostatic field, a magnetic field, and the like which allows a unique association between field distribution and logic state. Moreover, the corresponding energy structure may be selected so as to allow operation of the QCA assemblies at ambient temperature. Hence, the signal processing capabilities of QCA assemblies may be obtained at significantly reduced complexity compared to conventional quantum-based QCA assemblies, which typically operate at very low temperatures.

Abstract: A method of detecting during a combustion cycle a peak value of pressure in a cylinder of an internal combustion engine includes providing and installing on the engine body an accelerometer that generates an acceleration signal representing vibrations of the engine body. The acceleration signal is filtered by comparing the band-pass filtered replica of the acceleration signal to a threshold. When the threshold is surpassed, a pressure peak is detected and flagged.

Abstract: A method of detecting during a combustion cycle a peak value of pressure in a cylinder of an internal combustion engine includes providing and installing on the engine body an accelerometer that generates an acceleration signal representing vibrations of the engine body. The acceleration signal is filtered by comparing the band-pass filtered replica of the acceleration signal to a threshold. When the threshold is surpassed, a pressure peak is detected and flagged.

Abstract: A hardware quantum gate for running quantum algorithms in a very fast manner exploits the fact that a large number of multiplications required by an entanglement operation of the quantum algorithm provides a null result since only one component per row of the entanglement matrix UF is not a null. The entanglement operation generates an entanglement vector by permuting pairs of opposite components of a linear superposition vector, depending on the value assumed by the function f. More specifically, if function f is null in correspondence to the vector identified by the first (leftmost) n qubits in common with the two n+1 qubit vectors, in which a pair of opposite components of the superposition vector is referred to, then the corresponding pair of components of the entanglement vector is equal to that of the superposition vector, otherwise it is the opposite.

Abstract: A quantum gate for running a Grover's quantum algorithm using a binary function having a vector basis of n qubits is provided. The quantum gate includes a superposition subsystem, an entanglement subsystem and an interference subsystem. The interference subsystem performs an interference operation on components of entanglement vectors for generating components of output vectors. The interference subsystem performs the interference operation in a very fast manner by using an adder receiving as input signals representing even or odd components of an entanglement vector, and generating a sum signal representing a weighted sum with a scale factor of the even or odd components.

Abstract: A method of performing a Grover's or a Deutsch-Jozsa's quantum algorithm being input with a binary function defined on a space having a basis of vectors of n of qubits includes carrying out a superposition operation over input vectors for generating components of linear superposition vectors referred to a second basis of vectors of n+1 qubits. An entanglement operation is performed over components of the linear superposition vectors for generating components of numeric entanglement vectors. The method allows a non-negligible time savings because the entanglement operation does not multiply a superposition vector for an entanglement matrix, but generates components of an entanglement vector simply by copying or inverting respective components of the superposition vector depending on values of the binary function. An interference operation is performed over components of the numeric entanglement vectors for generating components of output vectors.

Abstract: A quantum gate performs the superposition operation of a Grover's or of a Deutsch-Jozsa's quantum algorithm in a very fast manner. This is done by performing all multiplications by using logic gates that immediately outputs the result. The superposition operation includes performing the Hadamard rotation over an input set of vectors for producing a set of rotated vectors, and calculating the tensor product of all the rotated vectors for outputting a linear superposition set of vectors. The tensor product of all the rotated vectors is carried out by the logic gates.

Abstract: A method for performing a Simon's or Shor's quantum algorithm over a function encoded with n qubits is provided. The method includes performing a superposition operation over a set of input vectors for generating a superposition vector, performing an entanglement operation for generating a corresponding entanglement vector, and performing an interference operation for generating a corresponding output vector. The superposition operation is carried out in a comparably fast manner by generating the superposition vector by identifying the non-null components thereof and by calculating, as a function of the n qubits, the value ½n/2 of all the non-null components of the superposition vector, and by calculating indices of these components according to an arithmetic succession. The seed of this calculation is 1 and the common difference is 2n. The method may be implemented in a quantum gate.

Abstract: A quantum gate for running a Grover's quantum algorithm using a binary function having a vector basis of n qubits is provided. The quantum gate includes a superposition subsystem, an entanglement subsystem and an interference subsystem. The interference subsystem performs an interference operation on components of entanglement vectors for generating components of output vectors. The interference subsystem performs the interference operation in a very fast manner by using an adder receiving as input signals representing even or odd components of an entanglement vector, and generating a sum signal representing a weighted sum with a scale factor of the even or odd components.

Abstract: A hardware quantum gate for running quantum algorithms in a very fast manner exploits the fact that a large number of multiplications required by an entanglement operation of the quantum algorithm provides a null result since only one component per row of the entanglement matrix UF is not a null. The entanglement operation generates an entanglement vector by permuting pairs of opposite components of a linear superposition vector, depending on the value assumed by the function f. More specifically, if function f is null in correspondence to the vector identified by the first (leftmost) n qubits in common with the two n+1 qubit vectors, in which a pair of opposite components of the superposition vector is referred to, then the corresponding pair of components of the entanglement vector is equal to that of the superposition vector, otherwise it is the opposite.

Abstract: A method of performing a Grover's or a Deutsch-Jozsa's quantum algorithm being input with a binary function defined on a space having a basis of vectors of n of qubits includes carrying out a superposition operation over input vectors for generating components of linear superposition vectors referred to a second basis of vectors of n+1 qubits. An entanglement operation is performed over components of the linear superposition vectors for generating components of numeric entanglement vectors. The method allows a non-negligible time savings because the entanglement operation does not multiply a superposition vector for an entanglement matrix, but generates components of an entanglement vector simply by copying or inverting respective components of the superposition vector depending on values of the binary function. An interference operation is performed over components of the numeric entanglement vectors for generating components of output vectors.

Abstract: A circuit implementing a non-integer order dynamic system includes a neural network that receives at least one input signal and generates therefrom at least one output signal. The input and output signals are related to each by a non-integer order integro-differential relationship through the coefficients of the neural network. A plurality of such circuits, implementing respective non-integer order controllers can be interconnected in an arrangement wherein any of the integral or differential blocks included in one of these circuits generates a signal which is fed to any of the integral or differential blocks of another circuit in the system.

Abstract: A method for generating a random number sequence whose randomness properties are determined a priori, includes defining a parametric map, calculating, in function of parameters of the map, the entropy and the Lyapunov exponent of random number sequences obtainable using the parametric map, and identifying at least a set of values of parameters for which the entropy and the Lyapunov exponent are positive numbers the map has no attracting point. The method further includes assigning a pre-established value as a first feedback value and cyclically carrying out the following steps for generating a random number sequence: determining the parameters inside the set as the numerical values of respective physical quantities, outputting a random number, according to the map with the parameters and the assigned feedback value, and assigning as new feedback value the output random number.

Abstract: A quantum gate performs the superposition operation of a Grover's or of a Deutsch-Jozsa's quantum algorithm in a very fast manner. This is done by performing all multiplications by using logic gates that immediately outputs the result. The superposition operation includes performing the Hadamard rotation over an input set of vectors for producing a set of rotated vectors, and calculating the tensor product of all the rotated vectors for outputting a linear superposition set of vectors. The tensor product of all the rotated vectors is carried out by the logic gates.

Abstract: A circuit implementing a non-integer order dynamic system includes a neural network that receives at least one input signal and generates therefrom at least one output signal. The input and output signals are related to each by a non-integer order integro-differential relationship through the coefficients of the neural network. A plurality of such circuits, implementing respective non-integer order controllers can be interconnected in an arrangement wherein any of the integral or differential blocks included in one of these circuits generates a signal which is fed to any of the integral or differential blocks of another circuit in the system.