Patents by Inventor Atsushi Ishiwata

Atsushi Ishiwata 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: 8018931
    Abstract: A communication apparatus including a storage circuit that generates verification data in one-to-one correspondence with block data which is data having a first size, and stores each pair of verification data and block data in areas having a second size in an external memory; a packet control unit that includes a CPU which executes a program to, for each piece of verification data stored by the storage circuit, generate a piece of header information including the verification data, and perform control to transmit a piece of packet data including the generated piece of header information and the piece of block data corresponding to the piece of verification data included in the generated piece of header information; and a network unit operable to sequentially transmit each piece of packet data according to the control performed by the packet control unit, wherein the storage circuit and the CPU operate in parallel.
    Type: Grant
    Filed: May 9, 2008
    Date of Patent: September 13, 2011
    Assignee: Panasonic Corporation
    Inventors: Shinichiro Yamauchi, Akio Takeuchi, Atsushi Ishiwata
  • Patent number: 7555264
    Abstract: The present invention provides a method for automatically selecting, as a master, an optimum Bluetooth device for the master which can be stably connected to more devices in a Bluetooth network. According to the present invention, each of Bluetooth apparatuses capable of being masters acquires the device address of the connectable Bluetooth apparatus in response to an inquiry at 101, then, the each Bluetooth apparatus capable of being the masters acquires evaluation information such as the number of device address discoveries from the other Bluetooth apparatuses at 105, and the evaluation information of a self-device is compared with the acquired evaluation information of the other device at 106 to 113 in order to determine the Bluetooth apparatus to be the master based on a predetermined evaluating method for the evaluation information which is acquired. Thus, the master/slave decision of the self-device is caused to proceed.
    Type: Grant
    Filed: June 10, 2004
    Date of Patent: June 30, 2009
    Assignee: Panasonic Corporation
    Inventors: Atsushi Ishiwata, Toshihiro Tatsumi
  • Publication number: 20080310411
    Abstract: A communication apparatus that sequentially transmits a plurality of pieces of packet data over a network, each piece of packet data including a piece of block data, the communication apparatus including a storage circuit operable to generate a plurality of pieces of verification data in one-to-one correspondence with the plurality of pieces of block data, each piece of verification data reflecting content of the corresponding piece of block data which is data having a first size, and a store each pair of a piece of verification data and a corresponding piece of block data in a different one of a plurality of areas having a second size in an external memory; a packet control unit that includes a CPU and causes the CPU to execute a program to, for each piece of block data stored in the external memory by the storage circuit, read the piece of verification data corresponding to the piece of block data, generate a piece of header information including the read piece of verification data, and perform control to t
    Type: Application
    Filed: May 9, 2008
    Publication date: December 18, 2008
    Inventors: Shinichiro Yamauchi, Akio Takeuchi, Atsushi Ishiwata
  • Patent number: 7107586
    Abstract: A linking order forming section forms linking orders of intermediate objects. A linker starting section starts a linker based on the linking order that is formed by applying a genetic algorithm, etc. to form an executable object. A comparing section compares a program size of the formed executable object with the minimum value stored in a storing section. If the program size is smaller than the minimum value, the storing section stores this program size as the minimum value and also stores the linking order at that time. The linking order that can provide the minimum program size can be obtained effectively without the manual intervention by repeating a series of steps by using a repeating section.
    Type: Grant
    Filed: July 26, 2001
    Date of Patent: September 12, 2006
    Assignee: Matsushita Electric Industrial Co., Ltd.
    Inventor: Atsushi Ishiwata
  • Publication number: 20050014467
    Abstract: The present invention provides a method for automatically selecting, as a master, an optimum Bluetooth device for the master which can be stably connected to more devices in a Bluetooth network. According to the present invention, each of Bluetooth apparatuses capable of being masters acquires the device address of the connectable Bluetooth apparatus in response to an inquiry at 101, then, the each Bluetooth apparatus capable of being the masters acquires evaluation information such as the number of device address discoveries from the other Bluetooth apparatuses at 105, and the evaluation information of a self-device is compared with the acquired evaluation information of the other device at 106 to 113 in order to determine the Bluetooth apparatus to be the master based on a predetermined evaluating method for the evaluation information which is acquired. Thus, the master/slave decision of the self-device is caused to proceed.
    Type: Application
    Filed: June 10, 2004
    Publication date: January 20, 2005
    Inventors: Atsushi Ishiwata, Toshihiro Tatsumi
  • Publication number: 20020016957
    Abstract: A linking order forming section forms linking orders of intermediate objects. A linker starting section starts a linker based on the linking order that is formed by applying a genetic algorithm, etc. to form an executable object. A comparing section compares a program size of the formed executable object with the minimum value stored in a storing section. If the program size is smaller than the minimum value, the storing section stores this program size as the minimum value and also stores the linking order at that time. The linking order that can provide the minimum program size can be obtained effectively without the manual intervention by repeating a series of steps by using a repeating section.
    Type: Application
    Filed: July 26, 2001
    Publication date: February 7, 2002
    Applicant: Matsushita Electric Industrial Co., Ltd.
    Inventor: Atsushi Ishiwata