Patents by Inventor Fabrice Aidan

Fabrice Aidan 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: 10402198
    Abstract: A signal processing device comprising at least one control unit arranged to receive at least one pack-insert instruction, decode the received at least one pack-insert instruction, and output at least one pack-insert control signal in accordance with the received pack-insert instruction. The signal processing device further comprising at least one pack-insert component arranged to receive at least a first data block to be inserted into a sequence of data blocks to be output to at least one destination register, receive a plurality of further data blocks to be packed within the sequence of data blocks to be output to the at least one destination register, arrange the at least first data block and the plurality of further data blocks into a sequence of data blocks based at least partly on the at least one pack-insert control signal, and output the sequence of data blocks.
    Type: Grant
    Filed: June 18, 2013
    Date of Patent: September 3, 2019
    Assignee: NXP USA, Inc.
    Inventors: Avi Gal, Fabrice Aidan, Noam Eshel-Goldman, Roy Glasner, Dmitry Lachover, Itay Peled
  • Publication number: 20160188331
    Abstract: A signal processing device comprising at least one control unit arranged to receive at least one pack-insert instruction, decode the received at least one pack-insert instruction, and output at least one pack-insert control signal in accordance with the received pack-insert instruction. The signal processing device further comprising at least one pack-insert component arranged to receive at least a first data block to be inserted into a sequence of data blocks to be output to at least one destination register, receive a plurality of further data blocks to be packed within the sequence of data blocks to be output to the at least one destination register, arrange the at least first data block and the plurality of further data blocks into a sequence of data blocks based at least partly on the at least one pack-insert control signal, and output the sequence of data blocks.
    Type: Application
    Filed: June 18, 2013
    Publication date: June 30, 2016
    Applicant: Freescale Semiconductor, Inc.
    Inventors: Avi GAL, Fabrice AIDAN, Noam ESHEL-GOLDMAN, Roy GLASNER, Dmitry LACHOVER, Itay PELED
  • Publication number: 20160132332
    Abstract: A signal processing device comprising at least one control unit arranged to receive at least one bit-expand instruction, decode the received at least one bit-expand instruction, and output at least one control signal in accordance with the received at least one bit-expand instruction. The signal processing device further includes at least one execution unit component arranged to receive at least one source register value comprising at least one data bit to be expanded, extract at least one data bit from the at least one source register value located at an offset position according to the at least one control signal, expand the at least one extracted data bit into at least one multi-bit data type, and output the at least one multi-bit data type to at least one destination register.
    Type: Application
    Filed: June 18, 2013
    Publication date: May 12, 2016
    Applicant: Freescale Semiconductor, Inc.
    Inventors: Roy GLASNER, Fabrice AIDAN, Aviram AMIR, Noam ESHEL-GOLDMAN, Avi GAL, Ilia MOSKOVICH
  • Publication number: 20130275725
    Abstract: An integrated circuit device comprising at least one digital signal processor (DSP) module, the at least one DSP module comprising a first data register and at least one further data register and at least one data execution unit (DEU) module arranged to execute operations on target data stored within the first data register and the at least one further data register. The at least one DEU module is arranged, upon receipt of a conditional negation instruction, to retrieve at least one conditional bit value from the first data register, and conditionally perform negation of target data within the at least one further data register according to the at least one retrieved conditional bit value.
    Type: Application
    Filed: January 3, 2011
    Publication date: October 17, 2013
    Applicant: Freescale Semiconductor, Inc.
    Inventors: Ilia Moskovich, Fabrice Aidan, Avi Gal, Dmitry Lachover
  • Patent number: 6757701
    Abstract: A method and apparatus for implementing a linearly approximated Log MAP algorithm, the implementation involves calculating MAX*(a(n),b(n)) function, the method having the steps of: (A) Receiving a(n), b(n) and a value DE; (B) calculating (a(n)+b(n)+DE/2 and generating at least one intermediate result, the at least one intermediate result reflecting at least one relationship between at least two elements out of a(n), b(n) and DE; and (C) providing an MAX*(a(n),b(n)) result selected from a group comprising of a(n), b(n) or (a(n)+b(n)+DE)/2, the selection dependent upon the at least one intermediate result.
    Type: Grant
    Filed: August 3, 2001
    Date of Patent: June 29, 2004
    Assignee: Motorola, Inc.
    Inventors: Noam Sivan, Fabrice Aidan, Gregory Leshin
  • Patent number: 6654871
    Abstract: A method and a device for performing stack operations within a processing system. A first and second stack pointers point to a top of a stack and to a memory location following the top of the stack. A first stack pointer is used during pop operations and a second stack pointer is used during push operations. When a stack pointer is selected, it replaces the other stack pointer. The selected memory pointer is provided to a memory module in which a stack is implemented, and is also updated. When a pop operation is executed the updated stack pointer points to a memory location preceding a memory location pointed by the selected stack pointer and when a push operation is executed the updated stack pointer points to a memory address following that address.
    Type: Grant
    Filed: November 9, 1999
    Date of Patent: November 25, 2003
    Assignee: Motorola, Inc.
    Inventors: Fabrice Aidan, Yoram Salant, Mark Elnekave, Leonid Tsukerman
  • Patent number: 6480874
    Abstract: A power saving device and method for either adding or subtracting a constant from an operand, by checking a logic value of a portion of the operand and deciding whether to activate a multi-bit adder or to perform the subtraction or addition by inverting a portion of the operand. The power saving device and method is especially efficient when the constant K equals 2n. Then, the n'th bit of the operand is checked and if the addition or subtraction operation can be performed by inverting the n'th bit of the operand, a result is generated by that inversion, while a multi-bit adder is disabled.
    Type: Grant
    Filed: November 9, 1999
    Date of Patent: November 12, 2002
    Assignee: Motorola, Inc.
    Inventors: Fabrice Aidan, Yoram Salant, Mark Elnekave, Leonid Tsukerman
  • Publication number: 20020018533
    Abstract: A method and apparatus for implementing a linearly approximated Log MAP algorithm, said implementation involves calculating MAX*(a(n),b(n)) function, said method comprising the steps of: (A) Receiving a(n), b(n) and DE; (B) calculating (a(n)+b(n)+DE)/2 and generating at least one intermediate result, said at least one intermediate result reflecting at least one relationship between at least two elements out of a(n), b(n) and DE; and (C) providing an MAX*(a(n),b(n)) result selected from a group comprising of a(n), b(n) or (a(n)+b(n)+DE)/2, said selection dependent upon the at least one intermediate result.
    Type: Application
    Filed: August 3, 2001
    Publication date: February 14, 2002
    Inventors: Noam Sivan, Fabrice Aidan, Gregory Leshin