Patents by Inventor Ken Umeno

Ken Umeno 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).

  • Publication number: 20200233106
    Abstract: A computer calculates a change amount of a total number of electrons from an observation start time in the ionosphere between an observation station and a satellite based on observation data of a signal received from the satellite by the observation station on the ground. The computer estimates the change amount of the total number of electrons to be calculated next based on the time change of the change amount of the total number of electrons from the observation start time in the ionosphere and calculates a difference (estimation error) between the estimated change amount of the total number of electrons and the actually calculated change amount of the total number of electrons. The computer calculates a correlation value between the estimation error calculated for each observation station and the estimation error calculated for a predetermined number of the observation stations in the vicinity of each observation station.
    Type: Application
    Filed: November 27, 2017
    Publication date: July 23, 2020
    Inventors: Ken Umeno, Takuya Iwata
  • Publication number: 20190036635
    Abstract: The communication method using an almost periodic function code includes using, for modulation, almost periodic function codes the number of which is in accordance with the number of users or the number of channels, among K almost periodic function codes. Where k is an integer from 1 to K and is an identifier for identifying each of the K almost periodic function codes, a parameter that determines each of the K almost periodic function codes is represented by ?+(k?1)/K. The symbol K is N or 2N, where N is a code length of each almost periodic function code. The symbol ? is a real number greater than 0 and less than 1/N.
    Type: Application
    Filed: October 28, 2016
    Publication date: January 31, 2019
    Applicant: Kyoto University
    Inventors: Ken UMENO, Hirofumi TSUDA
  • Publication number: 20130036059
    Abstract: An electronic price-proposing server is provided with: a secret-key recording means for recording identification codes assigned individually to multiple user terminals and calculation values thereof, in association with each of the users as secret keys thereof, an encrypting means for generating encryption data with the chaotic encryption method, a price-data recording means for recording the encryption data in association with the corresponding item and user, a searching means for searching for and reading encryption data corresponding to requests from user terminals, and a transmitting means for transmitting the result thereof to the user terminals. Meanwhile, the user terminals are provided with: a decrypting means for decrypting the received encrypted data, using an identification-code value read out from an identification-code value reading means, and generating the original price data, and a displaying means for displaying the decrypted price data.
    Type: Application
    Filed: February 6, 2012
    Publication date: February 7, 2013
    Applicant: PATENET CORPORATION
    Inventors: Yuuji Oura, Ken Umeno
  • Patent number: 8285773
    Abstract: A signal separating device includes an iterative estimator, a repeating calculator, a result output unit, and a repetition controller. The repeating calculator repeatedly causes the iterative estimator to iteratively perform independent component analysis on an observed signal matrix, and to further perform independent component analysis on the source signal matrix obtained as a result. The result output unit outputs the product of the respective mixing matrices obtained during each repetition as a mixing matrix with respect to the observed signal matrix, while also outputting the source signal matrix obtained during the final repetition as a source signal matrix with respect to the observed signal matrix. The repetition controller causes the repeating calculator to repeat the calculation control until all mixing matrices and all source signal matrices satisfy a convergence condition. The iterative estimator may perform a fixed number of iterations, or perform iterations until convergence is obtained.
    Type: Grant
    Filed: April 27, 2007
    Date of Patent: October 9, 2012
    Assignee: Riken
    Inventors: Andrzej Cichocki, Rafal Zdunek, Shunichi Amari, Gen Hori, Ken Umeno
  • Patent number: 8265268
    Abstract: A converter uses a predetermined parameter a. A generating unit accepts generated inputs x1, . . . , xn, and generates generated outputs, y1, . . . , yn, using recurrence formulas, y1=F1(x1, a) and yi+1=Fi+1(xi+1, y1)(1?i?n?1). A key accepting unit accepts key inputs, k1, . . . , kn, and gives them as generated inputs to said generating unit. A repetition controller gives the generated outputs as generated inputs to said generating unit, for an “m” (m?0) number of times, and sets one of the generated outputs to be given at the end as a random number string, r1, . . . , rn. The data accepting unit accepts data inputs, d1, . . . , dn. The converting unit converts data using, ei=di?ri, and, outputs data outputs, e1, . . . , en. The converter can be used both for encrypting and decrypting data.
    Type: Grant
    Filed: June 8, 2009
    Date of Patent: September 11, 2012
    Assignee: National Institute of Information and Communications Technology Incorporated Administrative Agency
    Inventor: Ken Umeno
  • Patent number: 7925014
    Abstract: Random number generating, encrypting, and decrypting apparatus, method thereof, program thereof, and recording medium thereof are provided. Random numbers for cryptographic applications are generated by a CA core. The CA core is composed of one-dimensional, two-state, and three-neighbor cell automaton. A total of three inputs for the own cell and both neighbor cells are input to each cell. Each cell performs a logical operation and outputs the result of the logical operation. Each cell contains a register. Each register captures the result of the logical operation in synchronization with a clock and stores the result. An output of a cell is fed back to the cell to perform an arithmetic calculation at the next time step. In this case, a rotation shift operation of which outputs of cells are shifted to the left and fed back to the cells is performed. To output random numbers having many bits, 40 bits of outputs of cells are selected.
    Type: Grant
    Filed: March 25, 2003
    Date of Patent: April 12, 2011
    Assignee: National Institute of Information and Communications Technology, Incorporated Administrative Agency
    Inventors: Song-Ju Kim, Akio Hasegawa, Ken Umeno
  • Publication number: 20100232523
    Abstract: A communication system (101), which uses a primitive root “q” of a prime number “p”, uses b[k]=(1, exp(2?i×q0+k/p), exp(2?i×q1+k/p), . . . , exp(2?i×q(p?2)+k/p)) for each value of an integer k=0, 1, . . . , (p?2), “p” number of p-dimensional vectors b[i] each defined by b[p?1]=(1, 1, 1, . . . , 1), and their conjugate complex vectors c[i]. A transmitting device (111) converts a signal to be transmitted into a parallel form, calculates the inner products between the parallel signals and the vectors b[i] respectively, inserts guard intervals to convert them into a serial form and transmits the serial signal. A receiving device (131) eliminates the guard intervals from the received signal, synchronizes with the signal, converts the signal into a parallel form, calculates the inner products between the parallel signals and the vectors c[i] respectively, converts the signals into a serial form to obtain the signal that has been transmitted.
    Type: Application
    Filed: July 16, 2008
    Publication date: September 16, 2010
    Inventor: Ken Umeno
  • Patent number: 7697590
    Abstract: A chaos spreading code c(n) is inputted to a spreading unit 32. Data D1 and c(n) are multiplied in the spreading unit 32. A chaos spreading code d(n) is inputted to a spreading unit 42. Data D2 and d(n) are multiplied in the spreading unit 42. The chaos spreading codes c(n) and d(n) orthogonally cross each other. Outputs of the spreading units 32 and 42 are added by an adder 35 and transmitted through a transmitting unit 36 to a transmission path 38. By making an initial value which is set in a chaos sequence generator having a construction of a digital circuit different, the chaos spreading codes which orthogonally cross can be formed. Since the chaos spreading codes c(n) and d(n) orthogonally cross, an orthogonal modulating unit having a construction of an analog circuit for amplitude-modulating carriers which orthogonally cross can be made unnecessary and the construction can be simplified.
    Type: Grant
    Filed: June 11, 2004
    Date of Patent: April 13, 2010
    Assignees: Japan Science and Technology Agency, National Institute of Information and Communications Technology, Incorporated Administrative Agency
    Inventors: Ken Umeno, Akio Hasegawa, Minghui Kao
  • Publication number: 20100020888
    Abstract: In order to transmit and receive not less than a binary digital signal using a code table in which chaotic map is used and an independent component analysis, a transmitting device (121) and a receiving device (141) of a communication system (101) use the same chaos function T(•) and the same applying function A(•, •) to generate and hold a corresponding table that makes a sequence of a predetermined length correspond to each of bit sequences of a predetermined length as a code by using a code table generating device (161).
    Type: Application
    Filed: December 27, 2007
    Publication date: January 28, 2010
    Inventor: Ken Umeno
  • Publication number: 20090245508
    Abstract: A converter uses a predetermined parameter a. A generating unit accepts generated inputs x1, . . . , xn, and generates generated outputs, y1, . . . , yn, using recurrence formulas, y1=F1 (x1, a) and yi+1=Fi+1 (xi+1, y1) (1?i?n?1). A key accepting unit accepts key inputs, k1, . . . , kn, and gives them as generated inputs to said generating unit. A repetition controller gives the generated outputs as generated inputs to said generating unit, for an “m” (m?0) number of times, and sets one of the generated outputs to be given at the end as a random number string, r1, . . . , rn. The data accepting unit accepts data inputs, d1, . . . , dn. The converting unit converts data using, ei=di?ri, and, outputs data outputs, e1, . . . , en. The converter can be used both for encrypting and decrypting data.
    Type: Application
    Filed: June 8, 2009
    Publication date: October 1, 2009
    Applicant: National Institute of Informatio and Communicationd Technology Incorporated
    Inventor: Ken Umeno
  • Publication number: 20090234901
    Abstract: A signal separating device includes an iterative estimator, a repeating calculator, a result output unit, and a repetition controller. The repeating calculator repeatedly causes the iterative estimator to iteratively perform independent component analysis on an observed signal matrix, and to further perform independent component analysis on the source signal matrix obtained as a result. The result output unit outputs the product of the respective mixing matrices obtained during each repetition as a mixing matrix with respect to the observed signal matrix, while also outputting the source signal matrix obtained during the final repetition as a source signal matrix with respect to the observed signal matrix. The repetition controller causes the repeating calculator to repeat the calculation control until all mixing matrices and all source signal matrices satisfy a convergence condition. The iterative estimator may perform a fixed number of iterations, or perform iterations until convergence is obtained.
    Type: Application
    Filed: April 27, 2007
    Publication date: September 17, 2009
    Inventors: Andrzej Cichocki, Rafal Zdunek, Shunichi Amari, Gen Hori, Ken Umeno
  • Patent number: 7577182
    Abstract: An input receiving section 102 of a transmitter apparatus 101 receives inputs of multiple synchronized signals r1, . . . , rN, an asynchronizing section 103 outputs multiple asynchronized signals v1, . . . , vN that are obtained by delaying the multiple synchronized signals r1, . . . , rN by time t1, . . . , tN, a modulating section 104 modulates the multiple output asynchronized signals v1, . . . , vN to output modulated signal w1, . . . wL (1?L?N), a transmitting section 105 transmits the output modulated signal w1, . . . wL, and the delay time t1, . . . , tN is shorter than a reciprocal number of a minimum value of clock rates of the multiple input received synchronized signals r1, . . . , rN, and is desirably proportional to one generated by a chaos random number in particular.
    Type: Grant
    Filed: March 26, 2004
    Date of Patent: August 18, 2009
    Assignee: National Institute of Information and Communications Technology
    Inventor: Ken Umeno
  • Patent number: 7548618
    Abstract: A converter uses a predetermined parameter a. A generating unit accepts generated inputs x1, . . . , xn, and generates generated outputs, y1, . . . , yn, using recurrence formulas, y1=F1(x1, a) and yi+1=Fi+1(xi+1, yi) (1?i?n?1). A key accepting unit accepts key inputs, k1, . . . , kn, and gives them as generated inputs to said generating unit. A repetition controller gives the generated outputs as generated inputs to said generating unit, for an “m” (m?0) number of times, and sets one of the generated outputs to be given at the end as a random number string, r1, . . . , rn. The data accepting unit accepts data inputs, d1, . . . , dn. The converting unit converts data using, ei=di?ri, and, outputs data outputs, e1, . . . , en. The converter can be used both for encrypting and decrypting data.
    Type: Grant
    Filed: August 29, 2002
    Date of Patent: June 16, 2009
    Assignee: National Institute of Information and Communications Technology Incorporated Administrative Agency
    Inventor: Ken Umeno
  • Patent number: 7472147
    Abstract: A random number sequence output apparatus (101) includes a sequence acceptance unit (102) for accepting input of a numerical sequence, an initial value setting unit (103) for accepting an initial value and causing a storage unit (104) to store this, an output unit (105) for outputting a new value stored in the storage unit (104), a calculation unit (106) for applying a predetermined rational map stored in he storage unit (104) each time the output unit (105) outputs a value and further applying a predetermined calculation unit to the value and value extracted from the numerical sequence accepted by the sequence acceptance unit (102), and an updating unit (104) to store the value of the result of calculation performed by the calculation unit (106), thereby performing updating.
    Type: Grant
    Filed: November 5, 2002
    Date of Patent: December 30, 2008
    Assignees: Japan Science and Technology Agency
    Inventors: Ken Umeno, Shenghung Shih
  • Patent number: 7471714
    Abstract: In a random number sequence sharing apparatus, a reception unit receives a radio signal including a radio wave from a pre-designated radio star at a pre-designated observation time, a sending unit sends the received radio signal to another random number sequence sharing apparatus, an acceptance unit accepts a radio signal sent from the another sharing apparatus, an analysis unit separates the two radio signals into a plurality of independent components by independent component analysis, a selection unit selects two independent components temporally different by difference in time required for the radio wave to arrive at both sharing apparatuses from the radio star, a sampling unit averages the two selected independent components after adjusting the temporal difference and bit-samples the average, and an output unit outputs a sequence of the bit samples as a random number sequence to be shared.
    Type: Grant
    Filed: March 15, 2005
    Date of Patent: December 30, 2008
    Assignee: National Institute of Information and Communication Technology, Incorporated Administrative Agenvy
    Inventor: Ken Umeno
  • Patent number: 7466780
    Abstract: An FIR filter for filtering a prescribed real impulse constant (r) (?1<r<1) receives in a terminal the input of the input signal of the Chebyshev-chaos type spreading code sequence having a chip length D. A plurality of signals obtained by delaying the input signals by 0, D, 2D, 3D, . . . , and (N?1)D are output by a delay circuit. When the delay time is T, a plurality of delayed and output signals are multiplied by (?r)N?T/D with an amplifier and output, and the sum of a plurality of amplified and output signals, namely an optimum chaos-type spreading code string, is output by an adder.
    Type: Grant
    Filed: July 24, 2006
    Date of Patent: December 16, 2008
    Assignees: National Institute of Information and Communications Technology
    Inventor: Ken Umeno
  • Publication number: 20080288566
    Abstract: In a multimedia information providing system, responding to a preview request from a terminal equipment, a server device generates a chaotic random number sequence from an initial value allocated to the terminal equipment, mixes this sequence into a set of multimedia information as a noise signal at a first mixing ratio, and then transmits the result as a first set of multimedia information for distribution. Responding to a quality improvement request, the server device generates a chaotic number sequence from the initial value allocated to the terminal equipment, mixes this sequence into a set of multimedia information as a noise signal at a second mixing ratio, and then transmits the result as a second set of multimedia information for distribution. The terminal equipment performs component analysis on the first and second sets of multimedia information, removing the noise and restoring a high-quality version.
    Type: Application
    Filed: March 24, 2008
    Publication date: November 20, 2008
    Applicants: RIKEN, CHAOS WARE, INC.
    Inventors: Ken UMENO, Gen HORI, Andrzej CICHOCKI, Rafal ZDUNEK, Shun-ichi AMARI
  • Patent number: 7421463
    Abstract: Disclosed is a random sequence generating apparatus for generating a sequence of integers. A seed receiving section receives a sequence of integers as a seed. An initialization section provides a transformation section with the received sequence of integers. The transformation section performs predetermined transformation on each of the provided integer sequence to acquire a sequence of integers. A rotation section acquires the number of rotation bits from a part of the acquired sequence of integers, performs a rotation operation on the acquired number of rotation bits with respect to all of or part of the sequence of integers taken as a bit sequence, and acquires a sequence of integers. An updating section provides the transformation section with the sequence of integers. An output section outputs part of a sequence of integers obtained last as a random sequence in case where transformation and rotation are repeated a predetermined number of times.
    Type: Grant
    Filed: March 17, 2004
    Date of Patent: September 2, 2008
    Assignee: National Institute of Information and Communications Technology Incorporated Administrative Agency
    Inventor: Ken Umeno
  • Patent number: 7411997
    Abstract: A filter (201) accepts spreading code sequences or the like as input sequences of a chip rate 1/D, the accepted spreading code sequences are sequentially delayed and distributed by delay circuits (202) connected in series, delay times of individual signals are an arithmetical progression with a chip length D being a common difference D, the individual signals are amplified with spreading codes by amplifiers (203), amplification factors for the individual signals are a geometrical progression of a common ratio r, the sum of the amplified signals is obtained by addition in an adder (204), and the result is sequentially output as an output sequence.
    Type: Grant
    Filed: March 26, 2002
    Date of Patent: August 12, 2008
    Assignees: Japan Science and Technology Corporation, Chaosware Inc.
    Inventors: Ken Umeno, Shenghung Shih, Akihiro Yamaguchi
  • Patent number: 7317763
    Abstract: A UWB wireless communicating system is provided. When a process of the system is started, an initial value x0 is set to a storing portion. An output of the storing portion is supplied to a mapping portion that performs a calculation using a P-th order Chebyshev polynomial as a map. In addition, the output of the storing portion is returned to the storing portion. A generated chaotic sequence is stored in a pulse interval converting portion. The pulse interval converting portion converts a linear sum G1(x) of the Chebyshev polynomial into a pulse interval value t. An output of the pulse interval converting portion is supplied to a pulse output portion. A pulse sequence having a pulse interval ti into which the value of a liner sum G1(xi) has been converted is output. The output pulse sequence is supplied to the UWB wireless communicating system.
    Type: Grant
    Filed: June 18, 2004
    Date of Patent: January 8, 2008
    Assignee: National Institute of Information and Communications Technology
    Inventor: Ken Umeno