Patents
Literature
Hiro is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Hiro

58 results about "Absolute minimum" patented technology

Absolute minimum. absolute minimum A value of a given function that is less than or equal to any value of the given function.

Handoff method for communication system using multiple wireless resources

In a wireless communications system operating according to CDMA or the like, when one terminal simultaneously performs communication using multiple wireless resources (e.g., multiple carriers), there was a problem that when it was attempted to guarantee network mobility by the same soft handoff system as in the case where communication was performed using only one wireless resource, efficiency suffered from the viewpoint of network forwarding load, processing load and wireless resource occupancy time. Soft handoff termination is judged and soft handoff is forcibly terminated according to whether or not the data rate obtained for all resources on the network side satisfies a requested rate, based on a reception state notification from a terminal concerning wireless resources. By performing this processing, the soft handoff period is shortened, sufficient received strength in the terminal is maintained and terminal mobility is guaranteed, while at the same time network forwarding load, terminal processing load and wireless resource occupancy time are suppressed to the absolute minimum.
Owner:HITACHI LTD

Arithmetic functions in torus and tree networks

Methods and systems for performing arithmetic functions. In accordance with a first aspect of the invention, methods and apparatus are provided, working in conjunction of software algorithms and hardware implementation of class network routing, to achieve a very significant reduction in the time required for global arithmetic operation on the torus. Therefore, it leads to greater scalability of applications running on large parallel machines. The invention involves three steps in improving the efficiency and accuracy of global operations: (1) Ensuring, when necessary, that all the nodes do the global operation on the data in the same order and so obtain a unique answer, independent of roundoff error; (2) Using the topology of the torus to minimize the number of hops and the bidirectional capabilities of the network to reduce the number of time steps in the data transfer operation to an absolute minimum; and (3) Using class function routing to reduce latency in the data transfer. With the method of this invention, every single element is injected into the network only once and it will be stored and forwarded without any further software overhead. In accordance with a second aspect of the invention, methods and systems are provided to efficiently implement global arithmetic operations on a network that supports the global combining operations. The latency of doing such global operations are greatly reduced by using these methods.
Owner:IBM CORP

Method for automatic on-line calibration of a process model

A method is disclosed for collecting and processing raw process data. The method includes processing the raw data through a process model to obtain a prediction of the process quality; processing this prediction through two dynamic transfer functions thus creating two intermediate signals; storing the two intermediate signals as a function of time; retrieving at the time of a real and validated measurement of the process quality from the history the absolute minimum value and maximum value of the two intermediate signals in the time period corresponding to a minimum and maximum specified deadtime, in which the absolute minimum value and maximum values define the minimum and maximum prediction possible; calculating the deviation as being the difference between the real and validated measurement and the uncertainty area encompassed between the minimum and maximum prediction possible; incorporating the deviation into the process model to calibrate the process model; and, repeating.
Owner:SHELL OIL CO

Dynamic minimum-memory interleaving

Minimum-memory-implementation is available with any depth and period in DSL interleaving / deinterleaving, always allowing the minimum amount of memory to be used in both transmitter and receiver without loss of performance or of basic triangular structure, even if the interleaver / deinterleaver parameters change dynamically. A novel cell-scheduling process ensures availability of the minimum amount of memory (or any other desired memory usage) to implement an image of the perfect triangle and works for any co-prime depth and interleaver period. Minimal memory use may be further characterized by a simple off-line method that determines an addressing order for each of the memory cells in a minimum-memory (or other) implementation of an interleaver / deinterleaver according to the invention. Time variation of interleaver depth in operation can be accommodated easily with absolute minimum memory requirement at all time instants.
Owner:ADAPTIVE SPECTRUM & SIGNAL

Display and its drive method

The present invention provides a display device and its driving method to prevent the occurrence of erroneous writing of data into a holding circuit 110, to reduce power consumption and to provide highly integrated display pixels. In a display device which is provided with holding circuits to sustain digital video data for display pixels, the power supply voltage supplied to the holding circuits 110 is set to a minimum level that is an absolute minimum for sustaining the data. The power supply voltage to be supplied to the circuits 110 is boosted by a boosting circuit 95 after completion of the writing. In accordance with the signals inputted from gate signal lines 51, digital video signals from drain signal lines 61 are written into the circuits 110 and the circuits 110 sustain the signals. Displaying is conducted in accordance with the signal sustained in the circuits 110.
Owner:SANYO ELECTRIC CO LTD

Improved lattice-based key exchange protocol algorithm

The invention relates to a protocol algorithm, specifically a lattice-based key exchange protocol algorithm improved through utilization of random Gaussian noises. The method comprises the steps that1, it is assumed that a constant m is greater than or equal to 2, lambda is equal to O(n), beta is equal to (square root of n)sigma, and q is equal to O(2<lambda>mn[beta]<2>, wherein the sigma is a security parameter in M-DLWE definition, it is assumed that X is equal to {z which is an element of a set R<m>:||z||<=the beta, wherein the i is the element of the set [m]}, wherein the z is the element of the set R, and the||z|| is a norm z of a coefficient vector, hereinafter, an absolute minimum residual system is employed for R<q>, namely, each coefficient a satisfies |a|<q/2,wherein the a is the element of the set R<q>; S2, an m-order random matrix A is selected, wherein the A is the element of the set R<q><m _ x _ m>, and the A is accepted by a first communication partyand a second communication party, wherein; S3, information is issued, specifically, (1), the first communication party selects x,e<1><- D<R<m,sigma>>, computes a=(Ax+e<1>)mod q, and sends the a to thesecond communication party, and (2), the second communication party selects y,e<2><- D<R<m,sigma>>, computes b<T>=(y<T>A+e<2><T>)mod q and sends the b to the first communication party; and S4, sharedkeys are generated, specifically, (1), the first communication party generates the shared key k<1>=MSB(b<T>x mod q); and (2), the second communication party generates the shared key k2=MSB(y<T>a modq).
Owner:JIANGSU UNIV OF TECH

Apparatus for estimating motion vectors with extended search movement of reference macroblock

A motion vector estimation apparatus that can produce motion vectors accurately with an adequately expanded search domain, without increasing computational load too much. A reference macroblock mover moves a reference macroblock in a given reference frame according to a current search pattern, starting from a point identified as a minimum point in a preceding evaluation step. An evaluation processor calculates evaluation values corresponding to specified search movements, thus extracting a minimum evaluation value among as many evaluation values as the number of search movements performed. The evaluation processor finally finds an absolute minimum point from the extracted minimum evaluation values. A search pattern generator provides search patterns specifying extended search movements in a vertical direction so as to move a reference macroblock across different field lines. A motion vector estimator calculates a motion vector representing a distance and direction of the original macroblock relative to the reference macroblock at the absolute minimum point.
Owner:FUJITSU KYUSHU NETWORK TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products