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:
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:
A cache memory system (115), comprising at least one cache memory (205) and a cache memory controller (210, Ft, Fd, 225, 230, 235, 245, 252). The at least one cache memory includes a plurality of storage locations (RLj), each one identified by a corresponding cache address (CADDR) and being adapted to store tag address portions (TAGi) and data words (DATi), each data word corresponding to a respective tag address portion. The cache memory controller is adapted to receive a first address (ADD) and to access the at least one cache memory based on the received first address.The cache memory controller includes a first address transformer (Ft, 225) adapted to receive the first address and to transform it into at least one first cache address corresponding thereto by applying a first transform function; the at least one first cache address is used by the cache memory controller for accessing the at least one cache memory to retrieve at least a first part of a tag address portion stored in at least one of the storage locations. The cache memory controller includes a hit detector (245) adapted to establish an at least partial hit condition based on a comparison of the retrieved at least a first part of the tag address portion and a first predetermined part (TAGp) of the first address, and a second address transformer (Fd, 225) adapted to receive the first address and to transform it into at least one second cache address corresponding thereto by applying a second transform function. The cache memory controller is further adapted to use the at least one second cache address for accessing the at least one cache memory to retrieve a data word corresponding to the retrieved tag address portion in case said at least partial hit condition is established.
Abstract:
In a method for multiplication of floating-point real numbers (f, FN), encoded in a binary way in sign (SGN, SN), exponent (E, EN) and mantissa (M; MN), the multiplication of the mantissa (M; MN) envisages a step of calculation of partial products, which are constituted by a set of addenda (P) corresponding to said mantissa (MN). In order to reduce the size and power consumption of the circuits designed for calculation, there is adopted a method of binary encoding which envisages setting the first bit of the mantissa (MN) to a value 1, in order to obtain a mantissa (MN) having a value comprised between 0.5 and 1. Also proposed are methods for rounding of the product and circuits for the implementation of the multiplication method. Also illustrated are circuits for conversion from and to encoding of floating-point real numbers according to the IEEE754 standard. Preferential application is in portable and/or wireless electronic devices, such as mobile telephones and PDAs, with low power-consumption requirements.
Abstract translation:在用符号(SGN,SN),指数(E,EN)和尾数(M; MN)二进制编码的浮点实数(f,FN)相乘的方法中,尾数 M; MN)设想了计算部分产品的步骤,所述部分产品由对应于所述尾数(MN)的一组附加部分(P)构成。 为了减小为计算而设计的电路的尺寸和功耗,采用二进制编码的方法,其设想将尾数(MN)的第一位设置为值1,以便获得尾数(MN) 具有在0.5和1之间的值。还提出了用于实现乘法方法的乘积和电路的四舍五入方法。 还示出了根据IEEE754标准的用于从浮点实数转换到浮点实数编码的电路。 优先应用在便携式和/或无线电子设备中,例如移动电话和PDA,具有低功耗要求。
Abstract:
Once slot synchronization has been obtained in a first step, during a second step there is acquired, by means of correlation (111, 117) of the received signal (r) with the synchronization codes, the information corresponding to the codegroup and to the fine slot synchronization. The synchronization codes are split into codesets. In a first step, a synchronization code identifying a corresponding codeset (CS) is identified by means of correlation (111) and search for the maximum value of correlation energy (114). In a second step, the received signal (r) is correlated (117) with the remaining codes (113) belonging to the codeset identified. The information thus obtained, which corresponds to all the synchronization codes comprised in the codeset identified, is used (115) for obtaining frame synchronization and codegroup identification. Preferential application is in mobile communication systems based upon standards, such as UMTS, CDMA2000, IS95 or WBCDMA.