Abstract:
Digital signals (D) are transmitted on a bus (P) at given instants (..., t-1, t, ...) selectively in a non-encoded format (D(t)) and an encoded format (NOT(D(t))) so as to minimize the switching activity (SA) on the bus. Given the same value of switching activity (12, 13), the decision whether to transmit the signals in non-encoded format or in encoded format is taken according to the choice of maintaining constant, without transitions, the value of the additional signal (INV), which signals that encoding of the signals transmitted each time has taken place or has been omitted.
Abstract:
A pipeline structure (200) for use in a digital system (110) is proposed. The pipeline structure includes a plurality of stages (ST i ) arranged in a sequence from a first stage (ST 1 ) for receiving an input of the pipeline structure to a last stage (ST 5 ) for providing an output of the pipeline structure, at least one intermediate stage (ST 2 -ST 4 ) being interposed between the first stage and the last stage, wherein the first stage and the last stage are controlled by a main clock signal (CLK m ); the pipeline structure further includes phase shifting means (D 2 -D 4 ) for generating at least one local clock signal (CLK 2 -CLK 4 ) from the main clock signal for controlling the at least one intermediate stage, the main clock signal and the at least one local clock signal being out of phase.
Abstract:
A process for transmitting data on a bus, minimizing the switching activity, involves converting the data between a first format (b(t)) and a second format (B(t)) used for transmission of the data. The conversion between said first format (b(t)) and said second format (B(t)) entails the swapping of position of respective bits within a cluster comprising a given number of bits, the swap operation being implementable according to different variants, the maximum number of said variants being equal to the factorial of the aforesaid given number. Each of said variants is identified by a respective pattern (P t ). Among the aforesaid patterns, an optimal pattern is selected which minimizes the switching activity (SA) at the moment of transmission of data on the bus. The data are then transmitted on the bus using the second format (B(t)) generated using said optimal pattern.
Abstract:
For encoded membership functions used to identify the atomic conditions defining the antecedents of fuzzy inferences, and also for the determination of the operands of the said antecedents, corresponding stores (6, 9) are configured for the storage of the already available values of these encoded membership functions and of the said operands. At the time of identification of a new value for the said quantities, a check is made (5, 7) to see whether this value is already present in the corresponding store (6, 9). If the outcome of this check is positive, in the case of encoded membership functions, the mechanism by which the encoded fuzzy inferences point to these functions is changed, so that the pointers of the encoded fuzzy inferences are redirected towards the membership functions which are already stored. In the case of the operands of the antecedents, the check of the corresponding back-up store (9) is carried out preferably on the basis of the corresponding calculation values, the calculation of a new operand being disabled when it is found that the corresponding calculation parameters are already present in the corresponding back-up store (9). The aforesaid store (9) is preferably configured as a stack to which new calculated operand values are written at the uppermost position, with the possibility of making values identified as already present shift back to this uppermost position.
Abstract:
A circuit for estimating propagated carries in an adder starting from operands that include actual addition inputs or at least one earlier carry, the circuit performs statistical circuit operations with independent binary traffic for the operands. Preferably, this binary traffic is independent and equiprobable or quasi-equiprobable binary traffic, and the adder is a leading zero anticipatory logic integer adder producing a number having the same number of leading zeroes as the result of the integer addition performed. The carry value may be produced from a logic function (e.g., Karnaugh Map, Quine-McClusky) of the operands, as a logic combination of the operands covering all the 1s in the logic function.
Abstract:
In a method for transmitting on an optical connection (16) a sequence of input data (b(t)) comprising first ("1") and second ("0") logic states, there is envisaged the operation of providing an optical source (15) for generating an optical signal to be transmitted on said optical connection (16), said optical source (15) being able to generate optical pulses at the occurrence of said first ("1") logic states. The method comprises the operation of: - encoding (470,570) said sequence of input data (b(t)) in an encoded sequence of data (B(t)) prior to transmission on said optical connection (16), where said encoding operation minimizes the first logic states ("1") in said encoded sequence of data (B(t)). A preferential application is to optical-fibre communication systems with on-chip integrated buses.
Abstract:
A phase recovery and decoding method for decoding signals (S'(t)) comprising encoded symbols (u k ) over a respective symbol interval (T) which modulate a carrier, for example in a TCM system. The method envisages performing (20 to 26) a phase locking of the signal to be decoded so as to obtain a phase-locked signal which can present, during each symbol interval (T), variations induced by disturbances (noise, fading, etc.). The value attributed to the decoded symbol (U k ) is a function of the value assumed by the phase-locked signal on at least one subinterval of the symbol interval (T), for example located at the end of the symbol interval (T). Alternatively, the value assumed by the phase-locked signal on a plurality of subintervals comprised in each symbol interval (T) is detected (24,32), and a respective majority value of said phase-locked signal within said plurality of subintervals is identified (34,36). A suitable phase recovery and decoding circuit comprises a phase comparator (20), hard decision means (24), an encoder circuit (26), an oscillator (22) and a selection unit (28). For determining decoded value (U k ) and updating the state of the encoder circuit.
Abstract:
In a first step, slot synchronization is obtained by setting in correlation (210, 220) the received signal (r) with a primary sequence (SG), which represents the primary channel (PSC), and by storing said received signal. During a second step, the said correlator (210, 220) is re-used for correlating the received signal (r) with a secondary sequence (SSC) corresponding to the secondary synchronization codes. The correlator (210) is preferably structured in the form of a first filter (210) and of a second filter (220) set in series, which receive a first secondary sequence (SG1) and a second secondary sequence (SG2), typically consisting of Golay sequences. Proposed herein are architectures of a parallel and serial type, as well as architectures designed for re-using further circuit parts. A preferential application is in mobile communication systems based upon standards such as UMTS, CDMA2000, IS95, or WBCDMA.