Patents by Inventor Yacov Efrat
Yacov Efrat has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 7620760Abstract: A device that includes: a first bus, connected between a first logic and a first circuit; a group of second buses connected between the first logic and between multiple non-high impedance circuit access logics associated with multiple circuits; wherein each circuit access logic is adapted to: (i) provide to the first logic, a circuit write value during a circuit writing period and during an idle period that follows the circuit writing period and ends when another circuit is allowed to write; and (ii) provide a default value when another circuit is allowed to write; and wherein the first logic is adapted to alter a state of the first bus in response to a change between two consecutive circuit write values.Type: GrantFiled: February 7, 2005Date of Patent: November 17, 2009Assignee: Freescale Semiconductor, Inc.Inventors: Kostantin Godin, Moshe Anschel, Yacov Efrat, Leonid Rabinovich, Noam Sivan, Eitan Zmora, Ziv Zamsky
-
Publication number: 20080301371Abstract: A memory cache control arrangement for performing a coherency operation on a memory cache comprises a receive processor for receiving an address group indication for an address group comprising a plurality of addresses associated with a main memory. The address group indication may indicate a task identity and an address range corresponding to a memory block of the main memory. A control unit processes each line of a group of cache lines sequentially. Specifically it is determined if each cache line is associated with an address of the address group by evaluating a match criterion. If the match criterion is met, a coherency operation is performed on the cache line. If a conflict exists between the coherency operation and another memory operation the coherency means inhibits the coherency operation. The invention allows a reduced duration of a cache coherency operation. The duration is further independent of the size of the main memory address space covered by the coherency operation.Type: ApplicationFiled: May 31, 2005Publication date: December 4, 2008Applicant: FREESCALE SEMICONDUCTOR, INC.Inventors: Itay Peled, Moshe Anschel, Yacov Efrat, Alon Eldar
-
Patent number: 7434009Abstract: Apparatus and method for providing information to a cache module, the apparatus includes: (i) at least one processor, connected to the cache module, for initiating a first and second requests to retrieve, from the cache module, a first and a second data unit; (ii) logic, adapted to receive the requests and determine if the first and second data units are mandatory data units; and (iii) a controller, connected to the cache module, adapted to initiate a single fetch burst if a memory space retrievable during the single fetch burst comprises the first and second mandatory data units, and adapted to initiate multiple fetch bursts if a memory space retrievable during a single fetch burst does not comprise the first and the second mandatory data units.Type: GrantFiled: September 30, 2004Date of Patent: October 7, 2008Assignee: Freescale Semiconductor, Inc.Inventors: Kostantin Godin, Moshe Anschel, Yacov Efrat, Zvika Rozenshein, Ziv Zamsky
-
Publication number: 20080140894Abstract: A device that includes: a first bus, connected between a first logic and a first circuit; a group of second buses connected between the first logic and between multiple non-high impedance circuit access logics associated with multiple circuits; wherein each circuit access logic is adapted to: (i) provide to the first logic, a circuit write value during a circuit writing period and during an idle period that follows the circuit writing period and ends when another circuit is allowed to write; and (ii) provide a default value when another circuit is allowed to write; and wherein the first logic is adapted to alter a state of the first bus in response to a change between two consecutive circuit write values.Type: ApplicationFiled: February 7, 2005Publication date: June 12, 2008Applicant: Freescale Semiconductor, IncInventors: Kostantin Godin, Mosche Anschel, Yacov Efrat, Leonid Rabinovich, Noam Sivan, Eitan Zmora, Ziv Zamsky
-
Publication number: 20060069877Abstract: Apparatus and method for providing information to a cache module, the apparatus includes: (i) at least one processor, connected to the cache module, for initiating a first and second requests to retrieve, from the cache module, a first and a second data unit; (ii) logic, adapted to receive the requests and determine if the first and second data units are mandatory data units; and (iii) a controller, connected to the cache module, adapted to initiate a single fetch burst if a memory space retrievable during the single fetch burst comprises the first and second mandatory data units, and adapted to initiate multiple fetch bursts if a memory space retrievable during a single fetch burst does not comprise the first and the second mandatory data units.Type: ApplicationFiled: September 30, 2004Publication date: March 30, 2006Inventors: Kostantin Godin, Moshe Anschel, Yacov Efrat, Zvika Rozenshein, Ziv Zamsky
-
Publication number: 20030041213Abstract: A cache is used in the performance of one task that may be interrupted by another task. The first task results in the cache being loaded at least partially. The second task interrupts, but is preventing from thrashing the highest priority data. The highest priority data is not available for thrashing during the running of the second task. The second task may be interrupted as well. Similarly, the third task is prevented from thrashing the highest priority data of the second task and the first task. The third task can thrash all of the cache except that preserved for the first and second tasks. After the third task is completed, the second task can begin running again without having to reload the highest priority data. The first task is similarly completed.Type: ApplicationFiled: August 24, 2001Publication date: February 27, 2003Inventors: Yakov Tokar, Yacov Efrat, Doron Schupper, Brett L. Lindsley
-
Patent number: 6055556Abstract: A system (400) alternatively performs real matrix operation in a first mode or performs complex matrix multiplication in a second mode. One input matrix (e.g., {B}) stays in a plurality of memory fields (430-k), while the other input matrix (e.g., {A}) is loaded into a plurality of registers (410-k). Parallel operating groups (405-k, 409-(k+1)) combine elements of {A} with elements of {B}. The groups (405-k, 409-(k+1)) comprise the memory fields (430-k), the registers (410-k) as well as computational units (440-k), switches (420-k) and adder units (460-k). The adder units (460-k) are configured by the switches (420-k) to operate as adders or to operate as accumulators, depending on the mode. Adders provide intermediate results and accumulators accumulate these intermediate results (e.g., Sum) to elements of the resulting matrix {C}. For complex multiplication, real (Re) and imaginary (Im) parts of matrix elements are in processed in adjacent groups.Type: GrantFiled: August 15, 1997Date of Patent: April 25, 2000Assignee: Motorola, Inc.Inventors: Itzhak Barak, Jacob Kirschenbaum, Yacov Efrat, Shao-Wei Pan
-
Patent number: 6003058Abstract: A multiply-multiply-accumulate (MMA) system (10) efficiently evaluates matrix products X=F*C. Matrix C is dissected into submatrices A and B taking advantage of symmetry in C. LOG unit (14) converts B, A, and F to LOG values B', A' and F'. These are summed in K parallel calculating units CU's (18) and converted back to Normal domain as P=F*B*A in ALOG units (22) and sent to accumulators ACU's (24). The ACU's (24) accumulate the results. An output buffer (26) combines the results. The B', A' values (32,34) are held in a cache memory (20) and the LOG sums are performed in two steps with intermediate storage.Type: GrantFiled: September 5, 1997Date of Patent: December 14, 1999Assignee: Motorola, Inc.Inventors: Jacob A. Kirschenbaum, Itzhak Barak, Yacov Efrat, Shao Wei Pan
-
Patent number: 5968112Abstract: Parallel signal processor (10) (FIG. 2) performs a Fourier Transformation of an input signal; The transformation coefficients are converted once to logarithmic form and stored in a cache memory. The input data is converted serially to logarithmic form, and fed to all processing units in parallel. The processing units compute their respective products as additions in the logarithmic domain. Then, the products are converted back to the normal domain. The products with the correct sign are summed by an accumulator of the respective processing element. After the last signal data point has run through the processing elements and the last products are added to their respective sums, all complex output signal data points are complete simultaneously.Type: GrantFiled: September 4, 1997Date of Patent: October 19, 1999Assignee: Motorola,Inc.Inventors: Jacob Kirschenbaum, Itzhak Barak, Yaron Ben-Arie, Yacov Efrat, Effi Orian, Shao Wei Pan, Shay Ping Wang
-
Patent number: 5923575Abstract: The invention relates to a method for electronically representing a number V in a binary data word. Both the exponent and the mantissa are represented as 2' complement. The mantissa is normalized to 0.1.F if the number V is positive where F is the fraction of the mantissa. In case that the number V is negative the fraction F is normalized to 10.F. Usage of this format allows to design an improved adder which requires less hardware.Type: GrantFiled: August 15, 1997Date of Patent: July 13, 1999Assignee: Motorola, Inc.Inventors: Yacov Efrat, Itzhak Barak, Yaron Ben-Arie, Shao Wei Pan