Apple vs. Nokia Patent Infringed/Infringing Map

On 23 Oct 2009, Nokia filed a lawsuit against Apple, alleging its iPhone infringes Nokia's ten patents. (C.A. NO. 09-791-GMS); On 11 Dec. 2009, Apple countersued Nokia over alleged infringements of 13 Apple patents, U.S. Patent Nos. 5,634,074, 6,343,263, 5,915,131, 5,555,369, 6,239,795, 5,315,703, 6,189,034, 7,469,381, RE 39,486, 5,455,854, 7,383,453, 5,848,105, and 5,379,431, ("Apple Asserted Patents"). Using Patentics auto-calculated Infringed/Infringing Map on Apple (the infringed) and Nokia (the infringing), For these thirteen "Apple Asserted Patents", which are non-standards-essential, eight (U.S. Patent Nos. 6,343,263, 5,555,369, 6,239,795, 5,315,703, 7,469,381, RE 39,486, 5,848,105, 5,379,431) are ranked in the results by Patentics. This demonstrates that Nokia might be implementing similar competing technologies that were patented by Nokia prior to Apple, and if these Nokia patents, which were applied for later than Apple's, and are ranked as highly relevant to and covered by Apple's patents, were embodied in Nokia products, it might imply Nokia's probable infringement of Apple's patents. Apple has one of the most sophisticated IP portfolios in the software industry, and Nokia has one of the broadest IP portfolios in the telecom industry with over 10,000 families of patents. Yet, there’s no comprehensive patent system allowing competitors to easily keep tabs on each other during their own product development. The Competitors Infringed/Infringing Map computed by Patentics quantitatively provides a real-time patent strength/vulnerability analysis with pin-pointing accuracy that nails individual patents which may be questionable among competing parties. Please check Patentics auto-calculated Nokia (as the infringed) vs. Apple (as the infringing) Infringed/Infringing Map, where Patentics has ranked results that match up with Nokia's claims of Apple allegedly infringing Nokia's 10 standards-essential patents and 5 non-standards-essential patents.

The following contents are all caculated and generated automatically by Patentics program.

Apple vs. Nokia Patent Infringed/Infringing Map

Apple Teams lead over Nokia Teams Analysis

Apple Inventor(Team) Nokia Inventor(Team) Link c1 c2 c12

Wu;Hsi-Jung Kalevo;Ossi 6.04 15 17 12

Bellegarda;JeromeR. Tian;Jilei 5.97 67 52 23

Marriott;Greg Pyhalammi;Seppo 4.75 8 8 8

Chen;Kok Bergquist;Johan 2.67 6 6 6

Bellegarda;JeromeR. Olsen;Jesper 1.77 67 24 14

Staats;Erik Vasilache;Adriana 1.55 5 6 5

Matheny;JohnR. Viitala;Tomi 1.31 8 29 8

Jones;Anne Hannuksela;MiskaMatias 1.25 27 9 8

Venolia;DanielScott Reponen;Erika 1.19 4 4 4

Bellegarda;JeromeR. Tilei;Jian 1.01 67 11 10

Klivington;Jason Ridge;Justin 0.97 9 11 6

DiFonzo;JohnC. Lindberg;Phillip 0.93 5 10 5

Rohrbach;MatthewDean Lindberg;Phillip 0.93 5 10 5

Yu;DeanT. Vesterinen;Timo 0.88 10 11 6

Jones;Anne Hannuksela;MiskaM. 0.87 27 13 8

Cornelius;WilliamP. Floman;Matti 0.79 6 4 4

Jawa;Amandeep Myllyla;Tomi 0.79 6 4 4

Shwarts;ScottL. Roto;Virpi 0.79 6 4 4

Hauck;JerroldV. Gillet,Michel 0.77 10 6 5

Hauck;JerroldV. Gillet;Michel 0.77 10 6 5

Apple Inventors: 352; Nokia Inventors: 378; Inventor factor: 0.93; Strength factor: 2.75

www.patentics.com

1/529 Results selected and ranked by Patentics program

http://stadium.weblogsinc.com/engadget/files/Nokia_Apple_III.pdf

Competitive Leads Timeline

Competitive Timeline: 51

Apple Competitive Leads(*): 25.25; Nokia Competitive Leads(*): 15.67

Apple Inventor(Team) Nokia Inventor(Team)

Inventor Application Date Inventor Application Date

* Wu;Hsi-Jung 19960703 Kalevo;Ossi 20010119

* Bellegarda;JeromeR. 19960213 Tian;Jilei 20021111

Marriott;Greg 20041025 * Pyhalammi;Seppo 20040630

* DiFonzo;JohnC. 20050926 Lindberg;Phillip 20060608

* Rohrbach;MatthewDean 20050926 Lindberg;Phillip 20060608

* Yu;DeanT. 19951113 Vesterinen;Timo 20060822

* Hauck;JerroldV. 20000118 Gillet;Michel 20041007

* Arrouye;Yan 19980508 Das;Debashis 20021220

Haskell;BarinGeoffry 20021108 * Hannuksela;Miska 19991102

Haskell;BarinGeoffry 20021108 * Karczewicz;Marta 20010427

Chiang;Bing 20071218 * Wang;Hanyang 20011218

Kuo;Shyh-Shiaw 20050419 * Ojanpera;Juha 20040823

* Fredenburg;Timothy 19960618 Tian;Jilei 20021111

* Bellegarda;JeromeR. 19961217 Riis;Soren 20011219

Hill;RobertJ. 20061106 * Ozden;Sinasi 20050426

* Haskell;BarinGeoffry 20021108 Wang;Ru-Shang 20040223

* Kiddy;RaymondR. 20010725 Hill;Tapio 20021015

* Marcu;GabrielG. 19980615 Rantanen;Henry 20031014

* Opstad;DavidG. 19990507 Kotiranta;Atte 20041230

Dumitras;Adriana 20030707 * Karczewicz;Marta 19990811

* Christiansen;KevinM. 19941116 Zhao;Sheng 20010330

Chiang;Bing 20071218 * Ollikainen;Jani 19980324

MacDonald;LindsayWilliam 20040818 * Nenonen;Petri 20001222

* Siegmund;DieterW. 20050823 Swami;YogeshP. 20060203

Handley;Maynard 20030430 * Karczewicz;Marta 19990811

* Cheshire;StuartDavid 20001212 Smith;GregoryJ. 20020412

Kumar;Roger 20030430 * Hallapuro;Antti 20010830

* Tucker;Rusty 20001006 Le;Huihua 20031014

Bavor;Clay 20050801 * Kautto-Koivula;Kaisa 20031217

Zhang;Zhijun 20060905 * Arkko;Aimo 19990528

* Cheshire;Stuart 20010119 Card;James 20021211

* Crandall;RichardE. 19970718 Saarinen;Markku-Juhani 20010517

* Cheshire;StuartD. 20020319 Smith;GregoryJ 20030922

* Cheshire;StuartDavid 20001212 Card;James 20021211

Haskell;BarinGeoffry 20030707 * Wang;Ye-Kui 20030428

Schlub;RobertW. 20070104 * Ozden;Sinasi 20050426

Dumitras;Adriana 20030813 * Kalevo;Ossi 20000118

Anderson;EricC. 20010928 * Ronkka;Risto 19990120

MacDonald;LindsayWilliam 20040818 * Trimeche;Mejdi 20040709

Bilbrey;Brett 20031029 * Kalevo;Ossi 20000118

* LeCroy;Chris 20010927 Wang;Ru-Shang 20030321

Dumitras;Adriana 20030903 * Lainema;Jani 19970919

Zhang;Zhijun 20060905 * Ozden;Sinasi 20050426

* Bellegarda;JeromeR. 19961217 Riis;So 20010831

* Chaudhri;ImranA. 20040625 Vahtola;Miika 20060130

* Forstall;Scott 20030106 Nurmi;Mikko 20060419

Nie;Xiaochun 20030430 * Hannuksela;Miska 20000428

* Chaudhri;Imran 20020318 Nurmi;Mikko 20040109

* Chu;Ke-Chiang 19930430 Ridge;Justin 20020312

* Bailey;RobertL. 19940509 Kuusisto;Mika 19970108

* Serenyi;Denis 20010108 Bouet;Stephane 20011220

www.patentics.com


www.patentics.com


www.patentics.com


Competing Fields and Technologies

Circuit load Dc supply current Capacitor filter Inductive circuit

Bus logic Ram access Memory read/write Interface register

Broadcast protocol Protocol-related Package of data Communication stream

Phoneme recognizer Training text Training database Phonemic

Graphic icon Graphical item Iconic representation Iconic

Dynamic linking System library Software build Single executable file

Spatial-domain Source frame Quantisation Difference frame

Interactive control Interactive function Viewer interface Display video content

1983 results: Apple probably-infringed(637) Nokia probably-infringing(512)

PN Title Assignee Inventors Class ICL APD Count Rank Sel

6,343,263 Real-time signal processing system for serially transmitted data

Apple Computer, Inc. Nichols; James B. | Lynch; John

702 G06F 19940802 0 100%

Abstract: A data transmission system having a real-time data engine for processing isochronous streams of data includes an interface device that provides a physical and logical connection of a computer to any one or more of a variety of different typesof data networks. Data received at this device is presented to a serial driver, which disassembles different streams of data forpresentation to appropriate data managers. A device handler associated with the interface device sets up data flow paths, andalso presents data and commands from the data managers to a real-time data processing engine. Flexibility to handle any type of data, such as voice, facsimile, video and the like, that is transmitted over any type of communication network with any typeof real-time engine is made possible by abstracting the functions of each of the elements of the system from one another. Thisabstraction is provided through suitable interfaces that isolate the transmission medium, the data manager and the real-time engine from one another. MainClaim: A signal processing system for providing a plurality of realtime services to and from a number of independent clientapplications and devices, said system comprising:

a subsystem comprising a host central processing unit (CPU) operating in accordance with at least one application program anda device handler program, said subsystem further comprising an adapter subsystem interoperating with said host CPU and saiddevice;

a realtime signal processing subsystem for performing a plurality of data transforms comprising a plurality of realtime signalprocessing operations; and

at least one realtime application program interface (API) coupled between the subsystem and the realtime signal processingsubsystem to allow the subsystem to interoperate with said realtime services.

6,175,565 Serial telephone adapter Nokia Corporation McKinnon; Peter | Pek; Jiri

370 G06F 19970917 1 93%

Abstract: A serial telephone adapter for connection between a telephone and a personal computer to facilitate voice overcomputer-based networks such as the Internet. The adapter also includes an interface to the public switched telephone networkfor conventional voice communications when the personal computer is shut down. MainClaim: A system for use with a telephony terminal and a personal computer to provide telephone access to a computer-based communications network via said personal computer, said system comprising:

application software in said personal computer to execute an operating system program;

a serial telephone adapter connected between said telephony terminal and a serial communications port on said personalcomputer, said adapter having a receiver/transmitter to receive and transmit respectively telephony communications from andto said terminal, and a converter to convert said telephony communications from analog to digital and digital to analog;

a system transfer protocol to coordinate transfer of telephony communications and control messages between said personalcomputer and said serial telephone adapter said protocol requiring that control messages from the personal computer to theserial telephone adapter be acknowledged by the serial telephone adapter before another control message is sent; and

an interface in said adapter to connect said telephony terminal to the public switched telephone network (PSTN) if saidcomputer-based communications network is not available for service.

5,848,105

GMSK signal processors for improved communications capacity and quality

Gardner; William A. | Schell; Stephan V.

375 H03D 19961010 0 100%

Abstract: A method and apparatus for separating and removing distortion from interfering co-channel signals and suppressing adjacent-channel interfering signals of the Gaussian Minimum-Shift Keyed (GMSK) or other MSK type with filtering structures that exploit the cyclostationarity of the received GMSK or other MSK signals in order to accommodate a greater number (or thesame number, but with greater quality) of transmitted signals received by one or more antennas than can be accommodated byexisting filters. The parameters in these filtering structures are adapted by either of two adaptation apparatus that exploit boththe known training sequence that is transmitted in most wireless communications systems, and the constant modulus property

www.patentics.com


exhibited by each of the transmitted GMSK or other MSK signals. MainClaim: An apparatus for extracting a signal of interest from a plurality of spectrally and temporally overlapping inputsignals containing digital data having a bit rate, said input signals having carrier frequencies, said input signals having conjugatecycle frequencies equal to twice their carrier frequencies plus and minus one-half of their data bit rate, said input signals exhibiting conjugate spectral redundancy for spectral components having frequencies separated by said conjugate cyclefrequencies, said input signals exhibiting temporal redundancy, said apparatus comprising:

(a) time-shifting means for producing a time-shifted output signal wherein said signal of interest is time-shifted;

(b) frequency-shifting means for producing a frequency-shifted output signal wherein said signal of interest is frequency-shifted by an amount determined by its cycle frequencies; and

(c) linear combining means for weighting and summing said output signals to produce an estimate of said signal of interest.

2007/0129042 Receiver Nokia CorporationKristensson; Martin | Ottersten; Bjorn | Astely; David

455 H04B 20060911 1 96%

Abstract: The present invention relates to a method for a digital receiver and a receiver exploiting second order statistics foradaptive co-channel interference rejection in wireless communication. It uses digitally I, in phase, and Q, quadrature, branchesof a received transmitted signal as input to the receiver, a coarse synchronization and a coarse frequency offset compensationhave being performed on the signal. It comprises a means for derotation, means for separation, means for filtering, means forestimating and means for detecting transmitted symbols in the received signal. The invention thereby improving co-channel rejection in wireless communication, thus making it possible to increase the number of communication channels for frequenciesused. MainClaim: A method for a digital receiver exploiting second order statistics for adaptive co-channel interference rejection in wireless communication, having digitally I, in phase, and Q, quadrature, branches of a received transmitted signal, a coarsesynchronization and a coarse frequency offset compensation have being performed on said signal, the method comprising:derotating the signal, and outputting a complex valued time discrete base band representation of the received signal if a usedmodulation form is one dimensional, else if a used modulation form is multiple dimensional then construct, from possibly twovector valued signal sequences, a complex valued signal sequence and outputting said complex valued signal; separating saidoutput signal into its real and imaginary parts which vector is output containing the transmitted signal, co-channel interfering user signals, additive noise and other possible disturbance; estimating using the outputs and performing one or more of thefollowing quantities: fine synchronisation, fine frequency offset estimation or compensation, or data model estimation foroutputting one or more of said quantities; filtering, using the real value output and coefficients in the data model output andperforming a whitening operation on the signal additionally taking into account second order properties of noise and co-channel interference; and detecting transmitted symbols, and making use of the output and the data model, thereby improving co-channel rejection in wireless communication, thus making it possible to increase the number of channels for frequencies used.

7,474,884 Receiver Nokia CorporationKristensson; Martin | Ottersten; Bjorn | Astely; David

455 H04B 20060911 1 96%

Abstract: The present invention relates to a method for a digital receiver and a receiver exploiting second order statistics foradaptive co-channel interference rejection in wireless communication. It uses digitally I, in phase, and Q, quadrature, branchesof a received transmitted signal as input to the receiver, a coarse synchronization and a coarse frequency offset compensationhave being performed on the signal. It comprises a means for derotation, means for separation, means for filtering, means forestimating and means for detecting transmitted symbols in the received signal. The invention thereby improving co-channel rejection in wireless communication, thus making it possible to increase the number of communication channels for frequenciesused. MainClaim: A method comprising: receiving branches of transmitted signal by a digital receiver exploiting second orderstatistics for adaptive co-channel interference rejection in wireless communication, having digitally I, in phase, and Q,quadrature, wherein a coarse synchronization and a coarse frequency offset compensation are configured to be performed onsaid signal, derotating the signal, and outputting a complex valued time discrete base band representation of the received signalif a used modulation form is one dimensional, else if a used modulation form is multiple dimensional then construct, frompossibly two vector valued signal sequences, a complex valued signal sequence and outputting said complex valued signal;separating said output signal into its real and imaginary parts which vector is output containing the transmitted signal, co-channel interfering user signals, additive noise and other possible disturbance; estimating using the outputs and performing oneor more of the following quantities: fine synchronisation, fine frequency offset estimation or compensation, or data modelestimation for outputting one or more of said quantities; filtering, using the real value output and coefficients in the data modeloutput and performing a whitening operation on the signal additionally taking into account second order properties of noise andco-channel interference; and detecting transmitted symbols, and making use of the output and the data model, therebyimproving co-channel rejection in wireless communication, thus making it possible to increase the number of channels forfrequencies used.

7,107,031 Co-channel interference rejection in a digital receiver

Nokia CorporationKristensson; Martin | Ottersten; Bjorn | David; Astel

455 H04B 20010530 1 96%

Abstract: The present invention relates to a method for a digital receiver and a receiver exploiting second order statistics foradaptive co-channel interference rejection in wireless communication. It uses digitally I, in phase, and Q, quadrature, branchesof a received transmitted signal as input to the receiver, a coarse synchronization and a coarse frequency offset compensationhave being performed on the signal. It comprises a means for derotation, means for separation, means for filtering, means forestimating and means for detecting transmitted symbols in the received signal. The invention thereby improving co-channel rejection in wireless communication, thus making it possible to increase the number of communication channels for frequenciesused. MainClaim: A method for a digital receiver exploiting second order statistics for adaptive co-channel interference rejection in wireless communication, having digitally I, in phase, and Q, quadrature, branches of a received transmitted signal as input tothe receiver, a coarse synchronization and a coarse frequency offset compensation have being performed on said signal, andcomprising a means for derotation, means for separation, means for filtering, means for estimating and means for detectingtransmitted symbols in the received signal, characterized in that it comprises the following steps: derotating the signal in saidmeans for derotation, outputting a complex valued time discrete base band representation of the received signal if a usedmodulation form is one dimensional, else if a used modulation form is multiple dimensional then construct, from possibly two

www.patentics.com


vector valued signal sequences, a complex valued signal sequence and outputting said complex valued signal; separating saidoutput signal in said means for separating it into its real and imaginary parts which vector is output from said means forseparation containing the transmitted signal, co-channel interfering user signals, additive noise and other possible disturbance;estimating in said means for estimation, using the outputs from said means for separation, means for filtering, and from saidmeans for detecting as input, and performing on one or more of the following quantities: fine synchronisation, fine frequencyoffset estimation or compensation, or data model estimation, outputting one or more of said quantities to said means forderotating, filtering, and detecting; filtering in said means for filtering, using the real value output from said means forseparation and coefficients in said data model output from the means for estimation and performing a whitening operation onthe signal additionally taking into account a second order properties of noise and co-channel interference, the filtered signal being output to the means for estimation and detection; and detecting transmitted symbols in said means for detecting, makinguse of the output from said means for filtering and the data model from the means for estimation, thereby improving co-channel rejection in wireless communication, thus making it possible to increase the number of channels for frequencies used.

5,555,369 Method of creating packages for a pointer-based computer system

Apple Computer, Inc.

Menendez; Norberto | Potrebic; Peter J. | Sharpe; Benjamin W.

345 G06F 19940214 0 100%

Abstract: A development environment and method is provided in which a first computer system is used to develop anapplication for execution in a second computer system--such as a pen-based computer--having a graphical user interface. The first computer system also has a graphical user interface that can display (1) a palette containing lists and/or buttons of"components" representing graphical interface elements such as slide bars, dialog boxes, buttons, check boxes, icons, menus,etc., (2) a layout window corresponding a display screen of the second computer and containing "views" of selected palettecomponents and (3) a browser allowing the views to be edited graphically. To develop an application, the user creates views onthe layout window by (1) selecting a component from the palette and (2) drawing a border for the view in the layout window.Each view so created represents a "template" which is a frame object having a plurality of "slots" which may be edited in a sloteditor area of the browser. Some views in the layout window may be "linked views" which point to sublayout windows containinga plurality of other views. Still further, a system is provided that allows the creation of user defined proto templates containingan arrangement of views defined by the user. The user-defined proto templates can be used to create views in the layoutwindow as described above. MainClaim: A method of using a first computer system having a display screen displaying a first graphical user interface tocreate an application that can be executed and displayed through a second graphical user interface on a second computersystem having a display screen sensitive to a pointer, a processor in communication with the display screen, and a memory incommunication with the processor such that when the application is executing on the processor it can perform defined actions inresponse to interaction of the pointer with the display screen, the method comprising the following steps:

displaying a first layout window on the first graphical user interface displayed on the display screen of the first computer system,the first layout window defining a representation of the display screen of the second computer system as it will appear when theapplication is executing on the second computer system;

displaying a plurality of predefined view as manipulated by a user on the first layout window, each such predefined view defininga graphical interface element appearing on the display screen of the second computer system when the application is executing,the predefined view being located at regions of the first layout window corresponding to the locations of corresponding graphicalinterface elements appearing on the display screen of the second computer system when the application is executing on thesecond computer system, the graphical interface elements including one or more of slide bars, buttons, check boxes, icons,menus, and dialog boxes;

linking a second layout window to a predefined view on the first layout window, the second layout window itself having aplurality of predefined views defining graphical interface elements capable of appearing on the display screen of the secondcomputer system when the application is executing; and

building said application from views on said first and second layout windows.

2006/0230056 Method and a device for visual management of metadata

Nokia Corporation Aaltonen; Antti 707 G06F 20050406 16 93%

Abstract: A method and a device for visual management of metadata. An area with a plurality of data elements is visualized(504) to the user who determines (508) a route on the area, said route including a number of preferred elements belonging tothe plurality of elements, which is detected (512). The preferred elements shall act as targets for a predefined metadataoperation (514), e.g. change of a metadata attribute value. MainClaim: A method for directing a metadata operation at a number of electronically stored data elements in an electronicdevice having the steps of visualizing an area with a number of data elements on a display device to a user (504), obtainingcontrol information about a user-defined route between user-defined start and end points on the visualized area comprising saidnumber of data elements (508), specifying based on the route such data elements belonging to said number of data elementsover which the route passed (512), and performing the metadata operation on said specified data elements (514).

2007/0157117

Apparatus, method and computer program product providing user interface configurable command placement logic

Nokia Corporation Viitala; Tomi 715 G06F 20051220 29 93%

Abstract: In accordance with but one exemplary embodiment of this invention a computer program is embodied on a tangiblecomputer-readable medium. The execution of the computer program by a data processor of a device results in operations thatinclude operating a command placement manager to map an instance of a user interface (UI) command specification to at leastone control of a UI in accordance with information defining a device configuration, where the command specification iscomprised of a prioritized list of commands. MainClaim: A computer program embodied on a tangible computer-readable medium the execution of which by a data processor of a device results in operations comprising operating a command placement manager to map an instance of a userinterface (UI) command specification to at least one control of a UI in accordance with information defining a device

www.patentics.com


configuration, where the command specification is comprised of a prioritized list of commands.

2008/0040668 Creating virtual targets in directory structures

Nokia Corporation Ala-Rantala; Kati 715 G06F 20060810 8 92%

Abstract: A method includes detecting a first user operation corresponding to a first item in a directory structure. The directorystructure represents a hierarchical arrangement of a plurality of items, including the first item, in a memory. The first useroperation indicates a start of an item action with the first item. The method also includes, in response to detecting a second useroperation corresponding to a second item in the directory structure, creating a virtual target in the second item in the directorystructure. The virtual target is a possible location for completion of the item action with the first item. The method furtherincludes, in response to a third user operation indicating completion of the item action with the first item in the virtual target,completing the item action with the first item in the virtual target. MainClaim: A method comprising:detecting a first user operation corresponding to a first item in a directory structure, thedirectory structure representing a hierarchical arrangement of a plurality of items, including the first item, in a memory, the firstuser operation indicating a start of an item action with the first item;in response to detecting a second user operationcorresponding to a second item in the directory structure, creating a virtual target in the second item in the directory structure,wherein the virtual target is a possible location for completion of the item action with the first item; andin response to a thirduser operation indicating completion of the item action with the first item in the virtual target, completing the item action withthe first item in the virtual target.

5,315,703 Object-oriented notification framework system

Taligent, Inc.

Matheny; John R. | White; Christopher | Anderson; David R. | Schaeffer; Arnold

345 G06F 19921223 0 100%

Abstract: A system for an object based notification system. The notification system is designed in a flexible manner to supportchange notification in an object-oriented operating system. The change notification includes a memory for storing connectioninformation including notification routing information and connection registration information. The connection registrationinformation is stored in a connection object of the object-oriented system and the notification system updates the connectionobject with registration information indicative of enablement or disablement of notification. Then, when a notification event isdetected, the object-oriented operating system selectively notifies objects in the system based on the connection registrationinformation stored in the connection object in the memory of the computer system. MainClaim: An object-oriented notification framework system, comprising:

(a) means for connecting a plurality of objects to a notification source;

(b) memory means for storing connection information for the plurality of objects in a connection object of an object-oriented operating system;

(c) means for registering connection information, including registration information indicative of a notification status, in theconnection object of the object-oriented operating system;

(d) means for selectively dispatching notification to at least one of the plurality of objects based on the registration informationstored in the connection object of the object-oriented system; and

(e) means for the at least one of the plurality of objects to receive the notification and take action based on the notification.

2007/0157117



Abstract: In accordance with but one exemplary embodiment of this invention a computer program is embodied on a tangiblecomputer-readable medium. The execution of the computer program by a data processor of a device results in operations thatinclude operating a command placement manager to map an instance of a user interface (UI) command specification to at leastone control of a UI in accordance with information defining a device configuration, where the command specification iscomprised of a prioritized list of commands. MainClaim: A computer program embodied on a tangible computer-readable medium the execution of which by a data processor of a device results in operations comprising operating a command placement manager to map an instance of a userinterface (UI) command specification to at least one control of a UI in accordance with information defining a deviceconfiguration, where the command specification is comprised of a prioritized list of commands.

6,239,795 Pattern and color abstraction in a graphical user interface

Apple Computer, Inc.Ulrich; Robert R. | Johnston, Jr.; Robert G.

345 G06F 19990526 0 100%

Abstract: Systems and method for providing a user with increased flexibility and control over the appearance and behavior ofobjects on a user interface. Sets of objects can be grouped into themes to provide a user with a distinct overall impression ofthe interface. Themes can be switched dynamically by switching pointers to drawing procedures or switching data being appliedto these procedures. To buffer applications from the switchable nature of graphical user interfaces, colors and patterns used toimplement the interface objects are abstracted from the interface by, for example, pattern look-up tables. MainClaim: A computer readable medium comprising:

a first portion having stored therein data relating to a first set of graphical user interface objects whose individual appearancesare collectively associated with a first common theme;

a second portion having stored therein data relating to a second set of graphical user interface objects each of which have thesame function as an associated interface object in said first set, but whose individual appearances are collectively associatedwith a second common theme; and

www.patentics.com


a third portion having stored therein computer executable code wherein, upon execution of instructions embedded in said codeby a computer, a user interface associated with the computer selectively displays one of said first and second sets of graphicaluser interface objects.

2007/0157117




5,379,431

Boot framework architecture for dynamic staged initial program load

Taligent, Inc.Lemon; Steven P. | Ross; Patrick D. 710 B06F 19931221 0 100%

Abstract: A system is disclosed for use in booting a processor with a storage and attached peripherals. The system utilizes atechnique for initializing a computer by resetting the storage and the one or more peripherals. Then, the system initializes adegredated environment for use in activating an operating system. The degredated operating environment enables file sharingand other basic tasks of importance in loading in the IO devices, system preferences, and hardware configurations and replacesitself with the IO file system for use by the operating system. MainClaim: An apparatus for initializing a computer system in response to a boot command, comprising:

(a) a processor;

(b) a main volatile storage attached to and under control of said processor;

(c) a non-volatile external storage attached to and under control of said processor, said external storage containing a copy of anoperating system and a copy of a booting program;

(d) means responsive to said boot command for loading said booting program from said external storage into said main volatilestorage;

(e) means operable after said booting program has been loaded into said main volatile storage for starting said bootingprogram, said booting program thereupon controlling said processor; and

(f) means controlled by said booting program for configuring said computer system and for loading portions of said operatingsystem based on said configuring said computer system into said main volatile storage.

2007/0240171

Device, Method, And Computer Program Product For Accessing A Non-Native Application Executing In Virtual Machine Environment

Nokia Corporation Biro; Jozsef | Boros; Andras

719 G06F 20060329 9 92%

Abstract: Embodiments of the invention provide a virtual machine application program (VMAPI) interface logically disposedbetween a non-native application executing in the virtual machine environment and a native middleware application, such as anative high-availability middleware application. The VMAPI is registered as a proxy component with the native middlewareapplication by creating a library instance. The non-native application is registered as a proxied component with the nativemiddleware application by creating another dedicated library instance. A JVM mapper may be logically disposed between thenative middleware and the VMAPI that is capable of automatically mapping the JVM to the Java components based on a mappingpolicy selected from a predefined set of possible mapping policies. MainClaim: A device for providing access to a non-native application executing in a virtual machine environment, wherein the device comprises: a processing element configured to execute a virtual machine application, including a virtual machineapplication program interface (VMAPI), to create the virtual machine environment in which the non-native application is configured to execute; the processing element further configured to execute a native middleware application; wherein theVMAPI is logically disposed between the non-native application executing in the virtual machine environment and the nativemiddleware application; wherein the VMAPI is registered as a proxy component with the native middleware application; andwherein the non-native application is registered by the VMAPI as a proxied component with the native middleware application.

6,212,575 Extensible, replaceable network component system

Apple Computer, Inc.Cleron; Michael A. | Fisher; Stephen | Bruck; Timo

719 G06F 19950505 0 100%

Abstract: An extensible and replaceable network-oriented component system provides a platform for developing network navigation components that operate on a variety of hardware and software computer systems. These navigation componentsinclude key integrating components along with components configured to deliver conventional services directed to computernetworks, such as Gopher-specific and Web-specific components. Communication among these components is achieved throughnovel application programming interfaces (APIs) to facilitate integration with an underlying software component architecture.Such a highly-modular cooperating layered-arrangement between the network component system and the componentarchitecture allows any existing component to be replaced, and allows new components to be added, without affecting operationof the network component system.

www.patentics.com


MainClaim: An extensible and replaceable layered component computing arrangement residing on a computer coupled to acomputer network, the layered arrangement comprising:

a software component architecture layer interfacing with an operating system to control the operations of the computer, thesoftware component architecture layer defining a plurality of computing components; and

a network component layer for developing network navigation components that provide services directed to the computernetwork, the network component layer includes application programming interfaces; and

a first class included in the application programming interfaces to construct a first network navigation object that representsdifferent network resources available on the computer network, wherein the network component layer coupled to the softwarecomponent architecture layer in integrating relation to facilitate communication among the computing and network navigationcomponents.

2006/0168526 Platform-specific application user interface remoting

Nokia Corporation Stirbu; Vlad 715 G06F 20050112 10 92%

Abstract: This invention relates to a server-site method, a client-site method, computer program products, a client, a server, a module and a system for remoting a user interface of an application between a server that executes said application and at leastone client on which a representation of the user interface is to be rendered, wherein the representation of the user interface isgenerated at the server under consideration of a user interface description that is specific for a device platform of the at leastone client; and wherein the representation of the user interface is transferred to the at least one client. The representation ofthe user interface may for instance be a memory model representation or a frame buffer representation. MainClaim: A server-site method for remoting a user interface of an application between a server that executes said applicationand at least one client on which a representation of said user interface is to be rendered, said method comprising: generatingsaid representation of said user interface at said server under consideration of a user interface description that is specific for adevice platform of said at least one client; and transferring said representation of said user interface to said at least one client.

6,829,758

Interface markup language and method for making application code

Nokia Internet Communications, Inc.

Lewontin; Steve | Thrane; Leon 717 G06F 20000714 9 92%

Abstract: An Interface Markup Language ("IML") file specifies abstract server interface definitions called "operations" thatreturn abstract content descriptions called "entities". Each entity specifies a set of operations that the entity can invoke. Thecombined set of entities and operations together define an abstract flow diagram of an application. A computer readable mediumhas instructions stored thereon which, when executed by a processor, cause the processor to perform a sequence of steps inorder to make application code that is based on a flow diagram of an application. The steps include making an IML file thatincludes an operation list section delimited by an operation list marker and an entity list section delimited by an entity listmarker. The operation list section specifies a series of operations supported by an application server. The entity list sectiondescribes a set of entities which constitute an interface to an application running on the application server. The steps furtherinclude compiling the IML file to make application code. MainClaim: A method for generating application code comprising:

receiving a non-executable flow diagram of an application;

generating an interface markup language (IML) text file based on the application flow diagram, the IML text file containingoperations and entities specifying a structure of the application; and

generating application code or code fragments for the application based on the IML text file.

7,469,381

List scrolling and document translation, scaling, and rotation on a touch-screen display

Apple Inc. Ording; Bas 715 G06F 20071214 0 100%

Abstract: In accordance with some embodiments, a computer-implemented method for use in conjunction with a device with a touch screen display is disclosed. In the method, a movement of an object on or near the touch screen display is detected. Inresponse to detecting the movement, an electronic document displayed on the touch screen display is translated in a firstdirection. If an edge of the electronic document is reached while translating the electronic document in the first direction whilethe object is still detected on or near the touch screen display, an area beyond the edge of the document is displayed. After theobject is no longer detected on or near the touch screen display, the document is translated in a second direction until the areabeyond the edge of the document is no longer displayed. MainClaim: A computer-implemented method, comprising: at a device with a touch screen display: displaying a first portion ofan electronic document; detecting a movement of an object on or near the touch screen display; in response to detecting themovement, translating the electronic document displayed on the touch screen display in a first direction to display a secondportion of the electronic document, wherein the second portion is different from the first portion; in response to an edge of theelectronic document being reached while translating the electronic document in the first direction while the object is stilldetected on or near the touch screen display: displaying an area beyond the edge of the document, and displaying a thirdportion of the electronic document, wherein the third portion is smaller than the first portion; and in response to detecting thatthe object is no longer on or near the touch screen display, translating the electronic document in a second direction until thearea beyond the edge of the electronic document is no longer displayed to display a fourth portion of the electronic document,wherein the fourth portion is different from the first portion.

2010/0107116 INPUT ON TOUCH USER INTERFACES

NOKIA CORPORATION

Rieman; John | Hiitola; Kari | Heine; Harri | Yli-Nokari; Jyrki | Kallio; Markus | Kaki; Mika

715 G06F 20081027 5 95%

APPARATUS, METHOD

www.patentics.com


2009/0276701

AND COMPUTER PROGRAM PRODUCT FOR FACILITATING DRAG-AND-DROP OF AN OBJECT

Nokia Corporation Nurmi; Mikko A. 715 G06F 20080430 1 94%

Abstract: An apparatus, method and computer program product are provided for facilitating the drag-and-drop of an object, wherein the distance a user has to drag a graphical item associated with the object may be reduced. Once a user has selectedan object, for which a graphical item is displayed on an electronic device display screen, the electronic device may attempt topredict with which target object the user is likely to link, or otherwise associate, the selected object. Once the electronic devicehas identified one or more potential target objects, the electronic device may cause the graphical item(s) associated with thosepotential target object(s) to be displayed on the electronic device display screen at a location that is close to the location atwhich the selected graphical item is displayed. MainClaim: An apparatus comprising:a processor configured to:receive a selection of an object;identify one or more potentialtarget objects with which the selected object is linkable; andalter an image on a display screen so as to cause a graphical itemassociated with at least one of the one or more identified potential target objects to be displayed within a predefined distancefrom a first location at which either a graphical item associated with the selected object is displayed within the image or a keyassociated with the selected object is located within a keypad of the apparatus.

2010/0138784 MULTITASKING VIEWS FOR SMALL SCREEN DEVICES

NOKIA CORPORATION Colley; Ashley 715 G06F 20081128 1 92%

Abstract: A system and method that includes providing content items to be displayed on a display of a device, determining arelevance of each content item with respect to each other content item, and organizing the content items on the display of thedevice along a scattered continuum, wherein more contextually relevant content is located closer to a center area of the displayand less contextually relevant content is located away from the center area. MainClaim: A method comprising:providing content items to be displayed on a display of a device;determining a relevance ofeach content item with respect to each other content item; andorganizing the content items on the display of the device along acontinuum, wherein more contextually relevant content is located closer to a center area of the display and less contextuallyrelevant content is located away from the center area.

5,612,719 Gesture sensitive buttons for graphical user interfaces


Beernink; Ernest H. | Foster; Gregg S. | Capps; Stephen P.

345 G09G 19940415 0 100%

Abstract: A gesture sensitive button for graphical user interfaces characterized by a digital computer, a screen coupled to thedigital computer, a pointer mechanism used for pointing locations on the screen, a "button" image displayed on the screen, anda gesture recognizer for detecting gestures made on the screen by the pointing mechanism. The button is responsive to at leasttwo different button gestures made on the screen on or near the button. A process implementing the gesture sensitive button ofthe present invention includes: providing a button image on a computer screen; detecting a gesture made on the screen by apointer such as a stylus, mouse, or trackball; determining whether the gesture is associated with the button image; andinitiating one of at least two processes if the gesture is associated with the button image. The gesture sensitive buttonconserves real estate on the computer screen by permitting a single button to control multiple functions and processes. MainClaim: A gesture sensitive button for a graphical user interface comprising:

a digital processor,

a display screen coupled to said digital processor;

a pointer for pointing to locations on said display screen;

a button image displayed on said display screen, said digital processor being responsive without any intermediate input to atleast two different button gestures made by said pointer on said display screen at any location over said button image; and

gesture recognition means for detecting gestures made on said display screen by said pointer and operative to initiate a processin said digital processor that is determined by a recognizable button gesture made with said pointer on said display screen whichselects said button image and which has meaning to said digital processor based upon a context associated with said buttonimage wherein the gesture recognition means is arranged such that the function associated with each of said button gestureswill be initiated and executed in an identical manner regardless of the location over the button image that the gesture wasmade,

wherein said digital processor is operable such that when said gesture recognition means recognizes a particular recognizablebutton gesture for said button image, said digital processor provides feedback relative to said button confirming that said buttonimage has been selected, said feedback relative to said button also indicative of the particular function associated with saidparticular recognizable button gesture.

7,623,119 Graphical functions by gestures

Nokia CorporationAutio; Markku Tapio | Jarvio; Jami Jarkko Juhani

345 G09G 20040421 7 95%

Abstract: A method for operating a computer through a touch sensitive display interface includes displaying a computergenerated graphical image on a touch sensitive display using display software. The display software includes programs used todisplay the graphical image (e.g., display driver and web browser), and is responsive to inputs at a first, active portion (e.g.,coinciding with toolbars, hyperlinks) of the touch sensitive display when the graphic image is displayed, and is non-responsive to a second, inactive portion. In the method, an input character is received at the second, inactive portion of the touch sensitivedisplay, and is compared to a stored command character that is associated with a separate corresponding computer command.The separate corresponding computer command is executed if the input character matches the command character. In oneembodiment, one particular input character results in emulating a right mouse button by displaying a submenu of shortcut icons, and the method is implemented by operation of a computer program in a mobile station. MainClaim: A computer readable medium having computer instructions for performing actions comprising: displaying acomputer generated graphical image and at least one active area comprising an attribute on a touch sensitive display using a

www.patentics.com


displaying software program, the attribute comprising at least one of a scrolling operator, a toolbar icon and a hyperlink, saiddisplaying software program being responsive to inputs at only a first active portion of the touch sensitive display when saidgraphical image is displayed, and non-responsive to a second inactive portion of the display; receiving an input character at thesecond inactive portion of said touch sensitive display; comparing said input character to a stored command character that isassociated with a separate corresponding computer command; and executing the separate corresponding computer command ifsaid input character matches said command character, wherein said separate corresponding computer command is to display asubmenu at the touch sensitive display, said submenu comprising a plurality of shortcut links each to a different executablecommand.

2005/0237308 Graphical functions by gestures

Nokia CorporationAutio, Markku Tapio | Jarvio, Jami Jarkko Juhani

345 G09G 20040421 4 94%

Abstract: A method for operating a computer through a touch sensitive display interface includes displaying a computergenerated graphical image on a touch sensitive display using display software. The display software includes programs used todisplay the graphical image (e.g., display driver and web browser), and is responsive to inputs at a first, active portion (e.g.,coinciding with toolbars, hyperlinks) of the touch sensitive display when the graphic image is displayed, and is non-responsive to a second, inactive portion. In the method, an input character is received at the second, inactive portion of the touch sensitivedisplay, and is compared to a stored command character that is associated with a separate corresponding computer command.The separate corresponding computer command is executed if the input character matches the command character. In oneembodiment, one particular input character results in emulating a right mouse button by displaying a submenu of shortcut icons,and the method is implemented by operation of a computer program in a mobile station. MainClaim: In an electronic device for displaying a graphical image at a touch sensitive user interface using a displayingsoftware program, and for storing a separate computer command apart from the displaying software program, the improvementcomprising a computer program embodied in a computer readable medium comprising instructions to cause a computer to:receive an input at a portion of the touch sensitive user interface that is not recognized as active by the display program;compare said received input to a stored command character that is associated with the separate computer command; andexecute the separate computer command only if the received input matches the stored command character.

2008/0002888

Apparatus, method, device and computer program product providing enhanced text copy capability with touch input display

Nokia Corporation Yuan; Shijun 382 G06K 20060629 13 94%

Abstract: A device includes a display having touch sensitive display surface that is responsive to pen-based user input, and a control unit that is bidirectionally coupled to the display. The control unit is responsive to a user selecting displayed text from afirst display location using the pen, and is further responsive to a first signal generated using the pen, to copy the selecteddisplayed text to a buffer associated with a text window and to display the copied text in the text window. The control unit isfurther responsive to the user selecting a second display location using the pen, and to a second signal, to copy the displayedtext from the text window to the second display location, thereby implementing a copy and paste function. A cut and pastefunction may also be implemented. MainClaim: A method, comprising:selecting displayed text from a first display location using a pen in combination with a touchsensitive surface;in response to a first signal generated using the pen, copying the selected displayed text to a buffer associatedwith a text window and displaying the copied text in the text window;selecting a second display location using the pen; andinresponse to a second signal, copying the displayed text from the buffer to the second display location.

5,379,430 Object-oriented system locator system Taligent, Inc. Nguyen; Frank T. 707 G06F 19930804 0 100%

Abstract: A method and system for adding system components (documents, tools, fonts, libraries, etc.) to a computer systemwithout running an installation program. A location framework is employed to locate system components whose propertiesmatch those specified in a search criteria. The framework receives notification from the system when system components whoseproperties match the search criteria are added to or removed from the system. MainClaim: A computer implemented method for dynamically adding support for hardware or software components with one ormore properties to an operating system active on a computer with a memory, comprising the steps of:

(a) specifying a target hardware or software component search criteria including one or more properties;

(b) querying the operating system to identify one or more hardware or software components that meet the target hardware orsoftware component search criteria;

(c) returning hardware or software components meeting the target hardware or software component search criteria; and

(d) adding support for the hardware and software components to the operating system without rebooting the operating system.

2007/0050756 Component architecture Nokia Corporation Paller; Gabor 717 G06F 20050824 4 95%

Abstract: A self-organising software for controlling a device, which software contains at least two components. Each componentincludes at least one interface for connecting with other components, wherein each of the components itself contains informationdefining component rules. The rules contained by the components define how components can be connected with each othercomponents so that no external rule databases are necessary. MainClaim: A device including self-organising software that includes at least two components each including at least oneinterface for connecting with other components, wherein each of the components contains information defining component rulesaccording to which that component can be connected with other components.

2005/0160414

System and method for dynamically adding features to software applications

Nokia Corporation

Parnanen, Matti | Laaksonen, Jari | Rosendahl, Sami | Mansikkamaki, Harri

717 G06F 20040121 2 95%

Abstract: A method, device, system, and a computer program product where features are dynamically added to softwareapplications. These applications are added using a framework for a general unchangeable application programming interface

www.patentics.com


(API) that adds any feature to any application. MainClaim: A method for adding computer software features dynamically to a software application by establishing a frameworkfor a application programming interface (API) that adds a feature to an application, the method comprising: requesting from anapplication interworking framework a feature matching a consumer interest of a consumer application; using the consumerinterest and a feature capability to identify a provider; providing the feature, if the provider is identified, to the consumerapplication; and utilizing the feature at the consumer application.

2010/0005481 Method of Maintaining Applications in a Computing Device

NOKIA CORPORATIONLewis; Simon | Litovski; Ivan 719 G06F 20051215 3 94%

Abstract: A method is provided for managing the application lifecycle for user applications on a computing device. The methodcan centrally manage application lifecycle (including installation, execution status, removal) application capabilities long-lived OS level application owned resources (e.g. push connections, alarms) securityfor any application, regardless of application type ormodel or execution environment. MainClaim: A method of managing application lifecycle for user applications on a computing device, the method comprisingproviding an application management system (AMS) for managing a plurality of application models and a plurality of applicationenvironments, wherein the AMS is implemented as a component within an operating system for the computing device andgrants to the operating system control for all application management functionality on the device.

7,710,290

System and method for situational location relevant invocable speed reference

Apple Inc. Johnson; William J. 340 G08B 20070622 0 100%

Abstract: Situational location dependent information is transmitted from a server data processing system to a receiving dataprocessing system. The server data processing system communicates with the receiving data processing system in a manner bypushing content when appropriate. A candidate delivery event associated with a current positional attribute of the receiving dataprocessing system is recognized and a situational location of the remote data processing system is determined. The candidatedelivery event may be a location and/or direction change, device state change, or movement exceeding a movement tolerance.The situational location of the remote data processing system may be its location, direction, location and direction, proximity toa location, state change, or location and/or direction relative to a previous location and/or direction, or combinations thereof. Aset of delivery content from a deliverable content database is transmitted from the server data processing system to thereceiving data processing system according to the situational location of the receiving data processing system, and according todelivery constraints. The delivery content is configurable by authorized administrators on an instant activation basis forproactive delivery. MainClaim: A speed reference invocation method in a data processing system, said method comprising: receiving an invocablespeed reference according to a situational location of a user of said data processing system; presenting information for saidinvocable speed reference to said user; and automatically invoking said speed reference upon selection for invocation by saiduser, wherein said invocable speed reference is a phone number and wherein said step of automatically invoking said speedreference upon selection for invocation by said user includes automatically making a call with said phone number upon selectionfor invocation by said user.

2009/0222438 Method, system, and apparatus for location-aware search

Nokia Corporation and Recordation Form Cover Sheet

Strandell; Toni | Aarnio; Ari | Quiroz-Castro; Carlos

707 G06F 20080229 1 94%

Abstract: Performing location-aware search involves intercepting a network request targeted for an Internet-based search engine. The network request includes a location-dependent query containing a location term, and the location term cannot beused by the search engine to positively determine a target location. A location descriptor that can be used by the search engineto positively determine a target location is determined via a location database. The location database may include a locationsensor such as GPS. The network request is modified to replace the location term with the location descriptor, and the modifiednetwork request is sent to the search engine. MainClaim: An apparatus comprising:a network interface capable of communicating with an Internet-based search engine;a processor coupled to the network interface;a location database; andmemory coupled to the processor and the location database,wherein the memory includes instructions that cause the processor to:intercept a network request targeted for the searchengine, wherein the network request includes a location-dependent query containing a location term, wherein the location termcannot be used by the search engine to positively determine a target location;determine, via a location database of theapparatus, a location descriptor that can be used by the search engine to positively determine the target location;modify thenetwork request to replace the location term with the location descriptor; andsend the modified network request to the searchengine.

5,485,076 High efficiency auxiliary switching power supplies

Apple Computer, Inc.Schoenwald; David S. | Forge; Charles O.

323 H02M 19940816 0 100%

Abstract: Method and apparatus for producing an auxiliary voltage in a switching power supply. One or more auxiliary windingsare coupled to the main inductor of the switching power supply. A synchronous switch is used in conjunction with the auxiliarywinding to provide rectification and additionally provides waveform averaging which improves efficiency and voltage regulationover varying load conditions. MainClaim: In a switching power supply for producing a first output having a controlling circuit controlling a first switchconnected to a first end of a first transformer winding, and the first output connected to the second end of the first transformerwinding, a secondary output comprising:

a second transformer winding inductively coupled to the first transformer winding,

a second switch connected to the second transformer winding,

drive coupling connected from the controlling circuit to the second switch for switching the second switch in synchrony with thefirst switch, and

a filter capacitor connected across the second switch and the second transformer winding for filtering; the secondary output.

Synchronous

www.patentics.com


6,696,772 rectification Nokia Corporation Nieminen; Pentti 307 H02J 20020612 4 96%

Abstract: A direct-current converter converts an input voltage into an output voltage. It has and which comprises an operatingvoltage source, a power transformer having a primary side and secondary side, an input voltage source connected to the powertransformer, at least one first power switch disposed on the primary side, and at least one second power switch disposed on thesecondary side and rectifying the output voltage. The direct-current converter also has a regulating circuit, which is connected tothe first power switch and the second power switch to control the timing of their switching functions, and an auxiliary powersource arranged to supply power to the regulating circuit and connected to the operating voltage. MainClaim: A direct-current converter which converts an input voltage into an output voltage, comprising:

a power transformer having a primary side and a secondary side,

an input voltage source connected to said power transformer, at least one first power switch disposed on said primary side, andat least one second power switch disposed on said secondary side and serving to rectify the output voltage,

a regulating circuit, which is connected to said first power switch and to said second power switch to control the timing of theirswitching action, and

an auxiliary power source, which has been arranged to supply power to said regulating circuit and produce an output voltage.

6,671,193

Power source and arrangement for restricting the short-circuit current or rectifier

Nokia Corporation Pelkonen; Seppo 363 H02H 20020115 1 93%

Abstract: A power source with an arrangement for restricting short-circuit current includes at least a primary-side switch block, a transformer unit and a rectifier. The rectifier includes switching transistors for rectifying the secondary side of the transformer.Operation of the rectifier depends on a control from a pulse-forming part of the primary-side switch block. Control for the switching transistors in the rectifier is interrupted when the output current of the rectifier exceeds a limit value. At least oneother switch element is arranged parallel to each of the switching transistors in the rectifier to realize a secondary-side rectification in an overload situation. MainClaim: A power source with an arrangement for restricting a short-circuit current, said power source comprising:

a primary-side switch block,

a transformer unit having a transformer primary side and a transformer secondary side, said primary-side switch block connected to said transformer primary side, and

a rectifier connected to said transformer secondary side for generating an output signal of the power source and having at leastone switching transistor, a rectifier switching circuit for controlling said at least one switching transistor, wherein said rectifierswitching circuit is arranged to be cut off in an overload situation, and at least one switch element connected in parallel with saidat least one switching transistor, whereby rectification at the secondary side is realized in an overload situation by said at leastone switch element,

wherein said primary-side switch block includes a pulse-forming part for controlling the primary-side switch block and for generating a control signal proportional to the output signal of the power source and an arrangement for feeding the controlsignal from said pulse forming part to said rectifier switching circuit, said rectifier switching circuit controlling said at least oneswitching transistor in response to the control signal generated by said pulse-forming part.

5,657,211

Method and circuit for controlling the output characteristics of a switched-mode power supply

Nokia Technology GmbH

Brockmann; Hans-Jurgen 363 H02M 19960521 3 93%

Abstract: The invention relates to a method and a circuit to control the output voltage and current of a switched-mode power supply. In order to restrict the output current, a voltage value proportional to the primary current of a switched-mode power supply is measured and compared to a variable reference voltage Uext the value of which is determined by the total effect of the

constant charging current of a capacitor Cext and a discharge circuit operating in step with the secondary diode of the power

supply. If the voltage value proportional to the primary current is bigger than said reference voltage, the switching pulses of theprimary current switch are shortened. In order to restrict the output voltage, an image voltage is generated for the secondaryvoltage of the power supply transformer which is filtered and rectified and combined with the aforementioned reference voltagein order to produce pulse-width-modulated switching pulses of the primary current switch. MainClaim: A circuit to control the output current and output voltage in a switched-mode power supply that comprises a transformer (T1) equipped with primary and secondary windings (11, 12, 13) through which power is transferred from theprimary to the secondary, and a first switching element (Q1) on the primary side to interrupt the primary current (Ip) flowing

through the primary winding (11) of said transformer, which circuit comprises on the primary side

a control circuit (F1) to regulate the output voltage of the power supply by means of pulse width modulation by adjusting thepulse ratio of the switching pulses of said first switching element (Q1),

means (14, S1, Rs, Cext) for producing a first reference voltage (Uext), and

means (D2, R2, C2, Ia, R5, D3, C3, C4) for producing a first voltage signal (Ub), characterized in that it further comprises on the

primary side means (R11-R14) for producing a combination of said first reference voltage (Uext) and first voltage signal (Ub) and

for taking said combination to said control circuit (F1) in order to produce said switching pulses.

www.patentics.com


5,566,064 High efficiency supply for electroluminescent panels

Apple Computer, Inc.Schoenwald; David S. | Forge; Charles O.

363 H02M 19950526 0 100%

Abstract: Apparatus for operating electroluminescent panels. An electroluminescent panel is driven by a voltage source feedinga modified bridge driven by a pulse width modulated signal. By using a pulse frequency above the range of human hearing and amodulating signal that is a sine wave of the proper frequency for operating the panel, a sine wave is generated across the panelwithout requiring bulky low frequency magnetic components. MainClaim: Apparatus for operating an electroluminescent panel comprising:

a DC source having positive and negative terminals;

first and second capacitors connected in series between the positive and negative terminals of the DC source forming a voltagedivider;

a first output terminal for the electroluminescent panel connected to the junction of the first and second capacitors;

a transformer having first and second windings, each of the first and second windings having a start and an end, the start of thefirst winding connected to the positive terminal of the DC source and the start of the second winding connected to the negativeterminal of the DC source;

first and second series connected switches, the first switch connected to the end of the first transformer winding and the secondswitch connected to the end of the second transformer winding;

a second output terminal for the electroluminescent panel connected to the junction of the first and second switches; and

switch driving means for driving the first and second switches in complementary fashion with a pulse width modulated switchingsignal.

6,696,772 Synchronous rectification

Nokia Corporation Nieminen; Pentti 307 H02J 20020612 4 93%






5,657,211












www.patentics.com



7,382,634 Voltage multiplier with charge recovery

Nokia Corporation Buchmann; Michael 363 H02M 20031022 2 92%

Abstract: Capacitive voltage multiplier for generating voltage pulses, preferably up to 100 V, that are higher than the supplyvoltage for displays, non-volatile memories and corresponding units especially in small electronic devices, such as handheldtelecommunication terminals or corresponding devices, wherein the multiplier comprises a switching capacitor circuit (21)provided with capacitors and switches for charging the capacitors in parallel and discharging them in series in order to deliver ahigh voltage pulse. The multiplier further comprises a diode chain circuit (22) consisting of a diode-chain and pumping capacitors for delivering high voltage current. The inventive system allows the output high voltage to be switched on and heldwith little longtime drop and with small switching losses and able to supply a load current without significant ripple. Additionallyswitching the high voltage on and off does not result in efficiency loss. MainClaim: Capacitive voltage multiplier for generating voltage pulses, preferably up to 100 V, that are higher than the supplyvoltage for displays, non-volatile memories and corresponding units especially in small electronic devices, such as handheldtelecommunication terminals or corresponding devices, wherein the multiplier comprises a switching capacitor circuit (21)coupled between input (31) and output (32) terminals of the multiplier, said switching capacitor circuit (21) provided withcapacitors and switches for charging the capacitors in parallel and discharging them in series in order to deliver a high voltagepulse, characterised in that the multiplier further comprises a diode chain circuit (22) coupled between said input (31) andoutput (32) terminals of the multiplier, said diode chain circuit (22) comprising a diode-chain and pumping capacitors for delivering high voltage current.

5,490,053 Methods and apparatus for auxiliary trickle power supply

Apple Computer, Inc.Tkacenko; Nikola | Sontag, III; Harold L.

363 H02M 19930930 0 100%

Abstract: Circuit arrangements and methods are disclosed for providing trickle voltages and currents when a main power supplyis unavailable or, alternatively, for providing auxiliary power. In one embodiment, a trickle power supply consists of a bilaterallyconducting semiconductor diode device such as a SIDAC receiving an unregulated DC input voltage through a resistor. TheSIDAC is contemplated to have a specified breakover voltage Vbo and current carrying capability chosen according to designer

preference. A first capacitor is coupled between the SIDAC and a primary side of a step-down pulse transformer providing a specified reduction in voltage from a secondary side relative to the voltage applied to the primary side. The resistor, the firstcapacitor, and the SIDAC together form a modified RC resonant circuit oscillation characteristic. When the unregulated DC inputvoltage is applied, the first capacitor will charge up to the breakover voltage Vbo of the SIDAC, whereafter the SIDAC becomes

strongly conducting and charge is rapidly discharged to ground from the first capacitor through the SIDAC. When the storedcharge has been depleted, the SIDAC becomes nonconducting, and charge is thereafter again accumulated in the first capacitor.The alternate charging and discharging of the first capacitor according to the Vbo of the SIDAC produces an oscillating pulse

waveform. The pulse waveform is subsequently reduced in magnitude by the pulse transformer, and thereafter routed throughvoltage regulating means to adjust the reduced voltage and current of the oscillating pulse waveform to an output trickle voltageand current of specified magnitude. MainClaim: A trickle power supply for generating trickle voltages and currents, said trickle power supply comprising:

charge storage means coupled to an unregulated direct current (DC) source for receiving and storing electric charge;

bidirectionally conducting semiconductor diode means coupled to the charge storage means for enabling said charge storagemeans to alternately charge and discharge, thereby generating a periodic oscillating waveform having a plurality of alternatingcharging and discharging profiles;

voltage reducing means coupled to said charge storage means and said bidirectionally conducting semiconductor diode meansfor converting said periodic oscillating waveform into a reduced voltage periodic oscillating waveform, and

voltage regulation means coupled to said voltage reducing means for accumulating and converting said reduced periodicoscillating waveform into regulated voltage and current outputs comprising said trickle voltages and currents.








5,978,235 Primary adjusted switched-mode power supply

Nokia Technology GmbH Lampinen; Pertti 363 19980107 1 93%

Abstract: In order to adjust the output voltage and output current of a galvanically isolated switched-mode power supply, on the primary side there is formed an auxiliary voltage (15) proportional to the secondary voltage, and said auxiliary voltage is

www.patentics.com


studied by means of a window comparator, so that when the auxiliary voltage is within the reference window, there is appliedfixed power adjustment, and when the auxiliary voltage falls outside the reference window (>max, <min), the quantity ofelectric power fed in by the isolation transformer of the primary side is restricted. Most advantageously the auxiliary voltage isformed by means of an auxiliary coil (12b) contained in the isolation transformer, and the reverse threshold voltages of twozener diodes represent the limit values of the reference window. MainClaim: A method for adjusting the output voltage and output current of a switched-mode power supply that is galvanically isolated by means of an isolation transformer, comprising the steps of:

providing a quantity of power to said isolation transformer,

on a primary side, providing an auxiliary voltage proportional to a secondary voltage,

monitoring said auxiliary voltage by means of a window comparator, for restricting the quantity of electric power fed into theisolation transformer by the primary side when the auxiliary voltage falls outside a reference window, and otherwise providingthe quantity of electric power as a fixed quantity.

7,382,634 Voltage multiplier with charge recovery Nokia Corporation Buchmann; Michael 363 H02M 20031022 2 93%

Abstract: Capacitive voltage multiplier for generating voltage pulses, preferably up to 100 V, that are higher than the supplyvoltage for displays, non-volatile memories and corresponding units especially in small electronic devices, such as handheldtelecommunication terminals or corresponding devices, wherein the multiplier comprises a switching capacitor circuit (21)provided with capacitors and switches for charging the capacitors in parallel and discharging them in series in order to deliver ahigh voltage pulse. The multiplier further comprises a diode chain circuit (22) consisting of a diode-chain and pumping capacitors for delivering high voltage current. The inventive system allows the output high voltage to be switched on and heldwith little longtime drop and with small switching losses and able to supply a load current without significant ripple. Additionallyswitching the high voltage on and off does not result in efficiency loss. MainClaim: Capacitive voltage multiplier for generating voltage pulses, preferably up to 100 V, that are higher than the supplyvoltage for displays, non-volatile memories and corresponding units especially in small electronic devices, such as handheldtelecommunication terminals or corresponding devices, wherein the multiplier comprises a switching capacitor circuit (21)coupled between input (31) and output (32) terminals of the multiplier, said switching capacitor circuit (21) provided withcapacitors and switches for charging the capacitors in parallel and discharging them in series in order to deliver a high voltagepulse, characterised in that the multiplier further comprises a diode chain circuit (22) coupled between said input (31) andoutput (32) terminals of the multiplier, said diode chain circuit (22) comprising a diode-chain and pumping capacitors for delivering high voltage current.

5,773,963

Method and apparatus for programmably adjusting output voltage of a battery charger

Apple Computer Inc. Blanc; James J. | Gurries; Mark C.

320 H02J 19960829 0 100%

Abstract: An apparatus for programmably adjusting output voltage of a constant-voltage battery charger is disclosed. The present invention includes a power circuit for generating an output voltage for charging batteries. This power circuit generatesthis output voltage as a function of an incoming power source and an incoming error signal. The invention further includes acontroller for providing a pulse width modulated (PWM) signal operating at a pre-determined frequency. This PWM signal controls the effective divider ratio of a voltage divider network which is implemented, among other things, for generating theerror signal to be fed to the power circuit. The present invention varies the effective divider ratio by programmably applying thepulse width modulated signal from the controller. As a result, the output voltage from the power circuit can be varied tooptimally charge batteries of differing types and technologies. MainClaim: A constant-voltage battery charger for charging at least one battery, the battery charger comprising:

a voltage divider network including at least two resistive elements in series and said two resistive elements being disposed inelectrical parallel to the at least one battery;

a power circuit for generating an output voltage of the battery charger from an incoming power source and an incoming errorsignal; said power circuit being adapted for applying the output voltage to the at least one battery and the voltage dividernetwork;

a control circuit including a control resistor serially connected to a MOSFET, said control resistor and said MOSFET beingdisposed in electrical parallel to one of the at least two resistive elements of the voltage divider network, said control circuithaving one end connected to an electrical ground;

a controller being connected to the MOSFET and adapted for switching the MOSFET ON and OFF, said MOSFET being responsiveto a pulse width modulated output signal having a programmable duty cycle operating at a pre-determined frequency from the controller; and

a comparison circuit including an operational amplifier for generating the error signal by comparing between a pre-determined voltage reference and the voltage across the control circuit, said comparison circuit being configured to roll off at a frequencymuch lower than the pre-determined frequency of the pulse width modulated output signal.

6,407,532

Method and apparatus for measuring battery charge and discharge current

Nokia Mobile Phones, Ltd.

Ruha; Antti 320 H01M 20010129 1 93%

Abstract: Disclosed is a method for charging a battery and circuitry for performing the method. The method includes steps of:(a) generating a charging current (Ich) for a battery; (b) generating a replica current (Irep) of Ich, where Irep=Ich/N, whereN>1; (c) measuring a voltage drop induced by Irep across a measurement resistance; and (d) using the measured voltage dropfor controlling a magnitude of Ich. Preferably N is greater than about 10, more preferably N is greater than about 100, and inthe most preferred embodiment N is in a range of about 100 to about 1000. The step of generating the charging current (Ich)includes a step of operating a first device having an input node coupled to a source of charging current, the step of generating

www.patentics.com


the replica current (Irep) includes a step of operating a second device having an input node coupled to the source of chargingcurrent; wherein the first device and the second device are both driven with the same control signal. The control signal may be apulse width modulated signal having a pulse width that is controlled as a function of the measured voltage drop across themeasurement resistance, or a DC voltage having an adjustable voltage value. In the preferred embodiment the step ofgenerating the replica current (Irep) includes a step of operating a servo loop to force a potential appearing at an output node ofthe second device to equal a potential appearing at an output node of the first device. A battery discharge measurement circuitis also disclosed, and operates in accordance with the same principles as the battery charging circuit. MainClaim: A battery charging circuit, comprising:

a first device driven by a control signal and having an input node coupled to a source of charging current and an output node forcoupling a charging current Ich to a battery to be recharged; and

a second device driven by said control signal and having an input node coupled to said source of charging current and an outputnode coupled to a measurement resistance, wherein a voltage drop across said measurement resistance due to a current flowIrep through said measurement resistance is sensed for controlling current flow through said first device, and wherein Irep isequal to Ich/N, where N is a scaling factor that is greater than unity.

2005/0253556 Battery charging control Nokia Corporation Kuiri, Tapio 320 H02J 20040511 1 92%

Abstract: The invention relates to a battery charging control circuit for controlling a charging of a rechargeable battery bymeans of a charging component. The battery charging control circuit comprises a switching element, a control component andan energy storage component. The switching element is adapted to connect a battery to a charging component and todisconnect the battery from the charging component. The control component is adapted to control the switching element. Theenergy storage component is arranged to be loaded by the charging component and to provide a voltage across the energystorage component as a supply voltage to the control component. The invention relates equally to a electronic device comprisingsuch a circuit and to a method of providing a power supply to a control component of such a circuit. MainClaim: A battery charging control circuit for controlling a charging of a rechargeable battery by means of a chargingcomponent, said battery charging control circuit comprising a switching element, a control component and an auxiliary energystorage component, wherein said switching element is adapted to connect a battery to a charging component and to disconnectsaid battery from said charging component, respectively; wherein said control component is adapted to control said switchingelement; and wherein said energy storage component is arranged to be loaded by a charging component and to provide avoltage across said energy storage component as a supply voltage to said control component.

2008/0278221

POWER DISTRIBUTION CIRCUIT FOR USE IN A PORTABLE TELECOMMUNICATIONS DEVICE

Nokia Corporation Rowland; Barry G05F 20070511 2 92%

Abstract: A power distribution circuit for use in a personal telecommunications device comprises a switched mode power supplyconfigured to convert an input voltage and current from an energy source into an output voltage and current, a plurality ofseries-connected charge storage components arranged to be charged by the output voltage and a charge balancing circuitconfigured to substantially equalise voltages across each of the charge storage components, wherein the charge balancing circuitcomprises a charge pump. MainClaim: A power distribution circuit for use in a portable telecommunications device comprising:a switched mode powersupply configured to convert an input voltage and current from an energy source into an output voltage and current;a pluralityof series-connected charge storage components arranged to be charged by the output voltage;a charge balancing circuit comprising a charge pump configured to substantially equalise voltages across each of the charge storage components.

7,408,403 Circuits and methods for amplifying signals

Apple Inc.Farrar; Douglas M. | Sander; Wendell B.

330 H03F 20060609 0 100%

Abstract: The present invention discloses a bus pumping compensation for a pulse modulation circuit such as class Dmodulators. The compensation according to the present invention provides a compensation current controlled by the outputvoltage, with the compensation characteristics matching the reverse current for improving circuit efficiency. Embodiments of thepresent invention also disclose a designable compensation circuit, comprising a linear compensation current, offering a goodtrade-off between circuit efficiency and ease of design. The present invention compensation circuit is preferably employed in aclass D amplifier with substantial reverse current, and most preferably added into a LDO power supply in a class D amplifiercircuit to prevent reverse current problem. The disclosed class D amplifier circuit is preferably used in an audio media player. MainClaim: A method for compensating for reverse power supply current of a modulator, the method comprising: generating avoltage-dependent compensation current for the power supply to compensate for the reverse current, the compensation currentcontrolled by an output voltage of the modulator circuit.

2008/0272750 Device NOKIA CORPORATION Aitto-Oja; Timo 323 G05F 20070821 1 94%

Abstract: A device includes an output and a linear regulator coupled to the output. The device also includes a switchingregulator coupled to the output and means for controlling said switching regulator in dependence on power loss in said linearregulator. MainClaim: A device comprising:an output;a linear regulator coupled to the output;a switching regulator coupled to the output;andmeans for controlling said switching regulator in dependence on power loss in said linear regulator.

7,538,631 Multi-mode amplitude modulator control method

Nokia CorporationImmonen; Antti | Grigore; Vlad 332 H03C 20070220 1 94%

Abstract: A power management device providing a power amplifier with power supply voltage is provided. The powermanagement unit includes a parallel-hybrid amplitude modulator apparatus having a linear part configured to track frequencycomponents of an input signal above a determined threshold frequency and a switching part arranged in parallel with the linearpart and configured to track frequency components of the input signal below the determined threshold frequency. Additionally,the power management unit includes a current sensing and controlling part configured to determine the level of a direct currentcomponent at an output of the linear part and control the switching part to produce an output signal compensating for the directcurrent component at the output of the linear part to decrease the absolute level of the direct current at the output of the linearpart. MainClaim: A parallel-hybrid amplitude modulator apparatus, comprising: an interface configured to receive an input signal; a

www.patentics.com


linear part configured to track frequency components of the input signal above a determined threshold frequency; a switchingpart arranged in parallel with the linear part and configured to track frequency components of the input signal below thedetermined threshold frequency, wherein the linear part and the switching part are configured to track a varying amplitude ofthe input signal; and a current sensing and controlling part configured to determine a level of a direct current component at anoutput of the linear part and control the switching part to produce an output signal configured to compensate the direct currentcomponent at the output of the linear part to decrease a absolute level of the direct current at the output of the linear part.

2008/0157895 Multi-mode amplitude modulator control method

Nokia CorporationImmonen; Antti | Grigore; Vlad 332 H03C 20070220 1 94%

Abstract: A power management device providing a power amplifier with power supply voltage is provided. The powermanagement unit includes a parallel-hybrid amplitude modulator apparatus having a linear part configured to track frequencycomponents of an input signal above a determined threshold frequency and a switching part arranged in parallel with the linearpart and configured to track frequency components of the input signal below the determined threshold frequency. Additionally,the power management unit includes a current sensing and controlling part configured to determine the level of a direct currentcomponent at an output of the linear part and control the switching part to produce an output signal compensating for the directcurrent component at the output of the linear part to decrease the absolute level of the direct current at the output of the linearpart. MainClaim: A parallel-hybrid amplitude modulator apparatus, comprising:an interface configured to receive an input signal;alinear part configured to track frequency components of the input signal above a determined threshold frequency;a switchingpart arranged in parallel with the linear part and configured to track frequency components of the input signal below thedetermined threshold frequency; anda current sensing and controlling part configured to determine a level of a direct currentcomponent at an output of the linear part and control the switching part to produce an output signal compensating for the directcurrent component at the output of the linear part to decrease a absolute level of the direct current at the output of the linearpart.

7,688,046 Power converters having varied switching frequencies

Apple Inc. Li; Li | Patel; Ronil D.

323 H02M 20050725 0 100%

Abstract: Systems and techniques for performing power conversion operations in a portable device are used to convert an inputvoltage to a voltage at an output. The conversion operations use a two-stage conversion to convert the input voltage to a first voltage and to convert the first voltage to a second voltage. A switching frequency is altered with changes in the input voltage.The switching frequency is selected based on the input voltage level and/or to maintain a substantially consistent ripple at theoutput, which can correspond to the first voltage and/or the second voltage. MainClaim: A method comprising: converting an input voltage from a battery to a voltage at an output using a two-stage conversion to convert the input voltage to a first voltage and to convert the first voltage to a second voltage; determining adecrease in the input voltage from the battery; and decreasing a switching frequency in the two-stage conversion based, at least in part, on the decreased input voltage from the battery to provide improved power efficiency relative to use of a constantswitching frequency, wherein decreasing the switching frequency is performed in response to a detected change in the ripple atthe output to maintain a substantially consistent ripple at the output.

2009/0315471 METHOD AND DEVICE FOR DRIVING A CIRCUIT ELEMENT

NOKIA CORPORATION Rowland; Barry 315 H05B 20061228 1 93%

Abstract: Light emitting diodes (LEDs) are commonly used to backlight liquid crystal display screens for mobile telephones andother display devices. It may be desirable for the LEDs to be gradually dimmed and this can result in noise being emitted by thecomponents of the driving circuit, along with other undesirable effects. A device for driving a circuit element is provided,comprising a voltage source (6, 7, 8) for generating a pulse width modulated (PWM) output voltage signal, a capacitor (9)arranged to filter the PWM output voltage signal; and a switching element (13) characterised in that the switching element (13)is synchronised with the PWM output voltage signal such that when the PWM output voltage signal is at a minimum, theswitching element (13) isolates the capacitor (9) and so prevents the capacitor (9) from discharging. MainClaim: An apparatus comprising:a voltage source for generating a pulse width modulated (PWM) output voltage signal;acapacitor configured to filter the PWM output voltage signal; anda switching element configured to synchronise with the PWMoutput voltage signal such that when the PWM output voltage signal is at a minimum, the switching element substantiallyprevents the capacitor from discharging.

2008/0278221

POWER DISTRIBUTION CIRCUIT FOR USE IN A PORTABLE TELECOMMUNICATIONS DEVICE

Nokia Corporation Rowland; Barry G05F 20070511 2 93%

Abstract: A power distribution circuit for use in a personal telecommunications device comprises a switched mode power supplyconfigured to convert an input voltage and current from an energy source into an output voltage and current, a plurality ofseries-connected charge storage components arranged to be charged by the output voltage and a charge balancing circuitconfigured to substantially equalise voltages across each of the charge storage components, wherein the charge balancing circuitcomprises a charge pump. MainClaim: A power distribution circuit for use in a portable telecommunications device comprising:a switched mode powersupply configured to convert an input voltage and current from an energy source into an output voltage and current;a pluralityof series-connected charge storage components arranged to be charged by the output voltage;a charge balancing circuit comprising a charge pump configured to substantially equalise voltages across each of the charge storage components.

5,420,493 Power supply and battery charger


Hargadon; Andrew | Young; Steven J. | Tonomura; Kihachiro | Wallgren; Markus | Gurries; Mark

320 H01M 19920630 0 100%

Abstract: An integrated AC adapter and battery charger is disclosed. The apparatus comprises an AC adapter unit forconverting AC power to a DC power and a battery charging apparatus coupled to the AC adapter unit for charging a batterypack. The battery charging apparatus further comprises a microcontroller for sensing the condition of the battery pack or tacksbeing charged, a memory for storing the proper charging profile for a number of different types of battery packs, and a chargingcurrent generator capable of generating a varying charging current based on the microcontroller's determination of the battery's

www.patentics.com


condition and the charging profile stored in the memory. MainClaim: A method for charging a battery pack having a first memory for indicating a multiplicity of battery identificationdata comprising at least a serial number identifying the battery pack, the method comprising the steps of:

inserting the battery pack into a battery charger further coupled to a computer, said battery charger comprising at least acontroller, a second memory for storing battery identification data corresponding to a multiplicity of known battery packs, and acharging current generator;

reading the battery identification data of said battery pack from said first memory with the controller;

determining whether the battery pack inserted in said battery charger is one of said known battery packs by comparing saidbattery identification data read from the battery pack against said battery identification data stored in said battery charger;

reading via said controller from the second memory at least one charging profile corresponding to the battery identification dataread from said first memory,

and

charging the battery pack with an electrical current according to the charging profile by varying the electrical current producedby the charging current generator.

6,242,888

Optimization of mobile station battery charging with a two slot charger by sharing a charging period

Nokia Mobile Phones Cerf; Patrice 320 H02J 20000530 1 92%

Abstract: A battery charging station includes a first charging circuit for charging a first battery, a second charging circuit forcharging a second battery and circuitry that is responsive to a pulse width modulated signal that defines a plurality of repeatingcharging periods, for selectively allocating, during a single one of the charging periods, battery charging energy first to one ofthe first charging circuit or the second charging circuit, and then to the other charging circuit. The PWM signal is preferablyreceived from an external battery charging circuit associated with the first battery, and during a single one of the chargingperiods the battery charging energy is applied first to the first charging circuit and then, if at least one criteria is met, to thesecond charging circuit. The at least one criteria can include an ability to develop a minimum charging voltage to the secondbattery during the amount of time remaining within the current charging period, after applying charging energy to the firstbattery. The first battery may be installed within a device, such as a cellular telephone or a personal communicator, and thePWM signal is received from a battery charging circuit installed within the device and the second battery is located within a(spare) battery pack. During a single one of the charging periods the battery charging energy is applied first to the first chargingcircuit for recharging the first battery and then is selectively applied to the second charging circuit for recharging the secondbattery. MainClaim: A battery charging station, comprising:

a first charging circuit for charging a first battery;

a second charging circuit for charging a second battery; and

circuitry, responsive to a pulse width modulated (PWM) signal that defines a plurality of repeating charging periods, forselectively allocating, during a single one of the charging periods, battery charging energy first to one of the first charging circuitor the second charging circuit, and then to the other charging circuit.

5,559,683 Flyback switching power supply with bootstrapped gate drive

Apple Computer, Inc.Schoenwald; David S. 363 H02M 19940930 0 100%

Abstract: Method and apparatus for providing bootstrapped gate drive voltage in a flyback switching power supply. Switchingtransients and ringing caused by leakage inductance and capacitance in the flyback transformer are captured and used toprovide a boosted gate drive voltage for the flyback switch, resulting in lower on resistance and lower switching losses. MainClaim: In a switching power supply having an input terminal, a common terminal, a controller, a transformer primaryhaving a top primary winding lead and a bottom primary winding lead, the top primary winding lead connected to the inputterminal, a switch controlled by the controller, the switch connected between the bottom primary winding lead and commonterminal, an improved drive voltage generator comprising:

a series diode connected to the junction of the bottom primary winding lead and the switch;

a capacitor connected between the output of the series diode and common; and

a voltage clamp connected to the output of the series diode, the voltage clamp providing a bootstrapped voltage rising to avoltage higher than the voltage at the input terminal, the bootstrapped voltage being used to drive the switch.




www.patentics.com






6,356,468 Arrangement for limiting starting current in a power supply

Nokia Networks OyHavukainen; Matti | Riihimaki; Juha 363 H02M 20010517 3 95%

Abstract: The invention disclosed here relates to a method and arrangement for limiting the starting current in a switchingpower supply. As the operating voltage is switched on in the power supply an uncharged capacitor (C1) in the power supply

represents a short circuit, generating a large starting current which is limited by a limiting element (16) to a desired value. Toensure uninterrupted operation of the switching power supply the limiting element (16) should be bypassed as soon as possibleafter the switching-on of the operating voltage. Therefore, in parallel with the limiting element (16) there is provided a bypassunit (14) via which the bypass current can be conducted. The limiting element bypass unit (14) is controlled by a control signalwhich is generated by means of a capacitive voltage divider circuit from the primary voltage. MainClaim: A method for limiting the starting current in a switching power supply in which

the starting current generated in connection with the charging of a capacitor (C1) in the switching power supply is limited by a

limiting element (16), and

the limiting element (16) is bypassed via a limiting element bypass unit (14) connected in parallel with the limiting element (16)after the operating voltage of the switching power supply has been switched on, when the power supply has started,

characterized in that

a control signal is generated, using capacitive voltage division, from the voltage of a primary winding in a switching transformer,and

the limiting element bypass unit (14) is controlled by means of said control signal.

5,657,211













5,949,160

System and method for double fault protection within a digital camera device

Apple Computer, Inc. Anderson; Eric C. | Fullam; Scott F.

307 H01H 19961008 0 100%

Abstract: The invention comprises a battery coupled to a power bus, an external power connector coupled to the power bus forreceiving an external power plug, and two switching devices for disconnecting the battery from the power bus when the externalpower plug is coupled to the connector. The battery supplies power to the camera unless the external power plug is coupled tothe connector. Upon coupling of the external power plug to the connector, the two switching devices, which are positioned inseries between the negative terminal of the battery and the system ground, are opened. The opening of the two switchingdevices disconnects the battery from the power bus and connector to prevent damage which could be caused by applying anexternally supplied voltage from the external power plug across the positive and negative terminals of the battery. MainClaim: A system for providing double fault protection, comprising:

www.patentics.com


a battery for generating an internal supply voltage, said battery being coupled to a power bus and a plurality of diodes forvoltage clamping said power bus;

an external power connector, coupled to said power bus, for receiving an external power plug; and

first and second switching devices connected in series from said battery from said power bus when said external power plug isinserted.

2009/0097182 Circuitry protection arrangement Nokia Corporation Saarinen; Pertti 361 H02H 20071016 1 93%

Abstract: A circuit and a method are provided for protecting sensitive circuitry from over voltage and over current during adouble fault situation. The circuit may be used in a portable electronic device, and may include an over voltage protectioncomponent and an over current protection component. The over voltage protection component may be coupled across powersupply inputs of a load of the portable electronic device. The over current protection component is configured in the circuit toprovide over current protection to the load of the portable electronic device at least when the over current protection componentprovides over current protection to the over voltage protection component. MainClaim: A portable device comprising a circuit, wherein the circuit comprises:a first component configured to be coupledacross power supply inputs of a load, said power supply inputs configured for receipt of power from an external power source,said first component configured to provide over voltage protection for said load; anda second component coupled to the firstcomponent and configured to be coupled to said load, said second component configured to provide over current protection forsaid load and for said first component, wherein said second component provides over current protection to said load at leastwhen the second component provides over current protection to said first component.

5,572,095

Method and apparatus for driving deflection and high voltage stages in a video display

Apple Computer, Inc. Krause; Peter 315 H01J 19950721 0 100%

Abstract: The present invention, generally speaking, provides an improved base drive arrangement for scan and/or EHT outputstages in a television or video display monitor. In accordance with one aspect of the invention, by adding just a few componentsto an existing main base drive circuit, two power transistors may be driven, e.g. a scan output transistor and an EHT outputtransistor. The two power transistors are switched at the same time, allowing pulse width modulators of the scan and EHTcircuits to operate on a common time base. Switching of two power transistors at the same time would usually require a quitecomplicated design to offset the different storage times of the two devices, thereby achieving high performance but at aconsiderable cost premium. The base drive circuit of the invention achieve substantial synchronization of the two transistors atminimal cost. In accordance with another aspect of the invention, a base drive circuit uses a low DC supply voltage and aresistive element in series with the main current path in order to produce a more constant maximum base current overfrequency. MainClaim: For use in a video monitor, an apparatus comprising:

a first power transistor connected to power and ground voltages and having a first control electrode;

a second power transistor connected to power and ground voltages and having a second control electrode;

a signal comprising periodic retrace pulses for periodically switching off the first and second power transistors; and

a drive circuit coupled to said signal and to said first and second control electrodes, said circuit comprising:

means for providing a positive drive current to said first and second control electrodes;

means for causing a first negative drive current to flow from said first control electrode, producing a negative voltage at saidfirst control terminal; and

means coupled to said first control electrode and said second control electrode of said second power transistor and responsive tosaid negative voltage for causing a second negative drive current to flow from said second control electrode.









www.patentics.com




4,130,862 DC Power supply Apple Computer, Inc. Holt; Frederick R. 363 H02M 19780201 0 100%

Abstract: A direct current (DC) power supply of the single-ended flyback type particularly suited for providing power for integrated circuits is described. The power supply is self-exciting and thus does not employ an auxiliary drive or oscillator. The starting/restarting circuitry provides protection against faults. Because of this fault protection, a relatively simple over-voltage circuit is employed at the output of the supply. An additional primary winding is used to provide protection for no-load conditions. MainClaim: A direct current power supply comprising:

a transformer having at least one primary winding and one secondary winding, one lead of said primary winding for coupling toa source of direct current;

a transistor having a collector, base, and emitter terminal, said collector terminal coupled to the other lead of said primarywinding;

starting means for initiating oscillations such that power may be transferred through said transformer from said primary windingto said secondary winding, said starting means comprising a first resistor and first capacitor coupled to the emitter terminal ofsaid transistor and charging means for charging said first capacitor, said starting circuit for controlling the flow of emitter currentso as to initiate said oscillations without damaging said transistor;

rectification means coupled to said secondary winding for providing an output direct current potential;

whereby oscillations are initiated in said direct current power supply without damage to said supply during a fault condition.











7,688,267

Broadband antenna with coupled feed for handheld electronic devices

Apple Inc. Hill; Robert J. 343 H01Q 20061106 0 100%

Abstract: Broadband antennas and handheld electronic devices with broadband antennas are provided. A handheld electronicdevice may have a housing in which electrical components such as integrated circuits and a broadband antenna are mounted.The broadband antenna may have a ground element and a resonating element. The resonating element may have two arms ofunequal length and may have a self-resonant element. The antenna may have a feed terminal connected to the self-resonant element and a ground terminal connected to the ground element. The self-resonant element may be near-field coupled to one of the arms of the resonating element. With one suitable arrangement, the self-resonant element may be formed using a conductive rectangular element that is not electrically shorted to the ground element or the arms of the resonating element. Theantenna may operate over first and second frequency ranges of interest. MainClaim: A handheld electronic device antenna, comprising: a ground element; a resonating element comprising a first armhaving a first length, a second arm having a second length that is different than the first length, and a self-resonant element that is near-field coupled to the second arm, wherein the self-resonant element is not electrically shorted to the ground element; an antenna ground terminal connected to the ground element; and an antenna feed terminal connected to the self-resonant element.

2009/0005110 Using a conductive support of a speaker assembly as an antenna

Nokia Corporation Ozden; Sinasi 455 H04M 20070629 4 94%

Abstract: A speaker assembly is disclosed that includes a conductive support that provides mechanical support for the speakerassembly. The conductive support is configured to function as an antenna. A wireless device is disclosed that includes a speaker

www.patentics.com


assembly including a conductive support that provides mechanical support for the speaker assembly, and includes a transceivercoupled to the conductive support and configured to communicate radio frequency signals using the conductive support. Amethod is disclosed that includes providing a speaker assembly including a conductive support that provides mechanical supportfor the speaker assembly, and providing a transceiver operable to communicate radio frequency signals using the conductivesupport. MainClaim: A speaker assembly comprising a conductive support that provides mechanical support for the speaker assembly,wherein the conductive support is configured to function as an antenna.

2010/0123633 APPARATUS AND METHOD OF PROVIDING AN APPARATUS

Nokia CorporationOZDEN; Sinasi | Cviko; Mirsad 343 H01Q 20091113 5 94%

Abstract: An apparatus and method of providing an apparatus, the apparatus including a conductive cover portion defining atleast a portion of an external surface of the apparatus; a feed element configured to capacitively couple radio circuitry to theconductive cover portion at a feed point; a ground plane galvanically connected to the conductive cover portion at a groundpoint; wherein the feed point and the ground point are separated along a length of the conductive cover portion and configurethe conductive cover portion to resonate at a first resonant frequency so as to be operable as an antenna in a first frequencyband and wherein the first resonant frequency of the conductive cover portion is controlled by the separation between the feedpoint and the ground point. MainClaim: An apparatus comprising;a conductive cover portion defining at least a portion of an external surface of theapparatus;a feed element configured to capacitively couple radio circuitry to the conductive cover portion at a feed point;aground plane galvanically connected to the conductive cover portion at a ground point;wherein the feed point and the groundpoint are separated along a length of the conductive cover portion and configure the conductive cover portion to resonate at afirst resonant frequency so as to be operable as an antenna in a first frequency band and wherein the first resonant frequency ofthe conductive cover portion is controlled by the separation between the feed point and the ground point.

2008/0303723 Antenna system Nokia Corporation Bengtsson; Erik 343 H01Q 20070606 1 93%

Abstract: A wireless electronic device is disclosed that includes one or more ground planes and an antenna electrically coupledto the one or more ground planes. The antenna is positioned adjacent to a portion of the one or more ground planes. Thewireless electronic device includes a material placed in a position and having a dielectric constant selected to increase aneffective electrical size of the one or more ground planes relative to the effective electrical size of the one or more ground planeswithout the material. Other wireless electronic devices and methods for forming the same are also disclosed. MainClaim: A wireless electronic device comprising:at least one ground plane;an antenna electrically coupled to the at least oneground plane, the antenna positioned adjacent to a portion of the at least one ground plane; anda material placed in a positionand having a dielectric constant selected to increase an effective electrical size of the at least one ground plane relative to theeffective electrical size of the at least one ground plane without the material.

5,694,060 CMOS differential twisted-pair driver

Apple Computer, Inc. Brunt; Roger Van | Oprescu; Florin

326 H03F 19941213 0 100%

Abstract: A CMOS differential twisted-pair driver which utilizes CMOS switches and current sources advantageously. Noalternative power supply is required, the switches do not have to be low impedance and the device is low power. The preferredembodiment driver further limits signal overshoot and common mode energy. The signal transmission facility is bi-directional so an off state is provided. It is doubly terminated to provide for symmetry, improved bandwidth and reduces reflective signalnoise. The double termination also provides for faster rise and fall times which reduces the systems sensitivity to receiver offset. MainClaim: A CMOS twisted-pair signal driver responsive to CMOS level signals for coupling to a twisted-pair communication cable for signaling information, said signal driver comprising:

first signal current driving circuitry responsive to a first CMOS level signal logic state for propagating a first signal state over atwisted-pair cable, said first signal current driving circuitry including a terminating resistor through which a first current flows when said first signal state is propagating over said twisted pair cable; and

second signal current driving circuitry responsive to a second CMOS level signal logic state for propagating a second signal stateover said twistedpair cable, said second current driving circuitry including the terminating resistor through which a secondcurrent flows when said second signal state is propagating over said twisted pair cable;

wherein said first and second signal states have approximately equal amplitudes with opposite sign.

7,519,334

Multi-mode I/O circuitry supporting low interference signaling schemes for high speed digital interfaces

Nokia Corporation

Ruha; Antti | Ruotsalainen; Tarmo | Tervaluoto; Jussi-Pekka

455 H04B 20011102 2 92%

Abstract: A multi-mode I/O circuit or cell (10) is provided for transmitting and receiving data between ICs, where each ICcontains at least one of the I/O circuits. Each data link includes transmitter circuitry (12) and receiver circuitry (14). Thetransmitter circuitry sends data to a receiver circuitry in another IC, and the receiver circuitry receives data from a transmittercircuitry in another IC. The I/O circuit is constructed with CMOS-based transistors (e.g., CMOS or BiCMOS) that are selectively interconnected together by a plurality of switches to operate as two single-ended, current or voltage mode links, or as a single differential current or voltage mode link. In the preferred embodiment the transmitter circuitry sends data to the receivercircuitry in another IC over a first pair of adjacently disposed conductors, and the receiver circuitry receives data from thetransmitter circuitry in another IC over a second pair of adjacently disposed conductors. The transmitter circuitry and thereceiver circuitry are selectively configured by the plurality of switches for operating in a double single-ended voltage mode link mode, a double single-ended current mode link mode, a mode defined by a single differential voltage mode link with a single-ended input drive, a mode defined by a single differential voltage mode link with a differential input drive, a mode defined by asingle differential current mode link with a single-ended input drive mode, and a mode defined by a single differential currentmode link with a differential input drive. A common I/O circuit may also be provided, and programmed into either thetransmitter or the receiver circuit configuration. MainClaim: A multi-mode Input/Output (I/O) circuit for transmitting and receiving data between integrated circuits (ICs), wherein each IC contains at least one of said I/O circuits, comprising at least one of transmitter circuitry or receiver circuitry,said transmitter circuitry configured to send data to another IC, and said receiver circuitry configured to receive data fromanother IC, said I/O circuit being constructed with CMOS-based transistors that are selectively interconnected together byswitches to operate as two single-ended, current or voltage mode links, and as a single differential current or voltage mode link.

www.patentics.com


2008/0133799 Control and slow data transmission method for serial interface

Nokia Corporation Voutilainen; Martti 710 G06F 20071128 1 92%

Abstract: A scalable low voltage signaling (SLVS) serial interface structure is configured as a 0.4V NMOS totem-pole driver structure for both high speed differential signaling and slow speed single-ended signaling using the same 0.4V NMOS totem-pole driver structure. An un-terminated receiver (Rx) and a CMOS inverter comparator powered from a 0.4 volt supply, is used forreceiving the slow speed single-ended 0-100 mega bits per second (Mbps) signaling in a data link. A terminated receiver (Rx)and a differential comparator powered from a 0.4 volt supply, is used for receiving the high speed differential 2 giga bits persecond (Gbps) signaling in the data link. MainClaim: A module, comprising:a serial interface driver structure configured for both high speed differential signaling and forslow speed single-ended signaling, anda serial interface receiver structure arranged with a selectively connectable resistortermination at its input for receiving both the high speed differential signaling when the resistor termination is selectivelyconnected to said receiver structure input, and for receiving the slow speed single-ended signaling when the resistor termination is selectively disconnected from said receiver structure input.

5,352,968 Battery charge state determination Apple Computer, Inc.

Reni; Daniele | Culbert; Michael F. 320 G01N 19920528 0 100%

Abstract: Method and apparatus for accurately determining the charge state of a battery is disclosed. The charge state isderived from the battery voltage, which is corrected for errors introduced by temperature and series resistance. Error fromseries resistance is minimized by either making an open circuit voltage measurement, or by making a plurality of voltagemeasurements under known load conditions, calculating the series resistance from these measurements, and calculating anequivalent open circuit voltage, compensating for the voltage drop caused by the series resistance of the battery. Errorsintroduced by temperature induced shifts in battery voltage are corrected by reading the battery temperature and correcting thebattery voltage to a reference temperature. The battery voltage corrected for temperature and series resistance effects is usedto compute charge state by table look up or algebraically. MainClaim: The method of determining the charge state of a battery comprising the steps of:

measuring the temperature of the battery;

measuring the open circuit voltage of the battery;

subtracting a reference temperature value from the measured battery temperature to form a temperature shift;

multiplying the temperature shift by a temperature shift constant to form a temperature shift voltage;

adding the temperature shift voltage to the open circuit battery voltage to form the compensated battery voltage; and

computing the charge state of the battery from the compensated battery voltage.

5,460,901 Battery identificationNokia Mobile Phones Limited Syrjala; Markku 429 H01M 19930922 1 95%

Abstract: A battery (1) has identification means for enabling an apparatus e.g. a radio telephone or a battery charger,connected to the battery to determine a plurality of battery parameters e.g. temperature and battery capacity using a singlemeasurement, so that, for example, a battery charger can adopt the correct charging regime for the battery type. Theidentification means is provided by a constant current source (I) and one or more solid state components (D1-D3) having p-n junctions e.g. diodes or transistors coupled in series or in parallel. As the threshold voltage (VD) of p-n junctions vary with

temperature, and the number of components can be made to vary with battery type, by measuring the total voltage drop (Vo)across series connected components or current through parallel connected components which will vary with temperature and thenumber of components, a single signal can provide information on more than one battery parameter. MainClaim: A battery for use in an electrical apparatus, the battery comprising:

a plurality of interconnected cells; and

means, operably connected to the cells and variable in response to a first battery parameter, for providing a commonidentification signal indicative of the first battery parameter and a second independent battery parameter.

7,301,307

Method and apparatus to charge a battery using determination of battery load current

Nokia CorporationHansen; Stig Rafn | Froding; Emil | Jorgensen; Frank

320 H01M 20040625 3 92%

Abstract: By determining charging current Ichar and then subsequently utilising that determination of charging current Ichar in

relation to battery current Ibat and load current Iload as a result of operation of a phone or other electronic device it is possible

periodically to adjust the necessary charging current in order to operate the device in terms of recharging the battery to a targetcharging voltage, as well as providing adequate electrical current for operation of the associated phone or other electronicdevice. MainClaim: A battery charging method for a portable hand held device, the method comprising applying a charging currentacross a battery for charging of the battery to attain a charging voltage and determination of load current by periodicinterruption in application of the charging current whereby the charging current for the battery is adjusted towards a definedtarget value for the charging voltage between determinations of the load current for sustained charging of the battery despitevariation in load current requirements.

2005/0285568 Battery charging method and apparatus therefor Nokia Corporation

Hansen, Stig Rafn | Froding, Emil | Jorgensen, Frank

320 H02J 20040625 2 92%



www.patentics.com



7,671,804 Tunable antennas for handheld devices

Apple Inc. Zhang; Zhijun | Caballero; Ruben

343 H01Q 20060905 0 100%

Abstract: A compact tunable antenna for a handheld electronic device and methods for calibrating and using compact tunableantennas are provided. The antenna can have multiple ports. Each port can have an associated feed and ground. The antennadesign can be implemented with a small footprint while covering a large bandwidth. The antenna can have a radiating elementformed from a conductive structure such as a patch or helix. The antenna can be shaped to accommodate buttons and othercomponents in the handheld device. The antenna may be connected to a printed circuit board in the handheld device usingsprings, pogo pins, and other suitable connecting structures. Radio-frequency switches and passive components such as duplexers and diplexers may be used to couple radio-frequency transceiver circuitry to the different feeds of the antenna. Antenna efficiency can be enhanced by avoiding the use of capacitive loading for antenna tuning. MainClaim: A tunable multipart handheld electronic device patch antenna, comprising: a ground terminal; a substantially planarradiating element located above the ground terminal that is electrically connected to the ground terminal; and at least first andsecond antenna feeds, wherein the first antenna feed is electrically connected to the radiating element at a first location,wherein the second antenna feed is electrically connected to the radiating element at a second location that is different from thefirst location, wherein the first antenna feed and the ground terminal form a first antenna port through which antenna signalsare transmitted and received, and wherein the second antenna feed and the ground terminal form a second antenna portthrough which antenna signals are transmitted and received.

2009/0061796 Antenna arrangement Nokia CorporationArkko; Aimo | Hallivuori; Juha

455 H01Q 20070827 1 94%

Abstract: A multi-part, distributed antenna arrangement including: an antenna element as a first part; and a semiconductorchip as a second part, separated from the first part, wherein the semiconductor chip comprises integrated radio frequencycircuitry and a coupling element for wirelessly coupling the integrated radio frequency circuitry with the antenna element. MainClaim: A multi-part, distributed antenna arrangement comprising:an antenna element as a first part; anda semiconductorchip as a second part, galvanically separated from the first part,wherein the semiconductor chip comprises integrated radiofrequency circuitry and a wireless coupling element for wirelessly coupling the integrated radio frequency circuitry with theantenna element.






Abstract: A speaker assembly is disclosed that includes a conductive support that provides mechanical support for the speakerassembly. The conductive support is configured to function as an antenna. A wireless device is disclosed that includes a speakerassembly including a conductive support that provides mechanical support for the speaker assembly, and includes a transceivercoupled to the conductive support and configured to communicate radio frequency signals using the conductive support. Amethod is disclosed that includes providing a speaker assembly including a conductive support that provides mechanical supportfor the speaker assembly, and providing a transceiver operable to communicate radio frequency signals using the conductivesupport. MainClaim: A speaker assembly comprising a conductive support that provides mechanical support for the speaker assembly,wherein the conductive support is configured to function as an antenna.

5,254,928 Power management system for battery powered computers

Apple Computer, Inc. Young; Steven J. | Wallgren; Markus

320 H02J 19911001 0 100%

Abstract: A power management system for a portable computer is disclosed. The system can determine which one of a pluralityof battery packs has been coupled to the system. After determining the type of battery pack, the system recalls from storagethe recommended charging pattern for the particular battery pack and begins to charge the battery at the recommended rate.The system's information is used during charging to determine if the battery pack is defective. When the computer is running offthe battery pack, the charge counter measures the total amount of charge supplied to the computer and provides thisinformation to the system. When the difference betweem the total amount of charge supplied to the computer and the totalcharge available from the battery reaches a predefined limit, the system indicates to the computer that a low-power situation exists and that the computer should prepare for a possible loss-of-power event. MainClaim: A battery charging circuit with self-adjusting charging voltage levels, the circuit comprising:

first transformer means for converting an A.C. voltage to a D.C. voltage;

www.patentics.com


oscillator means coupled to the first transformer means for converting the D.C. voltage to a square wave of fixed amplitude butvariable duty cycle;

second transformer means coupled to the oscillator means for converting the square wave to a sinusoidal wave, the amplitude ofthe sinusoidal wave varying directly with the duty cycle of the square voltage wave;

rectifier means coupled to the second transformer means and a battery, for converting the sinusoidal wave to a D.C. chargingvoltage; and

voltage comparator means having at least two inputs, a first input being coupled to an output of the rectifier means, a secondinput being coupled to a square wave generator, the output of the comparator means being coupled to the oscillator means, thecomparator means decreasing the duty cycle of the oscillator means when the output of the comparator is high, the decrease inthe duty cycle resulting in less voltage at the output of the second transformer means.

2005/0285568 Battery charging method and apparatus therefor Nokia Corporation

Hansen, Stig Rafn | Froding, Emil | Jorgensen, Frank

320 H02J 20040625 2 94%




7,301,307



320 H01M 20040625 3 94%




7,612,725 Antennas for handheld electronic devices with conductive bezels

Apple Inc.Hill; Robert J. | Schlub; Robert W. | Caballero; Ruben

343 H01Q 20070621 0 100%

Abstract: A handheld electronic device may be provided that contains wireless communications circuitry. The handheldelectronic device may have a housing and a display. The display may be attached to the housing a conductive bezel. Thehandheld electronic device may have one or more antennas for supporting wireless communications. A ground plane in thehandheld electronic device may serve as ground for one or more of the antennas. The ground plane and bezel may define aopening. A rectangular slot antenna or other suitable slot antenna may be formed from or within the opening. One or moreantenna resonating elements may be formed above the slot. An electrical switch that bridges the slot may be used to modify theperimeter of the slot so as to tune the communications bands of the handheld electronic device. MainClaim: A handheld electronic device, comprising: a housing having a planar surface with a periphery; a ground planeelement mounted to the housing that has portions that define a slot; a conductive bezel that surrounds the periphery of theplanar surface of the housing, that surrounds the slot in the ground plane element, and that is electrically connected to theground plane element; and at least one antenna formed from the ground plane element and the slot.




2009/0160712 Apparatus and method Nokia Corporation

Breiter; Richard | Troelsen; Jens | Pinto; Alexandre | Nielsen; Bjarne

343 H01Q 20071221 5 94%

www.patentics.com


Abstract: An apparatus including a first conductive cover portion defining an interior surface and an exterior surface of theapparatus; an antenna element, connected to a feed point and arranged to operate in at least a first resonant frequency band; aconductive element, positioned between the interior surface of the first conductive cover portion and the antenna element, andarranged to couple with the first conductive cover portion, wherein the combination of the conductive element and the firstconductive cover portion are operable in a second resonant frequency band, different to the first resonant frequency band andare arranged to be contactlessly fed by the antenna element. MainClaim: An apparatus comprising:a first conductive cover portion defining an interior surface and an exterior surface of theapparatus;an antenna element, connected to a feed point and arranged to operate in at least a first resonant frequency band;aconductive element, positioned between the interior surface of the first conductive cover portion and the antenna element, andarranged to couple with the first conductive cover portion,wherein the combination of the conductive element and the firstconductive cover portion are operable in a second resonant frequency band, different to the first resonant frequency band andare arranged to be contactlessly fed by the antenna element.




5,418,478 CMOS differential twisted-pair driver Apple Computer, Inc.

Van Brunt; Roger | Oprescu; Florin 326 H03K 19930730 0 100%

Abstract: A CMOS differential twisted-pair driver which utilizes CMOS switches and current sources advantageously. Noalternative power supply is required, the switches do not have to be low impedance and the device is low power. The preferredembodiment driver further limits signal overshoot and common mode energy. The signal transmission facility is bi-directional so an off state is provided. It is doubly terminated to provide for symmetry, improved bandwidth and reduces reflective signalnoise. The double termination also provides for faster rise and fall times which reduces the systems sensitivity to receiver offset. MainClaim: A CMOS twisted-pair signal driver responsive to CMOS level signals for coupled to a twisted-pair communication cable having first and second signal lines and an impedance, said signal driver comprising:

first signal driving circuitry coupled to receive a first CMOS level signal logic state and for propagating a first signal state oversaid twisted-pair cable:

second signal driving circuitry coupled to receive a second CMOS level signal logic state and for propagating a second signalstate over said twisted pair cable;

tri-state control circuitry for generating a third signal state over said twisted-pair cable, said third signal state having approximately a zero amplitude; and

a terminating resistor coupled between sold first and second signal lines, said terminating resistor approximately matching theimpedance of the twisted pair cable;

said first signal driving circuitry comprising:

a first switch coupled to a voltage supply source equivalent to said first CMOS level signal, said first switch responsive to andclosing upon receipt of said first CMOS level logic state by said signal driver;

a first transistor for performing a current source function coupled between said first switch and said first signal line of saidtwisted-pair cable;

a second transistor for performing a current source function coupled to said second signal line of said twisted-pair cable; and

a second switch coupled to ground and to said second transistor, said second switch responsive to and closing upon receipt ofsaid first CMOS level logic state by said signal driver.

7,519,334


Nokia Corporation

Ruha; Antti | Ruotsalainen; Tarmo | Tervaluoto; Jussi-Pekka

455 H04B 20011102 2 92%

Abstract: A multi-mode I/O circuit or cell (10) is provided for transmitting and receiving data between ICs, where each ICcontains at least one of the I/O circuits. Each data link includes transmitter circuitry (12) and receiver circuitry (14). Thetransmitter circuitry sends data to a receiver circuitry in another IC, and the receiver circuitry receives data from a transmittercircuitry in another IC. The I/O circuit is constructed with CMOS-based transistors (e.g., CMOS or BiCMOS) that are selectively interconnected together by a plurality of switches to operate as two single-ended, current or voltage mode links, or as a single differential current or voltage mode link. In the preferred embodiment the transmitter circuitry sends data to the receivercircuitry in another IC over a first pair of adjacently disposed conductors, and the receiver circuitry receives data from thetransmitter circuitry in another IC over a second pair of adjacently disposed conductors. The transmitter circuitry and thereceiver circuitry are selectively configured by the plurality of switches for operating in a double single-ended voltage mode link mode, a double single-ended current mode link mode, a mode defined by a single differential voltage mode link with a single-ended input drive, a mode defined by a single differential voltage mode link with a differential input drive, a mode defined by asingle differential current mode link with a single-ended input drive mode, and a mode defined by a single differential current

www.patentics.com


mode link with a differential input drive. A common I/O circuit may also be provided, and programmed into either thetransmitter or the receiver circuit configuration. MainClaim: A multi-mode Input/Output (I/O) circuit for transmitting and receiving data between integrated circuits (ICs), wherein each IC contains at least one of said I/O circuits, comprising at least one of transmitter circuitry or receiver circuitry,said transmitter circuitry configured to send data to another IC, and said receiver circuitry configured to receive data fromanother IC, said I/O circuit being constructed with CMOS-based transistors that are selectively interconnected together byswitches to operate as two single-ended, current or voltage mode links, and as a single differential current or voltage mode link.

2003/0087671


Nokia Corporation

Ruha, Antti | Ruotsalainen, Tarmo | Tervaluoto, Jussi-Pekka

455 H04M 20011102 1 92%

Abstract: A multi-mode I/O circuit or cell (10) is provided for transmitting and receiving data between ICs, where each ICcontains at least one of the I/O circuits. Each data link includes transmitter circuitry (12) and receiver circuitry (14). Thetransmitter circuitry sends data to a receiver circuitry in another IC, and the receiver circuitry receives data from a transmittercircuitry in another IC. The II/O circuit is constructed with CMOS-based transistors (e.g., CMOS or BiCMOS) that are selectively interconnected together by a plurality of switches to operate as two single-ended, current or voltage mode links, or as a single differential current or voltage mode link. In the preferred embodiment the transmitter circuitry sends data to the receivercircuitry in another IC over a first pair of adjacently disposed conductors, and the receiver circuitry receives data from thetransmitter circuitry in another IC over a second pair of adjacently disposed conductors. The transmitter circuitry and thereceiver circuitry are selectively configured by the plurality of switches for operating in a double single-ended voltage mode link mode, a double single-ended current mode link mode, a mode defined by a single differential voltage mode link with a single-ended input drive, a mode defined by a single differential voltage mode link with a differential input drive, a mode defined by asingle differential current mode link with a single-ended input drive mode, and a mode defined by a single differential currentmode link with a differential input drive. A common I/O circuit may also be provided, and programmed into either thetransmitter or the receiver circuit configuration. MainClaim: A multi-mode Input/Output (I/O) circuit for transmitting and receiving data between integrated circuits (ICs), wherein each IC contains at least one of said I/O circuits, comprising at least one of transmitter circuitry or receiver circuitry,said transmitter circuitry sending data to receiver circuitry in another IC, and said receiver circuitry receiving data fromtransmitter circuitry in another IC, said I/O circuit being constructed with CMOS-based transistors that are selectively interconnected together by switches to operate as two single-ended, current or voltage mode links, or as a single differential current or voltage mode link.

7,595,759 Handheld electronic devices with isolated antennas

Apple Inc.

Schlub; Robert W. | Hill; Robert J. | Zavala; Juan | Caballero; Ruben

343 H01Q 20070104 0 100%

Abstract: Handheld electronic devices are provided that contain wireless communications circuitry having at least first andsecond antennas. An antenna isolation element reduces signal interference between the antennas, so that the antennas may beused in close proximity to each other. A planar ground element may be used as a ground by the first and second antennas. Thefirst antenna may be formed using a hybrid planar-inverted-F and slot arrangement in which a planar resonating element is located above a rectangular slot in the planar ground element. The second antenna may be formed from an L-shaped strip. The planar resonating element of the first antenna may have first and second arms. The first arm may resonate at a commonfrequency with the second antenna and may serve as the isolation element. The second arm may resonate at approximately thesame frequency as the slot portion of the hybrid antenna. MainClaim: Wireless communications circuitry in a handheld electronic device comprising: first and second wireless transceivercircuits that transmit and receive radio-frequency signals; first and second transmission lines associated respectively with thefirst and second wireless transceiver circuits for conveying the radio frequency signals; first and second antennas, wherein thefirst antenna is connected to the first transmission line and wherein the second antenna is connected to the second transmissionline; and an isolation element associated with the first antenna that resonates in a frequency band in which the second antennaoperates and reduces interference between the first antenna and the second antenna during simultaneous antenna operation,wherein the first antenna comprises a hybrid planar-inverted-F and slot antenna and wherein the isolation element is formed aspart of a planar-inverted-F resonating element in the hybrid planar-inverted-F and slot antenna.






Abstract: An apparatus and method of providing an apparatus, the apparatus including a conductive cover portion defining atleast a portion of an external surface of the apparatus; a feed element configured to capacitively couple radio circuitry to theconductive cover portion at a feed point; a ground plane galvanically connected to the conductive cover portion at a groundpoint; wherein the feed point and the ground point are separated along a length of the conductive cover portion and configurethe conductive cover portion to resonate at a first resonant frequency so as to be operable as an antenna in a first frequencyband and wherein the first resonant frequency of the conductive cover portion is controlled by the separation between the feedpoint and the ground point. MainClaim: An apparatus comprising;a conductive cover portion defining at least a portion of an external surface of theapparatus;a feed element configured to capacitively couple radio circuitry to the conductive cover portion at a feed point;aground plane galvanically connected to the conductive cover portion at a ground point;wherein the feed point and the groundpoint are separated along a length of the conductive cover portion and configure the conductive cover portion to resonate at a

www.patentics.com


first resonant frequency so as to be operable as an antenna in a first frequency band and wherein the first resonant frequency ofthe conductive cover portion is controlled by the separation between the feed point and the ground point.



343 H01Q 20071221 5 93%


5,666,006

Circuit offering sequential discharge and simultaneous charge for a multiple battery system and method for charging multiple batteries

Apple Computer, Inc. Townsley; David B. | Blanc; James J.

307 H02J 19940512 0 100%

Abstract: A circuit enabling simultaneous independent charging, sequential charging and sequential discharging of multiplebatteries within a computer system and a method for charging the batteries independent of their technology or chemistry. Eachbattery of the multiple batteries in incorporated within a battery pack. The battery pack includes at least the battery, but mayalso include a module for supplying information regarding the battery to a system micro-controller unit to assist the system micro-controller unit in charging of the battery. For such battery packs, the method for charging each battery, regardless of itstechnology or chemistry and without hardware modification or software downloading of information, includes a monitoringphase, a charging phase and an error phase. MainClaim: A circuit for at least supplying power to a plurality of components through a main power line within a computersystem, said circuit comprising:

a first battery selectively chosen to sequentially discharge its power to said plurality of components through a first battery poweroutput line, and alternatively, to receive power to charge said first battery from a first battery power input line;

a second battery selectively chosen to sequentially discharge power to said plurality of components through a second batterypower output line, and alternatively, to receive power to charge said second battery from a second battery power input line;

a first switch; and

a first power line selectively coupled to one of the main power line, said first battery power output line and said second batterypower output line by enabling at least said first switch, said first power output line provides power to said plurality ofcomponents when coupled thereto, charges said first battery when coupled to said first battery power output line, andalternatively charges said second battery when coupled to said second battery power output line.

6,157,172 Charging method and device

Nokia Mobile Phones Limited

Niemitalo; Paavo | Siponen; Sakari

320 H01M 19990611 2 93%

Abstract: A start up charger and a method of providing an initial charge for a significantly depleted battery of a cellular phone isdescribed in which the charging switch is cycled to provide a pulsed charge to the battery until said battery is charged to theoperational voltage threshold of the cellular telephone controller. MainClaim: A battery charging system for a cellular phone, said cellular phone having a controller constructed to operate thebattery charging system when enabled, said controller having a predetermined minimum operating voltage threshold, saidcharging system comprising:

a charger for connection to the cellular phone to provide a charging current to the battery when the battery is depleted;

a charger switch connected to the charger and to the controller to actuate the charger in response to a signal from the controllerwhen the voltage of the battery falls to an undesirable level;

a comparator connected to sense battery voltage and compare said voltage to said voltage threshold and to enable saidcontroller when said battery voltage is equal to or in excess of said voltage threshold; and

a start up charger module comprising a pulse generator connected to the charger switch to cycle said switch on and off whensaid start up charger is enabled, said start up charger connected to said comparator and enabled thereby when said batteryvoltage is depleted below said threshold value.




320 H02J 20000112 2 93%

Abstract: A start up charger and a method of providing an initial charge for a significantly depleted battery of a cellular phone isdescribed in which the charging switch is cycled to provide a pulsed charge to the battery until said battery is charged to theoperational voltage threshold of the cellular telephone controller. MainClaim: A battery charging system for a communication device, said device having a controller constructed to operate thebattery charging system when enabled, said controller having a predetermined minimum operating voltage threshold, said

www.patentics.com


charging system comprising:

a charger for connection to the communication device to provide a charging current to the battery when the battery is depleted;




2009/0267570

Apparatus for providing boot-up capability signals and associated methods

Nokia Corporation Paunonen; Tommi 320 H02J 20080428 1 92%

Abstract: An apparatus for providing a boot-up capability signal for a portable electronic device, the apparatus configured todetermine an amount of charge provided to a battery of the device by a charging process, based around one or more poweringevents, in order to provide for the boot-up capability signal. MainClaim: An apparatus for providing a boot-up capability signal for a portable electronic device, the apparatus configured todetermine an amount of charge provided to a battery of the device by a charging process, based around one or more poweringevents, in order to provide for the boot-up capability signal.

7,551,142

Hybrid antennas with directly fed antenna slots for handheld electronic devices

Apple Inc.

Zhang; Zhijun | Hill; Robert J. | Schlub; Robert W. | Zavala; Juan | Caballero; Ruben

343 H01Q 20071213 0 100%

Abstract: A handheld electronic device is provided that contains wireless communications circuitry. The wirelesscommunications circuitry may include antennas. An antenna in the handheld electronic device may have a ground planeelement. A slot antenna resonating element may be formed from an opening in the ground plane element. A near-field-coupled antenna resonating element may be electromagnetically coupled to the slot antenna resonating element throughelectromagnetic near-field coupling. A transmission line may directly feed the slot antenna resonating element. The transmission line may indirectly feed the near-field-coupled antenna resonating element through the slot antenna resonating element. Theslot antenna resonating element may have one or more associated resonant frequencies and the near-field-coupled antenna resonating element may have one or more associated resonant frequencies. The antenna may be configured to cover one ormore distinct communications bands. MainClaim: A handheld electronic device antenna that is coupled to a transmission line, comprising: a ground plane antennaelement; a slot antenna resonating element formed from an opening in the ground plane antenna element; antenna terminalsadjacent to the slot antenna resonating element with which the transmission line directly feeds the slot antenna resonatingelement; and a near-field-coupled antenna resonating element that is indirectly fed by the transmission line through near fieldcoupling with the directly fed slot antenna resonating element, wherein the near-field-coupled antenna resonating element has multiple branches each of which is associated with a separate antenna resonant frequency.


Nokia Corporation OZDEN; Sinasi | Cviko; Mirsad

343 H01Q 20091113 5 93%




343 H01Q 20071221 5 92%


Nielsen; Bjarne |

www.patentics.com


2009/0160713 Apparatus, methods and computer programs for wireless communication

Nokia CorporationBreiter; Richard | Troelsen; Jens | Pinto; Alexandre

343 H01Q 20080610 1 92%

Abstract: An apparatus including a cover defining an exterior surface of the apparatus and including a first conductive coverportion; an antenna, connected to a feed point and configured to operate in at least a first resonant frequency band; a firstconductive member; a second conductive member; and wherein the first and second conductive members are configured tocouple with the first conductive cover portion, the combination of the first and second conductive members and the firstconductive cover portion are operable in a second resonant frequency band, different to the first resonant frequency band andare configured to be contactlessly fed by the antenna. MainClaim: An apparatus comprising:a cover defining an exterior surface of the apparatus and including a first conductivecover portion;an antenna, connected to a feed point and configured to operate in at least a first resonant frequency band;a firstconductive member;a second conductive member; and wherein the first and second conductive members are configured tocouple with the first conductive cover portion, the combination of the first and second conductive members and the firstconductive cover portion are operable in a second resonant frequency band, different to the first resonant frequency band andare configured to be contactlessly fed by the antenna.

7,705,795 Antennas with periodic shunt inductors

Apple Inc.

Chiang; Bing | Springer; Gregory Allen | Kough; Douglas B. | Ayala; Enrique | McDonald; Matthew Ian

343 H01Q 20071218 0 100%

2008/0129612 Antenna for mobile communication terminals

Nokia Corporation Wang; Hanyang | Williams; Stuart

343 H01Q 20071221 1 96%

Abstract: An antenna comprising: a first substantially planar ground plate; a first substantially planar resonator positioned in aplane substantially parallel to the first ground plate; a second substantially planar ground plate positioned in a planesubstantially parallel to the first ground plate; two or more connectors for electrically connecting the second ground plate toground; and one or more connectors for electrically connecting the first resonator to the second ground plate; wherein the firstresonator and the second ground plate are connected to at least one of receiver means and transmitter means by antennafeeding means. MainClaim: An antenna comprising:a first substantially planar ground plate;a first substantially planar resonator positioned in aplane substantially parallel to the first ground plate;a second substantially planar ground plate positioned in a plane substantiallyparallel to the first ground plate;two or more connectors electrically connecting the second ground plate to the first groundplate; andone or more connectors electrically connecting the first resonator to the second ground plate;wherein:the firstresonator and the second ground plate are connected to at least one of a receiver and a transmitter by an antenna feed;the firstresonator and the second ground plate each have similar dimensions;the first resonator is substantially aligned with the secondground plate; andthe second ground plate is positioned between the first ground plate and the first resonator.

7,439,916 Antenna for mobile communication terminals

Nokia CorporationWang; Hanyang | Williams; Stuart

343 H01Q 20071221 1 96%

Abstract: An antenna comprising: a first substantially planar ground plate; a first substantially planar resonator positioned in aplane substantially parallel to the first ground plate; a second substantially planar ground plate positioned in a planesubstantially parallel to the first ground plate; two or more connectors for electrically connecting the second ground plate toground; and one or more connectors for electrically connecting the first resonator to the second ground plate; wherein the firstresonator and the second ground plate are connected to at least one of receiver means and transmitter means by antennafeeding means. MainClaim: An antenna comprising: a first substantially planar ground plate; a first substantially planar resonator positioned ina plane substantially parallel to the first ground plate; a second substantially planar ground plate positioned in a planesubstantially parallel to the first ground plate; two or more connectors electrically connecting the second ground plate to the firstground plate; and one or more connectors electrically connecting the first resonator to the second ground plate; wherein: thefirst resonator and the second ground plate are connected to at least one of a receiver and a transmitter by an antenna feed;the first resonator and the second ground plate each have similar dimensions; the first resonator is substantially aligned withthe second ground plate; and the second ground plate is positioned between the first ground plate and the first resonator.

7,705,791 Antenna having a plurality of resonant frequencies

Nokia Corporation Ollikainen; Jani 343 H01Q 20080505 1 94%

5,357,214 Methods and apparatus for microphone preamplification

Apple Computer, Inc.Heyl; Lawrence F. | Farrar; Douglas M. 330 H03F 19930603 0 100%

Abstract: Preamplifying circuitry amplifies sound signals for input into a computer system. A first stage common-emitter amplifier provides high-gain amplification of the input signal, while a second stage amplifier comprising an operational amplifieris suitable for driving a cable with the amplified sound signal. A low-cost constant voltage source comprising a diode and an operational amplifier supplies a voltage reference to both amplifier stages with a very high rejection of system noise. Thecircuitry and methods of the present invention provide a low-cost, easily manufactured preamplifier suitable for sound input indesktop computing devices. MainClaim: Apparatus for pre-amplification of an electronic signal from a microphone comprising:

a microphone input for the electronic signal;

a voltage reference source comprising

a first operational amplifier having two inputs and an output,

a diode coupled to a first input of the first operational amplifier, and

www.patentics.com


a first capacitor coupled across an electrical connection from the output and a second input of the first operational amplifier;

a common emitter amplifier coupled to the microphone input and the voltage reference source; and

a line driver amplifier coupled to the common emitter amplifier and the voltage reference source, the line driver amplifier havingan output for a pre-amplified electronic signal.

2007/0297623 Apparatus and method to provide advanced microphone bias

Nokia Corporation Kuiri; Tapio 381 H04R 20060626 1 92%

Abstract: A circuit includes a differential amplifier having a first input for coupling to a first terminal of a microphone and asecond input for coupling to a first terminal of a component having an impedance value that is substantially equal to animpedance value of the microphone, where a second terminal of the microphone and a second terminal of the component arecoupled to circuit ground. The circuit further includes a first resistance having a first node coupled to a source of microphonebias voltage and a second node coupled to the first terminal of the microphone; and a second resistance having a first nodecoupled to the source of microphone bias voltage and a second node coupled to the first terminal of the component. Operationof the differential amplifier results in attenuating or suppressing common mode noise and interference present in themicrophone bias voltage and in the common potential. MainClaim: A circuit, comprising:a differential amplifier having a first input for coupling to a first terminal of a microphone anda second input for coupling to a first terminal of a component having an impedance value that is substantially equal to animpedance value of the microphone, where a second terminal of the microphone and a second terminal of the component arecoupled to circuit ground;a first resistance having a first node coupled to a source of microphone bias voltage and a second nodecoupled to the first terminal of the microphone; anda second resistance having a first node coupled to the source of microphonebias voltage and a second node coupled to the first terminal of the component.

5,504,458 CMOS class AB amplifier for driving capacitive and resistive loads

Apple Computer, Inc.Van Brunt; Roger | Oprescu; Florin 330 H03F 19940930 0 100%

Abstract: The class AB amplifier is configured to provide low quiescent current while achieving high internal switching rates.The buffer is connected to a large external capacitance which provides external compensation. The amplifier includes an inputstage which converts differential voltages to current. An output stage provides an output current and also provides a feedbackcurrent into the input stage. A biasing network provides voltage for biasing various nodes within the amplifier. Cross-coupling is provided within the output stage for achieving a low quiescent current. A pair of current limiting circuits, one for p-channel element and another for n-channel elements, is also provided. MainClaim: An amplifier comprising:

an input stage for converting a differential between a pair of input voltages into a current, said input stage having p-channel and n-channel transistors providing a differential output;

an output stage for providing an output voltage, said output stage having first and second p-channel transistors, and first and second n-channel transistors; wherein

said p-channel transistor of said input stage, said first p-channel transistor of said output stage, said first n-channel transistor of said output stage, and said n-channel transistor of said input stage are connected in series between a high voltage source and a ground;

said second p-channel and n-channel transistors of said output stage are connected in series between said high voltage sourceand said ground; and

said first and second p-channel and n-channel transistors of said output stage are cross-coupled with a drain of said first p-channel transistor of said output stage connected to a gate of said second n-channel transistor of said output stage and with a drain of said first n-channel transistor of said output stage connected to a gate of said second p-channel transistor of said output stage; and wherein

sizes of said transistors are selected to provide a net amplification of an input differential voltage to said output voltage and toprovide a stable quiescent output of about zero volts.

6,111,464

Amplifier having bias circuit self-compensating for VGS process variation and IDS aging

Nokia Networks OyLaureanti; Steven J. 330 H03F 19990723 1 94%

Abstract: An LDMOS RF amplifier having a bias voltage generated through feedback around an LDMOS sense transistor has asense transistor, a current sensing circuit that monitors current in the sense transistor, and a bias voltage generation circuitcontrolled by an output of the current sensing circuit. The bias voltage from the bias voltage generation circuit is applied to thegates of both the sense transistor and an LDMOS RF power amplifier transistor. An AC-coupled RF input signal is applied through typical impedance-matching circuitry to the gate of the RF power amplifier transistor, and an AC-coupled output signal is tapped from, and power applied to, the drain of the RF power amplifier transistor through impedance matching circuitry of the typeknown in the art. MainClaim: An amplifier comprising

a) a first power transistor, having a gate and a drain;

b) a first sense transistor, having a gate and a drain;

c) a first current sensing circuit having an output and coupled to measure a current flow through the drain of the first sensetransistor;

www.patentics.com


d) a first bias circuit for generating a first bias voltage, the first bias voltage being coupled to the gate of the first power transistor and to the gate of the first sense transistor, the first bias circuit having a control input coupled to the output of thefirst current sensing circuit;

e) circuitry for coupling an input signal to the gate of the first power transistor;

f) circuitry for coupling an output signal from the drain of the first power transistor and for coupling power to the first powertransistor; and

g) circuitry for coupling power to the first sense transistor;

h) wherein the first bias circuit is controlled by the output of the first current sensing circuit so as to maintain a constant currentin the first sense transistor, and thereby also maintaining a substantially constant quiescent current in the first power transistor.

6,052,032 Radio frequency amplifiers


Jarvinen; Esko 330 H03F 19990309 1 93%

Abstract: A radio frequency amplifier having a power transistor (Q1) to the base of which is coupled a radio frequency signal tobe amplified. An amplified radio frequency signal is provided at the collector of the power transistor (Q1). A control transistor(Qc) has its base coupled to the base of the power transistor (Q1) while a driver transistor (Q2) provides a control bias signal tothe bases of the control and power transistors. A differential amplifier (Qd1, Qd2) has a first input coupled to an input bias signaland an output coupled to the base of the driver transistor (Q2). The collector of the control transistor (Qc) is coupled to asecond input of the differential amplifier to provide a negative feedback signal to the differential amplifier and the drivertransistor (Q2) and thereby to stabilise the operating point of the power transistor (Q1). MainClaim: A radio frequency amplifier comprising:

a power transistor having an input for receiving a radio frequency signal to be amplified and an output for providing an amplifiedradio frequency signal;

a control transistor having an input coupled to said input of the power transistor;

a driver transistor having an output coupled to said inputs of the power and control transistors for providing a control bias signalto the power and control transistors; and

a differential amplifier having a first input coupled to an input signal and an output coupled to an input of the driver transistorfor providing a driver control signal to the driver transistor,

the control transistor having an output coupled to a second input of the differential amplifier, wherein the output of the controltransistor tends to follow the output of the power transistor and provides a negative feedback signal to the differential amplifier.

6,657,481 Current mirror circuit Nokia CorporationRasmussen; Carsten | Nielsen; Ivan Riis

327 G05F 20020423 1 92%

Abstract: A current mirror circuit has an input portion including a first transistor, which is adapted to establish a referencecurrent. It also has an output portion including a second transistor, and a control portion between the input portion and theoutput portion. The control portion includes a third transistor coupled for controlling the second transistor to generate an outputcurrent which is a function of the reference current while inhibiting current leakage from the input portion to the output portion.A lowpass filter is included in the control portion to prevent noise in the input portion from influencing the second transistor. MainClaim: A current mirror circuit comprising:

an input portion including a first transistor, wherein the first transistor is adapted to establish a reference current;

an output portion including a second transistor;

a control portion between the input portion and the output portion, the control portion including a third transistor coupled forcontrolling the second transistor to generate an output current which is a function of the reference current while inhibitingcurrent leakage from the input portion to the output portion; and

a lowpass filter included in said control portion,

wherein the lowpass filter is an RC filter and comprises, as its resistive part, a fourth transistor which is biased by a feedbackloop into a state of high impedance.

6,400,321

Surface-mountable patch antenna with coaxial cable feed for wireless applications


Fenwick; Stephen C. | Astrin; Art | Birnbaum; Thomas J. | Mariano; Rick | Fangonilo; Frank

343 H01Q 20000717 0 100%

Abstract: The invention includes an antenna assembly. The antenna assembly includes an antenna plate that defines an interiorsurface. The antenna plate includes a boss that extends from the interior surface of the antenna plate and a feed point. Theantenna assembly also includes a ground plate that defines an interior surface. The ground plate includes a probe channel and aboss. Both the probe channel and the boss each extends from the interior surface of the ground plate. The ground plate boss iscoupled to the antenna plate boss. The antenna assembly also includes a probe feed having a ground wire coupled to the probechannel and a conductor wire coupled to the feed point. MainClaim: An antenna assembly comprising:

www.patentics.com


an antenna plate that defines an interior surface, the antenna plate having a boss that extends from the interior surface of theantenna plate and a feed point;

a ground plate that defines an interior surface, the ground plate having a probe channel and a boss wherein each extends fromthe interior surface of the ground plate, and wherein the ground plate boss is coupled to the antenna plate boss; and

a probe feed having a ground wire coupled to the probe channel and a conductor wire coupled to the feed point.

6,437,745

Expansion card for wireless data transmission and antenna structure for the same

Nokia CorporationVaisanen; Ari | Petterson; Juha-Pekka

343 H01Q 20001018 1 92%

Abstract: The present invention relates to an expansion card and an antenna structure for this expansion card for wireless datatransmission, which card (C) comprises a card part (1) to be placed inside an expansion card interface of an electronic device,and which antenna part for receiving and transmitting of signals comprises at least one electroconductive, radiating antennaplane (31) and a ground plane (32) arranged parallel to the same, at a distance, as well as a dielectric (33) between saidplanes. In the invention, for improving the antenna properties, said antenna structure is placed in a housing part (2) which isconnected to the end of the card part (1) and which comprises a cover structure (21) and a bottom structure (22), for extendingsaid antenna structure at least partly outside said interface, wherein the antenna plane (32) is arranged on the side of the coverstructure (21), the ground plane (32) is arranged on the side of the bottom structure (22), and said dielectric is arranged a freeclearance. MainClaim: An expansion card for wireless data transmission, which card (C) comprises:

a card part (1) which is arranged to be placed at least partly inside an expansion card interface of an electronic device,

a housing part (2) which is attached at the end of said card part (1) and is arranged to extend at least partly outside saidinterface, and which comprises a cover structure (21) and a bottom structure (22), and

an antenna structure for receiving and transmitting signals, which structure comprises at least one electroconductive, radiatingantenna plane (31) and a ground plane (32) arranged parallel to the same, at a distance, as well as a dielectric (33) betweensaid planes,


for improving the antenna properties, said antenna structure is placed in the housing part (2), wherein said antenna plane (31)is arranged on the side of the cover structure (21), the ground plane (32) is arranged on the side of the bottom structure (22),and as said dielectric is arranged a free clearance.

5,998,972

Method and apparatus for rapidly charging a battery of a portable computing device

Apple Computer, Inc. Gong; Andrew 320 H02J 19980430 0 100%

Abstract: Improved techniques for charging batteries within portable computing devices are disclosed. The improved techniquesoperates to charge a battery at an approximately constant power level by adjusting a charge current as the battery voltagechanges. As a result, the battery is able to be charged at a rate that is significantly faster than previously performed. Also, bymonitoring the amount of power that is available for charging, the improved techniques ensure that the portable computingdevice is not starved for power during its operation. MainClaim: A method for charging a battery within a portable computing device using a charge current, said methodcomprising:

(a) coupling the portable computing device to a power source;

(b) obtaining a maximum charge current and a maximum charge voltage from the battery;

(c) determining an amount of power from the power source that is available for charging the battery;

(d) determining an efficient charge current based on the battery voltage and the amount of power available; and

(e) producing a charge current based on the lesser of the maximum charge current and the efficient charge current, the chargecurrent being used to charge the battery.




320 H02J 20000112 2 94%

Abstract: A start up charger and a method of providing an initial charge for a significantly depleted battery of a cellular phone isdescribed in which the charging switch is cycled to provide a pulsed charge to the battery until said battery is charged to theoperational voltage threshold of the cellular telephone controller. MainClaim: A battery charging system for a communication device, said device having a controller constructed to operate thebattery charging system when enabled, said controller having a predetermined minimum operating voltage threshold, saidcharging system comprising:

a charger for connection to the communication device to provide a charging current to the battery when the battery is depleted;


www.patentics.com







320 H01M 19990611 2 94%

Abstract: A start up charger and a method of providing an initial charge for a significantly depleted battery of a cellular phone isdescribed in which the charging switch is cycled to provide a pulsed charge to the battery until said battery is charged to theoperational voltage threshold of the cellular telephone controller. MainClaim: A battery charging system for a cellular phone, said cellular phone having a controller constructed to operate thebattery charging system when enabled, said controller having a predetermined minimum operating voltage threshold, saidcharging system comprising:

a charger for connection to the cellular phone to provide a charging current to the battery when the battery is depleted;




7,301,307



320 H01M 20040625 3 93%




4,320,498 Auto balancing duplexer for communication lines

Apple Computer, Inc. Justice; Gregory 370 H04B 19800211 0 100%

Abstract: A circuit for generating a control signal for use in a communication line duplexer or other isolation means. Thetransmitted signal at the output of the duplexer is phase detected to detect its real and imaginary components. Thesecomponents are used to modulate the transmitted signal which is then injected into a feedback loop of the duplexer. Thissubstantially cancels the transmitted signal at the output of the duplexer. The circuit permits the communication line to beterminated in a constant impedance. MainClaim: In a communications system employing an isolation means for isolating a transmitted signal from a received signal,a circuit for providing a control signal for said isolation means which reduces the magnitude of said transmitted signal at areceiver, comprising:

phase detection means for detecting the real component and imaginary component of said transmitted signal at the output ofsaid isolation means, said phase detection means coupled to receive said transmitted signal and coupled to said isolation means;and,

modulation means for modulating said transmitted signal with said real and imaginary components from said phase detectionmeans so as to provide said control signal, said modulation means coupled to receive said transmitted signal and coupled to saidphase detection means and said isolation means;

whereby a control signal is provided which substantially cancels said transmitted signal at said output of said isolation means.

2006/0205375

Measurement circuit and method for measuring the level of an RF signal, and a transmitter including a measurement circuit

Nokia Corporation Vaisanen; Risto 455 H04K 20050311 1 93%

Abstract: A measurement circuit for measuring a level of a radio frequency signal comprises a first signal path adapted toconduct a first version of a radio frequency signal and a second signal path adapted to conduct a second version of said radiofrequency signal. The first and second versions have different phases. A combining circuit (301, 302, 405, 406, 407, 501, 502,503, 605, 606, 607, 608, 609, 610, 801, 802) is coupled to receive the first version and the second version of the radiofrequency signal. The combining circuit comprises a phase shifter part (301, 405, 406, 605, 606, 607, 801) adapted to changethe phase of at least one of the first version and the second version of the radio frequency signal to make the phases of the firstversion and the second version equal, and an adder part (302, 407) adapted to produce a sum of the first version and thesecond version the phases of which were made equal, the sum being indicative of the level of the radio frequency signal.

www.patentics.com


MainClaim: A measurement circuit for measuring a level of a radio frequency signal, comprising: a first signal path adapted toconduct a first version of a radio frequency signal, said first version having a first phase, a second signal path adapted toconduct a second version of said radio frequency signal, said second version having a second phase different than said firstphase, and a combining circuit coupled to receive said first version and said second version of said radio frequency signal,wherein said combining circuit comprises a phase shifter part adapted to change the phase of at least one of said first versionand said second version of said radio frequency signal to make the phases of said first version and said second version equal,and an adder part adapted to produce a sum of said first version and said second version the phases of which were made equal,said sum being indicative of said level of said radio frequency signal.

2009/0098840

Apparatus and method for measuring the level of RF signals, and a transmitter including a wide band measurement circuit

Nokia Corporation Vaisanen; Risto 455 H04B 20071011 1 93%

Abstract: On a radio frequency signal path a transmission phase shifter causes a phase shift. From a first end of said phaseshifter comes a first sample, and from a second end of said phase shifter comes a second sample. Another phase shifter changesthe phase of the second sample by the same magnitude as said transmission phase shifter. A measurement circuit combines thephase-shifted second sample with a phase-inverted version of the first sample to produce an output indicative of a power levelof the original signal on the radio frequency signal path. MainClaim: An apparatus, comprising:a radio frequency signal path,as a part of said radio frequency signal path a transmissionphase shifter,a measurement circuit,a first coupling between a first end of said transmission phase shifter and the measurementcircuit,a second coupling between a second end of said transmission phase shifter and the measurement circuit, andas a part ofsaid second coupling a first phase shifter dimensioned to produce a phase shift of same magnitude as said transmission phaseshifter;wherein the measurement circuit is configured to combine a signal coming through said second coupling with a phase-inverted version of a signal coming through said first coupling to produce a first output signal indicative of a power level of a firstradio frequency signal on said radio frequency signal path.

5,231,364 Phaseshift network for an IQ modulator


Mucke; Lars H. 332 H04L 19920624 1 93%

Abstract: A phaseshift network (2) exhibits approximately equal impedances to the outputs of an IQ mixer (10), over a rangeof modulation frequencies (Fm). The phaseshift network furthermore exhibits an approximately equal time delay for the I and Qmodulated signals propagating therethrough. The phaseshift network includes a first branch having an input node for receiving afirst frequency signal that varies within a range of frequencies about a frequency Fo. The first branch includes a phaseshifter forproviding a frequency signal representative of the first input signal that is retarded by a first predetermined number of degrees.The phaseshift network further includes a second branch having an input node for receiving a second frequency signal thatvaries within a range of frequencies about the frequency Fo. The second branch includes a phaseshifter for providing a frequencysignal representative of the second input signal that is advanced by a second predetermined number of degrees. A summersums together the retarded and advanced frequency signals for providing, at an output node, an output signal that is asummation of the retarded and the advanced frequency signals. MainClaim: A phaseshift network, comprising:

a first branch having an input node for receiving a first frequency signal that varies within a range of frequencies about afrequency Fo and including means for providing, at an output node of said first branch, a frequency signal representative of thefirst input signal that is retarded by a first predetermined number of degrees;

a second branch having an input node for receiving a second frequency signal that varies within a range of frequencies about thefrequency Fo and including means for providing, at an output node of said second branch, a frequency signal representative ofthe second input signal that is advanced by a second predetermined number of degrees; and

summing means, having a first input node coupled to said output node of said first branch and a second input node coupled tosaid output node of said second branch, for summing together the retarded and advanced frequency signals and for providing atan output node an output signal that is a summation of the retarded and the advanced frequency signals; wherein

said second branch includes first circuit means for equalizing an insertion loss of said second branch to an insertion loss of saidfirst branch, and wherein

said first branch includes second circuit means for equalizing an input impedance of said first branch, at Fo, to an inputimpedance of said second branch, at Fo.

6,054,955

Folded monopole antenna for use with portable communications devices


Schlegel, Jr.; Herbert | Blaney; Timothy J. | Difronzo; Charles M.

343 H01Q 19930823 0 100%

Abstract: An antenna arrangement of sufficiently small size to be accommodated in the housing of a portable communicationsdevice includes a pair of spaced folded monopole antennas. Each antenna includes a first printed circuit board having aconducting surface that forms a ground plane. Mounted on the first circuit board is a second printed circuit board having a right-angled strip of conducting material, which forms a folded monopole radiating element. The folding of the monopole reduces itsheight, to thereby enable it to fit into small casings and the like. To compensate for the effects of the folded monopole on theelectrical match, frequency bandwidth and electromagnetic fields, a shunt inductance is introduced between the monopole andthe ground plane. The antennas are mounted within cavities that can be lined or coated with metallic material, to improve theradiation patterns of the antennas and isolate them from the electronic components of the communications system. MainClaim: An antenna arrangement comprising at least two antennas spaced from one another by a distance related to afrequency band over which communications are to take place, each of said antennas including:

a metallic base plate which is disposed on a first printed circuit board and forms a ground plane;

a folded radiating element formed on a second printed circuit board and having a first linear portion which extends in a direction

www.patentics.com


generally perpendicular to said base plate and a second linear portion connected to said first portion and extending in a directiongenerally parallel to said base plate;

a shunt inductance connected between said radiating element and said base plate; and

a cable having a first conductor connected to said first portion of said radiating element and a second conductor connected tosaid base plate.

5,627,550

Wideband double C-patch antenna including gap-coupled parasitic elements

Nokia Mobile Phones Ltd. Sanad; Mohamed 343 H01Q 19950615 1 94%

Abstract: A wide bandwidth, shorted, dual C-patch antenna includes a truncated ground plane, a layer of dielectric materialhaving a first surface overlying the ground plane and an opposing second surface, and an electrically conductive layer overlyingthe second opposing surface of the dielectric layer. The electrically conductive layer is differentiated into a plurality of antennaelements including a driven antenna element and at least one non-driven, parasitic antenna element. Each of the antenna elements is in the shape of a parallelogram and has one of a rectangular and a non-rectangular (e.g., parabolic, triangular, pentagonal) aperture having a length that extends along a first edge of the electrically conductive layer and a width that extendstowards an oppositely disposed second edge. The length has a value that is equal to approximately 20% to approximately 35%of a length of the first edge. The antenna may further include electrically conductive vias or feedthroughs for shorting theelectrically conductive layer to the ground plane at a region adjacent to a third edge of the electrically conductive layer. Thewide bandwidth antenna may be curved about one or more axes. MainClaim: An antenna structure, comprising:

a ground plane;

a layer of dielectric material having a first surface overlying said ground plane and an opposing second surface;

an electrically conductive layer overlying said second opposing surface of said dielectric layer, said electrically conductive layerbeing differentiated into a plurality of antenna elements including a driven antenna element and at least one non-driven, parasitic antenna element, individual ones of said parasitic antenna elements being disposed on opposite sides of said drivenantenna element, each of said antenna elements having a shape of a parallelogram and having a first radiating aperture havinga length that extends along a first edge of said electrically conductive layer and a width that extends towards an oppositelydisposed second edge, said electrically conductive layer further having a second radiating aperture having a length that extendsalong said first edge of said electrically conductive layer and a width that extends towards said oppositely disposed second edge,said first and second radiating apertures having a zero potential plane disposed therebetween; and

means for coupling at least one of radio frequency energy into and out of said electrically conductive layer of said drivenantenna element, said coupling means being located within said zero potential plane and further being located nearer to one ofsaid radiating apertures than the other.

6,348,894 Radio frequency antenna Nokia Mobile Phones Ltd.

Lahti; Saku 343 H01Q 20000510 1 94%

Abstract: An RF antenna having a non-planar resonating region for radiating or receiving electromagnetic waves in order toconvey communication signals between two electronic devices via a radio link. The resonating region is folded into at least twosections so that the radiating surface of one section is located on a different plane from the radiating surface of the othersection. In order to optimize the input impedance of the antenna, an impedance matching part connected to the resonatingregion is used to provide a short circuit to the resonating region. A signal conduit part is used to feed signals to the resonatingregion in the proximity of the impedance matching part. Preferably, the antenna is integrated into a system connector of ahand-held communication device so as to allow the hand-held device to communicate with a communication network via a radiolink. MainClaim: An antenna operating in the radio frequency range to be used in a hand-held communication device having a system connector, said radio frequency antenna comprising:

a resonating region to radiate or receive electromagnetic waves carrying the communication signals; and

a feeding region coupled to the resonating region for impedance matching, wherein

the radio frequency antenna is integrated into the system connector so as to allow the hand-held communication device to communicate with a communication network via a radio link.

5,680,144

Wideband, stacked double C-patch antenna having gap-coupled parasitic elements

Nokia Mobile Phones Limited Sanad; Mohamed 343 H01Q 19960313 1 94%

Abstract: A stacked, shorted double C-patch antenna (100) has gap-coupled parasitic elements (102a, 106a, 102b, 106b) and one directly fed antenna element (104a). A second fed element (104b) is conductively fed from the directly fed element. Theantenna has a truncated ground plane (108) and a bandwidth that is equal to or greater than approximately 70 MHz at afrequency of approximately 850 MHz. The directly fed antenna element is conductively coupled to a transmitter and to a receiverof a communications device, such as a cellular telephone. MainClaim: A stacked, shorted double C-patch antenna comprising a first antenna element assembly comprised of at least onegap-coupled parasitic element and one directly fed antenna element, said stacked, shorted double C-patch antenna further comprising a second antenna element assembly comprised of at least one gap-coupled parasitic element and one antenna element that is conductively fed from said directly fed antenna element, said first antenna element assembly being disposed in aspaced-apart fashion from said second antenna element assembly by an intervening layer of dielectric material, said antennahaving a truncated ground plane and a bandwidth that is equal to or greater than approximately 70 MHz at a frequency ofapproximately 850 MHz.

www.patentics.com


5,613,010

Apparatus for reproducing sound with a reduced dynamic range

Apple Computer, Inc. Heyl; Lawrence F. | Austin; Steven E.

381 H04R 19940330 0 100%

Abstract: An open-loop speaker amplifier and a dynamic range reduction circuit are disclosed. The speaker amplifier includes abridge driver and a bridge circuit. The bridge circuit includes a first set of switches and a second set of switches. When the firstset of switches are activated, a positive current flows through a speaker load. When the second set of switches are activated, anegative current flows through the speaker load. The bridge driver generates a pulse width modulated signal and a delayedpulse width modulated signal to drive the first and second set of switches of the bridge circuit responsive to a modulation signal.The modulation signal maybe for example, a plurality of pulse code modulated samples representing sound. The dynamic rangereduction circuit modifies a selected signal to reduce the dynamic range of the sound reproduced based on the modulationsignal. The selected signal is either the modulation signal or a reference signal. In one embodiment, the dynamic rangereduction circuit modifies the selected signal by processing the selected signal based on a smooth saturating function. In anotherembodiment, the dynamic range reduction circuit modifies the amplitude of the reference signal based on an envelope size ofthe modulation signal. MainClaim: An apparatus for reproducing sound with a reduced dynamic range, said sound being encoded in a modulationsignal, the apparatus comprising:

a mapping function unit configured to receive a first signal and to generate a modified first signal based on said first signal, saidfirst signal being either said modulation signal or a reference signal;

said mapping function unit generating an increased amplitude signal as said modified first signal when said first signal has anamplitude below a first predetermined level, said increased amplitude signal being said first signal with an increased amplitude;

said mapping function unit generating a decreased amplitude signal as said modified first signal when said first signal has anamplitude above a second predetermined level, said decreased amplitude signal being said first signal with a decreasedamplitude;

a comparator coupled to said mapping function unit, said comparator receiving said modified first signal and a second signal andgenerating a pulse width modulation signal based on said modified first signal and said second signal, said second signal beingsaid reference signal if said first signal is said modulation signal, said second signal being said modulation signal if said firstsignal is said reference signal;

a switch circuit operatively coupled to said comparator and to a speaker load, said pulse width modulation signal driving saidswitch circuit to produce a current flow through said speaker load responsive to said pulse width modulation signal.

6,466,087

Method and apparatus providing digital error correction for a class D power stage

Nokia Mobile Phones, Ltd. Ruha; Antti 330 H03F 20001228 1 92%

Abstract: Disclosed is a method and class D amplifier circuitry for compensating a pulse width modulated (PWM) signal. Themethod includes steps of generating a PWM signal for application to a driver stage; obtaining a filtered difference between thePWM signal and a version of the same PWM signal after the driver stage; generating a correction signal that is indicative of asign of the filtered difference; and using the correction signal for adjusting at least one of the leading edge or the trailing edgeof the PWM signal so as to compensate the version of the same PWM signal after the driver stage. The steps of obtaining andgenerating include steps of RC filtering, digital comparison and digital filtering. In the preferred embodiment the step ofgenerating generates a one-bit correction signal. The correction signal is used to compensate the version of the same PWMsignal after the driver stage for driver stage non-linearities and for power supply noise and variations. The PWM signal is preferably in a thermometer format, although other formats can be used, and the step of adjusting includes initial steps ofcombining two successive samples into one longer sample, and interpolating the longer sample by a factor in a range of abouttwo to eight. In the presently preferred embodiment the step of generating generates the PWM signal from a multi-bit signal output from a sigma-delta modulator, where the multi-bit signal has 2n quantization levels, where n is in a range of about two to about eight. MainClaim: A signal path, comprising:

a sigma-delta modulator (SDM) for receiving an N-bit digital signal;

a pulse width modulator (PWM) coupled to an output of said SDM for receiving an n-bit digital signal output therefrom, said PWM having an output for outputting a pulse width modulated waveform signal in accordance with said n-bit digital signal;

a PWM waveform signal correction circuit coupled to an output of said PWM and outputting a corrected pulse width modulatedwaveform signal;

a class D switching stage coupled to an output of said PWM waveform correction circuit for being driven by said corrected pulsewidth modulated waveform signal and providing a signal path output for driving a load; and

an error measurement block having a first input coupled to said output of said switching stage, a second input coupled to saidoutput of said PWM, and an output coupled to a correction input of said PWM waveform signal correction circuit; said errormeasurement block obtaining a difference between a first signal appearing at said first input and a second signal appearing atsaid second input and outputting at said output a digital correction signal that indicates a sign of the difference between saidfirst input signal and second input signal.

7,641,477 Electromagnetic connector for electronic device

Apple Inc.

DiFonzo; John C. | Andre; Bartley K. | Lim; Kanye | Rohrbach; Matthew Dean | Doutt; Mark

439 H01R 20080311 0 100%

www.patentics.com


Edward | Gery; Jean-Marc

Abstract: An electrical plug and receptacle relying on magnetic force from an electromagnet to maintain contact are disclosed.The plug and receptacle can be used as part of a power adapter for connecting an electronic device, such as a laptop computer,to a power supply. The plug includes electrical contacts, which are preferably biased toward corresponding contacts on thereceptacle. The plug and receptacle each have a magnetic element. The magnetic element on one of the plug or receptacle canbe a magnet or ferromagnetic material. The magnetic element on the other of the plug or receptacle is an electromagnet. Whenthe plug and receptacle are brought into proximity, the magnetic attraction between the electromagnet magnet and itscomplement, whether another magnet or a ferromagnetic material, maintains the contacts in an electrically conductiverelationship. MainClaim: A connector comprising: a first contact; an electromagnet positioned on the connector, wherein the electromagnetis energizable to produce magnetic attraction; and control circuitry coupled to the electromagnet, the control circuitry detectinga first control signal and controlling energization of the electromagnet based on the first control signal, wherein the first controlsignal indicates a charged condition of a battery associated with an electronic device, and wherein the control circuitry causesthe electromagnet to be de-energized in response to receiving the first control signal.

7,637,746 Magnetic connector for mobile electronic devices Nokia Corporation

Lindberg; Phillip | Shirgaonkar; Sameer | Bjorninen; Kati

439 H01R 20081222 4 92%

Abstract: A magnetic connector for connecting various cables to a mobile electronic device includes a connector part in themobile electronic device and a connector part attached to the cable. One of the connector parts includes a permanent magnetand the other connector part includes magnetic material or another magnet. The attractive magnetic force between thepermanent magnet or the other magnet and the magnetic material keeps the connector parts into engagement. The magnetsmay themselves form the electrical contacts. The connector parts can also include magnetically operated switches. MainClaim: A device comprising a first connector part configured to interact with a second connector part disposed at the endof a cable to be connected to the device, wherein said first connector part includes a magnet that is magnetically attracted tomagnetic material disposed on the second connector part and/or wherein magnetic material is disposed on said first connectorpart which is configured to magnetically attract a magnet disposed on the second connector part such that the magnetic forcegenerated between the magnet and the magnetic material or between the two magnets is utilized for bringing the first connectorpart and the second connector part into engagement with each other thereby establishing an electrical connection between thecable and the device, and wherein the electrical connection is established by the magnet touching on the magnetic material.

2009/0111287 Magnetic connector for mobile electronic devices

Nokia Corporation


439 H01R 20081222 4 92%

Abstract: A magnetic connector for connecting various cables to a mobile electronic device includes a connector part in themobile electronic device and a connector part attached to the cable. One of the connector parts includes a permanent magnetand the other connector part includes magnetic material or another magnet. The attractive magnetic force between thepermanent magnet or the other magnet and the magnetic material keeps the connector parts into engagement. The magnetsmay themselves form the electrical contacts. The connector parts can also include magnetically operated switches. MainClaim: (canceled)

7,351,066 Electromagnetic connector for electronic device


DiFonzo; John C. | Andre; Bartley K. | Lim; Kanye | Rohrbach; Matthew Dean | Doutt; Mark Edward | Gery; Jean-Marc

439 H01R 20050926 0 100%

Abstract: An electrical plug and receptacle relying on magnetic force from an electromagnet to maintain contact are disclosed.The plug and receptacle can be used as part of a power adapter for connecting an electronic device, such as a laptop computer,to a power supply. The plug includes electrical contacts, which are preferably biased toward corresponding contacts on thereceptacle. The plug and receptacle each have a magnetic element. The magnetic element on one of the plug or receptacle canbe a magnet or ferromagnetic material. The magnetic element on the other of the plug or receptacle is an electromagnet. Whenthe plug and receptacle are brought into proximity, the magnetic attraction between the electromagnet magnet and itscomplement, whether another magnet or a ferromagnetic material, maintains the contacts in an electrically conductiverelationship. MainClaim: An apparatus for electrically connecting an electronic device to an electrical relation, comprising: a first connectorhaving at least one first contact electrically connected to the electronic device; and a second connector positionable adjacent thefirst connector and having at least one second contact electrically connected to the electrical relation, wherein one of theconnectors comprises a magnetic element positioned on the connector and the other connector comprises an electromagnetpositioned on the connector, wherein the electromagnet is energizable to produce magnetic attraction with the magneticelement and substantially maintain the first and second contacts of the connectors in an electrically conductive relationship,wherein the apparatus further comprises control circuitry coupled to the electromagnet, the control circuitry detecting a controlsignal and controlling energization of the electromagnet based on the signal, wherein the control signal indicates a chargedcondition of a battery associated with the electronic device, and wherein the control circuitry causes the electromagnet to be de-energized in response to receiving the control signal.

7,637,746 Magnetic connector for mobile electronic devices

Nokia Corporation


439 H01R 20081222 4 92%

Abstract: A magnetic connector for connecting various cables to a mobile electronic device includes a connector part in themobile electronic device and a connector part attached to the cable. One of the connector parts includes a permanent magnetand the other connector part includes magnetic material or another magnet. The attractive magnetic force between thepermanent magnet or the other magnet and the magnetic material keeps the connector parts into engagement. The magnetsmay themselves form the electrical contacts. The connector parts can also include magnetically operated switches. MainClaim: A device comprising a first connector part configured to interact with a second connector part disposed at the endof a cable to be connected to the device, wherein said first connector part includes a magnet that is magnetically attracted tomagnetic material disposed on the second connector part and/or wherein magnetic material is disposed on said first connector

www.patentics.com


part which is configured to magnetically attract a magnet disposed on the second connector part such that the magnetic forcegenerated between the magnet and the magnetic material or between the two magnets is utilized for bringing the first connectorpart and the second connector part into engagement with each other thereby establishing an electrical connection between thecable and the device, and wherein the electrical connection is established by the magnet touching on the magnetic material.


Nokia Corporation


439 H01R 20060608 2 92%

Abstract: A magnetic connector for connecting various cables to a mobile electronic device includes a connector part in themobile electronic device and a connector part attached to the cable. One of the connector parts includes a permanent magnetand the other connector part includes magnetic material or another magnet. The attractive magnetic force between thepermanent magnet or the other magnet and the magnetic material keeps the connector parts into engagement. The magnetsmay themselves form the electrical contacts. The connector parts can also include magnetically operated switches. MainClaim: A connector for electrically and mechanically connecting a cable to a mobile electronic device comprising a firstconnector part disposed at the end of the cable and a second connector part disposed at the mobile electric device, wherein atleast one of said first and said second connector parts includes a magnet that is magnetically attracted to magnetic materialdisposed on the other of the at least one of said first and said second connector parts such that the magnetic force generatedbetween the magnet and the magnetic material or between the two magnets is utilized for bringing the first connector part andthe second connector part into engagement with each other thereby establishing an electrical connection between the cable andthe mobile electrical device, and wherein the electrical connection is established by the magnet touching on the magneticmaterial.

2009/0111287 Magnetic connector for mobile electronic devices Nokia Corporation


439 H01R 20081222 4 92%


6,496,149

Recessed aperture-coupled patch antenna with multiple dielectrics for wireless applications


Birnbaum; Thomas J. | Fenwick; Stephen C. | Astrin; Arthur W. | Mariano; Rieeardo

343 H01Q 20010201 0 100%

Abstract: The present invention provides an aperture-fed patch antenna assembly that is recessed into a conductive surface ofan external shell of an electronic device. In one embodiment, an antenna feed attached to a removable core of the electronicdevice may be removed from the external shell without requiring a manual disconnecting of the antenna feed from a wirelessradio modem in the electronic device. The patch antenna assembly includes a shim having an aperture therein and positionedbetween a primary dielectric and a printed circuit board to create a secondary dielectric between the primary dielectric and theprinted circuit board. In one embodiment, the primary dielectric is ceramic and the shim is plastic. MainClaim: An apparatus for wireless communication, comprising:

an electronic device having an external shell, the external shell having at least two opposing sides enclosing a hollow spacetherebetween;

a removable core to which a plurality of electrical components are attached, the removable core operatively and removablypositioned within the hollow space, wherein one of the plurality of the electrical components is a radio modem;

an antenna feed attached to a side of the removable core and coupled to the radio modem;

a primary dielectric fitted within a recessed opening in one of the opposing sides of the external shell, the recessed openingpositioned such that the antenna feed is proximate the primary dielectric when the removable core is operatively and removablypositioned within the hollow space;

a metallized patch attached to the primary dielectric, wherein the patch is an antenna;

a shim positioned between the primary dielectric and the antenna feed, the shim having an aperture therein to form a secondarydielectric between the antenna feed and the primary dielectric when the antenna feed is positioned proximate the primarydielectric, a signal to be transmitted from the antenna feed to the primary dielectric via the secondary dielectric.



343 H01Q 20071221 5 92%

Abstract: An apparatus including a first conductive cover portion defining an interior surface and an exterior surface of theapparatus; an antenna element, connected to a feed point and arranged to operate in at least a first resonant frequency band; aconductive element, positioned between the interior surface of the first conductive cover portion and the antenna element, andarranged to couple with the first conductive cover portion, wherein the combination of the conductive element and the firstconductive cover portion are operable in a second resonant frequency band, different to the first resonant frequency band andare arranged to be contactlessly fed by the antenna element. MainClaim: An apparatus comprising:a first conductive cover portion defining an interior surface and an exterior surface of theapparatus;an antenna element, connected to a feed point and arranged to operate in at least a first resonant frequency band;aconductive element, positioned between the interior surface of the first conductive cover portion and the antenna element, andarranged to couple with the first conductive cover portion,wherein the combination of the conductive element and the first

www.patentics.com


conductive cover portion are operable in a second resonant frequency band, different to the first resonant frequency band andare arranged to be contactlessly fed by the antenna element.

6,867,738

Recessed aperture-coupled patch antenna with multiple dielectrics for wireless applications


Birnbaum; Thomas J. | Fenwick; Stephen C. | Astrin; Arthur W. | Mariano; Ricardo

343 H01Q 20021203 0 100%

Abstract: The present invention provides an aperture-fed patch antenna assembly that is recessed into a conductive surface ofan external shell of an electronic device. In one embodiment, an antenna feed attached to a removable core of the electronicdevice may be removed from the external shell without requiring a manual disconnecting of the antenna feed from a wirelessradio modem in the electronic device. The patch antenna assembly includes a shim having an aperture therein and positionedbetween a primary dielectric and a printed circuit board to create a secondary dielectric between the primary dielectric and theprinted circuit board. In one embodiment, the primary dielectric is ceramic and the shim is plastic. MainClaim: A computer, the computer having an external shell and a patch antenna assembly positioned adjacent to theexternal shell, the patch antenna assembly comprising:

a primary dielectric adjacent to the external shell;

a metallized patch attached to a first side of the primary dielectric, wherein the metallized patch is an antenna;

a shim having a first side and a second opposite side, the first side of the shim positioned proximate a second side of theprimary dielectric, the shim having an aperture therein to form a secondary dielectric; and

an antenna feed removably positioned proximate the second side of the shim and coupled to the primary dielectric via thesecondary dielectric to transmit a signal from the antenna feed to the primary dielectric.



343 H01Q 20071221 5 92%


7,311,526 Magnetic connector for electronic device

Apple Inc.

Rohrbach; Matthew Dean | Doutt; Mark Edward | Andre; Bartley K. | Lim; Kanye | DiFonzo; John C. | Gery; Jean-Marc

439 H01R 20050926 0 100%

Abstract: An electrical plug and receptacle relying on magnetic force to maintain contact are disclosed. The plug and receptaclecan be used as part of a power adapter for connecting an electronic device, such as a laptop computer, to a power supply. Theplug includes electrical contacts, which are preferably biased toward corresponding contacts on the receptacle. The plug andreceptacle each have a magnetic element. The magnetic element on one or both of the plug and receptacle can be a magnet,which is preferably a permanent rare earth magnet although electromagnets may also be used. The magnetic element on theplug or receptacle that does not include a magnet is composed of ferromagnetic material. When the plug and receptacle arebrought into proximity, the magnetic attraction between the magnet and its complement, whether another magnet or aferromagnetic material, maintains the contacts in an electrically conductive relationship. MainClaim: An apparatus for electrically connecting an electronic device to an electrical relation, comprising: a first connectorhaving a first magnetic element and having at least one first contact electrically connected to the electronic device; and asecond connector positionable adjacent the first connector, the second connector having a second magnetic element and havingat least one second contact electrically connected to the electrical relation, wherein the at least one first contact comprises ametallic contact extending from a first face of the first connector and biased relative to the first face, wherein magneticattraction between the first and second magnetic elements substantially maintains the first and second contacts in an electricallyconductive relationship, wherein the first and second connectors each comprise two axes of symmetry such that the first andsecond connectors couple together in only two orientations relative to one another, and wherein the at least one first and secondcontacts of the first and second connectors each comprise a pair of first path contacts on the connector for establishing a firstpath of electrical communication between the device and the relation, wherein the pairs of first path contacts form an electricallyconductive relationship with one another regardless of which of the two orientations the connectors are magnetically coupled.

7,637,746 Magnetic connector for mobile electronic devices Nokia Corporation


439 H01R 20081222 4 93%

Abstract: A magnetic connector for connecting various cables to a mobile electronic device includes a connector part in themobile electronic device and a connector part attached to the cable. One of the connector parts includes a permanent magnetand the other connector part includes magnetic material or another magnet. The attractive magnetic force between thepermanent magnet or the other magnet and the magnetic material keeps the connector parts into engagement. The magnetsmay themselves form the electrical contacts. The connector parts can also include magnetically operated switches.

www.patentics.com


MainClaim: A device comprising a first connector part configured to interact with a second connector part disposed at the endof a cable to be connected to the device, wherein said first connector part includes a magnet that is magnetically attracted tomagnetic material disposed on the second connector part and/or wherein magnetic material is disposed on said first connectorpart which is configured to magnetically attract a magnet disposed on the second connector part such that the magnetic forcegenerated between the magnet and the magnetic material or between the two magnets is utilized for bringing the first connectorpart and the second connector part into engagement with each other thereby establishing an electrical connection between thecable and the device, and wherein the electrical connection is established by the magnet touching on the magnetic material.


Nokia Corporation


439 H01R 20060608 2 93%

Abstract: A magnetic connector for connecting various cables to a mobile electronic device includes a connector part in themobile electronic device and a connector part attached to the cable. One of the connector parts includes a permanent magnetand the other connector part includes magnetic material or another magnet. The attractive magnetic force between thepermanent magnet or the other magnet and the magnetic material keeps the connector parts into engagement. The magnetsmay themselves form the electrical contacts. The connector parts can also include magnetically operated switches. MainClaim: A connector for electrically and mechanically connecting a cable to a mobile electronic device comprising a firstconnector part disposed at the end of the cable and a second connector part disposed at the mobile electric device, wherein atleast one of said first and said second connector parts includes a magnet that is magnetically attracted to magnetic materialdisposed on the other of the at least one of said first and said second connector parts such that the magnetic force generatedbetween the magnet and the magnetic material or between the two magnets is utilized for bringing the first connector part andthe second connector part into engagement with each other thereby establishing an electrical connection between the cable andthe mobile electrical device, and wherein the electrical connection is established by the magnet touching on the magneticmaterial.

2009/0111287 Magnetic connector for mobile electronic devices

Nokia Corporation


439 H01R 20081222 4 93%


7,517,222 Magnetic connector for electronic device APPLE Inc.

Rohrbach; Matthew Dean | Doutt; Mark Edward | Andre; Bartley K. | Lim; Kanye | Difonzo; John C. | Gery; Jean-Marc

439 H01R 20071022 0 100%

Abstract: An electrical plug and receptacle relying on magnetic force to maintain contact are disclosed. The plug and receptaclecan be used as part of a power adapter for connecting an electronic device, such as a laptop computer, to a power supply. Theplug includes electrical contacts, which are preferably biased toward corresponding contacts on the receptacle. The plug andreceptacle each have a magnetic element. The magnetic element on one or both of the plug and receptacle can be a magnet,which is preferably a permanent rare earth magnet although electromagnets may also be used. The magnetic element on theplug or receptacle that does not include a magnet is composed of ferromagnetic material. When the plug and receptacle arebrought into proximity, the magnetic attraction between the magnet and its complement, whether another magnet or aferromagnetic material, maintains the contacts in an electrically conductive relationship. MainClaim: A magnetic connector system comprising: a first connector having a first plurality of electrical contacts and aplurality of magnets; and a second connector having a second plurality of electrical contacts and a magnetic element, thesecond plurality of electrical contacts being adapted to mate with the first plurality of electrical contacts when the first connectorcouples to the second connector, wherein the plurality of magnets of the first connector are proximally located and are arrangedin opposing polarities with respect to each other so that when the first connector is brought in close proximity to the secondconnector, magnetic field lines travel through the magnetic element of the second connector from one of the plurality ofmagnets in the first connector to another one of the plurality of magnets in the first connector, thereby increasing magneticattraction between the first connector and the second connector.


Nokia Corporation


439 H01R 20081222 4 93%

Abstract: A magnetic connector for connecting various cables to a mobile electronic device includes a connector part in themobile electronic device and a connector part attached to the cable. One of the connector parts includes a permanent magnetand the other connector part includes magnetic material or another magnet. The attractive magnetic force between thepermanent magnet or the other magnet and the magnetic material keeps the connector parts into engagement. The magnetsmay themselves form the electrical contacts. The connector parts can also include magnetically operated switches. MainClaim: A device comprising a first connector part configured to interact with a second connector part disposed at the endof a cable to be connected to the device, wherein said first connector part includes a magnet that is magnetically attracted tomagnetic material disposed on the second connector part and/or wherein magnetic material is disposed on said first connectorpart which is configured to magnetically attract a magnet disposed on the second connector part such that the magnetic forcegenerated between the magnet and the magnetic material or between the two magnets is utilized for bringing the first connectorpart and the second connector part into engagement with each other thereby establishing an electrical connection between thecable and the device, and wherein the electrical connection is established by the magnet touching on the magnetic material.

2009/0111287 Magnetic connector for mobile electronic devices Nokia Corporation


439 H01R 20081222 4 93%

www.patentics.com



5,515,514 Peripheral processor card for upgrading a computer

Apple Computer, Inc.Dhuey; Michael J. | Yazdy; Farid A. 710 G06F 19950928 0 100%

Abstract: Circuit arrangements and methods are disclosed for upgrading an 040-based personal computer system using an optional, peripheral add-in card. In one embodiment, the present invention comprises a PowerPC-based microprocessor, such as the MPC601, having one megabyte of on-board direct mapped level 2 external cache memory arranged as tag and data blocks.The PowerPC-based board is inserted into a processor-direct data path sharing the data and address bus with the 040microprocessor. System random access memory (RAM), I/O, and other functional blocks are present on the main boardcomprising the 040-based computer. The MPC601 is coupled via address and data buses to the tag cache, a bus translation unit(BTU), a read only memory (ROM) storing the operating system code for the PowerPC microprocessor, the data cache, a dualfrequency clock buffer, and other interface components such as a processor-direct data path including address and data latches. When the computer is turned on, the BTU coupled to the data bus sequentially clears all valid bits in the tag cache, whereafterthe cache and memory map are enabled. The 040 processor on the main board is disabled after power-up by using the 040 JTAG test port after inactivating the power-on fast reset. By shifting in appropriate RESET, TCK, and TMS patterns, the 040 willbe placed in a nonfunctional, high impedance state. However, DRAM present on the motherboard may be accessed by the 601after a cache miss. DRAM is accessed via a 601-040 transaction translation operation within the BTU, wherein coded tables mapthe MPC601 transaction into the appropriate 040 transaction. MainClaim: A peripheral processor card for upgrading a host personal computer, said host personal computer including a hostaddress bus and a host data bus, and, operatively connected to said host address bus and to said host data bus, a firstprocessor, system memory, and input-output (I/O) units, said peripheral processor card comprising:

a second processor;

a peripheral address bus coupled between said second processor and said host address bus;

a peripheral data bus coupled between said second processor and said host data bus; and

a bus translator unit coupled to said peripheral address bus and to said peripheral data bus and having a plurality ofprogrammable control registers to generate a plurality of control signals to said first processor and to said second processor,said bus translator unit further generating processor shutdown signals which, when received by said first processor, place saidfirst processor in a shutdown state,

said second processor thereafter having control of said system memory and I/O units within said host personal computer.

7,013,398

Data processor architecture employing segregated data, program and control buses

Nokia Corporation Zhao; Sheng 713 G06F 20011115 1 92%

Abstract: A mobile station includes an RF transceiver and a user interface. The mobile station further includes a plurality of dataprocessor cores each having a first interface supporting a first bus coupled to an associated one of a plurality of programmemories, a second interface supporting a second bus coupled to a common data memory, and a third interface supporting athird bus coupled to at least one input/output device. Each of the first, second and third buses include an address bus that issourced from the processor core and a data bus. The plurality of data processor cores may be contained within a singleintegrated circuit package, such as an ASIC, in a System on Chip (SoC) configuration. In this case a first processor core mayfunction as a CPU for controlling the overall operation of the mobile station, including the user interface, while a secondprocessor core functions as a DSP for controlling operation of the RF transceiver. The first interface supports a unidirectionaldata bus from the program memory, and the second interface and the third interface each support a bidirectional data bus. Eachof the plurality of processor cores has the second interface coupled to the common data memory through a common memorycontrol unit, and the third interface is coupled to at least one of a plurality of interface devices through a common control busunit. Each of the processor cores operates with a clock signal and fetches an instruction from the associated one of the pluralityof program memories using the address bus and the data bus of the first interface, the instruction fetch being referenced to apredetermined edge of the clock signal. Each processor core then begins an execution of the fetched instruction on a nextoccurrence of said predetermined edge of said clock signal. The first interface is responsive to an assertion of a HOLD signal forsuspending the fetching of a next instruction from the program memory. The segregation of the program, data and controlbuses provides for increased efficiencies and bus bandwidth, increasing the number of instructions that are executed per unit oftime at a given clock frequency. MainClaim: A data processor comprising at least two processor cores, each said processor core having a first interfacesupporting a first bus coupled to an associated one of at least two program memories, a second interface supporting a secondbus coupled to a common data memory accessible by each of said at least two processor cores, and a third interface supportinga third bus coupled to at least one input/output device accessible by each of said at least two processor cores, each of said first,second and third buses comprise an address bus that is sourced from one of said processor cores and a data bus, where said atleast two processor cores are contained within a single integrated circuit package, and where said integrated circuit package isinstalled within a mobile station, where a first processor core functions as a CPU for controlling the overall operations of saidmobile station, including a user interface, and where a second processor core functions as a DSP for controlling aspects of thewireless operation of said mobile station.

2003/0105906

Data processor architecture employing segregated data, program and control buses

Nokia Corporation Zhao, Sheng 710 G06F 20011115 1 92%

www.patentics.com


Abstract: A mobile station includes an RF transceiver and a user interface. The mobile station further includes a plurality of dataprocessor cores each having a first interface supporting a first bus coupled to an associated one of a plurality of programmemories, a second interface supporting a second bus coupled to a common data memory, and a third interface supporting athird bus coupled to at least one input/output device. Each of the first, second and third buses include an address bus that issourced from the processor core and a data bus. The plurality of data processor cores may be contained within a singleintegrated circuit package, such as an ASIC, in a System on Chip (SoC) configuration. In this case a first processor core mayfunction as a CPU for controlling the overall operation of the mobile station, including the user interface, while a secondprocessor core functions as a DSP for controlling operation of the RF transceiver. The first interface supports a unidirectionaldata bus from the program memory, and the second interface and the third interface each support a bidirectional data bus. Eachof the plurality of processor cores has the second interface coupled to the common data memory through a common memorycontrol unit, and the third interface is coupled to at least one of a plurality of interface devices through a common control busunit. Each of the processor cores operates with a clock signal and fetches an instruction from the associated one of the pluralityof program memories using the address bus and the data bus of the first interface, the instruction fetch being referenced to apredetermined edge of the clock signal. Each processor core then begins an execution of the fetched instruction on a nextoccurrence of said predetermined edge of said clock signal. The first interface is responsive to an assertion of a HOLD signal forsuspending the fetching of a next instruction from the program memory. The segregation of the program, data and controlbuses provides for increased efficiencies and bus bandwidth, increasing the number of instructions that are executed per unit oftime at a given clock frequency. MainClaim: A data processor comprising at least one processor core, said processor core having a first interface supporting afirst bus coupled to a program memory, a second interface supporting a second bus coupled to a data memory, and a thirdinterface supporting a third bus coupled to at least one input/output device, each of said first, second and third buses comprisean address bus that is sourced from the processor core and a data bus.

5,274,763 Data path apparatus for IO adapter

Apple Computer, Inc. Banks; John D. (Jano)

710 G06F 19901228 0 100%

Abstract: A bi-directional data path apparatus coupled between a first bus and a second bus for allowing a plurality of datatransfering devices contained on either one of the buses to transfer data to the devices contained on the other bus. The datapath apparatus includes latching stations designed to receive data from the first and second buses. The data path apparatusincludes a plurality of byte lanes interconnecting the byte latching stations. A control mechanism directs the transfer of dataalong specific byte lanes and in a specific temporal order depending on the databus size of the devices sending and receivingdata. MainClaim: In a bi-directional bus adapter coupled between a system bus and an IO bus, said buses consisting of data, addressand control lines, said system and IO buses containing a plurality of system and IO data transferring devices respectively, saidsystem data transferring devices being 32-bit data transferring devices, said IO data transferring devices being 8-bit, 16-bit or 32-bit data transferring devices, each of which is designed to send and receive data according to its predetermined databus size by generating a bus cycle, a bi-directional data path apparatus coupled between a system bus and an IO bus, said data pathapparatus provided to allow said devices contained on either one of said buses to transfer data to the devices contained on theother of said buses, said data path apparatus comprising:

a first set of four signal transfer stations, each of said first set for receiving one byte of data from said system device to betransferred to said IO device;

a second set of four signal transfer stations, each of said second set for receiving one byte of data from said IO device to betransferred to said system device;

first, second, third and fourth byte lanes routed between said first, second, third and fourth system signal transfer stations andsaid first, second, third and fourth IO signal transfer stations respectively, such that 32-bit system bus devices transfer data with 32-bit IO bus devices on corresponding byte lanes at the same time;

fifth and sixth byte lanes routed between said third and fourth system signal transfer station and said first and second IO signaltransfer stations respectively, wherein data transfers of system bus devices to and from 16-bit IO bus devices utilize only said first, second, third and fourth system signal transfer stations and said first and second IO signal transfer stations, such that datatransfers occur in two-byte transfer sizes to or from said first and second IO signal transfer stations along said first and secondbyte lanes and then along said fifth and sixth byte lanes successively; and

seventh and eighth byte lanes routed from said first IO signal transfer station to said second and fourth system signal transferstations respectively, wherein data transfers of system bus devices to and from 8-bit IO devices utilize only said first, second, third, and fourth system signal transfer stations and said first IO signal transfer station, such that data transfers occur in one-byte transfer sizes to or from said first IO signal transfer station along said first byte lane, said seventh byte lane, said fifth bytelane and said eighth byte lane successively; and

control means for interpreting said bus cycle, such that said control means directs the routing of said data between said systemand IO bus devices along said byte lanes, such that all of the data is transferred between said system and IO bus devicesaccording to the databus sizes of those devices sending or receiving data.

2004/0225779

Programmable CPU/interface buffer structure using dual port RAM


Zhao, Sheng | Aries, Wong | Lin, Ming-Hui

710 G06F 20010330 9 93%

Abstract: Disclosed is a programmable buffer circuit (16) for interfacing a CPU (12) to a plurality of channel interfaces (14). Thebuffer circuit includes a dual port memory (18) having a first port coupled to a CPU data bus and a second port coupled to achannel data bus that serves the plurality of channel interfaces. The buffer circuit further includes an arbitrator (24) forarbitrating access to the dual port memory by individual ones of the channel interfaces over the channel data bus; an addressgenerator (26) for generating dual port memory addresses for reading and writing data using the CPU data bus and the channeldata bus; and a control unit (20) and allocator (22) that are programmable by the CPU for specifying individual ones of bufferlocations and sizes within the dual port memory for individual ones of the channel interfaces, and for enabling and disablingindividual ones of the buffers. The allocator has outputs coupled to the address generator for controlling the generation ofaddresses thereby, depending on which channel interface is currently selected for access to the dual port memory. The controlunit is programmable for operating individual ones of the channel buffers in a block access mode or in a first in/first out (FIFO)

www.patentics.com


access mode of operation. In a preferred embodiment, at least the dual port memory, the CPU and the plurality of interfacechannels are contained within a common integrated circuit package, such as an ASIC. By example, one of the plurality ofinterface channels implements an audio CODEC, another one implements a serial data interface, and another one implements apacket data interface channel. Individual ones of the plurality of interface channels contain a receive interface and a transmitinterface, and the allocator includes a corresponding plurality of registers for specifying at least a starting address and a size foreach of of the receive interface and the transmit interface. The buffer circuit is also programmable for specifying a receive bufferof one channel interface to be a transmit buffer of another channel interface. MainClaim: A programmable buffer circuit for interfacing a CPU to a plurality of channel interfaces, comprising: a single dualport memory having a first port coupled to a CPU data bus and a second port coupled to a channel data bus that serves saidplurality of channel interfaces; an arbitrator for arbitrating access to said dual port memory by individual ones of said channelinterfaces over said channel data bus for selectibely storing data in and reading data from said single port memory; an addressgenerator for generating dual port memory addresses for selectively reading data from and writing data to said single dual portmemory using said CPU data bus and said channel data bus; and an allocator and control unit programmable by said CPU forspecifying individual ones of buffer locations and buffer sizes within said single dual port memory for individual ones of saidchannel interfaces, and for enabling individual ones of said buffers, said allocator having outputs coupled to said addressgenerator for controlling the generation of addresses thereby depending on which channel interface is currently selected foraccess to said single dual port memory.

7,054,986


Nokia CorporationZhao; Sheng | Aries; Wong | Lin; Ming-Hui

710 G06F 20010330 9 93%

Abstract: Disclosed is a programmable buffer circuit (16) for interfacing a CPU (12) to a plurality of channel interfaces (14). Thebuffer circuit includes a dual port memory (18) having a first port coupled to a CPU data bus and a second port coupled to achannel data bus that serves the plurality of channel interfaces. The buffer circuit further includes an arbitrator (24) forarbitrating access to the dual port memory by individual ones of the channel interfaces over the channel data bus; an addressgenerator (26) for generating dual port memory addresses for reading and writing data using the CPU data bus and the channeldata bus; and a control unit (20) and allocator (22) that are programmable by the CPU for specifying individual ones of bufferlocations and sizes within the dual port memory for individual ones of the channel interfaces, and for enabling and disablingindividual ones of the buffers. MainClaim: A programmable buffer circuit for interfacing a CPU to a plurality of channel interfaces, comprising: a single dualport memory having a first port coupled to a CPU data bus and a second port coupled to a channel data bus that serves saidplurality of channel interfaces; an arbitrator for arbitrating access to said dual port memory by individual ones of said channelinterfaces over said channel data bus for selectively storing data in and reading data from said single dual port memory; anaddress generator for generating dual port memory addresses for selectively reading data from and writing data to said singledual port memory using said CPU data bus and said channel data bus; and an allocator and control unit programmable by saidCPU for specifying individual ones of buffer locations and buffer sizes within said single dual port memory for individual ones ofsaid channel interfaces, and for enabling individual ones of said buffers, said allocator having outputs coupled to said addressgenerator for controlling the generation of addresses thereby depending on which channel interface is currently selected foraccess to said single dual port memory, wherein in a first case said control unit operates individual ones of channel buffers in ablock access mode of operation using a set of channel registers and in a second case said control unit operates said individualones of channel buffers in a first in/first out (FIFO) access mode of operation using said same set of channel registers.

5,430,849 Data path apparatus for IO adapter Apple Computer, Inc. Banks; John D. 710 G06F 19930611 0 100%

Abstract: A bi-directional data path apparatus coupled between a first bus and a second bus for allowing a plurality of datatransfering devices contained on either one of the buses to transfer data to the devices contained on the other bus. The datapath apparatus includes latching stations designed to receive data from the first and second buses. The data path apparatusincludes a plurality of byte lanes interconnecting the byte latching stations. A control mechanism directs the transfer of dataalong specific byte lanes and in a specific temporal order depending on the databus size of the devices sending and receivingdata. MainClaim: A bi-directional data path apparatus coupled between first and second buses of the same size, wherein each of said first and second buses include a predetermined number of bus byte lanes, wherein a plurality of first and second datatransferring devices are coupled to said first and second buses respectively, each of which is designed to send and receive dataon said first and second buses, wherein at least one of said second devices is coupled to only a portion of said predeterminednumber of bus byte lanes of said second bus, said data path apparatus provided to allow a first device coupled to one of saidbuses to transfer data to a second device coupled to the other of said buses, said data path apparatus comprising:

a first set of signal transfer stations coupled to said first bus for receiving data from said first device to be transferred to saidsecond device;

a second set of signal transfer stations coupled to said second bus for receiving data from said second device to be transferredto said first device; and

a plurality of interconnecting byte lanes interconnecting said first and second sets of signal transfer stations; and control meanscoupled to said first and second sets of signal transfer stations for routing data on said plurality of interconnecting byte lanes tocomplete data transfers between said first bus and said second bus,

such that data is routed between the same bus byte lanes when transfers are between one of said first devices and one of saidsecond devices coupled to all of said predetermined number of byte lanes, and wherein data is routed onto only said portion ofsaid predetermined number of bus byte lanes when transfers are between one of said first devices and said at least one seconddevice, such that data sent from said at least one second device to said first device is routed onto all of said bus byte lanes ofsaid first bus in successive cycles prior to transfer onto said first bus independently of said first device and said at least onesecond device and such that data received by said at least one second device from said first device is routed onto only saidportion of said predetermined number of bus byte lanes in successive cycles independently of said at least one second deviceand said first device.

2004/0225779 Programmable CPU/interface buffer structure using dual port



710 G06F 20010330 9 92%

www.patentics.com


RAM

Abstract: Disclosed is a programmable buffer circuit (16) for interfacing a CPU (12) to a plurality of channel interfaces (14). Thebuffer circuit includes a dual port memory (18) having a first port coupled to a CPU data bus and a second port coupled to achannel data bus that serves the plurality of channel interfaces. The buffer circuit further includes an arbitrator (24) forarbitrating access to the dual port memory by individual ones of the channel interfaces over the channel data bus; an addressgenerator (26) for generating dual port memory addresses for reading and writing data using the CPU data bus and the channeldata bus; and a control unit (20) and allocator (22) that are programmable by the CPU for specifying individual ones of bufferlocations and sizes within the dual port memory for individual ones of the channel interfaces, and for enabling and disablingindividual ones of the buffers. The allocator has outputs coupled to the address generator for controlling the generation ofaddresses thereby, depending on which channel interface is currently selected for access to the dual port memory. The controlunit is programmable for operating individual ones of the channel buffers in a block access mode or in a first in/first out (FIFO)access mode of operation. In a preferred embodiment, at least the dual port memory, the CPU and the plurality of interfacechannels are contained within a common integrated circuit package, such as an ASIC. By example, one of the plurality ofinterface channels implements an audio CODEC, another one implements a serial data interface, and another one implements apacket data interface channel. Individual ones of the plurality of interface channels contain a receive interface and a transmitinterface, and the allocator includes a corresponding plurality of registers for specifying at least a starting address and a size foreach of of the receive interface and the transmit interface. The buffer circuit is also programmable for specifying a receive bufferof one channel interface to be a transmit buffer of another channel interface. MainClaim: A programmable buffer circuit for interfacing a CPU to a plurality of channel interfaces, comprising: a single dualport memory having a first port coupled to a CPU data bus and a second port coupled to a channel data bus that serves saidplurality of channel interfaces; an arbitrator for arbitrating access to said dual port memory by individual ones of said channelinterfaces over said channel data bus for selectibely storing data in and reading data from said single port memory; an addressgenerator for generating dual port memory addresses for selectively reading data from and writing data to said single dual portmemory using said CPU data bus and said channel data bus; and an allocator and control unit programmable by said CPU forspecifying individual ones of buffer locations and buffer sizes within said single dual port memory for individual ones of saidchannel interfaces, and for enabling individual ones of said buffers, said allocator having outputs coupled to said addressgenerator for controlling the generation of addresses thereby depending on which channel interface is currently selected foraccess to said single dual port memory.

7,054,986



710 G06F 20010330 9 92%


5,191,653

IO adapter for system and IO buses having different protocols and speeds


Banks; John D. (J.) | Karakotsios; Kenneth M. | Scalise; Albert M.

710 G06F 19901228 0 100%

Abstract: A bi-directional bus adapter coupling a system bus, which operates at a first speed using a first protocol, and an IObus, which operates at a second speed using a second protocol, and allowing data transfering devices on either bus to transferdata to or from devices on the other bus. The bus adapter includes a cycle generation mechanism which is responsive to datacycles from one of the buses in order to generate bus cycles needed to complete a data transfer to a device on the other bus.The bus adapter includes a synchronization mechanism for converting the plurality of data cycles generated by the cyclegeneration mechanism from either the first speed to the second speed or vice versa. The bus adapter includes bi-directional data path mechanism for routing data between the system and IO buses according to said protocols, such that the data path directsbytes of data to specific data lines to perform byte steering and dynamic bus sizing on the data from the system bus to the IObus. The bus adapter also includes a bi-directional address transceiver mechanism for routing addresses between said system and said IO buses. MainClaim: A bi-directional bus adapter coupled between first and second buses, said buses consisting of data, address ancontrol lines, said first and second buses containing a plurality of first and second data transferring devices, each generating afirst plurality of data cycles designed to send and receive data according to a predetermined databus size, said first and secondbuses operating at first and second speeds respectively with first and second bus control protocols respectively, said first andsecond speeds and first and second bus control protocols being different, said bus adapter provided to allow said devicescoupled to either of said buses to transfer data to other devices contained on the other of said buses, said bus adaptercomprising:

arbitration means responsive to said plurality of data cycles from said devices, said arbitration means for determining ownershipbased upon priority of both said first and second buses by only one of said devices at any one time, wherein said arbitrationmeans supports said first and second bus control protocols;

www.patentics.com


bus cycle generation means, responsive to said first plurality of data cycles from one of said devices on one of said buses, forgenerating a second plurality of data cycles necessary to complete said data transfer to one of said other devices on the other ofsaid buses, such that the bus control protocols of each of said buses is supported during said data transfer;

synchronization means coupled to said bus cycle generation means for converting said second plurality of data cycles from eithersaid first speed to said second speed or said second speed to said first speed;

bi-directional data path means coupled between said data bus of said first bus and said databus of said second bus andresponsive to said first plurality of data cycles, said data path for performing data path routing between said first and secondbuses according to said bus control protocols; and

bi-directional address transceiver means coupled between said databus of said first bus and said databus of said second bus andresponsive to said first plurality of data cycles, said transceiver means for routing addresses between said first and said secondbuses,

wherein devices on either of said buses transfer data to devices on the other of said buses according to their bus controlprotocols, such that said first and second buses operate as one single bus.

2004/0225779




710 G06F 20010330 9 92%

Abstract: Disclosed is a programmable buffer circuit (16) for interfacing a CPU (12) to a plurality of channel interfaces (14). Thebuffer circuit includes a dual port memory (18) having a first port coupled to a CPU data bus and a second port coupled to achannel data bus that serves the plurality of channel interfaces. The buffer circuit further includes an arbitrator (24) forarbitrating access to the dual port memory by individual ones of the channel interfaces over the channel data bus; an address generator (26) for generating dual port memory addresses for reading and writing data using the CPU data bus and the channeldata bus; and a control unit (20) and allocator (22) that are programmable by the CPU for specifying individual ones of bufferlocations and sizes within the dual port memory for individual ones of the channel interfaces, and for enabling and disablingindividual ones of the buffers. The allocator has outputs coupled to the address generator for controlling the generation ofaddresses thereby, depending on which channel interface is currently selected for access to the dual port memory. The controlunit is programmable for operating individual ones of the channel buffers in a block access mode or in a first in/first out (FIFO)access mode of operation. In a preferred embodiment, at least the dual port memory, the CPU and the plurality of interfacechannels are contained within a common integrated circuit package, such as an ASIC. By example, one of the plurality ofinterface channels implements an audio CODEC, another one implements a serial data interface, and another one implements apacket data interface channel. Individual ones of the plurality of interface channels contain a receive interface and a transmitinterface, and the allocator includes a corresponding plurality of registers for specifying at least a starting address and a size foreach of of the receive interface and the transmit interface. The buffer circuit is also programmable for specifying a receive bufferof one channel interface to be a transmit buffer of another channel interface. MainClaim: A programmable buffer circuit for interfacing a CPU to a plurality of channel interfaces, comprising: a single dualport memory having a first port coupled to a CPU data bus and a second port coupled to a channel data bus that serves saidplurality of channel interfaces; an arbitrator for arbitrating access to said dual port memory by individual ones of said channelinterfaces over said channel data bus for selectibely storing data in and reading data from said single port memory; an addressgenerator for generating dual port memory addresses for selectively reading data from and writing data to said single dual portmemory using said CPU data bus and said channel data bus; and an allocator and control unit programmable by said CPU forspecifying individual ones of buffer locations and buffer sizes within said single dual port memory for individual ones of saidchannel interfaces, and for enabling individual ones of said buffers, said allocator having outputs coupled to said addressgenerator for controlling the generation of addresses thereby depending on which channel interface is currently selected foraccess to said single dual port memory.

7,054,986



710 G06F 20010330 9 92%


5,341,480 Method and apparatus for providing a two conductor serial bus

Apple Computer, Inc.Wasserman; Steven | Roskowski; Steven

710 G06F 19920409 0 100%

Abstract: A method for rapidly transferring serial data in a two conductor busing arrangement in which one conductor is utilizedto transfer data and the other conductor is utilized to transfer clock signals, and in which a plurality of components are

www.patentics.com


connected to the two conductors, at least one of which is capable of acting as a bus master including the steps of providing clocksignals on the clock conductor which are active on both edges, placing a special signal on the data conductor to indicate thestart of an operation, placing address data on the data conductor to indicate an address on the data conductor, placing data onthe data conductor to indicate the type of transfer to be made, acknowledging the receipt of the address by a component beingaddressed, transferring data on the data conductor, placing a special signal on the data conductor to indicate the end of the datatransfer, transferring a signal indicating a parity count, and placing another special signal on the data conductor to indicate theend of the operation. MainClaim: A method for rapidly transferring serial data in a two conductor busing arrangement in which one conductor isutilized to transfer data and the other conductor is utilized to transfer clock signals, and in which a plurality of components areconnected to the two conductors, wherein said components include a first master circuit, a second master circuit, a first slavecircuit, a second slave circuit, and a single clock signal generator, comprising the steps of

providing continuously periodic clock signals, from said clock signal generator, on the clock conductor, wherein each one of theclock signals has an active rising edge and an active falling edge,

placing a first special signal, from at least one of said master circuits, on the data conductor to indicate the start of an operation,

attempting to place a first set of address data, from said first master circuit, on the data conductor, wherein said first set ofaddress data specifies an address of said first slave circuit,

attempting to place a second set of address data, from said second master circuit, on the data conductor, wherein said secondset of address data specifies an address of said second slave circuit,

comparing, in each of said first and second master circuits, said first set of address data with said second set of address data,and granting the first master circuit access to the data conductor if a predetermined relationship between said first set ofaddress data and said second set of address data is satisfied,

placing data, from said first master circuit, on the data conductor to indicate a transfer requiring one of said first master circuitand said first slave circuit to act as a transmitting circuit, and the other one of said first master circuit and said first slave circuitto act as a receiving circuit,

placing an acknowledge signal, from said first slave circuit, on the data conductor after said first slave circuit verifies that saidtransmitted first set of address data matches the address of said first slave circuit,

performing said transfer by said transmitting circuit sending data to said receiving circuit,

placing a second special signal, from said transmitting circuit, on the data conductor to indicate the end of the transfer, and

placing a third special signal, from said first master circuit, on the data conductor to indicate the end of the operation.

2008/0195775 Interface NOKIA CORPORATIONWebb; Neil | Crawford; Ashley | Jager; Mike

710 G06F 20040630 3 93%

Abstract: A method of performing a burst read access at a memory device using a multiplexed data/address bus and a controlsignal including transferring a first portion of address information in a first phase via the multiplexed data/address bus to thememory device; transferring second portion of address information in a second phase via a multiplexed data/address bus to thememory device; transferring a series of data words from the memory via the multiplexed data/address bus; toggling the state ofthe control signal at the memory device as each data word is transferred; and suspending the transfer of the series of datawords from the memory via the multiplexed data/address bus and the toggling of the state of the control signal. MainClaim: A method of transferring address information from a controller device to a target device via a multiplexeddata/address bus comprising:transferring a first portion of address information in a first phase via the multiplexed data/addressbus;transferring a second portion of address information in a second phase via a multiplexed data/address bus,wherein the firstand second portions are distinct portions of the address information and the first and second phases are distinct and successive.

5,805,927

Direct memory access channel architecture and method for reception of network information

Apple Computer, Inc. Bowes; Michael J. | Childers; Brian A.

710 G06F 19970924 0 100%

Abstract: An ethernet receive channel, corresponding to an ethernet controller, is contained within a direct memory access(DMA) controller. The DMA controller is connected to the CPU bus of a computer system through a bus interface and is alsoconnected to an I/O bus, which is coupled to one or more I/O controllers, including an ethernet controller. The ethernet receivechannel contains a buffer and multiple register sets storing the number of packets to be received for a particular DMA transfer,the address where the next byte of the incoming ethernet packet will be written in memory, and control information for thetransfer. The address registers are initially programmed with the starting location for the transfer in main memory, whichcorrespond to segments within chains of contiguous physical memory. During a transfer, the address registers are updated tocontain the location where the next portion of the incoming ethernet packet will be written in memory. MainClaim: A method for transferring packets of data from an input/output (I/O) device to a main memory of a computersystem with a direct memory access (DMA) controller, wherein the computer system includes a first bus and a second buscoupled to the DMA controller, and wherein the DMA controller includes a buffer and at least one register set which includes anaddress register, the method comprising the steps of:

establishing at least one buffer in said main memory, wherein each of said at least one buffer in said main memory comprises atleast one segment, and wherein each of said at least one segment corresponds to one of said packets of data;

determining a first packet of said packets of data;

www.patentics.com


initially setting a number of most significant bits of said address register equal to corresponding most significant bits of anaddress of a first memory location of said corresponding segment in said main memory;

initially setting a next higher least significant bit over a number of least significant bits of said address register to one;

transferring a portion of said first packet from said I/O device to said buffer in said DMA controller via said second bus;

transferring said portion of said first packet from said buffer in said DMA controller to a location of said corresponding segmentin said main memory, via said first bus, wherein said location is indicated by an address stored in said address register, whereinsaid number of least significant bits of said address register are hardwired to zero, and wherein a number of memory locationscorresponding to addresses represented by said number of least significant bits is equal in size to said portion of said firstpacket;

incrementing said address register by an amount equal in size to said portion of said first packet after transferring each saidportion of said first packet from said buffer in said DMA controller to said corresponding segment in said main memory;

repeating said transferring said portion steps and said incrementing said address register step until said first packet iscompletely transferred to said corresponding segment in said main memory;

transferring status data from a status register of said I/O device to said buffer in said DMA controller in response to a finalportion of said first packet being transferred to said corresponding segment;

resetting said number of most significant bits of said address register equal to said corresponding most significant bits of saidaddress of said first memory location of said corresponding segment in said main memory, in response to transferring said finalportion of said first packet;

resetting said next higher least significant bit over said number of least significant bits of said address register to zero, whereinan address of a beginning location of said corresponding segment is indicated by said address stored in said address register;

transferring said status data from said buffer in said DMA controller to said beginning location of said corresponding segment;

incrementing said address register by an amount equal in size to said portion of said first packet after transferring said statusdata from said buffer in said DMA controller to said beginning location of said corresponding segment;

incrementing said address register by an amount equal to a size of one of said at least one segment in response to a finalportion of said status data being transferred to said corresponding segment; and

decrementing a packet count by one in response to said final portion of said status data being transferred to said correspondingsegment.

7,054,986



710 G06F 20010330 9 96%


2004/0225779




710 G06F 20010330 9 96%

Abstract: Disclosed is a programmable buffer circuit (16) for interfacing a CPU (12) to a plurality of channel interfaces (14). Thebuffer circuit includes a dual port memory (18) having a first port coupled to a CPU data bus and a second port coupled to achannel data bus that serves the plurality of channel interfaces. The buffer circuit further includes an arbitrator (24) forarbitrating access to the dual port memory by individual ones of the channel interfaces over the channel data bus; an addressgenerator (26) for generating dual port memory addresses for reading and writing data using the CPU data bus and the channeldata bus; and a control unit (20) and allocator (22) that are programmable by the CPU for specifying individual ones of bufferlocations and sizes within the dual port memory for individual ones of the channel interfaces, and for enabling and disabling

www.patentics.com


individual ones of the buffers. The allocator has outputs coupled to the address generator for controlling the generation ofaddresses thereby, depending on which channel interface is currently selected for access to the dual port memory. The controlunit is programmable for operating individual ones of the channel buffers in a block access mode or in a first in/first out (FIFO)access mode of operation. In a preferred embodiment, at least the dual port memory, the CPU and the plurality of interfacechannels are contained within a common integrated circuit package, such as an ASIC. By example, one of the plurality ofinterface channels implements an audio CODEC, another one implements a serial data interface, and another one implements apacket data interface channel. Individual ones of the plurality of interface channels contain a receive interface and a transmitinterface, and the allocator includes a corresponding plurality of registers for specifying at least a starting address and a size foreach of of the receive interface and the transmit interface. The buffer circuit is also programmable for specifying a receive bufferof one channel interface to be a transmit buffer of another channel interface. MainClaim: A programmable buffer circuit for interfacing a CPU to a plurality of channel interfaces, comprising: a single dualport memory having a first port coupled to a CPU data bus and a second port coupled to a channel data bus that serves saidplurality of channel interfaces; an arbitrator for arbitrating access to said dual port memory by individual ones of said channelinterfaces over said channel data bus for selectibely storing data in and reading data from said single port memory; an addressgenerator for generating dual port memory addresses for selectively reading data from and writing data to said single dual portmemory using said CPU data bus and said channel data bus; and an allocator and control unit programmable by said CPU forspecifying individual ones of buffer locations and buffer sizes within said single dual port memory for individual ones of saidchannel interfaces, and for enabling individual ones of said buffers, said allocator having outputs coupled to said addressgenerator for controlling the generation of addresses thereby depending on which channel interface is currently selected foraccess to said single dual port memory.

5,634,013 Bus bridge address translator

Apple Computer, Inc. Childers; Brian A. | Baden; Eric A.

710 G06F 19950503 0 100%

Abstract: A computer bus bridge interconnects first and second buses, the first bus being big-endian and the second bus being little-endian. First address and size signals received from the first bus during a first bus cycle are converted into second addressand data unit enable signals for transmission on the second bus during a second bus cycle. The first address comprises a low-order address portion and a remaining upper-order address portion. The data unit enable signals are generated from the low-order address portion and the size signals of the first bus. An address offset is generated from the data unit enable signals. Theremaining upper-order address portion of the first address are then concatenated with the address offset and a predeterminedlower address portion for use as the second address. The data unit enable signals may designate, say, up to 4 possible databytes being transferred during a single beat on the second bus. The size signals may designate, say, up to 8 possible contiguousdata units being transferred during a single beat on the first bus. Here, byte enable signals are generated by first generating 8temporary byte enable signals from the low-order address portion and the size signals. Then, 4 of the 8 temporary byte enablesignals are selected for use as the byte enable signals on the second bus. The address offset is generated based on presence orabsence of assertion of 4 lowest order ones of the 8 temporary byte enable signals. MainClaim: In a computer bus bridge for interconnecting first and second buses, the first bus having a first endiancharacteristic and the second bus having a second endian characteristic that is opposite that of the first endian characteristic, anapparatus for converting first address and size signals received from the first bus during a first bus cycle into second addressand data unit enable signals for transmission on the second bus during a second bus cycle, wherein each data unit enable signalis for alternatively designating presence or absence of a meaningful data unit, and wherein the first address comprises a low-order address portion and a remaining upper-order address portion, the apparatus comprising:

means for generating the data unit enable signals from the low-order address portion and the size signals of the first bus; and

means for concatenating the remaining upper-order address portion of the first address with a predetermined lower-order address portion for use as the second address.

7,054,986



710 G06F 20010330 9 93%


2004/0225779




710 G06F 20010330 9 93%

Abstract: Disclosed is a programmable buffer circuit (16) for interfacing a CPU (12) to a plurality of channel interfaces (14). Thebuffer circuit includes a dual port memory (18) having a first port coupled to a CPU data bus and a second port coupled to achannel data bus that serves the plurality of channel interfaces. The buffer circuit further includes an arbitrator (24) forarbitrating access to the dual port memory by individual ones of the channel interfaces over the channel data bus; an addressgenerator (26) for generating dual port memory addresses for reading and writing data using the CPU data bus and the channel

www.patentics.com


data bus; and a control unit (20) and allocator (22) that are programmable by the CPU for specifying individual ones of bufferlocations and sizes within the dual port memory for individual ones of the channel interfaces, and for enabling and disablingindividual ones of the buffers. The allocator has outputs coupled to the address generator for controlling the generation ofaddresses thereby, depending on which channel interface is currently selected for access to the dual port memory. The controlunit is programmable for operating individual ones of the channel buffers in a block access mode or in a first in/first out (FIFO)access mode of operation. In a preferred embodiment, at least the dual port memory, the CPU and the plurality of interfacechannels are contained within a common integrated circuit package, such as an ASIC. By example, one of the plurality ofinterface channels implements an audio CODEC, another one implements a serial data interface, and another one implements apacket data interface channel. Individual ones of the plurality of interface channels contain a receive interface and a transmitinterface, and the allocator includes a corresponding plurality of registers for specifying at least a starting address and a size foreach of of the receive interface and the transmit interface. The buffer circuit is also programmable for specifying a receive bufferof one channel interface to be a transmit buffer of another channel interface. MainClaim: A programmable buffer circuit for interfacing a CPU to a plurality of channel interfaces, comprising: a single dualport memory having a first port coupled to a CPU data bus and a second port coupled to a channel data bus that serves saidplurality of channel interfaces; an arbitrator for arbitrating access to said dual port memory by individual ones of said channelinterfaces over said channel data bus for selectibely storing data in and reading data from said single port memory; an addressgenerator for generating dual port memory addresses for selectively reading data from and writing data to said single dual portmemory using said CPU data bus and said channel data bus; and an allocator and control unit programmable by said CPU forspecifying individual ones of buffer locations and buffer sizes within said single dual port memory for individual ones of saidchannel interfaces, and for enabling individual ones of said buffers, said allocator having outputs coupled to said addressgenerator for controlling the generation of addresses thereby depending on which channel interface is currently selected foraccess to said single dual port memory.

5,793,996

Bridge for interconnecting a computer system bus, an expansion bus and a video frame buffer

Apple Computer, Inc.Childers; Brian A. | Baden; Eric A. 710 H01J 19950503 0 100%

Abstract: In a computer system an apparatus interconnects a first bus, a second bus and a frame buffer, wherein the first busand the second bus are of incompatible bus architecture types. For example the first bus may be a loosely coupled bus havingsplit-bus transaction capability, such as the ARBus, and the second bus may be a tightly ordered bus, such as the PCI local bus. The apparatus includes bridge hardware for converting access requests from the first bus into suitable requests for the secondbus. Data paths within the apparatus allow data to be routed from one bus to another. The apparatus further includes a framebuffer controller that is accessible from either of the first or second buses for performing read or write operations from/to theframe buffer. Data path logic allows data to be routed from any of the first bus, second bus and frame buffer to any other one ofthese three locations. In a preferred embodiment, the data paths are fabricated on a first integrated circuit, and all of controllogic is fabricated on a second integrated circuit. The partitioning of hardware in this manner allows for an efficient interface tobe provided between the two chips. MainClaim: In a computer system, an apparatus for interconnecting a first bus, a second bus and a frame buffer, the apparatuscomprising:

first port means for coupling to the first bus;

second port means for coupling to the second bus;

third port means for coupling to the frame buffer;

data path means for switchably routing data received from any of the first, second and third port means to any other one of thefirst, second and third port means,

first bus slave interface means comprising:

means for receiving, from a first agent connected to the first bus, a first request to access a second agent connected to thesecond bus; and

means for forwarding the received first request to a second bus master interface means;

the second bus master interface means, comprising:

means for converting the first request into a second request that is suitable for transmission on the second bus, and fortransmitting the second request on the second bus; and

means for controlling the data path means to alternatively route data from the first bus to the second bus, or from the secondbus to the first bus in response to the first request alternatively being a write or a read request;

wherein the first bus slave interface means further comprises:

means for receiving, from the first agent connected to the first bus, a third request to access the frame buffer; and

means for forwarding the third request to a frame buffer interface means; and

the frame buffer interface means for controlling the data path means and the frame buffer to alternatively route data from thefirst bus to the frame buffer, or from the frame buffer to the first bus in response to the third request alternatively being a framebuffer write or a frame buffer read request.

Programmable

www.patentics.com


2004/0225779 CPU/interface buffer structure using dual port RAM



710 G06F 20010330 9 95%


7,054,986



710 G06F 20010330 9 95%


5,655,151

DMA controller having a plurality of DMA channels each having multiple register sets storing different information controlling respective data transfer

Apple Computer, Inc.Bowes; Michael J. | Childers; Brian A.

710 G06F 19940128 0 100%

Abstract: A direct memory access (DMA) controller is connected with the CPU bus of a computer system through a businterface and also to an I/O bus, which is connectable to one or more I/O controllers. The DMA controller contains multiplechannels, each corresponding to a particular I/O controller, which are coupled to both the bus interface and the I/O bus. Each ofthe channels contains at least one register set storing information for the transfer and a data buffer holding the data during atransfer between the I/O bus and the CPU bus. MainClaim: A direct memory access (DMA) controller designed to be coupled to a first bus and a second bus, said DMAcontroller comprising:

a plurality of DMA channels;

a different plurality of register sets corresponding to each channel of said plurality of DMA channels, wherein only one registerset of said plurality of register sets corresponding to a particular DMA channel may be active at any one moment, and whereineach register set of the plurality of register sets corresponding to the particular DMA channel stores different informationcontrolling a different DMA transfer via the particular DMA channel; and

a data buffer corresponding to each channel of said plurality of DMA channels.

www.patentics.com


7,054,986



710 G06F 20010330 9 95%


2004/0225779




710 G06F 20010330 9 95%


6,336,166 Memory control device with split read for ROM access

Apple Computer, Inc. Kelly; James D. 711 G06F 19970407 0 100%

Abstract: In a computer memory system, memory access operations are significantly enhanced by employing a data pathbetween the read only memory (ROM) and the system processor that is separate and independent from the data path or pathsbetween the system processor and the random access memory (i.e., RAM or DRAM). The separate ROM data path includes a fullcache line buffer which stores the ROM data until the system data bus is available to transport the ROM data. With a separateROM data path, that includes a full cache line buffer, memory access operations are more efficiently conducted because a RAMaccess (i.e., a read or write operation) and a ROM access (i.e., a read operation) can be executed concurrently. MainClaim: A computer system comprising:

a processing unit;

a memory access control component connected to the processing unit by a system data bus;

a random access memory (RAM) connected to the memory access control component by at least one RAM data path; and

a read only memory (ROM) connected to the memory access control component by a ROM data path, wherein said ROM datapath is separate from said RAM data path and comprises at least one cache line buffer for ROM;

wherein said computer system is configured to allow a ROM memory operation to be conducted simultaneously with a transferbetween the processing unit and the RAM.

www.patentics.com


6,563,739

System and method for transferring data between different types of memory using a common data bus


Aho; Ari | Floman; Matti | Lipponen; Markku

365 G11C 20001221 1 94%

Abstract: A memory controller for controlling the transfer of data to and from a memory array, wherein the memory arrayincludes a first type of memory and a second type of memory, the first type having a different signalling protocol from the second type of memory, wherein the memory controller comprises: an address decoder having an input for receiving a memoryaccess request, said memory access request including the address of the memory array to be accessed, and an output foroutputting the address of the memory array to be accessed; a first sub-controller for generating a plurality of memory interface signals for controlling the first type of memory, said first sub-controller being operated in response to addresses within a first range of addresses output by the address decoder; and a second sub-controller for generating a plurality of memory interface signals for controlling the second type of memory, said second sub-controller being operated in response to addresses within a second, non-overlapping range of addresses output by the address decoder. MainClaim: A system, which controls the transfer of data to and from a plurality of types of memory with each memory typeusing a different signalling protocol, the system comprising:

a controller;

at least one address bus coupling the controller to the plurality of types of memory; and

a single data bus, coupling the controller to a plurality of types of memory, which transmits the data between the controller andthe types of memory; and wherein

the controller controls transmitting of addressing signals on the at least one address bus to at least one of the plurality of typesof memory to selectively transfer the data to and from storage locations in each of the types of memory.

6,598,116 Memory interface using only one address strobe line


Aho; Ari | Lipponen; Markku | Knuutila; Jarno

711 G06F 19991101 3 93%

Abstract: A method for transmitting an address to a memory (3) for the purpose of reading and writing information. Thememory (3) comprises memory cells for storing information as well as an address bus (19a) and a data bus (19b). Part of theaddress is transmitted via said address bus (19a) and part of the address is transmitted via said data bus (19b). MainClaim: A method for transmitting an address to a memory (3) for the purpose of reading and writing information, whichmemory (3) comprises memory cells for storing information and an address bus (19a) and a data bus (19b), characterized inthat part of the address is transmitted via said address bus (19a) and part of the address is transmitted via said data bus (19b),wherein one address strobe line is used to effectuate a transfer of address information from the address bus and the data bus tothe memory, and a row address and a column address are transmitted to memory substantially simultaneously and the rowaddress and the column address are read from the address bus and the data bus into a row selector and a column selectorsubstantially simultaneously.

5,828,856

Dual bus concurrent multi-channel direct memory access controller and method

Apple Computer, Inc.Bowes; Michael J. | Childers; Brian A. 710 G06F 19960321 0 100%

Abstract: A direct memory access (DMA) controller is connected to the CPU bus of a computer system through a bus interfaceand is also connected to an I/O bus, which is coupled to one or more I/O controllers. Multiple channels, each corresponding to aparticular I/O controller, are contained within the DMA controller. The DMA controller controls DMA transfers between the I/Ocontrollers and the main memory of the system and allows multiple transfers to occur concurrently. The DMA controller controlstransfers in part through a first arbiter which arbitrates requests for access to the CPU bus coming from the DMA channels and asecond arbiter which arbitrates requests for access to the I/O bus coming from the DMA channels and the CPU. MainClaim: A computer system comprising:

a first bus;

a second bus;

a memory unit and a central processing unit coupled to said first bus;

a plurality of input/output controllers coupled to said second bus; and

a direct memory access controller, coupled to said first bus and said second bus, the direct memory access controller including,

a plurality of direct memory access channels including a first channel and a second channel, for transferring data between saidfirst bus and said second bus, wherein the first channel controls data transfers from a first input/output controller of the pluralityof input/output controllers and the second channel, concurrently with the first channel controlling data transfers from the firstinput/output controller, controls data transfers from a second input/output controller of the plurality of input/output controllers,wherein the first and second input/output controllers are two different input/output controllers,

a first arbiter coupled to each of said direct memory access channels, said first arbiter selecting one of the first channel or thesecond channel on behalf of which the direct memory access controller can arbitrate for access to said first bus; and

a second arbiter coupled to each of said direct memory access channels, said second arbiter for arbitrating access requests fromsaid plurality of direct memory access channels for said second bus.

Programmable Zhao; Sheng |

www.patentics.com


7,054,986 CPU/interface buffer structure using dual port RAM

Nokia CorporationAries; Wong | Lin; Ming-Hui 710 G06F 20010330 9 95%


2004/0225779




710 G06F 20010330 9 95%


5,860,080

Multicasting system for selecting a group of memory devices for operation

Apple Computer, Inc. James; David V. | Stone; Glen D.

711 G06F 19960319 0 100%

Abstract: A system and method for multicasting control signals to selectively operate one memory device or groups of memorydevices comprises a memory controller coupled to a plurality of memory devices by a command bus and a data bus. Each of theplurality of memory devices has a unique identification number. The system provides an addressing scheme in which anindividual memory device or groups of memory device can be selected for operation by addressing the devices with a commandpacket. The memory controller broadcasts a command packet over the command bus to the plurality of memory devices. Thepacket includes an identification number. At each of the memory devices, selection logic is included to make the memory deviceoperational if the identification number in the packet matches the identification number assigned to the memory device. Theaddress in the packet is preferably encoded such that identification number has the same size regardless of whether a singlememory device is being selected for operation or a group of memory devices are being selected for operation. The presentinvention also includes a method for selecting groups of memory devices for operation by multicasting a select addresscomprising the steps of: providing an memory identification number to each memory device, transmitting an memory deviceselection address, comparing the memory device selection address to the memory identification number, and asserting a signalto make the memory device operational if the memory device selection address and the memory identification number match. MainClaim: In a system having a memory controller coupled by a bus to a plurality of memory devices, a method for activatinga group of memory devices for operation, the method comprising the steps of:

providing a unique memory identification number for each memory device;

transmitting, from the memory controller to the plurality of memory devices, a packet including an encoded memory deviceselection address identifying the group of memory devices, the group including at least two memory devices and less than the

www.patentics.com


entire plurality of memory devices, and a command;

comparing the encoded memory device selection address to the memory identification number at each one of the plurality ofmemory devices; and

enabling operation of each memory device where the memory identification number matches the memory device selectionaddress to perform the command at the group of memory devices.

5,890,005

Low power, low interconnect complexity microprocessor and memory interface

Nokia Mobile Phones Limited Lindholm; Rune 713 H03K 19970602 3 95%

Abstract: A method is disclosed for reducing the power consumption of an electronic system, such as a wireless or cellulartelephone, that has a memory and a device for accessing the memory. The method includes the steps of (a)during a first part ofa memory access cycle, applying an address over a bus; (b) during a second part of the memory access cycle, transferring datato or from the memory over at least a portion of the bus; and (c) prior to the step of transferring, selectively inverting or notinverting the data so as to minimize a number of bus signal lines that are required to change state between the first part andthe second part of the memory access cycle. In a preferred embodiment of the invention the bus is a multiplexed address/databus. The method also generates a control signal that is transmitted to the bus for informing a receiving device that the data (oraddress) being transferred over the multiplexed address/data bus should be inverted before use. Also disclosed is a memorythat operates in a burst mode by incrementing or decrementing memory addresses using a clock signal, and that operates withthe power saving circuitry to selectively invert or not invert burst mode data read from or written to the memory. MainClaim: A method for reducing the power consumption of an electronic system having a first device and a second devicethat are coupled together through a bidirectional bus, comprising the steps of:

during a first part of a bus cycle, applying an address over the bus from the first device to the second device;

during a second part of the bus cycle, transferring data to or from the first device over at least a portion of the bidirectional bus;and

prior to the step of transferring, selectively inverting or not inverting the data, regardless of whether there is to be a chance indirection of data to be transferred over the bidirectional bus, so as to minimize a number of bus signal lines that are required tochange state between the first part and the second part of the bus cycle, thereby reducing power consumption by at leastreducing an amount of bus capacitance that is required to be charged or discharged in order to transfer the data during thesecond part of the bus cycle.


710 G06F 20040630 3 95%


4,958,304 Computer with interface for fast and slow memory circuits

Apple Computer, Inc. Moore; Robin B. 345 G06F 19890912 0 100%

Abstract: A CPU with an interface to two different RAMs which operate at different rates. The interface circuit includes adecoder which examines the addresses from the CPU and determines whether a faster cycle or slower cycle is needed. The slowRAM provides video signals to a video display. The fast RAM includes an image of the video signals stored in the first RAM. Whenthe video signals are read by the CPU, they are read only from the fast RAM, however, when it is necessary to update the videosignals, they are written into both the slow and fast RAMs. MainClaim: A computer which provides a video signal for a display comprising:

a central processing unit (CPU) which executes a program to provide said video signal for said display;

first and second random-access memories (RAMs) couples to said CPU, both of said memories storing video data, and said CPUaccessing said first RAM at a first rate and said second RAM at a second rate, said second rate being faster than said first rate;

video circuits coupled to said first and second RAM, and to said display for generating said video signal from said video datastored in said first RAM for said display, said circuits accessing said first RAM at said first rate, said video data being updatedand stored in both said first RAM and said second RAM;

an interface means for providing control between said CPU and said first and second RAMs such that when said CPU is executingsaid program and needs to read said video data, said interface means causes said video data to read only said second RAM bysaid CPU thereby allowing said CPU to operate a substantial portion of its time at said second rate.

5,890,005


Nokia Mobile Phones Limited Lindholm; Rune 713 H03K 19970602 3 93%

Abstract: A method is disclosed for reducing the power consumption of an electronic system, such as a wireless or cellular

www.patentics.com


telephone, that has a memory and a device for accessing the memory. The method includes the steps of (a)during a first part ofa memory access cycle, applying an address over a bus; (b) during a second part of the memory access cycle, transferring datato or from the memory over at least a portion of the bus; and (c) prior to the step of transferring, selectively inverting or notinverting the data so as to minimize a number of bus signal lines that are required to change state between the first part andthe second part of the memory access cycle. In a preferred embodiment of the invention the bus is a multiplexed address/databus. The method also generates a control signal that is transmitted to the bus for informing a receiving device that the data (oraddress) being transferred over the multiplexed address/data bus should be inverted before use. Also disclosed is a memorythat operates in a burst mode by incrementing or decrementing memory addresses using a clock signal, and that operates withthe power saving circuitry to selectively invert or not invert burst mode data read from or written to the memory. MainClaim: A method for reducing the power consumption of an electronic system having a first device and a second devicethat are coupled together through a bidirectional bus, comprising the steps of:







711 G06F 19991101 3 92%


5,493,666

Memory architecture using page mode writes and single level write buffering

Apple Computer, Inc. Fitch; Jonathan M. 711 G06F 19950111 0 100%

Abstract: A memory architecture including a memory cache which uses a single level of write buffering in combination withpage mode writes to attain zero wait state operation for most memory accesses by a microprocessor. By the use of such amemory architecture, the speed advantages of more expensive buffering schemes, such as FIFO buffering, are obtained usingless complex designs. The memory architecture utilizes same page detection logic and latching circuitry and takes advantage ofa feature built into industry standard dynamic RAMs, namely page mode writes, to perform writes to memory which allow theprocessor to be freed before the write is completed for the most frequently occurring type of write operations. MainClaim: A memory system having an address bus and a data bus coupled to a dynamic random access memory array, amemory cache coupled to said address bus and said data bus, a tag array coupled to said address bus and a memory controllercoupled to a central processing unit and said dynamic random access memory array, said memory system comprising:

a) page mode write control means coupled to said address bus and said memory controller for controlling writes of data on saiddata bus to said dynamic random access memory array which are within a predetermined memory page;

b) same page detection logic means for determining whether consecutive writes of data on said data bus to said dynamicrandom access memory array are within said predetermined memory page and generating a latch control signal for latching dataon said data bus;

c) latch means coupled to said dynamic random access memory array, said data bus, said page mode write control means andsaid same page detection logic means for latching data from said data bus which is to be written to said dynamic random accessmemory array using said latch control signal; said page mode write control means, said latch control signal and said latch meanscooperatively operating to provide a single level of write buffering.

2008/0059748

Method, mobile device, system and software for a write method with burst stop and data masks

Nokia CorporationKlint; Jani J. | Floman; Matti | Heinonen; Aarne

711 G06F 20070831 2 92%

Abstract: A method, mobile device, system, and software are devised in order to implement a write method that includes twodifferent types of write commands, depending upon the length of a data burst to memory. A first write command is provided fora first type of burst and/or a second write command is provided for a second type of burst. The first type of burst is a burst ofsubstantially a certain length. The second type of burst has length that is substantially an integer multiple of the length of thefirst type of burst, such as two or four times the length of the first type of burst. MainClaim: A method comprising: providing a first write command to use a first type of burst for writing to a memory; orproviding a second write command to use a second type of burst for writing to the memory; wherein the second type of bursthas length that is substantially an integer multiple of a length of the first type of burst.

Cache memory systems that accesses main memory without wait

www.patentics.com


5,353,429

states during cache misses, using a state machine and address latch in the memory controller

Apple Computer, Inc. Fitch; Jonathan M. 711 G06F 19930820 0 100%

Abstract: A memory system where a cache miss is fielded with a retry access to main memory, but instead of waiting for themicroprocessor to resynchronize and re-initiate the memory cycle, the memory cycle is started immediately. The speed of thetag array is specified so that the status of the cache, hit or miss, is known at the same time that the microprocessor's memorycycle start signal is known to be valid. The addresses are then latched and the memory cycle is started in anticipation of theretried cycle. The access time of memory is then overlapped with microprocessor resynchronization and memory cyclereinitialization. By using this technique, clock cycles are needed for the initial cycle, additional clock cycles are needed toperform the resynchronization, and additional clock cycles are needed for the retried cycle since the data is already waiting frommemory. The above-described improvement is implemented by decoupling the direct connection of the memory array from the address bus. Additionally, a state machine modifies the operation of the memory controller so that the access time of thememory is overlapped with microprocessor resynchronization and memory cycle reinitialization. MainClaim: A computer system including a cache memory system comprising:

a) a central processing unit coupled to a data bus and an address bus;

b) a main memory having a predetermined access time coupled to said data bus and to an address latch bus, said main memoryfor storing data and instructions for use by said central processing unit;

c) a memory controller means for controlling accesses to said main memory, said memory controller means including i) anaddress latch coupled to said address bus and said address latch bus, and ii) state machine means for controlling the operationof the memory controller means and the address latch;

d) a cache memory means coupled to said address bus and said data bus for storing a predetermined subset of said data andinstructions for use by said central processing unit;

e) a cache tag array means coupled to said address bus for storing portions of addresses from said address bus corresponding toaddresses of data and instructions stored in said cache memory means and for generating signals indicating for an address onsaid address bus whether data corresponding to the address on the address bus is stored within said cache memory means,such that if said data corresponding to the address on the address bus is not stored within said cache memory means, said statemachine operates to cause the access time of said main memory to be overlapped with resynchronization of said centralprocessing unit and memory cycle reinitialization required to obtain the data from said main memory.

2008/0059748

Method, mobile device, system and software for a write method with burst stop and data masks

Nokia CorporationKlint; Jani J. | Floman; Matti | Heinonen; Aarne

711 G06F 20070831 2 92%

Abstract: A method, mobile device, system, and software are devised in order to implement a write method that includes twodifferent types of write commands, depending upon the length of a data burst to memory. A first write command is provided fora first type of burst and/or a second write command is provided for a second type of burst. The first type of burst is a burst ofsubstantially a certain length. The second type of burst has length that is substantially an integer multiple of the length of thefirst type of burst, such as two or four times the length of the first type of burst. MainClaim: A method comprising: providing a first write command to use a first type of burst for writing to a memory; orproviding a second write command to use a second type of burst for writing to the memory; wherein the second type of bursthas length that is substantially an integer multiple of a length of the first type of burst.

4,742,448 Integrated floppy disk drive controller Apple Computer, Inc.

Sander; Wendell B. | Bailey; Robert 711 G06F 19861218 0 100%

Abstract: A floppy disk drive controller interface implemented as an integrated circuit on a single semi-conductor chip. The controller connects to a host computer data bus and one or more floppy disk drives. Based upon clocking and control signalsreceived from a digital computer, the controller generates serial encoded data for recording on a floppy disk and receives serialencoded data previously recorded on a floppy disk. The controller comprises a read control circuit including a read data register,write control means including a write data register, a mode register, a status register, state latches, a decoder and specialfunction registers. The controller operates by the setting and clearing of the state latches and reading or writing the moderegister, the status register, the special function registers, the read data register and the write data register. The setting of astate latch and accessing of a register is done simultaneously. The controller, under software control, operates in a synchronousor asynchronous read/write mode, and slow or fast read/write mode. MainClaim: An integrated circuit floppy disk drive controller formed in a single semiconductor device for interfacing between adigital computer having an address bus and a data bus, and at least one floppy disk drive, said disk drive controller and saidcomputer being coupled by said data bus, said computer generating a clock signal which is input to said controller, saidcontroller comprising:

state storage means for coupling to said computer by said address bus for storing state commands sent by said computer;

decoder means coupled to said state storage means for decoding state commands stored in said state storage means andgenerating control signals for controlling the operation of a status register means, a read control means and a write controlmeans based upon said decoded commands;

mode storage means coupled to said decoder means and for coupling to said computer, said mode storage means for storingdata sent by said computer indicating modes of operation selected by said computer, said modes of operation including at leastone of synchronous/asynchronous reading and writing and fast/slow clock;

said status register means coupled to said decoder means, and for coupling to said floppy disk drive and said computer for

www.patentics.com


storing information regarding the status of said at least one disk drive and the controller for interrogation by said computer, saidstatus being determined by the contents of said mode storage means and said status register means;

said read control means coupled to said mode storage means, and for coupling to said computer and said at least one disk drivefor receiving data from said disk drive and sending said data to said computer in a mode of operation as determined by saidmode storage means; and

said write control means coupled to said mode storage means, for coupling to said at least one disk drive for receiving data fromsaid computer and sending said data to said disk drive in a mode of operation as determined by said mode storage means.

6,754,740

Interface apparatus for connecting devices operating at different clock rates, and a method of operating the interface

Nokia Corporation Happonen; Aki 710 G06F 20001211 3 92%

Abstract: The invention proposes an apparatus (and method) for transferring data between a first device (1) and a memoryarea of memory means (3a; F_REG) of a second device (3), the apparatus comprising buffer registers for temporarily storing thedata (DATA) to be transferred and the address (ADDR) of the memory area to and/or from which the data are to be transferred,and a control means (EL, CTRL) for controlling said buffer registers, characterized by at least two groups of buffer registers([DATA_REG1, ADD_REG1], [DATA_REG2, ADD_REG2]) for storing data and associated addresses transmitted in consecutivedata transfer operations, and in that said control means (CTRL) is adapted to generate a control signal (ENABLE) for alternatelyswitching between a first group of buffer registers ([DATA_REG1, ADD_REG1]) and a second group of buffer registers([DATA_REG2, ADD_REG2]) after each of a respective one of consecutive data transfer operations. MainClaim: An apparatus for transferring data between a first device and a memory area of memory means of a second device,the memory area being determined by an address, within a system which comprises at least one system clock and in which thefirst device provides at least a first signal indicating data transfer and a second signal indicating the direction of data transfer,the apparatus comprising:

buffer registers for temporarily storing the data to be transferred and the address of the memory area to and/or from which thedata are to be transferred; and

a control means for controlling said buffer registers to temporarily store said data and address to be transferred in response tothe first signal indicating that data transfer being active and the second signal indicating the direction of data transfer betweenthe first device and the second device, the first and second signals thereby instructing either a write operation or a readoperation, wherein at least two groups of buffer registers for storing data and associated addresses transmitted in consecutivedata transfer operations, and wherein said control means is adapted to generate a control signal for alternately switchingbetween a first group of buffer registers and a second group of buffer registers of said at least two groups of buffer registersafter each of a respective one of consecutive data transfer operations.

5,717,952

DMA controller with mechanism for conditional action under control of status register, prespecified parameters, and condition field of channel command


Christiansen; Kevin M. | James; David V. | Eckstein; Bruce E.

710 G06F 19941116 0 100%

Abstract: A DMA controller capable of conditional action under the control of a status register, prespecified parameters, and acondition field of the channel command, and a DMA controller which returns status information to command entry locations thatare reserved for this purpose are disclosed. The prespecified parameters may be held in a register having a mask field and avalue field, and a test for conditional action may be a masked comparison of the status register and the value field. Thecondition field determines how the test result is interpreted and allows suppressing or forcing the conditional action during acommand. MainClaim: A direct memory access (DMA) controller comprising a channel including:

a status register;

a first condition register;

a command buffer having a first condition field;

a first combinational logic block having inputs connected to said status register, said first condition register and said firstcondition field and having an output whose value determines the conditional execution of a first action by said controller; andwherein

said first combinational logic block includes a first subsystem having inputs connected to said status register and said firstcondition register and having an output, and a second subsystem having inputs connected to said first condition field and saidoutput of said first subsystem, and an output which is the output of said first combinational logic;

said first condition field has two bits and four possible values, said values being used to determine whether said output of saidsecond subsystem is one, zero, equal to said output of said first subsystem, or equal to the complement of the output of saidfirst subsystem; and

said first condition register has a mask field and a value field and the output of said first subsystem is one if and only if thosebits of said status register corresponding to one bits of said mask field are equal to the corresponding bits of said value field.

www.patentics.com


6,694,398 Circuit for selecting interrupt requests in RISC microprocessors

Nokia CorporationZhao; Sheng | Wong; Aries | Lin; Minghui

710 G06F 20010430 5 92%

Abstract: An apparatus and method for prioritizing interrupt requests in a RISC processor. By utilizing hardware to prioritize therequests, processor time is reduced. The acknowledge signal from a priority resolve circuit selects the given service routineentry to branch instruction generating circuit. A lower priority service routine can be interrupted by a higher priority request. MainClaim: An apparatus for resolving interrupt requests, comprising:

a selector circuit for receiving a plurality of interrupt requests of different types and producing a single output for each type;

a plurality of arbitrator circuits, each receiving an output from said selector circuit;

an interrupt vector for storing interrupt service addresses corresponding to each interrupt request and supplying said addressesto said arbitrator;

said arbitrators producing an output signal indicating the interrupt request having the highest priority and the interrupt serviceaddress associated therewith.

5,802,550

Processor having an adaptable mode of interfacing with a peripheral storage device


Fullam; Scott | Anderson; Eric | Schneider; Rodger C.

711 G06F 19960117 0 100%

Abstract: A processor having an adaptable and self-setting mode of interfacing with a peripheral storage device is provided.The processor comprises a variable-parameter controller which enables the processor to adaptably interface with a peripheralstorage device. Upon powering up, the controller first interfaces with the peripheral storage device in accordance with a defaultmode of operation of the peripheral storage device to extract configuration data from the peripheral storage device. Theconfiguration data relates to at least one alternate mode of operation of the peripheral storage device. The controller theninterfaces with the peripheral storage device in accordance with the alternate mode of operation. The processor includes amemory device connected to the variable-parameter controller for storing the configuration data so that it is accessible to thecontroller. MainClaim: A processor having an adaptable mode of interfacing with a peripheral read only memory (ROM) device, whereinsaid peripheral ROM device is one of a standard-mode ROM device, a nibble-mode ROM device, and a burst-mode ROM device, comprising:

a parameter memory for storing information defining timing and control requirements and at least one data access mode of saidperipheral ROM device; and

a controller connected to said memory for interfacing with said ROM device in accordance with said stored information.

5,802,351 Data interfaceNokia Mobile Phones Limited Frampton; Simon 703 G06F 19960205 1 93%

Abstract: A data buffer (23) is positionable between processing devices, such as microcontroller (21) and a digital signalprocessor (22). Messages are transmitted between the devices via a dual port RAM buffer (31). The amount of storage allocatedfor transfers in each direction is adjustable via a size register (42) so that, at any particular time, the optimum amount ofstorage is provided for a transfer in a particular direction. The buffer is particular suited to applications in mobile telephones. MainClaim: A data buffer positionable between a first processing means and a second processing means, comprising:

storage means arranged to buffer data signals generated by each of said processing means for reception by the other of saidprocessing means, and

programmable storage allocation means arranged to adjust an amount of storage provided by said storage means for bufferingdata signals generated by each of said processing means;

wherein said programmable storage allocation means is comprised of address generating means for generating addressingsignals for the writing of data to said storage means or the reading of data from said storage means; and

wherein said address signal generating means is arranged to generate addressing signals initiated from a predetermined value,said address signal generating means further including decoding means for selectively applying an offset to said addressingsignals, depending upon whether a writing operation or a reading operation is being performed.

5,692,137 Master oriented bus bridge Apple Computer, Inc.

Regal; Michael L. | Flaig; Charles M. 710 G06F 19950508 0 100%

Abstract: An interface between two buses in different clock domains. The interface includes a master buffer which is used forboth master writes and slave reads. A control logic unit for each bus receives signals from a buffer manager which straddles theclock domains to gate latch pulses to the master buffer. MainClaim: An interface for transferring data between a master device on a first bus having timing controlled by a first clockand a slave device on a second bus having timing controlled by a second clock, the interface comprising:

a buffer manager for producing a first control signal when a master write is attempted and a second control signal when a slaveread is attempted;

a first circuit, arranged to receive a clock signal from said first clock and said first control signal, for producing a write latchpulse signal based on said first clock signal;

a second circuit, arranged to receive a clock signal from said second clock and said second control signal, for producing a read

www.patentics.com


latch pulse signal based on said second clock signal; and

a master buffer, arranged to receive write data from said first bus and read data from said second bus, and arranged to receivesaid write latch pulse signal and said read latch pulse signal, for producing as an output one of said write data latched by saidwrite latch pulse signal and said read data latched by said read latch pulse signal in accordance with a control signal.


710 G06F 20040630 3 95%


5,371,877

Apparatus for alternatively accessing single port random access memories to implement dual port first-in first-out memory

Apple Computer, Inc. Drako; Dean M. | Yu; Hsin-Tung A.

711 G06F 19911231 0 100%

Abstract: A circuit for providing the function of a dual port FIFO circuit including a first bank of single port random accessmemory, a second bank of single port random access memory, apparatus for sequentially writing every other piece of sequentialdata to an alternate one of the first and second [memory] banks of single port memory, and apparatus for simultaneouslyreading the earliest written piece of sequential data from the one [each] of the first and second [memory] banks of single portmemory not being written during the period data is being written to the other of the [memory] banks of single port memory. Byusing two banks of single port memory, the cost of dual port memory typically used for a FIFO circuit is substantially reduced. MainClaim: A circuit for accessing information, said circuit comprising:

a clock supplying a clock signal having a first phase and a second phase;

a first bank of single port random access memory that is accessed for reading during said first phase;

a second bank of single port random access memory that is accessed for reading during said second phase;

read circuitry, coupled to said first bank and to said second bank, sequentially reading every other piece of sequential data froman alternate one of said first bank of memory or said second bank of memory during said first and second clock phases,respectively;

write circuitry writing data into said first bank of memory during said second phase and also writing data into said second bankof memory during said first phase, wherein at least one piece of data may be written to said first bank or to said second bankwhile an other bank is being read by said read circuitry; and

recovery circuitry supplying data in response to removal of a hold condition, said recovery circuitry comprising:

first address generation circuitry generating a first address in a given clock cycle for addressing said first bank or said secondbank;

second address generation circuitry generating a second address in said given clock cycle for addressing said first bank or saidsecond bank wherein said second address is equal to an address succeeding said first address;

delay storage circuitry delaying data output from said first bank and said second bank by one clock cycle; and

multiplexing circuitry supplying information to output terminals from either said read circuitry or from said delay storagecircuitry.

6,754,740



Abstract: The invention proposes an apparatus (and method) for transferring data between a first device (1) and a memoryarea of memory means (3a; F_REG) of a second device (3), the apparatus comprising buffer registers for temporarily storing thedata (DATA) to be transferred and the address (ADDR) of the memory area to and/or from which the data are to be transferred,and a control means (EL, CTRL) for controlling said buffer registers, characterized by at least two groups of buffer registers([DATA_REG1, ADD_REG1], [DATA_REG2, ADD_REG2]) for storing data and associated addresses transmitted in consecutivedata transfer operations, and in that said control means (CTRL) is adapted to generate a control signal (ENABLE) for alternatelyswitching between a first group of buffer registers ([DATA_REG1, ADD_REG1]) and a second group of buffer registers([DATA_REG2, ADD_REG2]) after each of a respective one of consecutive data transfer operations. MainClaim: An apparatus for transferring data between a first device and a memory area of memory means of a second device,the memory area being determined by an address, within a system which comprises at least one system clock and in which the

www.patentics.com


first device provides at least a first signal indicating data transfer and a second signal indicating the direction of data transfer,the apparatus comprising:



5,504,913 Queue memory with self-handling addressing and underflow

Apple Computer, Inc. Baden; Eric A. 711 G06F 19920514 0 100%

Abstract: The present invention reduces the overhead commonly associated with computer queues by not requiring directaddressing of each location in the queue and by not requiring specialized underflow logic. Furthermore, reads and writes to thecomputer queue of the present invention can be asynchronous. Lastly, the computer queue of the present invention requiresless circuitry and is thus physically smaller, requires less power to operate and can operate more quickly than can queues of theprior art. MainClaim: An improved computer queue memory comprising:

a) a register file, said register file comprising a matrix of rows and columns of transparent latches wherein each said column oftransparent latches comprises a word of said queue memory and wherein each said row of transparent latches comprises a bit ofeach said word of said queue memory;

b) a write addressing shift register, said write addressing shift register comprising a series of flip-flops, each said write addressing flip-flop coupled to address one column of said columns of transparent latches of said register file;

c) a read addressing shift register and a read addressing shift register cycle indicator, said read addressing shift registercomprising a series of flip-flops, each said read addressing series flip-flop coupled to select the output of one transparent latch of a first predetermined set of outputs of each said row of transparent latches of said register file and also coupled to select theoutput of one transparent latch of a second predetermined set of outputs of each said row of transparent latches of said registerfile, said read addressing shift register cycle indicator coupled to select between said predetermined sets of outputs of each saidrow of transparent latches of said register file.

6,754,740



Abstract: The invention proposes an apparatus (and method) for transferring data between a first device (1) and a memoryarea of memory means (3a; F_REG) of a second device (3), the apparatus comprising buffer registers for temporarily storing thedata (DATA) to be transferred and the address (ADDR) of the memory area to and/or from which the data are to be transferred,and a control means (EL, CTRL) for controlling said buffer registers, characterized by at least two groups of buffer registers([DATA_REG1, ADD_REG1], [DATA_REG2, ADD_REG2]) for storing data and associated addresses transmitted in consecutivedata transfer operations, and in that said control means (CTRL) is adapted to generate a control signal (ENABLE) for alternatelyswitching between a first group of buffer registers ([DATA_REG1, ADD_REG1]) and a second group of buffer registers([DATA_REG2, ADD_REG2]) after each of a respective one of consecutive data transfer operations. MainClaim: An apparatus for transferring data between a first device and a memory area of memory means of a second device,the memory area being determined by an address, within a system which comprises at least one system clock and in which thefirst device provides at least a first signal indicating data transfer and a second signal indicating the direction of data transfer,the apparatus comprising:



5,815,733

System for handling interrupts in a computer system using asic reset input line coupled to set of status circuits for presetting values in the status circuits

Apple Computer, Inc. Anderson; Eric C. | Johnson; Celeste

710 G06F 19960201 0 100%

Abstract: The present invention provides an interrupt register for handling interrupt requests received from external devices ata common interrupt terminal of a CPU. The invention provides inputs, outputs, and storage means as part of the interruptregister. The interrupt register inputs and outputs are used for communication with both the external devices and CPU toprevent mishandling of the interrupt requests.

www.patentics.com


MainClaim: A circuit for facilitating communications between peripherals and a control device, comprising:

a first set of input circuits, at least one of the first set of input circuits being responsive to peripheral signals from a respectiveperipheral, including a signal pulse and a signal level change from a first level to a second level;

a set of status circuits coupled to the first set of input circuits, responsive to the peripheral signals being received at the first setof input circuits to generate a set of status signals;

a set of output circuits coupled to the set of status circuits, for indicating the set of status signals to the control device; and

an ASIC reset input line coupled to the set of status circuits, for presetting values in the status circuits.



710 G06F 20010430 5 92%






5,546,547 Memory bus arbiter for a computer system having a dsp co-processor

Apple Computer, Inc. Bowes; Michael J. | Yazdy; Farid A.

710 G06F 19940128 0 100%

Abstract: An arbitration scheme for a computer system in which a digital signal processor resides on the computer system'smemory bus without requiring a block of dedicated static random access memory. An arbitration cycle is divided into 10 slices ofwhich 5 slices are provided in each arbitration loop to the digital signal processor. Two slices are provided each to the system'sI/O interface and to the peripheral bus controller. A final slice is provided to the system's CPU. A default state when no memorybus resource is requesting the system memory bus parks the memory bus on the CPU. The arbitration scheme providessufficient bandwidth for real-time signal processing by the digital signal processor operating from the system's dynamic randomaccess memory while also providing sufficient bandwidth for a local area network interface through the system's I/O interface. MainClaim: A Computer system comprising:

a processing unit;

a system bus coupled to said processing unit;

a main memory system coupled to said system bus;

a digital signal processor coupled to said system bus for utilizing said main memory system as an external memory over saidsystem bus in conjunction with said processing unit using said main memory system over said system bus;

an arbiter in communication with said processing unit and said digital signal processor for processing system bus accessrequests, said arbiter for providing said digital signal processor with sufficient system bus bandwidth for access to said mainmemory system so as to facilitate real-time data processing without starving said processing unit from access to said mainmemory system over said system bus;

an I/O bus interface coupled to said system bus;

an I/O bus in communication with said system bus through said I/O bus interface;

wherein said arbiter is further in communication with said I/O bus interface, said arbiter further arbitrating said system bus toprovide sufficient system bus bandwidth to support resources coupled to said I/O bus;

an network port coupled to said I/O bus for connecting said computer system to a local area network;

an expansion card peripheral bus;

an expansion card peripheral bus controller for coupling said peripheral bus to said system bus;

wherein said arbiter is further in communication with said peripheral bus controller, said arbiter further arbitrating said systembus to provide sufficient system bus bandwidth to support resources coupled to said peripheral bus; and

www.patentics.com


wherein said arbiter designates any one of said processing unit, said digital signal processor, said I/O interface or said peripheralbus controller as the master on said system bus, said arbiter making said designation according to the following state diagram:##STR1## wherein state I corresponds to the state where said processing unit is assigned ownership of said system bus, statesII, IV, VI and VIII correspond to the state where said digital signal processor is assigned ownership of said system bus, statesIII and VII correspond to the state where said peripheral bus controller is assigned ownership of said system bus, and states Vand IX correspond to the state where said I/O bus interface is assigned ownership of said system bus.

7,293,119

DMA data transfer between low-overhead processor and connected external circuitry using transactions log

Nokia Corporation Beale; John 710 G06F 20011227 2 93%

Abstract: The present invention relates to a method and system for performing a data transfer between a shared memory (16)of a processor device (10) and a circuitry (20) connected to the processor device (10), wherein the data transfer is performedby triggering a DMA transfer of the data to the processor device, adding the DMA transfer to a transaction log, and providing thetransaction log to the processor device, when the transaction log has reached a predetermined depth limit. The processor deviceis then informed of the DMA transfer of the transaction log, so as to be able to validate the transferred data. Thereby, significantbackground data movement can be provided without introducing high core overheads at the processor device (10). MainClaim: A method comprising: performing a data transfer between a memory of a processor device and a circuitryconnected to said processor device, wherein said performing comprises setting up at said circuitry a direct memory access fortransferring data; triggering at said circuitry a direct memory access transfer of said data to said processor device; adding insaid circuitry said direct memory access transfer to a transaction log; providing said transaction log from said circuitry to saidprocessor device, when said transaction log has reached a predetermined limit; and informing said processor device of theavailability of said transaction log.

5,961,614

System for data transfer through an I/O device using a memory access controller which receives and stores indication of a data status signal

Apple Computer, Inc.Christiansen; Kevin M.

710 G06F 19960507 0 100%

Abstract: A method and system for transferring units of data between a computer memory and an external system in which aDMA controller stores and uses information from an I/O device interfacing with the external system to transfer data moreefficiently. MainClaim: A method of transferring a data unit from a computer system memory and to an external system through an I/Odevice using a memory access controller, said memory access controller including a register for storing information which thememory access controller uses to control its own operation, said method comprising the steps of:

a first step, executed by said memory access controller, of retrieving said data unit from said computer system memory andtransmitting said data unit to said I/O device;

a second step, executed by said I/O device, of transmitting said data unit retrieved and transmitted in said first step to saidexternal system;

a third step, executed by said I/O device, of sending a data status signal to said memory access controller when said secondstep is complete; and

a fourth step, executed by said memory access controller, of storing an indication of said data status signal sent in said thirdstep in said register.

2004/0225779




710 G06F 20010330 9 93%

Abstract: Disclosed is a programmable buffer circuit (16) for interfacing a CPU (12) to a plurality of channel interfaces (14). Thebuffer circuit includes a dual port memory (18) having a first port coupled to a CPU data bus and a second port coupled to achannel data bus that serves the plurality of channel interfaces. The buffer circuit further includes an arbitrator (24) forarbitrating access to the dual port memory by individual ones of the channel interfaces over the channel data bus; an addressgenerator (26) for generating dual port memory addresses for reading and writing data using the CPU data bus and the channeldata bus; and a control unit (20) and allocator (22) that are programmable by the CPU for specifying individual ones of bufferlocations and sizes within the dual port memory for individual ones of the channel interfaces, and for enabling and disablingindividual ones of the buffers. The allocator has outputs coupled to the address generator for controlling the generation ofaddresses thereby, depending on which channel interface is currently selected for access to the dual port memory. The controlunit is programmable for operating individual ones of the channel buffers in a block access mode or in a first in/first out (FIFO)access mode of operation. In a preferred embodiment, at least the dual port memory, the CPU and the plurality of interfacechannels are contained within a common integrated circuit package, such as an ASIC. By example, one of the plurality ofinterface channels implements an audio CODEC, another one implements a serial data interface, and another one implements apacket data interface channel. Individual ones of the plurality of interface channels contain a receive interface and a transmitinterface, and the allocator includes a corresponding plurality of registers for specifying at least a starting address and a size foreach of of the receive interface and the transmit interface. The buffer circuit is also programmable for specifying a receive bufferof one channel interface to be a transmit buffer of another channel interface. MainClaim: A programmable buffer circuit for interfacing a CPU to a plurality of channel interfaces, comprising: a single dualport memory having a first port coupled to a CPU data bus and a second port coupled to a channel data bus that serves saidplurality of channel interfaces; an arbitrator for arbitrating access to said dual port memory by individual ones of said channelinterfaces over said channel data bus for selectibely storing data in and reading data from said single port memory; an addressgenerator for generating dual port memory addresses for selectively reading data from and writing data to said single dual portmemory using said CPU data bus and said channel data bus; and an allocator and control unit programmable by said CPU forspecifying individual ones of buffer locations and buffer sizes within said single dual port memory for individual ones of saidchannel interfaces, and for enabling individual ones of said buffers, said allocator having outputs coupled to said addressgenerator for controlling the generation of addresses thereby depending on which channel interface is currently selected for

www.patentics.com


access to said single dual port memory.

7,054,986



710 G06F 20010330 9 93%


5,361,389 Apparatus and method for emulation routine instruction issue

Apple Computer, Inc. Fitch; Jonathan 703 G06F 19930927 0 100%

Abstract: An apparatus for emulation routine instruction issue comprises a bus signal router, a state machine, a virtual programcounter (VPC) circuit, an emulated program counter (EPC), a summing circuit, an opcode storage register, and a pointer storageregister. The VPC circuit maintains the VPC value under the direction of the state machine. In response to a next instructionrequest issued by the central processing unit (CPU), the state machine outputs the VPC to an instruction address bus,transferring the host instruction stored at the address indicated by the VPC to the instruction bus for issue to the CPU. After anext host instruction request, the state machine updates the VPC value. Concurrent with the execution of the current emulationroutine, the state machine prefetches the nest emulation routine pointer (NERP) by issuing DMA commands and commands tothe EPC, the opcode storage means, and the pointer storage means. If the final host instruction in the current emulation routinehas been reached, the state machine assigns the NERP to the VPC and outputs the VPC to the instruction address bus. A methodfor Emulation Routine Instruction Issue comprises the steps of determining if a next host instruction request has been made bythe CPU; outputting the VPC to the instruction address bus; and updating the VPC; and prefetching the NERP concurrent withthe execution of the host instructions in the current emulation routine. MainClaim: An apparatus for issuing instructions during emulation routines to a central processing unit (CPU) of a hostcomputer system, the host computer system also having a memory, a control bus, a data bus, an address bus, and an addressinstruction bus, said apparatus comprising:

an emulated program counter having a control input, a load input, and an output, for storing an address of a next emulationroutine to be executed from the data bus in response to a first control signal on the control input of the emulated programcounter, the control input of the emulated program counter coupled to the control bus, the load input of the emulated programcounter coupled to the data bus, and the output of the emulated program counter coupled to the address bus;

a pointer storage means having a control input, a data input, and an output, for storing a pointer to the next emulation routinein response to a second control signal on the control input of the pointer storage means, the control input of the pointer storagemeans coupled to the control bus, the data input of the pointer storage means coupled to the data bus;

a virtual counter generation circuit having a first control input, a second control input, a first data input, a second data input, anaddress output, and a data output for generating and storing a virtual program counter value, the first control input of thevirtual counter generation circuit coupled to the control bus, the first data input of the virtual counter generation circuit coupledto the data bus, the second data input of the virtual counter generation circuit coupled to the output of the pointer storagemeans, the address output of the virtual counter generation circuit coupled to the instruction address bus, and the data outputof the virtual counter generation circuit coupled to the data bus; and

a state machine having a control input, an increment input, and a first control output, for detecting when the emulated programcounter has been updated, for controlling the retrieval of a pointer to the next emulation routine to be executed from memory,and for issuing the virtual program counter value to the instruction address bus, the control input and the first control output ofthe state machine coupled to the control bus, and the increment input coupled to the address bus.



710 G06F 20010430 5 95%




www.patentics.com




7,437,497

Method and apparatus for encoding memory control signals to reduce pin count

Apple Inc.Cornelius; William P. 711 G06F 20040823 0 100%

Abstract: One embodiment of the present invention provides a system that uses encoded memory control signals to reduce pincount on chips that generate and drive memory control signals. During operation, the system receives encoded memory controlsignals from a memory controller, wherein the memory control signals were encoded to reduce the number of memory controlsignals, and wherein the encoded memory control signals are received at a buffer chip, which is external to the memorycontroller. Next, the system decodes the encoded memory control signals on the buffer chip to restore the memory controlsignals, and then drives the memory control signals from the buffer chip to corresponding memory modules in the systemmemory. By transferring the memory control signals in encoded form from the memory controller to the buffer chip, fewer pinsare required on both the memory controller chip and the buffer chip. MainClaim: A method for using encoded memory control signals to reduce pin count on chips that generate and drive memorycontrol signals, comprising: receiving encoded memory control signals from a memory controller, wherein the memory controlsignals were encoded to reduce the number of memory control signals, and wherein the encoded memory control signals arereceived at a buffer chip which is external to the memory controller and memory modules; decoding the encoded memorycontrol signals on the buffer chip to restore the memory control signals for controlling one or more memory modules, whereinthe one or more memory modules are located on integrated circuit (IC) chips that are separate from the buffer chip; and drivingthe memory control signals from the buffer chip to the one or more memory modules in a system memory, wherein driving thememory control signals involves using a phase-locked loop (PLL) or a delay-locked loop (DLL) within the buffer chip to synchronize the memory control signals with clock signals for the system memory; whereby transferring the memory controlsignals in encoded form from the memory controller to the buffer chip requires fewer pins on both the memory controller chipand the buffer chip.

2006/0184726 Flexible access and control of Dynamic Random Access Memory

Nokia Corporation

Klint; Jani | Floman; Matti | Vihmalo; Jukka-Pekka

711 G06F 20050211 2 94%

Abstract: The invention relates in general to a method for accessing data stored in a dynamic random access memory. Toenable flexible use of different types of memory modules, the invention provides addressing data through at least one addressbus, controlling at least data flow to and from the dynamic random access memory through at least one control bus, transferringdata to and from the dynamic random access memory through at least one data bus, and clocking the dynamic random accessmemory through at least one clock input, wherein transferring data to and from the dynamic random access memory throughthe data bus is operated at a variable data flow rate such that the number of data bits transferred on the data bus within oneclock cycle is adjustable through at least one command on the control bus. MainClaim: A method for accessing data stored in a dynamic random access memory, comprising the steps of: addressing datathrough at least one address bus, controlling at least data flow to and from the dynamic random access memory through atleast one control bus, transferring data to and from the dynamic random access memory through at least one data bus, andclocking the dynamic random access memory through at least one clock input, wherein transferring data to and from thedynamic random access memory through the data bus is operated at a variable data flow rate such that the number of data bitstransferred on the data bus within one clock cycle is adjustable through at least one command on the control bus.

7,280,054

Integrated circuit interface that encodes information using at least one input signal sampled at two consecutive edge transitions of a clock signal

Nokia Corporation Floman; Matti | Klint; Jani

341 H03M 20041202 2 92%

Abstract: An integrated circuit, such as a dynamic RAM, includes a plurality of terminals for coupling to signal lines. One of thesignal lines is an input signal line that conveys a clock signal, and at least one other signal line is also an input signal line thatconveys information that is encoded by a level of the at least one other signal line at n consecutive edge transitions of the clocksignal, where nν2. MainClaim: A circuit, comprising a plurality of terminals for coupling to signal lines, where one of the signal lines is an inputsignal line that conveys a clock signal, and where a plurality of other signal lines are also input signal lines that conveysinformation that is encoded by a level of each of the plurality of other signal lines when considered together and when sampledat n consecutive edge transitions of the clock signal, where n is greater than or equal to 2.

2006/0132337


Nokia CorporationFloman; Matti | Klint; Jani 341 H03M 20041202 2 92%

Abstract: An integrated circuit, such as a dynamic RAM, includes a plurality of terminals for coupling to signal lines. One of thesignal lines is an input signal line that conveys a clock signal, and at least one other signal line is also an input signal line thatconveys information that is encoded by a level of the at least one other signal line at n consecutive edge transitions of the clocksignal, where nν2. MainClaim: A circuit, comprising a plurality of terminals for coupling to signal lines, where one of the signal lines is an inputsignal line that conveys a clock signal, and where at least one other signal line is also an input signal line that conveysinformation that is encoded by a level of the at least one other signal line at n consecutive edge transitions of the clock signal,where nν2.

www.patentics.com


7,289,383

Reducing the number of power and ground pins required to drive address signals to memory modules

Apple Inc.Cornelius; William P. 365 G11C 20040823 0 100%

Abstract: One embodiment of the present invention provides a system that reduces the number of power and ground pinsrequired to drive address signals to system memory. During operation, the system receives address signals associated with amemory operation from a memory controller, wherein the address signals are received at a buffer chip, which is external thememory controller. The system also receives chip select signals associated with the memory operation at the buffer chip. Next,the system uses the chip select signals to identify an active subset of memory modules in the system memory, which are activeduring the memory operation. The system then uses address drivers on the buffer chip to drive the address signals only to theactive subset of memory modules, and not to other memory modules in the system memory. In this way, the buffer chiprequires fewer power and ground pins for the address drivers because the address signals are only driven to the active subset ofmemory modules, instead of being driven to all memory modules in the system memory. MainClaim: A method for reducing the number of power and ground pins required to drive address signals to system memory,comprising: receiving address signals associated with a memory operation from a memory controller, wherein the addresssignals are received at a buffer chip, which is external the memory controller; receiving chip select signals associated with thememory operation at the buffer chip; using the chip select signals to identify an active subset of memory modules in the systemmemory, which are active during the memory operation; and using address drivers on the buffer chip to drive the addresssignals only to the active subset of memory modules, and not to other memory modules in the system memory; whereby thebuffer chip requires fewer power and ground pins for the address drivers because the address signals are only driven to theactive subset of memory modules, instead of being driven to all memory modules in the system memory.

2006/0184726 Flexible access and control of Dynamic Random Access Memory

Nokia Corporation

Klint; Jani | Floman; Matti | Vihmalo; Jukka-Pekka

711 G06F 20050211 2 94%

Abstract: The invention relates in general to a method for accessing data stored in a dynamic random access memory. Toenable flexible use of different types of memory modules, the invention provides addressing data through at least one addressbus, controlling at least data flow to and from the dynamic random access memory through at least one control bus, transferringdata to and from the dynamic random access memory through at least one data bus, and clocking the dynamic random accessmemory through at least one clock input, wherein transferring data to and from the dynamic random access memory throughthe data bus is operated at a variable data flow rate such that the number of data bits transferred on the data bus within oneclock cycle is adjustable through at least one command on the control bus. MainClaim: A method for accessing data stored in a dynamic random access memory, comprising the steps of: addressing datathrough at least one address bus, controlling at least data flow to and from the dynamic random access memory through atleast one control bus, transferring data to and from the dynamic random access memory through at least one data bus, andclocking the dynamic random access memory through at least one clock input, wherein transferring data to and from thedynamic random access memory through the data bus is operated at a variable data flow rate such that the number of data bitstransferred on the data bus within one clock cycle is adjustable through at least one command on the control bus.

7,280,054


Nokia CorporationFloman; Matti | Klint; Jani 341 H03M 20041202 2 92%

Abstract: An integrated circuit, such as a dynamic RAM, includes a plurality of terminals for coupling to signal lines. One of thesignal lines is an input signal line that conveys a clock signal, and at least one other signal line is also an input signal line thatconveys information that is encoded by a level of the at least one other signal line at n consecutive edge transitions of the clocksignal, where nν2. MainClaim: A circuit, comprising a plurality of terminals for coupling to signal lines, where one of the signal lines is an inputsignal line that conveys a clock signal, and where a plurality of other signal lines are also input signal lines that conveysinformation that is encoded by a level of each of the plurality of other signal lines when considered together and when sampledat n consecutive edge transitions of the clock signal, where n is greater than or equal to 2.

2006/0132337


Nokia Corporation Floman; Matti | Klint; Jani

341 H03M 20041202 2 92%

Abstract: An integrated circuit, such as a dynamic RAM, includes a plurality of terminals for coupling to signal lines. One of thesignal lines is an input signal line that conveys a clock signal, and at least one other signal line is also an input signal line thatconveys information that is encoded by a level of the at least one other signal line at n consecutive edge transitions of the clocksignal, where nν2. MainClaim: A circuit, comprising a plurality of terminals for coupling to signal lines, where one of the signal lines is an inputsignal line that conveys a clock signal, and where at least one other signal line is also an input signal line that conveysinformation that is encoded by a level of the at least one other signal line at n consecutive edge transitions of the clock signal,where nν2.

5,619,471 Memory controller for both interleaved and non-interleaved memory

Apple Computer, Inc. Nunziata; Ann B. 365 G11C 19950606 0 100%

Abstract: A system and method for controlling DRAM is described. According to exemplary embodiments of the presentinvention, a memory subsystem can be populated by end users with any of a variety of DRAM chips. A memory controller willsize each memory bank and determine whether paired memory banks are to be configured as interleaved or non-interleaved based upon the detected DRAM population. Bank selection logic is designed to account for both size and status (interleaved or

www.patentics.com


non-interleaved) when determining which memory bank contains a memory location of interest. Row and column addressing isselected to minimize decoding of an incoming system address and reduce DRAM access time. MainClaim: A memory system comprising:

a plurality of memory banks, at least two of which are associated with one another for one of interleaved and non-interleaved operations;

a memory controller including:

a size register for storing a size of each of said plurality of memory banks;

an interleave register for storing a status of each of said memory banks as interleaved or non-interleaved based upon said size of said respective memory bank; and

address generation logic which generates a row address based upon an input system address irrespective of said status of saideach of said memory banks and which generates a column address based upon said input system address, said size and saidstatus.




711 G06F 19991101 3 92%


5,175,750 Application specific integrated circuit for a serial data bus

Apple Computer, Inc.Donovan; Paul M. | Caruso; Michael P. 375 H04L 19890915 0 100%

Abstract: An application specific integrated circuit is disclosed for use with a device locatable on a serial data bus of a datacommunication system. Attention and synch receiving circuitry is provided for receiving an attention and synch signal beingtransmitted on the serial data bus for synchronizing the device in accordance with the timing of the attention and synch signals.Demodulation circuitry is provided for receiving a command byte signal and a stop bit signal being transmitted on the serial databus. Demodulation circuitry is provided for demodulating the command byte signal. Reset circuitry is coupled to thedemodulation circuitry for receiving the command byte signal if the command byte signal contains a predetermined reset code.Flush circuitry is coupled to the demodulation circuitry for receiving the command byte signal if that signal contains apredetermined flush code. The flush circuitry clears all device specific data in the integrated circuit in response to thepredetermined flush code. Listen circuitry is coupled to the demodulation circuitry for receiving the command byte signal if thecommand byte signal contains a predetermined listen code. Talk circuitry coupled to the demodulation circuitry is provided forreceiving the command byte signal if the command byte signal contains a predetermined talk code. The talk circuitry preparesthe integrated circuit to transmit data from the device onto the serial data bus at a later period of time in the data bustransaction. MainClaim: An application specific integrated circuit of a device coupled to a serial data bus of a data communication system,wherein said device includes a plurality of device specific registers for storing device specific data, the application specificintegrated circuit comprising:

(a) attention and synch receiving means for receiving an attention and synch signal of a serial bus signal being transmitted onthe serial data bus, said attention and synch receiving means synchronizing said device in accordance with the timing of saidattention and synch signal;

(b) demodulation means for receiving a command byte signal and a stop bit signal being transmitted on the serial data bus, saidcommand byte signal following said attention and synch signal, said demodulation means for demodulating said command bytesignal to form a demodulated command byte signal, wherein said attention and synch signal received by said attention andsynch receiving means causes said demodulation means to start to demodulate said command byte signal;

(c) reset means coupled to said demodulation means for receiving said demodulated command byte signal if said demodulatedcommand byte signal contains a predetermined reset code, said reset means for returning resetable circuitor, said integratedcircuit to an initial state in response to said predetermined reset code;

(d) flush means coupled to said demodulation means for receiving said demodulated command byte signal if said demodulatedcommand byte signal contains a predetermined flush code, said flush means for clearing said device specific data stored in thedevice specific registers in response to said predetermined flush code;

(e) listen means coupled to said demodulation means for receiving said demodulated command byte signal if said demodulatedcommand byte signal contains a predetermined listen code, said listen means for preparing to receive data from the serial databus at a later period of time of the data bus transaction, wherein said demodulated command byte signal includes a start bitsignal if said command byte signal contains said predetermined listen code, wherein said listen means responds to said start bitsignal at said later period of time by utilizing said demodulation means for demodulating a plurality of data bytes of said databeing transmitted from said serial data bus for device specific functions of said device; and

(f) talk means coupled to said demodulation means for receiving said demodulated command byte signal if said demodulated

www.patentics.com


command byte signal contains a predetermined talk code, said talk means for preparing to transmit said device specific datafrom the device onto the serial data bus at said later period of time of the data bus transaction, wherein said talk meansgenerates said start bit signal if said demodulated command byte signal contains said predetermined talk code, said talk meansincluding modulation means for modulating and transmitting (1) said start bit signal and (2) the plurality of data bytes of saiddevice specific data onto said serial data bus at said later period of time, said integrated circuit minimizing any losses of dataduring interactions between the serial data bus and said device.

2004/0250002 Accessory control interface

Nokia Corporation Hellberg, Tino 710 G06F 20040310 1 92%

Abstract: Disclosed is an interface (10, 40) between a master device (30) and a slave device (20). The interface includes a bitserial bidirectional signal line (10A) for conveying commands and associated data from the master device to the slave device,and for conveying a reset signal, an interrupt signal, and a learning sequence signal for specifying a duration of a bit time fordata transferred from the slave device to the master device. The bit serial bidirectional signal line further indicates an accessorydevice connected/disconnected state to the master device. MainClaim: An interface between a master device and a slave device, said interface comprising a serial data bidirectional signal line for conveying commands and associated data from said master device to said slave device, said serial data bidirectionalsignal line further conveying other signals, said other signals comprising a reset signal, an interrupt signal, and a learningsequence signal for specifying a duration of a bit time for data transferred from said slave device to said master device, wheresaid interface comprises a resistance R coupled between the serial data bidirectional signal line and a circuit ground, and a pullup resistance RPU installed in the master device, wherein R and RPU together form a resistor voltage divider network.

7,167,935 Accessory control interface

Nokia Corporation Hellberg; Tino 710 G06F 20040310 1 92%

Abstract: Disclosed is an interface (10, 40) between a master device (30) and a slave device (20). The interface includes a bitserial bidirectional signal line (10A) for conveying commands and associated data from the master device to the slave device,and for conveying a reset signal, an interrupt signal, and a learning sequence signal for specifying a duration of a bit time fordata transferred from the slave device to the master device. The bit serial bidirectional signal line further indicates an accessorydevice connected/disconnected state to the master device. MainClaim: An interface between a master device and a slave device, said interface comprising a serial data bidirectional signalline for conveying commands and associated data from said master device to said slave device, said serial data bidirectionalsignal line further conveying other signals, said other signals comprising a reset signal, an interrupt signal, and a learningsequence signal for specifying a duration of a bit time for data transferred from said slave device to said master device, wheresaid interface comprises a resistance R coupled between the serial data bidirectional signal line and a circuit ground, and a pullup resistance RPU installed in the master device, wherein R and RPU together form a resistor voltage divider network.

6,742,061 Accessory control interface Nokia Corporation Hellberg; Tino 710 G06F 20020916 1 92%

Abstract: Disclosed is an interface (10, 40) between a master device (30) and a slave device (20). The interface includes a bitserial bidirectional signal line (10A) for conveying commands and associated data from the master device to the slave device,and for conveying a reset signal, an interrupt signal, and a learning sequence signal for specifying a duration of a bit time fordata transferred from the slave device to the master device. The bit serial bidirectional signal line further indicates an accessorydevice connected/disconnected state to the master device. MainClaim: An interface between a master device and a slave device, said interface comprising a bit serial bidirectional signalline for conveying commands and associated data from said master device to said slave device, said bit serial bidirectional signalline further conveying other signals, said other signals comprising a reset signal, an interrupt signal, and a learning sequencesignal for specifying a duration of a bit time for data transferred from said slave device to said master device, where saidinterface comprises, in said slave device, an Accessory Control Interface chip and an oscillator providing a clock signal to saidAccessory Control Interface chip, where the bit time is a multiple of the clock signal, and where said master device adapts thesampling of the data transferred from said slave device in accordance with the specified duration of the bit time.

5,651,126 Method and apparatus for reducing transitions on computer signal lines


Bailey; Robert | Howard; Brian D. | Johnson; Michael D.

711 G06F 19920626 0 100%

Abstract: A method and apparatus for eliminating unnecessary address transitions on an DRAM address bus and DRAM writeenable line. In a known DRAM controller and DRAM array, all address transitions on the CPU address bus are mirrored byaddress transitions on the DRAM address bus. The present invention eliminates all address transitions not associated with anactual DRAM access cycle by eliminating the DRAM controller's address multiplexer and replacing it with a multiplexing drivercircuit and a bus holder circuit. In a similar fashion, a DRAM write enable circuit eliminates all transitions on the DRAM writeenable line that are not associated with actual DRAM access cycles. Although specifically discussed in terms of a DRAM array andits associated circuitry, the portion of the present invention that reduces address transitions on the DRAM address lines could beused in any device currently using a multiplexer. MainClaim: In a computer system comprising a processor, a memory controller coupled to the processor by a read/write lineand a processor address bus including row and column address lines, a memory unit coupled to the memory controller by amemory address bus and memory read/write line, the memory controller having a circuit for eliminating unnecessary transitionson the memory address bus and memory read/write line, the circuit comprising:

first means for reducing memory address bus transitions, said first means being coupled to the memory address bus and theprocessor address bus for maintaining a value previously driven on the memory address bus while tri-stating the memory controller until the processor initiates a subsequent memory read/write operation, said first means further comprising:

a plurality of pairs of row and column inverter means, the row and column inverter means each having an input and an output,the number of pairs being equal to a number of bits in the memory address bus, the inputs of the row and column invertermeans being coupled respectively to the row and column address lines in the processor address bus, each row inverter beingcontrolled by a row address enable signal and each column inverter being controlled by a column address enable signal;

a plurality of output inverter means, each output inverter means having an input and an output, the inputs of each outputinverter means being coupled to the outputs of a pair of row and column inverter means and the outputs of the output invertermeans forming the memory address bus; and

www.patentics.com


a plurality of bus holder circuit means, one bus holder circuit means being coupled to the outputs of a pair of row and columninverter means, for maintaining an output driven by one of the pair of row and column inverter means, said each bus holdercircuit means comprising:

a first P-channel transistor with a gate, source, and drain;

a first N-channel transistor with a gate, source and drain; and

a bus inverter means with an input and output, the gates of the N-channel and P-channel transistors being coupled together and to the output of the inverter means, the drain of the P-channel transistor and the drain of the N-channel transistor being coupled to the input of the inverter means, the source of the P-channel transistor being coupled to a source of positive voltage and thesource of the N-channel transistor being coupled to a ground voltage potential, said input of the bus inverter means beingcoupled to the outputs of the pair of row and column inverter means and being further coupled to the input of the outputinverter means; and

second means for reducing write enable line transition, said second means being coupled to the memory write enable line andthe processor read/write line for maintaining a value on a memory write enable line until the processor initiates a subsequentmemory read/write operation.

5,890,005



Lindholm; Rune 713 H03K 19970602 3 92%

Abstract: A method is disclosed for reducing the power consumption of an electronic system, such as a wireless or cellulartelephone, that has a memory and a device for accessing the memory. The method includes the steps of (a)during a first part ofa memory access cycle, applying an address over a bus; (b) during a second part of the memory access cycle, transferring datato or from the memory over at least a portion of the bus; and (c) prior to the step of transferring, selectively inverting or notinverting the data so as to minimize a number of bus signal lines that are required to change state between the first part andthe second part of the memory access cycle. In a preferred embodiment of the invention the bus is a multiplexed address/databus. The method also generates a control signal that is transmitted to the bus for informing a receiving device that the data (oraddress) being transferred over the multiplexed address/data bus should be inverted before use. Also disclosed is a memorythat operates in a burst mode by incrementing or decrementing memory addresses using a clock signal, and that operates withthe power saving circuitry to selectively invert or not invert burst mode data read from or written to the memory. MainClaim: A method for reducing the power consumption of an electronic system having a first device and a second devicethat are coupled together through a bidirectional bus, comprising the steps of:




5,408,622

Apparatus and method for emulation routine control transfer via host jump instruction creation and insertion


Abstract: An apparatus for emulation routine control transfer creates a jump host instruction (JHI) containing the address of anext emulation routine during the execution of a current emulation routine and outputs the JHI at the end of current emulationroutine for transfer of host processor control. The apparatus preferably comprises: an emulated program counter (EPC), asumming means, a state machine, a pointer storage means, an opcode storage means, and a jump instruction circuit. The statemachine is preferably coupled to control the loading of the EPC, the loading of the opcode storage means, the summing means,the pointer storage means and the operation of the jump instruction circuit. The pointer storage means is preferably coupledbetween the data bus and the jump instruction circuit. The state machine preferably issues commands on the control bus anddirectly to the summing means and the jump instruction circuit to prefetch the next emulation routine, create a jump instructionto the beginning of the next emulation routine and assert the jump instruction on the bus at the appropriate time to transferdirectly from one emulation routine to the next using the single host jump instruction. The jump host instruction is placed uponthe host processor's instruction bus after execution of the final instruction within a current emulation routine. Thus, theexecution of the next emulation routine begins immediately after the execution of the jump host instruction, and significantamounts of processing time associated with the dispatch loop are eliminated. MainClaim: An apparatus for emulation routine control transfer via host jump instruction creation and insertion, said apparatusfor transferring control between a currently executing emulation routine and a next emulation routine on a host computersystem having a central processing unit and a memory coupled by a control bus, a data bus, and an address bus, eachemulation routine having a starting address corresponding to a first host instruction to be executed within the emulation routine,said apparatus comprising:

an emulated program counter having a control input, a load input, and an output, for storing an address of a next sourceinstruction to be emulated, said emulated program counter storing data from the data bus in response to a first signal on thecontrol input of said emulated program counter, the control input of said emulated program counter coupled to the control bus,the load input of said emulated program counter coupled to the data bus, and the output of said emulated program countercoupled to the address bus;

www.patentics.com


a pointer storage means having a control input, a data input, and a data output, for storing a pointer to the next emulationroutine in response to a second signal on the control input of said pointer storage means, the control input of said pointerstorage means coupled to the control bus, the data input of said pointer storage means coupled to the data bus;

a jump instruction circuit having a control input, an address input, a data input, an offset input, and an instruction output forcreating a jump instruction to the starting address of the next emulation routine, the control input of said jump instructioncircuit coupled to the control bus, the address input of said jump instruction circuit coupled to an instruction address bus, thedata input of said jump instruction circuit coupled to the data output of said pointer storage means, and the instruction output ofsaid jump instruction circuit coupled to an instruction bus; and

a state machine having a control input, an increment input, an address input, an increment output, a control output, and anoffset output, for detecting when said emulated program counter has been updated, for monitoring addresses used by the hostcomputer system, and for controlling the retrieval of a pointer to the next emulation routine to be executed from the memory,the storage of the pointer in said pointer storage means, the creation of the jump instruction, and the assertion of the jumpinstruction onto the instruction bus after a final host instruction in the currently executing emulation routine has been executed,the control input and the control output of said state machine coupled to the control bus, the increment input of said statemachine coupled to the address bus, the address input of said state machine coupled to the instruction address bus, theincrement output of said state machine coupled to the data bus, and the offset output of said state machine coupled to theoffset input of said jump instruction circuit.



710 G06F 20010430 5 94%






5,574,887 Apparatus and method for emulation routine pointer prefetch


Abstract: An apparatus and method for emulation routine pointer prefetch are disclosed. The apparatus includes an emulatedprogram counter (EPC), a prefetch state machine, a summing device, an opcode storage device, and a pointer storage device.The EPC, opcode storage device and pointer storage device are coupled to a bus to receive, store and output an emulatedprogram counter value, an opcode value and a pointer to a next emulation routine. The EPC, opcode storage device, and pointerstorage device are controlled by the prefetch state machine, which also is coupled to the bus to detect a reference to a reservedmemory address and stores an updated emulated program counter value in the EPC using the summing device. The prefetchstate machine uses the EPC value to prefetch the next source instruction to be emulated in a first memory operation. A portionof the prefetched source instruction is the opcode value and is stored in the opcode storage device. The prefetch state machineuses the opcode value in a second memory operation to retrieve a pointer to a corresponding emulation routine which is storedin the pointer storage device. The method for emulation routine pointer prefetch preferably comprises the steps of determining ifa currently executing emulation routine has issued an instruction to update the EPC; prefetching a next source instruction basedupon the value of the EPC; and using an opcode within the prefetched source instruction to prefetch a pointer to a nextemulation routine corresponding to the prefetched source instruction. MainClaim: An apparatus for retrieving and storing a pointer to a next emulation routine during execution of a currentemulation routine in a computer system having a central processing unit and a memory coupled by a control bus, a data bus,and an address, said apparatus comprising:

an emulated program counter having a control input, a load input, and an output, for storing an address of a next sourceinstruction to be emulated, the emulated program counter storing data on the data bus in response to a first signal on thecontrol input of the emulated program counter, the control input of the emulated program counter coupled to the control bus,the load input of the emulated program counter coupled to the data bus, and the output of the emulated program countercoupled to the address bus;

a pointer storage means having a control input, a data input, and a data output, for storing a pointer to the next emulationroutine in response to a second signal on the control input of the pointer storage means, the control input of the pointer storagemeans coupled to the control bus, the data input of the pointer storage means coupled to the data bus, and the data output ofthe pointer storage means coupled to the data bus; and

a prefetch state machine having a control input, an increment input, an increment output, and a control output, for detectingwhen the emulated program counter has been updated, retrieving a pointer to the next emulation routine to be executed fromthe memory and storing the pointer in the pointer storage means, the control input of the prefetch state machine coupled to thecontrol bus, the increment input of the prefetch state machine coupled to the address bus, and the control output of the prefetchstate machine coupled to the control bus.



710 G06F 20010430 5 93%

www.patentics.com







5,548,780

Method for semaphore communication between incompatible bus locking architectures

Apple Computer, Inc. Krein; William T. 710 G06F 19940721 0 100%

Abstract: A semaphore method establishes exclusive access transactions between source and destination nodes in a multiplebus computer system, independent of the bus locking architectures of the component buses. An atomic transaction is selectedfor each bus protocol to mediate exclusive access transactions involving the corresponding bus, and bridges coupling differentpairs of buses monitor these buses for the selected atomic transactions. A source node on one bus (the source bus) initiates anexclusive access transaction to a destination node by launching the selected atomic transaction appropriate for the source bus tothe destination node. When the path between the source and the destination nodes requires transit of more than one bus, eachbridge that couples a pair of buses in the path detects an incoming atomic transaction on one of these buses and launches anoutgoing atomic transactions appropriate for the other bus to the destination node. In this way, the atomic transaction initiatedby the source node to establish an exclusive transaction with the destination node is coupled through the buses of the system bya series of selected atomic transactions. Since each bus supports at least one atomic transaction, the semaphore methodoperates effectively, independent of the bus locking architectures of the buses. MainClaim: A computer implemented method for granting a source node on a first bus exclusive access to a destination nodeon a second bus that is coupled to the first bus, the method comprising the steps of:

monitoring the first bus to detect a first selected atomic transaction launched by the source node to the destination node;

launching a second selected atomic transaction to the destination node on the second bus in response to detecting the firstselected atomic transaction;

coupling to the source node a value read from the destination node in response to receipt of the second selected atomictransaction at the destination node;

writing a first preselected value to the destination node in response to receipt of the second selected atomic transaction at thedestination node, the first preselected value being effective to prevent another source node from gaining access to thedestination node; and

granting ownership of the destination node to the source node if the value coupled to the source node from the destination nodeis a second preselected value.

7,293,119

DMA data transfer between low-overhead processor and connected external circuitry using transactions log

Nokia Corporation Beale; John 710 G06F 20011227 2 92%

Abstract: The present invention relates to a method and system for performing a data transfer between a shared memory (16)of a processor device (10) and a circuitry (20) connected to the processor device (10), wherein the data transfer is performedby triggering a DMA transfer of the data to the processor device, adding the DMA transfer to a transaction log, and providing thetransaction log to the processor device, when the transaction log has reached a predetermined depth limit. The processor deviceis then informed of the DMA transfer of the transaction log, so as to be able to validate the transferred data. Thereby, significantbackground data movement can be provided without introducing high core overheads at the processor device (10). MainClaim: A method comprising: performing a data transfer between a memory of a processor device and a circuitryconnected to said processor device, wherein said performing comprises setting up at said circuitry a direct memory access fortransferring data; triggering at said circuitry a direct memory access transfer of said data to said processor device; adding insaid circuitry said direct memory access transfer to a transaction log; providing said transaction log from said circuitry to saidprocessor device, when said transaction log has reached a predetermined limit; and informing said processor device of theavailability of said transaction log.

6,148,376

Method and apparatus for an improved stack arrangement and operations thereon

Apple Computer, Inc. Claassen; Stuart L. 711 G06F 19960930 0 100%

Abstract: An apparatus and method for an improved stack comprises an advantageous indexing scheme and stack arrangementallowing more efficient performance of stack operations. The most-recently-used stack item appears at the top of the stack and the least-recently-used item is at the bottom of the stack. Values in between the top and bottom items are ordered from top tobottom with succeedingly less recently used items. An indexing scheme is used to indirectly reference locations of the stackitems in the stack. A set of registers is used to reference the locations of the stack items in an embedded memory array. Theregisters function as pointers to the memory array locations. To promote an item to the top of the stack, the item is identified asthe most-recently-used and the contents of the other registers are changed to specify the new locations, e.g. these pointers areshifted down one. Similarly, to insert a new item on to the top of the stack, the pointers are shifted and a new item is written

www.patentics.com


into the memory array location that contains the least-recently-used item. MainClaim: An apparatus for an MRU stack, said apparatus directly or indirectly connected to a stack search requesting unit,stack search requesting unit specifying a command and a data value to said MRU stack, said apparatus comprising:

means for receiving a command;

means for receiving a data value;

a stack data module for storing one or more stack data values, said stack data module being coupled to said data valuereceiving means for receiving a data value as input;

a stack pointer module for referencing stack data values stored in said stack data module, said stack pointer module beingcoupled to said stack data module to provide as input a reference to one or more stack data values, said stack pointer moduleincluding a set of data multiplexers, including one or more multiplexers, a set of registers, including one or more registerswherein an MRU register specifies, either directly or indirectly, a location of a most-recently-used stack data value and an LRU register specifies, either directly or indirectly, a location of a least-recently-used stack data value, and an address multiplexer, said data multiplexers and registers configured such that for each register in the set of registers, there is a correspondingmultiplexer in the set of data multiplexers, said corresponding multiplexer arranged and coupled to its corresponding register toreceive one or more inputs and provide an output to the corresponding register, the registers in said set of registers arrangedand interconnected by the multiplexers such that data values are specified from a most-recently-used data value down to a least-recently-used data value; and

a stack control module for the MRU stack, said stack control module being coupled to said command receiving means forreceiving a command as input and further being arranged to transmit an output to the stack search requesting unit, said stackcontrol module further being coupled to said stack pointer module to provide operational control of the stack pointer modulefunctions, said stack control module further being coupled to said stack data module to provide control of the accessing of datato and from the stack data module and to receive as input a stack data value, said stack control module further being coupled tosaid data value receiving means for receiving a data value as input.

6,721,867 Memory processing in a microprocessor


Launiainen; Aki 711 G06F 20020419 2 92%

Abstract: The invention relates to memory processing in a microprocessor. The microprocessor comprises a memory indicatedby means of alignment boundaries for storing data, at least one register for storing data used during calculation, memoryaddressing means for indicating the memory by means of the alignment boundaries and for transferring data between thememory and the register, and a hardware shift register, which can be shifted with the accuracy of one bit, and which comprisesa data loading zone and a guard zone. The memory addressing means transfer data including a memory addressing whichcannot be fitted into the alignment boundary between the memory and the register through the data loading zone in thehardware shift register, and the hardware shift register is arranged to process data using shifts and utilizing the guard zone. MainClaim: A microprocessor comprising

a memory indicated by means of alignment boundaries for storing data,

at least one register for storing data used during calculation,

memory addressing means for indicating the memory by means of the alignment boundaries and for transferring data betweenthe memory and the register, and

a hardware shift register, which can be shifted with the accuracy of one bit, and which comprises a data loading zone and aguard zone,

and the memory addressing means transfer data including a memory addressing which cannot be fitted into the alignmentboundary between the memory and the register through the data loading zone in the hardware shift register, and the hardwareshift register is arranged to process data using shifts and utilizing the guard zone.

5,640,599

Interconnect system initiating data transfer over launch bus at source's clock speed and transfering data over data path at receiver's clock speed


Roskowski; Steven G. | Drako; Dean M. | Krein; William T.

710 G06F 19940318 0 100%

Abstract: A computer interconnect including a plurality of nodes, each node capable of joining to a component of a computer,each node including apparatus for transferring signals between the component and the node, apparatus for storing packets ofdata, apparatus for signalling each other node that a packet of data exists for transfer to a component associated with thatnode, apparatus for sensing signals from another node indicating that a packet of data exists for transfer to a componentassociated with that node, and apparatus for transferring packets of data stored at one node to the apparatus for transferringsignals between the component and the node of another node. MainClaim: In a computer system having a first component and a second component, a computer interconnect for transferringpackets of data between the first and second components, the computer interconnect comprising:

a first launch bus;

a first node coupled to the first component;

a second node coupled to the second component, wherein

www.patentics.com


the first node includes:

a first buffer coupled to the first component for storing a first data packet received from the first component;

a first router coupled to the first launch bus and the first component, the first router for storing a first header associated withthe first data packet, the first router for transferring the first header to the second node via the first launch bus at a first clockspeed of the first component, the first header indicating that the first data packet exists for transfer to the second node;

a first data path coupled to the first buffer and the second node for transferring the first data packet from the first buffer to thesecond node at a second clock speed of the second component.

2006/0184710

Bridge between a single channel high speed bus and a multiple channel low speed bus

Nokia Inc.

Valdivia; David A. | Karuppampalayam; Jayagopal | Lappin; James B. JR.

710 G06F 20050217 2 92%

Abstract: An apparatus for enabling communication between components in a network device includes a network processorproviding data signals based on a PLx format; a multiport I/O controller having an IX bus interface and a plurality of MAC layerinterfaces; and a bridge for bi-directionally converting the streaming data from the network processor to the I/O controller. MainClaim: An apparatus for enabling communication between components in a network device, comprising: a networkprocessor providing data signals based on a PLx format; a multiport I/O controller having an IX bus interface and a plurality ofMAC layer interfaces; and a bridge for bi-directionally converting the streaming data from the network processor to the I/Ocontroller.

6,654,811 Backpressure arrangement in client-server environment

Nokia Inc.

Chaskar; Hemant M. | Ravikanth; Rayadurgam | Said; Inas | Vaananen; Pasi | Dimitrou; Eleftherios | Turkia; Mikko

709 G06F 20000413 2 92%

Abstract: A line interface card apparatus includes: a packet queue memory for storing packets; a physical layer having first andsecond buffers, the physical layer being connected to the packet queue memory by a data bus and being connected to a pluralityof links; and a queue manager connected to the packet queue memory and to the physical layer by a control bus. Upon one ofthe plurality of links transmitting a request for data packets to the physical layer, the physical layer transmits the request viathe control bus to the queue manager; the queue manager instructs the packet queue memory to transmit requested datapackets to the physical layer via the data bus; each data packet is transmitted from the packet queue memory to the physicallayer in one or more packet fragments which are stored in one of the first and second buffers, and upon all of the one or morepacket fragments of one data packet being stored in one of the first and second buffers, the data packet is transmitted to thelink transmitting the request for data packets. MainClaim: A line interface card apparatus comprising:

a data bus;

a control bus;

a packet queue memory for storing a plurality of data packets;

a physical layer having first and second buffers, said physical layer being connected to said packet queue memory by said databus and being adapted to be connected to a plurality of links to transmit data from said first and second physical layer bufferson the links;

a queue manager connected to said packet queue memory and to said physical layer by said control bus;

wherein, said queue manager is responsive to said physical layer transmitting to said queue manager via said control bus, arequest for a first particular data packet, by instructing said packet queue memory to transfer the first particular data packet tosaid physical layer via said data bus, the first particular data packet being transferred from said packet queue memory to saidphysical layer in one or more packet fragments, the packet fragments being stored in one of said first and second buffers fortransmission on the certain link, and upon the last fragment of the first particular data packet being transferred to the certainlink said queue manager locates a new packet to be transferred to a link in response to a further request.

7,107,471 Method and apparatus for saving power in pipelined processors

Apple Computer, Inc. Feierbach; Gary F. 713 G06F 20010321 0 100%

Abstract: Techniques for reducing power consumption in pipelined processors are described. As a method, one embodiment ofthe present invention reduces power requirements in a piplelined processor by evaluating instructions to be executed todetermine the operation type of the instructions, producing activity indicators based upon the operation types of theinstructions, and controlling the supply of current to each of the stages such that only selected stages draw current from apower supply. MainClaim: A microprocessor that operates in a manner that conserves power, the microprocessor comprising: an instructionregister for temporarily storing a next instruction to be executed; an instruction evaluation unit that is connected to saidinstruction register such that said instruction evaluation unit receives said next instruction from said instruction register, saidinstruction evaluation unit being configured to evaluate said next instruction in order to produce activity indicators by reading anoperation type from the instruction and providing an associated signal comprising one of a clock marker or a no-clock marker based upon the operation types of said instructions; a functional unit for executing instructions, said functional unit having aplurality of stages, each of said stages capable of being separately activated or deactivated based upon a respective activityindicator, where said stages of said functional unit are arranged in series; a memory unit for receiving and registering outputs

www.patentics.com


from the functional unit wherein the amount of time required to register an output from the functional unit comprises time Tr; a

stage activation controller that is connected to said instruction evaluation unit and includes logic gates that utilize said activityindicators in conjunction with a stage activation controller clock pulse CSR to determine which of said stages are to be activated

or deactivated and wherein the signal comprising one of a clock marker or a no-clock marker is advanced through a shift register of the stage activation controller such that it takes time Tg to advance each signal comprising one of a clock marker or a

no-clock marker a shift register in the stage activation controller; a clock circuit that supplies the stage activation controllerclock pulse CSR to said stage activation controller and also provides a functional unit clock pulse CFU to said functional unit

wherein the clock pulse CFU is subject to a gate delay of time Tg, and wherein said functional unit clock pulse CFU is time-

delayed with respect to said stage activation controller clock pulse CSR by an amount of time greater than the sum of times Tg,

Tr, and Tg thereby enabling the respective stage of the functional unit to have its power status adjusted depending the

requirements of the instruction entering said respective stage of the functional unit.

2003/0070105

Method for controlling the operation of a processor, and a processor

Nokia Corporation Launiainen, Aki 713 G06F 20021004 1 92%

Abstract: The invention relates to a method for controlling the operation of a processor. The processor comprises a core, two ormore functional blocks, and decoder arranged to decode of instruction words included in the program code, to be run in one ormore of said functional blocks. At least one of said functional blocks is provided with at least two different modes. The mode ofat least one of said functional blocks is set in one of said at least two modes at a time. The instruction word is used to transferinformation about whether the instruction word pertains to mode setting. Instruction words included in the program code areprocessed in at least a first decoding step and a second decoding step, wherein in the first decoding step, said informationincluded in the instruction word is examined. On the basis of the examination, it is determined whether the mode of one or moreof said functional blocks is to be set or whether the second decoding step is to be taken, in which the instruction word isdecoded to be run by one or more of said functional blocks. The invention also relates to a processor and an electronic device, inwhich the method can be implemented. The invention further relates to a program, in which a program code is provided forimplementing the method. MainClaim: A method for controlling the operation of a processor (1), which processor comprises a core, two or more functionalblocks;, decoder arranged to decode instruction words included in the program code, to be run in one or more of said functionalblocks, at least one of said functional blocks being provided with at least two different modes, and the mode of at least one ofsaid functional blocks being set to one of said at least two modes at a time, wherein the instruction word is used for transmittinginformation about whether it is an instruction word relating to the setting of a mode, and that instruction words included in theprogram code are processed in at least a first decoding step and a second decoding step, wherein in the first decoding step, saidinformation attached to the instruction is examined, and after the examination, it is determined whether a mode of one or moreof said functional blocks is to be set or whether the second decoding step is to be taken, to decode the instruction word to berun by one or more of said functional blocks.

7,114,089

System for controlling operation of a processor based on information contained within instruction word

Nokia Corporation Launiainen; Aki 713 G06F 20021004 1 92%

Abstract: An instruction word is used to transfer information about whether the instruction word pertains to mode setting of afunctional block. Instruction words included in the program code are processed in at least a first decoding step and a seconddecoding step, wherein in the first decoding step, said information included in the instruction word is examined. On the basis ofthe examination, it is determined whether the mode of one or more functional blocks is to be set or whether the seconddecoding step is to be taken, in which the instruction word is decoded to be run by one or more of said functional blocks. Theinvention also relates to a processor and an electronic device, in which the method can be implemented. The invention furtherrelates to a program, in which a program code is provided for implementing the method. MainClaim: A method for controlling the-operation of a processor, the processor comprising a core, two or more functionalblocks, a decoder for decoding instruction words included in a program code to be run in one or more of said functional blocks,at least one of said functional blocks being provided with at least two different modes, and the mode of at least one of saidfunctional blocks being set to one of said at least two modes at a time, the method comprising: transmitting an instruction wordcontaining information about whether it is an instruction word relating to setting of a mode, and processing instruction wordsincluded in the program code in at least a first decoding in a first decoding block and a second decoding in a second decodingblock, wherein the first decoding comprises: examining said information contained within the instruction word, and after theexamination, determining whether a mode of one or more of said functional blocks is to be set or whether the second decodingis to be taken; wherein said second decoding comprises: decoding the instruction word; and executing the decoded instructionword by one or more of said functional blocks.

5,671,446

Method and apparatus for atomically accessing a queue in a memory structure where LIFO is converted to FIFO

Apple Computer, Inc.Rakity; Philip M. | Rustad; Mark D. 710 G06F 19950316 0 100%

Abstract: A method and apparatus for storing and retrieving data from a queue implemented on a computer system. A queuememory structure is allocated in a memory device, the queue including a a last-in-fast-out (LIFO) and a first-in-first-out (FIFO). A data element is atomically added to the LIFO when the data element is enqueued to the queue structure, and a data elementis atomically removed from the FIFO when the data element is to be dequeued from the queue, thus preventing concurrentprocesses from disordering the data in the queue. When the FIFO becomes empty, the LIFO is converted to a new FIFO, and thisnew FIFO is stored in place of the old (empty) FIFO. In one embodiment, a lock is set and the LIFO is converted to a new FIFOonly when the lock is previously determined to be clear to prevent additional dequeuers from interrupting a dequeuing process.A high-priority data element can be atomically added to a head list that stores the data element at the front of the queuememory structure. The present invention allows multiple enqueuers and dequeuers on one or more processing elements,including interrupt handlers and other programs, to access the queue without altering interrupt levels and without risk ofdeadlock. MainClaim: A method for storing and retrieving data from a queue implemented on a computer system, the methodcomprising:

www.patentics.com


(a) allocating a queue memory structure in a memory device, said memory structure having a last-in-first-out list (LIFO) and a first-in-first-out list (FIFO);

(b) atomically adding a data element to said LIFO when said data element is enqueued to said queue memory structure;

(c) atomically removing a data element from said FIFO when said data element is to be dequeued from said queue memorystructure; and

(d) converting said LIFO to a new FIFO and storing said new FIFO as said FIFO when said FIFO is empty.

2009/0106500

Method and Apparatus for Managing Buffers in a Data Processing System

Nokia Siemens Networks GmbH & Co. KG

Hazay; Alon 711 G06F 20081229 1 93%

Abstract: A buffer management for a data processing system is provided. According to one embodiment, a method formanaging buffers in a telephony device is provided. The method comprising providing a plurality of buffers stored in a memory,providing a cache having a pointer pointing to the buffer, scanning the cache to determine if the cache is full, and when the scandetermines the cache is not full determining a free buffer from the plurality of buffers, generating a pointer for the free buffer,and placing the generated pointer into the cache. MainClaim: A method for managing buffers in a telephony device, comprising:providing a plurality of buffers stored in amemory;providing a cache having a pointer pointing to the buffer;scanning the cache to determine if the cache is full; andwhenthe scan determines the cache is not fulldetermining a free buffer from the plurality of buffers,generating a pointer for the freebuffer, andplacing the generated pointer into the cache.

5,727,233

Byte-mode and burst-mode data transfer mechanism for a high-speed serial interface

Apple Computer, Inc.Lynch; John | Nichols; James B. 710 G06F 19940802 0 100%

Abstract: A data transfer mechanism for a serial interface is provided whereby data transfer may be precisely controlled,eliminating the need for significant buffering. The data transfer mechanism also provides for flexible data transfer in either abyte mode or a burst mode so as to accommodate any of various telecommunications devices having a range of capabilities anddata rates, and minimizes host involvement in the data transfer operation. MainClaim: In a computer system having a memory including a direct memory access buffer area, and having a direct memoryaccess controller and a serial communications controller connected to a serial port, a method in which one of a firsttelecommunications device and a second telecommunications device produces a transmit handshake signal to control transfer oftransmit data from the memory to said one of the first telecommunications device and the second telecommunications deviceacross a serial link that carries the transmit handshake signal, the method comprising the steps of:

when the first telecommunication device is connected to the serial port:

a) the first telecommunications device asserting the transmit handshake signal;

b) the serial communications controller serially transmitting a unit of transmit data to the first telecommunications device acrossthe serial link;

c) the serial communications controller requesting a data unit from the direct memory access controller;

d) the direct memory access controller transferring a data unit to the serial communications controller;

e) the first telecommunication device de-asserting the transmit handshake signal; and

f) repeating steps a) through e);

whereby transfer of data is controlled by the first telecommunications device on a data-unit-by-data-unit basis; and

when the second telecommunications device is connected to the serial port:

g) the second telecommunications device asserting the transmit handshake signal;

h) the serial communications controller serially transmitting a unit of transmit data to the second telecommunications deviceacross the serial link;

i) the serial communications controller requesting a data unit from the direct memory access controller;

j) the direct memory access controller transferring a data unit to the serial communications controller; and

k) repeating steps h) through j) until the second telecommunications device de-asserts the transmit handshake signal;

whereby transfer of data is controlled by the second telecommunications device on a data burst basis.

2006/0004936 Bridge for enabling communication between a FIFO interface and a PL3 bus for a network

Nokia Inc.Karuppampalayam; Jayagopal | Lappin; James B. JR. | Messavussu;

710 G06F 20040630 1 92%

www.patentics.com


processor and an I/O card

Adote K.

Abstract: A bridge for converting a relatively high speed communication interfaces provided by a network processor intoanother type of relatively high speed interface that is supported by an I/O card in a network device. A proprietary high speedcommunication interface can be a first-in-first-out (FIFO) streaming data interface. The other type of high speed interfacesupported by an I/O card can be PL3, PL4, SPI 3, SPI 4, and the like. The network devices can include, routers, switches,firewalls, gateways, and the like. The bridge can be configured as an application specific integrated circuit (ASIC). MainClaim: An apparatus for enabling high speed communication between components in a network device, comprising: anetwork processor having a proprietary high speed FIFO interface for communicating streaming data regarding at least one linkon a network; a bridge for bi-directionally converting the streaming data from the proprietary high speed FIFO interface intodata signals based on a PLX format; and an I/O card that is in communication with the network processor through the datasignals provided in the PLX format.

5,001,662 Method and apparatus for multi-gauge computation

Apple Computer, Inc. Baum; Allen J. 708 G06F 19890428 0 100%

Abstract: Methods and apparatus are provided for performing multi-gauge arithmetic operations in a microprocessor CPU. Special purpose instructions facilitate parallel processing of individual bytes or half words of data words without requiring thatthe processor's mode be separately controlled. A byte/half word mode flag is provided to control the "width" of narrow gaugeoperation. Add partial, substract partial and compare partial instructions operate on corresponding bytes or half words of twooperands and return independent byte or half word results. Multiply partial instructions multiply byte or half word multiplicandsby a common multiplier and return independent byte or half word products. The multi-gauge arithmetic operations of the present invention have particular application to graphics processing where repetitive operations are performed on large arrays ofpixel data. MainClaim: In a digital computer, a method for selectively performing a plurality of arithmetic operations in parallel comprisingthe steps of:

(a) providing a multiplying means for performing an M-bit multiplication and which is selectively partitioned into a plurality ofindependent sub-multiplying means, each such sub-multiplying means for performing an N-bit multiplication where M and N are integers, with M being greater than N;

(b) providing a plurality of independent sign extension logic means individually associated with said plurality of independent sub-multiplying means;

(c) selectively enabling said plurality of independent sign extension logic means when said multiplying means is partitioned intosaid plurality of independent sub-multiplying means;

(d) providing a first register means for storing a multiplier;

(e) providing a second register means for storing an M-bit word representing a plurality of N-bit multiplicands;

(f) asserting said plurality of N-bit multiplicands at said multiplying means;

(g) asserting said multiplier at said multiplying means;

(h) computing a plurality of independent products of said respective plurality of multiplicands and said multiplier;

(i) truncating each of said plurality of independent products to an N-bit result; and

(j) concatenating said plurality of N-bit results into an M-bit word.

6,721,867 Memory processing in a microprocessor

Nokia Mobile Phones, Ltd. Launiainen; Aki 711 G06F 20020419 2 93%

Abstract: The invention relates to memory processing in a microprocessor. The microprocessor comprises a memory indicatedby means of alignment boundaries for storing data, at least one register for storing data used during calculation, memoryaddressing means for indicating the memory by means of the alignment boundaries and for transferring data between thememory and the register, and a hardware shift register, which can be shifted with the accuracy of one bit, and which comprisesa data loading zone and a guard zone. The memory addressing means transfer data including a memory addressing whichcannot be fitted into the alignment boundary between the memory and the register through the data loading zone in thehardware shift register, and the hardware shift register is arranged to process data using shifts and utilizing the guard zone. MainClaim: A microprocessor comprising

a memory indicated by means of alignment boundaries for storing data,

at least one register for storing data used during calculation,

memory addressing means for indicating the memory by means of the alignment boundaries and for transferring data betweenthe memory and the register, and

a hardware shift register, which can be shifted with the accuracy of one bit, and which comprises a data loading zone and aguard zone,

and the memory addressing means transfer data including a memory addressing which cannot be fitted into the alignmentboundary between the memory and the register through the data loading zone in the hardware shift register, and the hardware

www.patentics.com


shift register is arranged to process data using shifts and utilizing the guard zone.

5,796,989

Method and system for increasing cache efficiency during emulation through operation code organization

Apple Computer, Inc. Morley; John E. | Himelstein; Mark I.

703 G06F 19970801 0 100%

Abstract: An emulation system contains reorganized instruction code sequences for a computer, so that the native code whichis used to emulate instructions that occur most frequently in a typical environment are grouped together, to thereby minimizeinstruction cache conflicts. A representative set of programs which operate with the emulated code are run, and statistics arerecorded to determine the most frequently occurring emulated instructions. The native code which emulates these mostfrequently occurring instructions is then arranged so that the portions of the code are statically stored in main memory atconsecutive memory locations. As a result, when the native code for a frequently occurring emulated instruction is loaded fromthe memory into the cache, the likelihood that the cache will contain the native code for subsequent emulated instructions ismaximized, and the likelihood of cache conflicts is minimized. MainClaim: In a computer having a processor which executes instructions in a first instruction set, a main memory, a cachememory, and an emulation program for emulating the operation of a processor which executes instructions from a second,different instruction set, a method for increasing the efficiency of operation of the computer while said emulation program isrunning, comprising the steps of:

running an emulated program on said computer which is designed to operate with said second instruction set, and executingcommands issued by said emulated program through said emulation program;

identifying the instructions from said first instruction set which are executed the most number of times when said emulatedprogram is running;

storing said identified instructions in said main memory at neighboring address locations that are sufficiently close to oneanother; and

loading said identified instructions into the cache memory such that a predetermined number of said identified instructions aresimultaneously stored in the cache memory, wherein said predetermined number is equal to the smallest number of entries thatare transferred from the main memory to the cache memory at one time.

7,543,127 Computer system Nokia Corporation Kajihara; Masao 711 G06F 20060124 1 92%

Abstract: A technology for allowing the smooth acquisition of required data when a processor switches working modes in acomputer system is provided. According to one aspect of the present invention, the present invention can provide a computersystem including a processor having a plurality of working modes, each having a different privilege level from each other; anexclusive memory area related to a selected one of said plurality of working modes; and a connecting means for connecting saidprocessor with said exclusive memory, depending on said working mode. MainClaim: A computer system comprising: a processor comprising a first working mode, and a second working mode having adifferent privilege level from said first working mode; a first instruction cache memory area configurable to store programinstructions read from main memory and that is accessed by said processor during said first working mode, where theinstructions stored in the first instruction cache are the same as instructions stored in the main memory; a second instructioncache memory area configurable to store program instructions read from main memory and that is accessed by said processorduring said second working mode, where the instructions stored in the second instruction cache are the same as instructions inthe main memory; and circuitry configurable to respond to a current working mode to automatically select one of said firstinstruction cache memory area or said second instruction cache memory area to provide program instructions to be executed bysaid processor.

4,970,418

Programmable memory state machine for providing variable clocking to a multimode memory

Apple Computer, Inc.Masterson; Anthony D. 327 H03K 19890926 0 100%

Abstract: A circuit for providing control signals of selectable lengths capable of being driven off of either the rising or fallingedge of a clock pulse, the circuit comprising apparatus for providing signals indicating a mode of operation for access to a matrixof memory elements, apparatus responsive to the signals provided by the apparatus for providing signals indicating a mode ofoperation for providing signals indicating a clock period during which a control signal is to commence and the edge of the clocksignal at which such signal is to commence, and apparatus responsive to the signals provided by the apparatus for providingsignals indicating a mode of operation for providing signals indicating a clock period during which a control signal is to terminateand the edge of the clock signal at which such signal is to terminate. MainClaim: A circuit for providing control signals of selectable lengths capable of being driven off of either the rising or fallingedge of a clock pulse, the circuit comprising means for providing signals indicating a mode of operation for access to a matrix ofmemory elements, means responsive to the signals provided by the means for providing signals indicating a mode of operationfor providing signals indicating a clock period during which a control signal is to commence and the edge of the clock signal atwhich such signal is to commence, and means responsive to the signals provided by the means for providing signals indicating amode of operation for providing signals indicating a clock period during which a control signal is to terminate and the edge of theclock signal at which such signal is to terminate.

5,978,859

Implementation of timing between a microprocessor and its peripheral devices

Nokia Telecommunications Oy Sademaa; Juhani 710 G06F 19970513 1 93%

Abstract: A method and a circuit arrangement for implementing timing between a microprocessor and its peripheral devices. Anaddress bus and a data bus connect the microprocessor to the peripheral devices to transfer data from the microprocessor to aselected peripheral device, corresponding to writing to the peripheral device, and from a selected peripheral device to themicroprocessor, corresponding to reading from the peripheral device. The method comprises generating to the peripheraldevices (a) a signal controlling reading (Output Enable), which enables a peripheral device to apply data to the data bus, and (b)a signal controlling writing (Write Enable), which enables data to be written from the data bus to a peripheral device. In order to

www.patentics.com


simplify the equipment and circuit design, at least the signal (GWE) controlling writing is generated by means of an addressdecoder from the address currently valid on the address bus in such a manner that the moments of the rising and/or fallingedges of the signal are dependent on the value of the address and at the same time independent, within the addressing cyclerelating to the peripheral device, of the timing determined by the microprocessor, whereby the assertion period of the signal canbe adjusted by means of the value of the address. MainClaim: A method for implementing a timing between a microprocessor and peripheral devices of a microprocessor system;

peripheral devices having individual timing requirements, and said microprocessor being interconnected with the peripheraldevices;

the microprocessor system having

an address bus and a data bus for transferring data from the microprocessor to a selected one of said peripheral devices tothereby write to the selected peripheral device, and for transferring data from a selected one of the peripheral devices to themicroprocessor to thereby read from the selected peripheral device, the address appearing on the address bus addressing theselected peripheral device; and

a circuit arrangement for implementing timing between the microprocessor and the peripheral devices, said circuit arrangementcomprising means

(a) for generating a reading control signal, which enables the selected peripheral device to apply data to the data bus, and

(b) for generating a writing control signal, which enables data to be written from the data us to the selected peripheral device,

providing said address to the address bus, said address addressing the selected peripheral device,

providing to the peripheral devices said reading control signal, which controls the reading of data from the selected peripheraldevice to the data bus,

providing to the peripheral devices the writing control signal which controls the writing of data from the data bus to the selectedperipheral device,

the writing control signal being generated by means of an address decoder in response to the address currently valid on theaddress bus in such a manner that the timing of the rising and/or falling edges of said writing control signal is selected accordingto said address and is at the same time independent, within an addressing cycle of the selected peripheral device, of the timingdetermined by the microprocessor, in order to meet the timing requirements of the peripheral device designated by saidaddress.

5,461,649

Method and apparatus for maintaining a state of a state machine during unstable clock conditions without clock delay

Apple Computer Inc.Bailey; Robert L. | Johnson; Mary B. 327 H03K 19940509 0 100%

Abstract: An apparatus and method for protecting the state of a state machine from an unstable clock signal. The apparatus ofone embodiment includes a state register having an input and a first output which provides an output signal corresponding tothe state of the state machine and a set or reset input coupled, through a logic circuit, to the first output. The logic circuit iscoupled to receive a signal indicating the unstable state of the clock signal. The logic circuit is coupled to receive a signalindicating the unstable state of the clock signal. The logic circuit feeds back the output from the first output to the set or resetinput to maintain the state in the state register while the clock signal is unstable. An embodiment of the method comprisesstoring a state in a state register, receiving a first signal indicating an unstable state of the clock signal and feeding back theoutput from the state register to the set or reset input while the first signal indicates the unstable clock exits. In an alternativeembodiment, the output from the state register is fed back to its input while the first signal indicates the unstable clock exits. MainClaim: An apparatus for maintaining a state during an unstable clock signal condition, said apparatus comprising:

a state register having a first input and an output which provides an output signal indicative of said state, a clock input coupledto receive a clock signal, and at least one of a second input and a third input; and

a logic circuit coupled to receive said output signal and a signal indicating an unstable state of said clock signal and coupled tosaid one of said second input and said third input, said logic circuit feeding back said output signal to said one of said secondinput and said third input to maintain said state while said clock signal is in said unstable state.

5,912,570

Application specific integrated circuit (ASIC) having improved reset deactivation

Nokia Mobile Phones Limited Kuusisto; Mika 327 H03L 19970108 1 95%

Abstract: Disclosed is a circuit and method for initializing clocked digital logic and for generating at least one clock signal for theclocked digital logic. The circuit includes at least one flip-flop that is responsive to a stimulus signal becoming active forasserting and then deasserting a reset signal to the clocked digital logic. The at least one flip-flop is clocked with a free-running clock signal. The circuit further includes a gating circuit for generating the at least one clock signal from the free running clocksignal, and an edge detector that has an input coupled to the at least one flip-flop and an output coupled to the gating circuit. The edge detector operates to cause the gating circuit to place the at least one clock signal into an inactive state at least oneperiod of the free running clock prior to the reset signal being deasserted, and for holding the at least one clock signal in theinactive state for at least one period of the free running clock subsequent to the reset signal being deasserted. In this manner itis guaranteed that no clock edges are applied to the clocked digital logic (e.g., flip-flops) for a predetermined period of time prior to and after the deassertion of the reset signal. The period of the free running clock signal is predetermined to exceed the

www.patentics.com


minimum setup and hold times for the flip-flops that comprise the clocked digital logic. MainClaim: A method for initializing clocked digital logic, comprising the steps of:

in response to a stimulus signal becoming active,

asserting an initialization signal and applying the asserted initialization signal to the clocked digital logic;

during the time that the initialization signal is asserted,

placing one or more clock signals into an inactive state to prevent an occurrence of rising or falling clock edges at inputs of theclocked digital logic;

deasserting the initialization signal; and

placing the one or more clock signals into an active state so as to cause rising and falling clock edges at the inputs of theclocked digital logic.

5,594,919 Method and system for reordering bytes in a data stream

Apple Computer, Inc.Turkowski; Kenneth E. 712 G06F 19950602 0 100%

Abstract: A method and system are disclosed for efficiently translating data from one known data sequencing arrangement toan alternative sequencing arrangement. The method consists of the steps of generating a source sequence signal whichidentifies the ordering of units within the source sequence, generating a destination sequence signal which identifies theordering of units within the destination sequence, and combining the source signal and destination signal to produce apermutation signal which defines the relationship between the source sequence and the destination sequence. Once thepermutation signal has been defined, this permutation signal is applied to the source sequence to allow the reordering of thesource sequence into the desired destination sequence. A reordering circuit is used to rearrange the source sequence units intothe desired destination sequence units utilizing the permutation signal generated in the present invention. The reordering circuitconsists of an array of ordered swap units which contain inputs for source sequence signals and permutation signals, andoutputs which propagate destination sequences. MainClaim: A computer implemented method for translating a source sequence of ordered data units into a destinationsequence having a different ordering of said data units, the method comprising the computer implemented steps of:

using machine-specific data unit packing parameters to generate a source sequence signal, ES, which identifies the ordering of

units within the source sequence;

using machine-specific data unit packing parameters to generate a destination sequence signal, ED, which identifies the ordering

of units within the destination sequence;

combining the source sequence signal and the destination sequence signal to produce a permutation signal, EP, according to the

formula:

EP =(ES XOR ED)AND(n-1)

where n is equal to the number of data units to be translated and is greater than two; and

reordering the units from the source sequence in response to the permutation signal to produce a translated destinationsequence.

6,563,440

Apparatus and method for decoding Huffman codes using leading one/zero string length detection

Nokia Corporation Kangas; Janne 341 H03M 20011019 4 92%

Abstract: Decoding Huffman codes is accomplished by identifying consecutive strings of high order ones or zeroes and followingconsecutive strings of high order ones or zeroes, retrieving a table entry for each string based on its run count and bit value,until the retrieved entry contains the decoding output symbol, or until the remaining bits of the code word number within apredetermined threshold. The remaining bits are used as an offset into a lookup table, but the dimensions of the table havebeen reduced through elimination of the leading ones and zeroes. The consecutive strings are preferably processed by ahardware accelerator to identify the repeated bit, count the bits in the string and return this information to the host processor.The efficiencies of decoding canonical codes are realized; yet, non-canonical codes can be decoded. MainClaim: A method for decoding a code word in a series of variable length code words comprising the steps of:

a) detecting the value of a bit in said code word;

b) calculating a current count that starts with said bit and includes, from said series of variable length code words, subsequent,consecutive bits of the same value;

c) based on the current count, retrieving an entry from a decoding table; and

d) based on the retrieved entry, determining whether steps a) through d) are to be repeated for said code word using bitssubsequent to those included in the one or more counts in step b).

Method and system for

www.patentics.com


5,524,256 reordering bytes in a data stream

Apple Computer, Inc. Turkowski; Kenneth E.

712 G06F 19930507 0 100%

Abstract: A method and system are disclosed for efficiently translating data from one known data sequencing arrangement toan alternative sequencing arrangement. The method consists of the steps of generating a source sequence signal whichidentifies the ordering of units within the source sequence, generating a destination sequence signal which identifies theordering of units within the destination sequence, and combining the source signal and destination signal to produce apermutation signal which defines the relationship between the source sequence and the destination sequence. Once thepermutation signal has been defined, this permutation signal is applied to the source sequence to allow the reordering of thesource sequence into the desired destination sequence. A reordering circuit is used to rearrange the source sequence units intothe desired destination sequence units utilizing the permutation signal generated in the present invention. The reordering circuitconsists of an array of ordered swap units which contain inputs for source sequence signals and permutation signals, andoutputs which propagate destination sequences. MainClaim: A computer implemented method for translating a source sequence of ordered data units into a destinationsequence having a different ordering of said data units, comprising the computer implemented steps of:

generating a source sequence signal, ES, which identifies the ordering of units within the source sequence;

generating a destination sequence signal, ED, which identifies the ordering of units within the destination sequence;

combining the source sequence signal and the destination sequence signal to produce a permutation signal, ES, according to the

formula:

EP =(ES XOR ED) AND (n-1)

where n is equal to the number of data units to be translated; and

reordering the units from the source sequence in response to the permutation signal to produce a translated destinationsequence, wherein the data unit is an eight-bit byte, and ES and ED are digital signals which are defined for source and

destination sequences, respectively, and are generated by adding together individual signal elements, wherein the individualsignal elements are determined from the following relationships:

(i) for bytes ordered within a WORD16, the signal element is equal to 01 hex when the ordering is little-endian;

(ii) for WORD16's ordered within a WORD32, the signal element is equal to 02 hex when the ordering is little-endian;

(iii) for WORD32's ordered within a WORD64, the signal element is equal to 04 hex when the ordering is little-endian;

(iv) for WORD64's ordered within a WORD128, the signal element is equal to 08 hex when the ordering is little-endian;

(v) for WORD 128's ordered within a WORD256, the signal element is equal to 10 hex when the ordering is little-endian;

(vi) for WORD256's ordered within a WORD512, the signal element is equal to 20 hex when the ordering is little-endian;

(vii) for WORD512's ordered within a WORD1024, the signal element is equal to 40 hex when the ordering is little-endian;

(viii) for WORD 1024's ordered within a WORD2048, the signal element is equal to 80 hex when the ordering is little-endian; and

(ix) for orderings which are big-endian, the signal element is equal to 00 hex.

6,563,440

Apparatus and method for decoding Huffman codes using leading one/zero string length detection

Nokia Corporation Kangas; Janne 341 H03M 20011019 4 92%

Abstract: Decoding Huffman codes is accomplished by identifying consecutive strings of high order ones or zeroes and followingconsecutive strings of high order ones or zeroes, retrieving a table entry for each string based on its run count and bit value,until the retrieved entry contains the decoding output symbol, or until the remaining bits of the code word number within apredetermined threshold. The remaining bits are used as an offset into a lookup table, but the dimensions of the table havebeen reduced through elimination of the leading ones and zeroes. The consecutive strings are preferably processed by ahardware accelerator to identify the repeated bit, count the bits in the string and return this information to the host processor.The efficiencies of decoding canonical codes are realized; yet, non-canonical codes can be decoded. MainClaim: A method for decoding a code word in a series of variable length code words comprising the steps of:

a) detecting the value of a bit in said code word;

b) calculating a current count that starts with said bit and includes, from said series of variable length code words, subsequent,consecutive bits of the same value;

c) based on the current count, retrieving an entry from a decoding table; and

d) based on the retrieved entry, determining whether steps a) through d) are to be repeated for said code word using bits

www.patentics.com


subsequent to those included in the one or more counts in step b).

5,467,464 Adaptive clock skew and duty cycle compensation for a serial data bus

Apple Computer, Inc.Oprescu; Florin | Van Brunt; Roger 713 H03K 19930309 0 100%

Abstract: The de-skewer utilizes a delay line to generate a set of delayed versions of an input clock signal. A bank of flip-flops compares pulses within the delayed clock signals to a synchronization pulse provided within an input data signal. A detectorreceives outputs from the flip-flops and selects the delayed clock signal having the least amount of skew based on the values ofthe output from the flip-flops. A multiplexer outputs the selected delayed clock. The de-skewer provides a simple, open-loop circuit for eliminating skew between parallel transmission paths. The de-skewer is ideally suited for eliminating skew from sources which do not vary significantly as a function of time. In particular, the de-skewer is well-suited for use in a data transmission system providing short bursts of high data rate transmissions. A double-edged de-skewer is also described which is capable of generating a pair of clock signals for use in eliminating duty cycle distortion. MainClaim: A double-edge de-skewer apparatus for reducing skew between a clock signal and a data signal having a leadingedge and a trailing edge, received along first and second communication lines, said apparatus comprising:

a delay line coupled to receive said clock signal from said first communication line for delaying said clock signal to generate aplurality of delayed clock signals;

a first detector coupled to receive said plurality of delayed clock signals from said delay line and said data signal from saidsecond communication line, for comparing the delayed clock signals with said leading edge of the data signal to identify a firstdelayed clock signal having a least amount of skew with respect to said data signal leading edge; and

a second detector coupled to said delay line and said second communication line for comparing the delayed clock signals withsaid trailing edge of the data signal to identify a second delayed clock signal having a least amount of skew with respect to saiddata signal trailing edge;

a first output coupled to said first detector for outputting said first delayed clock signal; and

a second output coupled to said second detector for outputting said second delayed clock signal.

5,446,772 Integrated circuit bus Nokia Mobile Phones Ltd.

Korhonen; Veijo 375 H04B 19931001 1 92%

Abstract: An integrated circuit bus for the transmission of a serial data signal, to be used in integrated circuits, wherein thedata is clocked only to one addressed register, and thus cross-talk is reduced. In the bus all information signals are contained in one signal. The data transmission is based on pulses of different lengths corresponding to different states. MainClaim: An integrated bus for transmission of a serial data signal which includes both address bits and data bits, saidintegrated bus comprising:

a clock pulse source;

a plurality of pairs of data lines and clock lines, each pair coupled to a register;

a signal termination line manifesting first and second states;

circuit means coupled to said signal termination line and and clock pulse source and responsive to said first state on said signaltermination line to clock, transform and decode said address bits;

logic means coupled to said circuit means and clock pulse source and responsive to decoded address bits to select one pair ofsaid pairs of data lines and clock lines; and

means for changing said first state on said signal termination line to said second state to enable said data bits to pass to a dataline and clock pulses to a clock line of said selected pair of said pairs of data lines and clock lines.

5,045,715 Circuit for generating stretched clock phases on a cycle by cycle basis

Apple Computer, Inc. Fitch; Jonathan M. 327 H03K 19900319 0 100%

Abstract: A clock circuit for generating two clock signals, one (CLK) having stretched clock phases on a cycle by cycle basis,and the second (2X CLK) being a clock signal having a frequency twice the frequency of the first clock signal which is phase andedge coherent with the first clock signal, including the stretched clock phases. The circuit inputs a signal generated by anoscillator which is twice the frequency of the CLK signal which is then used to generate the CLK signal for use by amicroprocessor, either phase of which can be stretched on demand, while the second 2X CLK signal remains phase coherent withthe microprocessor CLK signal. MainClaim: A circuit for generating first and second clock signals, each cycle of said first and second clock signals having a firstphase and a second phase, said second clock signal being twice the frequency of the first clock signal, such that said first andsecond clock signals are edge and phase coherent during predetermined stretched phases of said first clock signal, said circuitcomprising:

a) oscillator means for generating an input clock signal having a frequency which is twice the frequency of said first clock signal;

b) first flip-flop means having a clock input coupled to said oscillator means for generating said first clock signal;

c) stretch logic means coupled to a first input of said first flip-flop means for receiving control signals generated by a processor and for generating a stretch signal indicating phases of said first and second clock signals which are to be stretched based uponsaid received control signals;

www.patentics.com


d) inverter means coupled to said stretch logic means and said first flip-flop means for inverting said stretch signal and supplying said inverted stretch signal to a second input of said first flip-flop means;

e) second flip-flop means having a clock input coupled to said oscillator means, and first and second inputs coupled to an outputof said first flip-flop means;

f) exclusive OR gate means having a first input coupled to said output of said first flip-flop means for receiving said first clock signal and a second input coupled to an output of said second flip-flop means, said exclusive OR gate means for generating said second clock signal which is input to said stretch logic means and which is twice the frequency said first clock signal and is edgeand phase coherent therewith during all phases and all stretched phases of said first clock signal.

5,315,183 Synchronous phase detector circuit

Nokia Mobile Phones Ltd.

Ruotsalainen; Asko 327 H03L 19921221 3 94%

Abstract: A phase detector for high speed logic circuits including an edge detector circuit responsive to two signals which maycontain frequency and phase errors which result in the edges of the signal pulses of the two signals occurring at different times.The edges of the two signal pulses are detected by a phase detector circuit and an output signal provided to a correction circuitthat provides a correction signal for the time period between the pulse edges of the signal pulses. The correction circuit outputsignal is fed back to a local oscillator to minimize the frequency and phase errors. A synchronizing circuit is connected to theoutput of the correction circuit to synchronously reset the phase detector circuit at the end of the correction signal period. MainClaim: A phase detection means for high speed logic circuits that functions in a synchronous mode in response to first andsecond frequency clock signals comprising:

a voltage controlled oscillator circuit for generating a first frequency clock signal VCO,

a reference signal source for generating a second frequency clock signal Vref,

a source of clock signal XLO

a source of clock signals RFC,

an input signal FVD having a frequency that is a submultiple of the frequency of said first frequency clock signal VCO,

an input signal FRD having a frequency that is a submultiple of said second frequency clock signal VREF, and wherein said

frequency of said FRD signal is the same as said frequency of said FVD signal;

a phase detector logic circuit including an edge detector circuit responsive to said FRD, FVD, XLO and RFC signals for producinga first output signal upon the occurrence of one of said FRD and RFC or FVD and XLO signal pairs and a second output signalupon the occurrence of the other of said FRD and RFC or FVD and XLO signal pairs,

a correction circuit responsive to said first and second output signals from said edge detector circuit for producing an outputpulse signal beginning in response to said first output signal from said edge detector circuit and ending in response to saidsecond output signal from said edge detector circuit, the duration of said signal from said correction circuit being representativeof the duration between the occurrence of said FRD and FVD signals

output means connected to said correction circuit and to said voltage controlled oscillator circuit, said output means responsiveto and applying said output pulse signal from said correction circuit to said voltage controlled oscillator circuit to adjust thefrequency of said voltage controlled oscillator signal VCO until said FRD signal and said FVD signal occur in phase

and a synchronizing means connected to the output of said correction circuit and to said XLO signal for generating a reset signalsynchronous with the end of correction pulse from said correction circuit, said reset signal being connected to said edge detectorcircuit for resetting said edge detector circuit at the end of said correction pulse.

6,446,198 Vectorized table lookup Apple Computer, Inc. Sazegari; Ali 712 G06F 19990930 0 100%

Abstract: A lookup operation is carried out on a data table by logically dividing the data table into a number of smaller sets ofdata that can be indexed with a single byte of data. Each set of data consists of two vectors, which constitute the operands for apermute instruction. Only a limited number of bits are required to index into the table during the execution of this instruction.The remaining bits of each index are used as masks into a series of select instructions. The select instruction chooses betweentwo vector components, based on the mask, and places the selected components into a new vector. The mask is generated byshifting one of the higher order bits of the index to the most significant position, and then propagating that bit throughout abyte, for example by means of an arithmetic shift. This procedure is carried out for all of the index bytes in the vector, togenerate a select mask. The select mask is then used during a select operation, to choose between the results of permuteinstructions on different ones of the logically divided sets of data. Multi-byte table entries are retrieved by replicating each index value and adding consecutive values to form multiple consecutive index values that are then used in multiple permuteoperations. MainClaim: A method for performing a lookup operation for a table stored in a computer memory, comprising the steps of:

storing an index vector containing multiple index values which respectively designate locations in the table;

performing a plurality of permute operations on different respective sets of data within said table, in accordance with the valuesin said index vector, to produce a plurality of intermediate result vectors; and

performing at least one select operation on said intermediate result vectors to produce a final result vector of entries from saiddata table.

www.patentics.com


2003/0172245

DATA PROCESSING METHOD AND DEVICE FOR PARALLEL STRIDE ACCESS

Nokia Corporation Takala, Jarmo 711 G06F 20020307 1 92%

Abstract: A method and apparatus for accessing data elements of an N-element data block on N memory locations distributed over Q memory modules via Q parallel accesses. The Q memory modules are addressable in a q-bit module address and an (n-q) bit row address in a power-of-two stride fashion. The row address is selected from (n-q) bits of the index address, and the module address for one of the Q accesses is obtained from bitwise exclusive-OR operation on bits obtained from corresponding positions in a plurality of q-bit fields grouped from the index address. MainClaim: A method of accessing data elements of an N-element data block on N memory locations distributed over Q memory modules via Q parallel accesses, wherein said N memory locations are addressable in an n-bit index address, and said Q memory modules are addressable in a q-bit module address and an (n-q) bit row address, where N=2n and Q-2q, characterized by: selecting (n-q) bits from the index address for providing the row address; grouping the index address into a plurality of fields comprising a number of first fields, wherein each of the first fields contains q bits; and performing a logicalfunction operation on bits obtained from corresponding positions in said plurality of fields for providing the module address foraccessing the data elements in said Q memory modules.

6,640,296 Data processing method and device for parallel stride access

Nokia Corporation Takala; Jarmo 711 G06F 20020307 1 92%

Abstract: A method and apparatus for accessing data elements of an N-element data block on N memory locations distributed over Q memory modules via Q parallel accesses. The Q memory modules are addressable in a q-bit module address and an (n-q) bit row address in a power-of-two stride fashion. The row address is selected from (n-q) bits of the index address, and the module address for one of the Q accesses is obtained from bitwise exclusive-OR operation on bits obtained from corresponding positions in a plurality of q-bit fields grouped from the index address. MainClaim: A method of accessing data elements of an N-element data block on N memory locations distributed over Q memory modules via Q parallel accesses, wherein

said N memory locations are addressable in an n-bit index address, and

said Q memory modules are addressable in a q-bit module address and an (n-q) bit row address, where N=2n and Q=2q, characterized by:

selecting (n-q) bits from the index address for providing the row address;

grouping the index address into a plurality of fields comprising a number of first fields, wherein each of the first fields contains qbits; and

performing a logical function operation on bits obtained from corresponding positions in said plurality of fields for providing themodule address for accessing the data elements in said Q memory modules.

5,689,517

Apparatus for scannable D-flip-flop which scans test data independent of the system clock

Apple Computer, Inc. Ruparel; Kamalesh 714 G01R 19960726 0 100%

Abstract: The present invention discloses an apparatus for controlling and observing test data stored in scannable-D-flip-flops independent of a system clock, thereby making the scannable-D-flip-flops well suited for partial scanning Design-For-Test (DFT) techniques. Under the present invention, the scannable-D-flip-flop is comprised of two master latches and one slave latch such that the scannable-D-flip-flops may operate in a normal mode of operation or a scan/test mode of operation. During normal mode of operation, the first master latch operates together with the slave latch in response to the system clock. During thescan/test mode of operation, the second master latch operates together with the slave latch in response to a scan clock. Sincethe scanning of external test data is controlled by the scan clock, the conventional non-scannable D-flip-flops in the design, which are controlled by the system clock, maintain their previous states during a scanning operation. Also disclosed is a methodfor performance testing integrated circuits utilizing the scanning application of the scannable-D-flip-flops. This is accomplished by constructing a test circuit that spans the entire silicon die area. By using a special AC-TEST-MODE control signal, the scannable D-flip-flops are set to a "flow-through" mode to provide a direct path through the scannable flip-flops such that the test circuit forms an oscillator in which the frequency of the device can be measured. MainClaim: A scannable D-flip-flop circuit for processing data bits, said scannable D-flip-flop circuit comprising:

(a) a first latch circuit coupled to a first input of said scannable D-flip-flop, said first latch circuit receives a first data input signal and a first clock signal and stores said first data input signal in response to said first clock signal during a normal mode ofoperation, said first latch having an output;

(b) a second latch circuit coupled to a second input of said scannable D-flip-flop, said second latch circuit receives a second data input signal and a second clock signal and stores said second data input signal in response to said second clock signal during ascan mode of operation, said second latch having an output;

(c) a third latch circuit having a data path and a feedback path wherein said data path is coupled to said output of said first latchcircuit and said feedback path is coupled to said output of said second latch circuit, said third latch circuit receives said first datainput signal and said first clock signal and stores said first data input signal in response to said first clock signal during saidnormal mode of operation, said third latch circuit receives said second data input signal and said second clock signal and storessaid second data input signal in response to said second clock signal during said scan mode of operation, said third latch circuitis coupled to an output of said D-flip-flop.

5,907,562 Testable integrated circuit with reduced power dissipation


Wrape; Michael J. | Uhari; Tommi 714 G01R 19960731 1 95%

www.patentics.com


Abstract: An integrated circuit includes a plurality of internal devices that are tested by setting the states of their data registersto respective levels, first forming a known initialization value and then a functional data value. All the data registers used fortesting are coupled as one or more shift registers and by clocking data through a serial scan path, test stimuli can be shifted inand results shifted out. The scan path connections are provided in addition to the usual functional operation signal connections.During functional operation, the data transitions in the scan path signals are disabled to reduce the power dissipation associatedwith driving the scan path signals. MainClaim: A serial scan test structure in a MOS integrated circuit comprising:

latching means, having a data input, a select input, a test input, and a data output, for receiving a select signal at said selectinput and a data signal at said data input and latching said data signal to said data output when said select signal is in a firststate, and for receiving a test signal at said test input and latching said test signal to said data output when said select signal isin a second state; and

gating means, having a test output along with first and second inputs coupled respectively to said data output and select inputof said latching means, for coupling said data output to said test output when said select input is in said second state and fordecoupling said data output from said test output when said select input is in said first state, whereby said decoupling reducespower dissipation by said test signal when said select signal is in said first state.

5,047,967

Digital front end for time measurement and generation of electrical signals

Apple Computer, Inc. Sander; Wendell | Sander; Brian

702 G06F 19890719 0 100%

Abstract: An integrated circuit cell module for performing precise time measurements for use in applications such as disk drivecontrollers. The combination of the cell module and a hard disk controller chip creates a complete hard disk controller in a singlechip without the need for external analog components normally required for classic phase lock loop hard disk controllers. Aproblem in designing such a unified chip is that it must be digital in nature. Therefore, the maximum resolution with whichsignals generated by the disk drive (Rddata signals) can be measured and signals generated by the controller for writing to disk(Wrdata signals) can be generated is dependent on the clock which drives the controller chip. In hard disk controllers, the datarate is such that the minimum distance between adjacent Rddata or Wrdata pulses is approximately 100 ns which would requirean oscillator having a speed which would be impractical in a design. This problem is solved using standard CMOS gates tomeasure the distance between a reference clock and the Rddata pulse to 2 ns. accuracy. This measurement is provided as abinary number to the hard disk controller which uses this information along with the measurement for an adjacent pulse todetermine the distance between adjacent pulses (cell time) to within 2 ns. For generating Wrdata pulses, a binary number isinput which defines the distance to be delayed from the reference clock. This delay can be any multiple of 4 ns. over the periodof the reference clock. Thus, it is possible to create distances between adjacent Wrdata pulses to within 4 ns. increments. MainClaim: An integrated circuit frontend for coupling to an integrated circuit hard disk drive controller, a central processingunit having a system clock, and a disk drive, said frontend generating timing signals for use by said disk controller using digitalcircuitry and write pulses for use by said disk drive to write data, and receiving read pulses generated by said disk driverepresenting read data, said frontend comprising:

(a) clock generator means for converting a system clock signal generated by said system clock having a first frequency into areference clock signal having a second frequency;

(b) read data time detector means coupled to said clock generator means, said disk drive controller and said disk drive forreceiving said read pulses and generating a relative read value output to said disk drive controller, said relative read valuerepresenting the location of a particular read pulse relative to said reference clock signal;

(c) write data time generator means coupled to said clock generator, said disk drive controller and said disk drive for receiving arelative write value generated by said disk drive controller which represents the location of a particular write pulse relative tosaid reference clock signal and generating said write pulses output to said disk drive based upon said relative write value.



Ruotsalainen; Asko 327 H03L 19921221 3 95%

Abstract: A phase detector for high speed logic circuits including an edge detector circuit responsive to two signals which maycontain frequency and phase errors which result in the edges of the signal pulses of the two signals occurring at different times.The edges of the two signal pulses are detected by a phase detector circuit and an output signal provided to a correction circuitthat provides a correction signal for the time period between the pulse edges of the signal pulses. The correction circuit outputsignal is fed back to a local oscillator to minimize the frequency and phase errors. A synchronizing circuit is connected to theoutput of the correction circuit to synchronously reset the phase detector circuit at the end of the correction signal period. MainClaim: A phase detection means for high speed logic circuits that functions in a synchronous mode in response to first andsecond frequency clock signals comprising:








www.patentics.com






5,390,223 Divider circuit structureNokia Mobile Phones Ltd. Lindholm; Rune 377 H03K 19920701 2 92%

Abstract: A divider circuit provides an output signal having a frequency which is equal to the frequency of an input signaldivided by an odd integer. This is achieved by feeding back the output from a binary counter through an AND gate, delay flip-flop and an OR gate so that one cycle is added the output of the binary counter. MainClaim: A divider circuit comprising:

divider means operable to divide the frequency of an input signal by a pre-determined even integer and to supply the divided signal as an output; and

adding means operable to add one cycle to the divided output signal to provide an output signal for said divider whereby thedivider output signal has a frequency which is equal to the frequency of said input signal divided by a pre-determined odd integer,

wherein said adding means comprises delay means operable to delay coupling of said input signal to said dividing means by onecycle such that said divider output signal has one cycle added thereto,

wherein said divider means comprises at least one flip-flop coupled in series and said delay means is operable in response to asignal from a first logic means operable to supply the first logic means signal when the outputs from said at least one flip-flop are all in the same state, and

wherein said delay means comprises a flip-flop coupled to the logic means for receiving said first logic means signal therefromand to supply a signal to a second logic means in response thereto, said second logic means being operable to delay coupling ofsaid input signal to said divider means in response said second logic means signal.

RE39,213

Apparatus and method for increasing a digital camera image capture rate by delaying image processing

Apple Computer, Inc.Anderson; Eric C. | Masukawa; Mike M. 348 H04N 20010202 0 100%

Abstract: An apparatus for increasing a digital camera image capture rate comprises an imaging device for capturing raw imagedata, a frame buffer for receiving the image data, a first RAM spooler for transferring the raw image data to a RAM disk, a firstflash spooler for transferring the raw image data from the RAW disk to a flash memory, an image processor for processing andcompressing the raw data, a second RAM spooler for storing the compressed image data into the RAM disk, and a second flashspooler for transferring the compressed image data from the RAM disk to the flash memory. MainClaim: A method for increasing a digital camera image capture rate, comprising the steps of: capturing an image upondetecting an image capture request; storing the image in a memory device; repeating the capturing and storing steps if anotherimage capture request is detected; performing image processing and compression on the image; halting the imageprocessing/compression step and returning to the capturing step if another image capture request is detected; and resuming theimage processing/compression step after the capturing, storing and repeating steps have been performed.

2009/0273686

Methods, computer program products and apparatus providing improved image capturing

Nokia Corporation

Kaikumaa; Timo | Kalevo; Ossi | Ilmoniemi; Martti | Boden; Rolf | Yong; Sin-Hung | Baxter; Andrew

348 H04N 20080502 3 93%

Abstract: The exemplary embodiments of the invention allow for parallel operations within a digital image capturing system.For example, raw image data can be processed while a subsequent image is being captured. In one exemplary embodiment ofthe invention, a method includes: executing at least one foreground operation within a digital image capturing device; andexecuting at least one background operation within the digital image capturing device, wherein the at least one foregroundoperation includes: capturing raw image data via at least one sensor, storing the captured raw image data as an intermediatefile, and activating a digital viewfinder, wherein the at least one background operation includes: accessing the intermediate file,performing image processing on the raw image data of the intermediate file to obtain processed image data, and storing theprocessed image data, wherein the at least one background operation is executed independently of the at least one foregroundoperation. MainClaim: A method comprising:executing at least one foreground operation within a digital image capturing device,whereinthe at least one foreground operation comprises: capturing raw image data via at least one sensor, storing the captured rawimage data as an intermediate file, and activating a digital viewfinder; andexecuting at least one background operation withinthe digital image capturing device,wherein the at least one background operation comprises: accessing the intermediate file,performing image processing on the raw image data of the intermediate file to obtain processed image data, and storing the

www.patentics.com


processed image data,wherein the at least one background operation is executed independently of the at least one foregroundoperation.

5,867,214

Apparatus and method for increasing a digital camera image capture rate by delaying image processing

Apple Computer, Inc.Anderson; Eric C. | Masukawa; Mike M. 348 H04N 19960411 0 100%

Abstract: An apparatus for increasing a digital camera image capture rate comprises an imaging device for capturing raw imagedata, a frame buffer for receiving the image data, a first RAM spooler for transferring the raw image data to a RAM disk, a firstflash spooler for transferring the raw image data from the RAM disk to a flash memory, an image processor for processing andcompressing the raw data, a second RAM spooler for storing the compressed image data into the RAM disk, and a second flashspooler for transferring the compressed image data from the RAM disk to the flash memory. MainClaim: A method for increasing a digital camera image capture rate, comprising the steps of:

capturing an image upon detecting an image capture request;

storing the image in a memory device;

repeating the capturing and storing steps if another image capture request is detected;

performing image processing and compression on the image;

halting the image processing/compression step and returning to the capturing step if another image capture request is detected;and

resuming the image processing/compression step after the capturing, storing and repeating steps have been performed.

2009/0273686

Methods, computer program products and apparatus providing improved image capturing

Nokia Corporation

Kaikumaa; Timo | Kalevo; Ossi | Ilmoniemi; Martti | Boden; Rolf | Yong; Sin-Hung | Baxter; Andrew

348 H04N 20080502 3 92%

Abstract: The exemplary embodiments of the invention allow for parallel operations within a digital image capturing system.For example, raw image data can be processed while a subsequent image is being captured. In one exemplary embodiment ofthe invention, a method includes: executing at least one foreground operation within a digital image capturing device; andexecuting at least one background operation within the digital image capturing device, wherein the at least one foregroundoperation includes: capturing raw image data via at least one sensor, storing the captured raw image data as an intermediatefile, and activating a digital viewfinder, wherein the at least one background operation includes: accessing the intermediate file,performing image processing on the raw image data of the intermediate file to obtain processed image data, and storing theprocessed image data, wherein the at least one background operation is executed independently of the at least one foregroundoperation. MainClaim: A method comprising:executing at least one foreground operation within a digital image capturing device,whereinthe at least one foreground operation comprises: capturing raw image data via at least one sensor, storing the captured rawimage data as an intermediate file, and activating a digital viewfinder; andexecuting at least one background operation withinthe digital image capturing device,wherein the at least one background operation comprises: accessing the intermediate file,performing image processing on the raw image data of the intermediate file to obtain processed image data, and storing theprocessed image data,wherein the at least one background operation is executed independently of the at least one foregroundoperation.

5,295,164

Apparatus for providing a system clock locked to an external clock over a wide range of frequencies

Apple Computer, Inc.Yamamura; Michael 375 H03D 19911223 0 100%

Abstract: A digital phase lock loop circuit for synchronizing the phase of clock signals delivered to devices through clock treecircuitry with the phase of input clock signals including a first delay line, a second delay line, a phase detector circuit, apparatusfor transferring the input clock signals through the first delay line to the phase detector circuit, apparatus for transferring theinput clock signals through the second delay line and the clock tree circuitry to the phase detector circuit, apparatus responsiveto the difference in phase detected between the clock signals transferred through the first and second delay lines for varying thedelay of one of the delay lines to bring the clock signals transferred through the first and second delay lines into phase with oneanother. MainClaim: A digital phase lock loop circuit for synchronizing a phase of clock signals delivered to devices through clock treecircuitry with a phase of input clock signals comprising a first delay line, a second delay line, a phase detector circuit, means fortransferring the input clock signals through the first delay line to the phase detector circuit, means for simultaneouslytransferring the input clock signals through the second delay line and the clock tree circuitry to the phase detector circuit, andsaid phase detector circuit being responsive to the difference in phase detected between the clock signals transferred throughthe first and second delay lines and varying the delay of one of the delay lines to bring the clock signals transferred through thefirst and second delay lines into exact phase with one another.


Nokia Mobile Phones Ltd. Ruotsalainen; Asko 327 H03L 19921221 3 95%

Abstract: A phase detector for high speed logic circuits including an edge detector circuit responsive to two signals which maycontain frequency and phase errors which result in the edges of the signal pulses of the two signals occurring at different times.The edges of the two signal pulses are detected by a phase detector circuit and an output signal provided to a correction circuitthat provides a correction signal for the time period between the pulse edges of the signal pulses. The correction circuit outputsignal is fed back to a local oscillator to minimize the frequency and phase errors. A synchronizing circuit is connected to theoutput of the correction circuit to synchronously reset the phase detector circuit at the end of the correction signal period.

www.patentics.com


MainClaim: A phase detection means for high speed logic circuits that functions in a synchronous mode in response to first andsecond frequency clock signals comprising:












5,365,119 Circuit arrangement Nokia Mobile Phones Ltd.

Kivari; Raimo 327 H03K 19920812 2 92%

Abstract: A signal generator includes a frequency divider having an input node for receiving a first signal having a firstfrequency f1 and a single output node for outputting a second signal having a second frequency f2, wherein a ratio f1 /f2 is equal

to an odd number that is equal to or greater than three. A synchronous delay circuit has an input node coupled to the singleoutput node of the frequency divider and an output node for outputting a third signal that is delayed in time with respect to thesecond signal by an amount that is a function of a period of the first signal. Logic is provided having a first input node coupled tothe single output node of the frequency divider and a second input node coupled to the output node of the delay circuit. Thelogic has an output node for outputting a fourth signal having the second frequency f2 and a 50% duty cycle. In a further

embodiment the signal generator outputs a frequency that is (2n+1)/2 of the input frequency, where n any positive integer. MainClaim: A signal generator, comprising:

frequency divider means having an input node for receiving a first signal having a first frequency f1 and a single output node for

outputting a second signal having a second frequency f2, wherein a ratio f1 /f2 is equal to an odd number that is equal to or

greater than three;

delay means having an input node coupled to said single output node of said frequency divider means and an output node foroutputting a third signal that is delayed in time with respect to said second signal by an amount that is a function of a period ofsaid first signal, said third signal being synchronized to said first signal; and

logic means having a first input node coupled to said single output node of said frequency divider means and a second inputnode coupled to said output node of said delay means, said logic means having an output node for outputting a fourth signalhaving the second frequency f2 and a 50% duty cycle.

5,103,114 Circuit technique for creating predetermined duty cycle

Apple Computer, Inc. Fitch; Jonathan M. 327 H03L 19900319 0 100%

Abstract: A circuit for allowing a clock of any specified duty cycle to be created from a clock of the same frequency usingstandard digital delay lines. In particular, an EXOR function is implemented to generate a clock signal having a frequency whichis twice the frequency of its input signals by using standard logic components such that the active branch for each input edgehas an independent path to the output signal. In this manner, if a time delay is introduced into the active branch and only theactive branch, the corresponding output edge and only that edge will be delayed by a like amount. Over a complete cycle of theinput waveforms, four output edges are produced (two clock cycles). By varying the delay on the input branches, these outputedges can be placed independently and arbitrarily within the period. As such, an output waveform having any desired duty cyclecan be created independent of the phase relationship between the two input waveforms. MainClaim: A circuit for receiving first and second input waveforms having substantially the same frequency for generating anoutput waveform having a frequency which is substantially twice the frequency of said first and second input waveforms andhaving a duty cycle which is substantially independent of the phase relationship between said first and second input waveforms,said circuit comprising:

www.patentics.com


a) first gate means for receiving said first input waveform from a first input line containing said first input waveform and aninversion of said second input waveform from a first inverter coupled to a second input line containing said second inputwaveform;

b) second gate means for receiving said second input waveform from a third input line containing said second waveform and aninversion of said first input waveform from a second inverter coupled to a fourth input line containing said first input waveform,wherein said first and said fourth input lines are isolated by a first buffer means coupled between said first gate means and saidsecond inverter, and said second and third input lines are isolated by a second buffer means coupled between said second gatemeans and said first inverter;

c) first delay means coupled between said first gate means and said first buffer means for applying a first predetermined delayto said first input waveform;

d) second delay means coupled between said first gate means and said first inverter for applying a second predetermined delayto said inversion of said second input waveform;

e) third delay means coupled between said second gate means and said second inverter for applying a third predetermineddelay to said inversion of said first input waveform;

f) fourth delay means coupled between said second gate means and said second buffer means for applying a fourthpredetermined delay to said second input waveform; and

g) third gate means coupled to said first and second gate means for receiving outputs from said first and second gate meansand producing said output waveform

whereby said output waveform has a frequency which is substantially twice the frequency of said first and second inputwaveforms and has a duty cycle which is substantially independent of the phase relationship between said first and second inputwaveforms as determined by said first, second, third and fourth predetermined delays.

5,365,119 Circuit arrangement Nokia Mobile Phones Ltd.

Kivari; Raimo 327 H03K 19920812 2 92%

Abstract: A signal generator includes a frequency divider having an input node for receiving a first signal having a firstfrequency f1 and a single output node for outputting a second signal having a second frequency f2, wherein a ratio f1 /f2 is equal

to an odd number that is equal to or greater than three. A synchronous delay circuit has an input node coupled to the singleoutput node of the frequency divider and an output node for outputting a third signal that is delayed in time with respect to thesecond signal by an amount that is a function of a period of the first signal. Logic is provided having a first input node coupled tothe single output node of the frequency divider and a second input node coupled to the output node of the delay circuit. Thelogic has an output node for outputting a fourth signal having the second frequency f2 and a 50% duty cycle. In a further

embodiment the signal generator outputs a frequency that is (2n+1)/2 of the input frequency, where n any positive integer. MainClaim: A signal generator, comprising:

frequency divider means having an input node for receiving a first signal having a first frequency f1 and a single output node for

outputting a second signal having a second frequency f2, wherein a ratio f1 /f2 is equal to an odd number that is equal to or

greater than three;

delay means having an input node coupled to said single output node of said frequency divider means and an output node foroutputting a third signal that is delayed in time with respect to said second signal by an amount that is a function of a period ofsaid first signal, said third signal being synchronized to said first signal; and

logic means having a first input node coupled to said single output node of said frequency divider means and a second inputnode coupled to said output node of said delay means, said logic means having an output node for outputting a fourth signalhaving the second frequency f2 and a 50% duty cycle.

5,390,223 Divider circuit structure Nokia Mobile Phones Ltd.

Lindholm; Rune 377 H03K 19920701 2 92%

Abstract: A divider circuit provides an output signal having a frequency which is equal to the frequency of an input signaldivided by an odd integer. This is achieved by feeding back the output from a binary counter through an AND gate, delay flip-flop and an OR gate so that one cycle is added the output of the binary counter. MainClaim: A divider circuit comprising:

divider means operable to divide the frequency of an input signal by a pre-determined even integer and to supply the divided signal as an output; and

adding means operable to add one cycle to the divided output signal to provide an output signal for said divider whereby thedivider output signal has a frequency which is equal to the frequency of said input signal divided by a pre-determined odd integer,

wherein said adding means comprises delay means operable to delay coupling of said input signal to said dividing means by onecycle such that said divider output signal has one cycle added thereto,

wherein said divider means comprises at least one flip-flop coupled in series and said delay means is operable in response to asignal from a first logic means operable to supply the first logic means signal when the outputs from said at least one flip-flop are all in the same state, and

www.patentics.com


wherein said delay means comprises a flip-flop coupled to the logic means for receiving said first logic means signal therefromand to supply a signal to a second logic means in response thereto, said second logic means being operable to delay coupling ofsaid input signal to said divider means in response said second logic means signal.

6,321,269

Optimized performance for transaction-oriented communications using stream-based network protocols

Apple Computer, Inc. Walker; Ted W. 709 G06F 19981229 0 100%

Abstract: A modified stream-based protocol implementation is employed within a network environment to compensate for inefficiencies associated with conventional stream based protocols, such as TCP. Characteristics of a transaction-based protocol are advantageously utilized in client/server data transactions to reduce the number of acknowledgment signals sent upon receiptof data, as well as eliminate delays associated with the buffering of data at the server. These results are accomplished withoutrequiring changes to servers using standard stream-based protocols. MainClaim: A method for communicating data between computers, comprising the steps of:

issuing a request for data from a first computer to a second computer;

determining the amount of data to be received at said first computer in response to said request;

monitoring data received at the first computer and detecting when the remaining amount of data to be received is less than apredetermined amount; and

sending a preemptive acknowledgment from said first computer to said second computer in response to said detection to promptsaid second computer to transmit the remaining data to be sent.

6,757,248

Performance enhancement of transmission control protocol (TCP) for wireless network applications

Nokia Internet Communications Inc.

Li; Xiang | Wu; Jing | Cheng; Shiduan | Ma; Jian

370 G01R 20000614 1 92%

Abstract: A new Fast Recovery Plus (FR+) mechanism, and associated method, for wireless and/or mobile network applicationsto control data flow and avoid network congestion in a TCP/IP packet-switched network. MainClaim: A method of flow control and congestion avoidance congestion in a network, comprising:

transmitting, at a source node, data packets to a destination node, via at least an intermediate node;

receiving, at the destination node, data packets transmitted from the source node, via the intermediate node, and generating aduplicate ACK back to the source node to inform the source node that a data packet was received out-of-order in the network and serves as an indication that a data packet has been lost;

upon receipt of a designated number of duplicate ACKs, at the source node, determining that a data packet has been lost;

initializing a counter, at the source node, and recording a congestion window CWND, a slow start threshold Ssthresh, and amaximal sequence number SN that has been sent into the network;

upon receipt of a next duplicate ACK, at the source node, recording its acknowledged sequence number ACK_SN;

determining, at the source node, if the acknowledged sequence number ACK_SN is no more than a recorded sequence numberSN;

if the acknowledged sequence number ACK_SN is more than the recorded sequence number SN, incrementing the counter, atthe source node, and re-transmitting a lost packet;

if the acknowledged sequence number ACK_SN is no more than the recorded sequence number SN, determining if the packetloss is due to a transmission error; and

if the packet loss is due to the transmission error, setting, at the source node, the slow start threshold Ssthresh to Max(CWND,(Ssthresh+CWND)/2), wherein said CWND and Ssthresh exhibit values previously recorded.

6,741,555

Enhancement of explicit congestion notification (ECN) for wireless network applications

Nokia Internet Communictions Inc.


370 H04L 20000614 2 92%

Abstract: An Explicit Congestion Notification (ECN) method is disclosed for wireless applications to avoid network congestion ina TCP/IP packet-switched network. Such method comprises transmitting, at a source node, data packets to a destination node, via at least an intermediate node; determining, at the intermediate node, if an incipient congestion is encountered, setting aCongestion Experienced (CE) flag in each data packet to notify congestion; sending, at the destination node, an ECN-Echo acknowledgment packet back to the source node to inform congestion; reducing, at the source node, a congestion window and atransmission rate to avoid congestion; if the packet loss is due to congestion, re-transmitting, at the source node, only a lost packet to the destination node; alternatively, if the packet loss is due to transmission error, re-transmitting, the lost packet to the destination node, while increasing a round-trip timeout but maintaining the same congestion window. MainClaim: A method of avoiding congestion in a network, comprising:

www.patentics.com


transmitting, at a source node, data packets to a destination node, via at least an intermediate node, each data packet includinga Transmission Control Protocol (TCP) header;

determining, at the intermediate node, if an incipient congestion is encountered, and if the incipient congestion is encountered,setting a Congestion Experienced (CE) flag in each data packet which indicates the incipient congestion to notify the incipientcongestion to the destination node;

receiving, at the destination node, a CE data packet, setting an Explicit Congestion Notification-Echo (ECN-Echo) flag in the TCP header of an acknowledgment (ACK) packet subsequent to the CE data packet received, and sending an ECN-Echo ACK packet back to the source node to inform that the incipient congestion was encountered in the network on the path from the sourcenode to the destination node;

upon receipt of the ECN-Echo ACK packet, reducing, at the source node, a congestion window and a transmission rate to avoidthe congestion, and determining if a packet loss is due to congestion or due to a transmission error, when the incipientcongestion is still encountered in the network on the path from the source node to the destination node;

if the packet loss is due to congestion, re-transmitting, at the source node, only a lost packet to the destination node, via theintermediate node; and

if the packet loss is due to the transmission error, re-transmitting, at the source node, the lost packet to the destination node,via the intermediate node, while increasing a round-trip timeout (RTO) but maintaining the same congestion window.

7,502,322

System, method and computer program product for increasing throughput in bi-directional communications

Nokia Corporation Yu; Jing | Hu; Xuelong Ronald

370 H04J 20030930 2 92%

Abstract: A system, method, and computer program product are provided for bi-directional communication. The system includes a first host capable of transmitting multiplexed data at a first transmission rate and operating with a first congestionwindow. The first host is also capable of receiving multiplexed data at a second transmission rate from a second host capable ofoperating with a second congestion window. The first host can be capable of configuring at least one of a size of the firstcongestion window and a size of the second congestion window based upon first transmission rate, the size of the secondcongestion window, the second transmission rate and the size of the first congestion window. MainClaim: An apparatus comprising: a processor configured to transmit multiplexed data at a first transmission rate andoperate with a first congestion window, wherein the processor is also configured to receive multiplexed data at a secondtransmission rate from a second host separate from the apparatus and configured to operate with a second congestion window,and wherein the processor is configured to set at least a size of the second congestion window based upon the first transmissionrate, the size of the second congestion window, the second transmission rate and the size of the first congestion window.

5,931,961 Discovery of acceptable packet size using ICMP echo

Apple Computer, Inc.Ranganathan; Murali | Riddle; Guy G.

714 G06F 19960508 0 100%

Abstract: A network messaging protocol is used to send an arbitrary size packet over the network from a source machine to adestination machine. If the packet is accepted by the routers along the path of the potential network connection, then thedestination machine will be able to echo the test message packet back to the source machine and an acceptable packet size isset equal to the test message packet size. If not, after a suitable time out, the source machine will send another test messagewith a different packet size than the initial arbitrary packet size and wait for echo and repeat the process until an acceptablepacket size is discovered. MainClaim: A method for discovering an acceptable packet size over a path that utilizes a user datagram protocol (UDP) forpackets from a source to a destination, said method comprising the steps of:

choosing a first size as a testing size;

sending a test message packet with a test message using an echoing protocol, said test message the size of said testing sizefrom said source to said destination; and

checking during a specified timeout whether said test message packet is successfully echoed back, and if said test messagepacket is successfully echoed back, setting said acceptable UDP packet size equal to said testing size.

6,741,555

Enhancement of explicit congestion notification (ECN) for wireless network applications

Nokia Internet Communictions Inc.


370 H04L 20000614 2 94%

Abstract: An Explicit Congestion Notification (ECN) method is disclosed for wireless applications to avoid network congestion ina TCP/IP packet-switched network. Such method comprises transmitting, at a source node, data packets to a destination node, via at least an intermediate node; determining, at the intermediate node, if an incipient congestion is encountered, setting aCongestion Experienced (CE) flag in each data packet to notify congestion; sending, at the destination node, an ECN-Echo acknowledgment packet back to the source node to inform congestion; reducing, at the source node, a congestion window and atransmission rate to avoid congestion; if the packet loss is due to congestion, re-transmitting, at the source node, only a lost packet to the destination node; alternatively, if the packet loss is due to transmission error, re-transmitting, the lost packet to the destination node, while increasing a round-trip timeout but maintaining the same congestion window. MainClaim: A method of avoiding congestion in a network, comprising:

transmitting, at a source node, data packets to a destination node, via at least an intermediate node, each data packet includinga Transmission Control Protocol (TCP) header;

www.patentics.com


determining, at the intermediate node, if an incipient congestion is encountered, and if the incipient congestion is encountered,setting a Congestion Experienced (CE) flag in each data packet which indicates the incipient congestion to notify the incipientcongestion to the destination node;

receiving, at the destination node, a CE data packet, setting an Explicit Congestion Notification-Echo (ECN-Echo) flag in the TCP header of an acknowledgment (ACK) packet subsequent to the CE data packet received, and sending an ECN-Echo ACK packet back to the source node to inform that the incipient congestion was encountered in the network on the path from the sourcenode to the destination node;

upon receipt of the ECN-Echo ACK packet, reducing, at the source node, a congestion window and a transmission rate to avoidthe congestion, and determining if a packet loss is due to congestion or due to a transmission error, when the incipientcongestion is still encountered in the network on the path from the source node to the destination node;

if the packet loss is due to congestion, re-transmitting, at the source node, only a lost packet to the destination node, via theintermediate node; and

if the packet loss is due to the transmission error, re-transmitting, at the source node, the lost packet to the destination node,via the intermediate node, while increasing a round-trip timeout (RTO) but maintaining the same congestion window.

7,177,272

System and method for optimizing link throughput in response to non-congestion-related packet loss

Nokia Corporation Swami; Yogesh 370 H04J 20030625 2 93%

Abstract: A system, apparatus, and method for providing secure loss recovery for packet loss due to bit errors and other non-congestion-related packet loss occurring over the communication link. An intermediary node in a network between a sendingnode and a receiving node identifies packet loss due to bit errors (PLB), or other non-congestion-based packet loss, over a network connection between the sending module and the network node. A loss notification signal is sent from the network nodeto the sending module in response to identification of the non-congestion-based packet loss. The PLB is verified at the sending module. A first loss recovery procedure is performed, different from a second loss recovery procedure associated withcongestion-based packet loss, if the PLB is verified at the sending module. MainClaim: A method for increasing throughput over network connections experiencing data loss due to non-congestion-based packet loss, comprising: identifying, at a network node, non-congestion-based packet loss over a network connection between a sending module and the network node; sending a loss notification signal from the network node to the sending module inresponse to identification of the non-congestion-based packet loss; verifying the non-congestion-based packet loss at the sending module independently of the receipt of loss notification signals; and performing a first loss recovery procedure, differentfrom a second loss recovery procedure associated with congestion-based packet loss, if the non-congestion-based packet loss is verified at the sending module.

7,170,856

Jitter buffer for a circuit emulation service over an internet protocol network

Nokia Inc.

Ho; Chi Fai | Kondapalli; Raghu R. | Merani; Lalit | Bhat; Ravi Bail | Kejriwal; Prabhas | Merchant; Shashank

370 H04J 20000512 1 93%

Abstract: A jitter buffer receives a plurality of data packets comprising a circuit emulation service over internet protocol(CESIP), buffers the plurality of data packets, and plays data from the plurality of data packets at a constant bit ratecorresponding to the CESIP. MainClaim: A method comprising: adjusting the first constant bit rate based on a level of buffered data packets of the firstplurality of data packets; receiving a first plurality of data packets comprising a first circuit emulation service over internetprotocol; buffering the first plurality of data packets; and playing data from the first plurality of data packets at a first constantbit rate corresponding to the first circuit emulation service over internet protocol, wherein adjusting the first constant bit ratecomprises a increasing the first constant bit rate if the level of buffered data packets exceeds a tolerance range; and decreasingthe first constant bit rate if the level of buffered data packets drops below the tolerance range.

6,665,729

Data transmission utilizing pre-emptive acknowledgements with transaction-oriented protocols

Apple Computer, Inc. Walker; Ted W. 709 G06F 20010813 0 100%

Abstract: A modified stream-based protocol implementation is employed within a network environment to compensate for inefficiencies associated with conventional stream based protocols, such as TCP. Characteristics of a transaction-based protocol are advantageously utilized in client/server data transactions to reduce the number of acknowledgment signals sent upon receiptof data, as well as eliminate delays associated with the buffering of data at the server. These results are accomplished withoutrequiring changes to servers using standard stream-based protocols. MainClaim: A client computer, comprising:

means for issuing a request for data;

means for determining the amount of data to be received in response to said request;

means for monitoring received data and detecting when the remaining amount of data to be received is less than apredetermined amount; and

means for sending a preemptive acknowledgment in response to said detection.

System, method and computer program

www.patentics.com


7,502,322

product for increasing throughput in bi-directional communications

Nokia Corporation Yu; Jing | Hu; Xuelong Ronald

370 H04J 20030930 2 92%

Abstract: A system, method, and computer program product are provided for bi-directional communication. The system includes a first host capable of transmitting multiplexed data at a first transmission rate and operating with a first congestionwindow. The first host is also capable of receiving multiplexed data at a second transmission rate from a second host capable ofoperating with a second congestion window. The first host can be capable of configuring at least one of a size of the firstcongestion window and a size of the second congestion window based upon first transmission rate, the size of the secondcongestion window, the second transmission rate and the size of the first congestion window. MainClaim: An apparatus comprising: a processor configured to transmit multiplexed data at a first transmission rate andoperate with a first congestion window, wherein the processor is also configured to receive multiplexed data at a secondtransmission rate from a second host separate from the apparatus and configured to operate with a second congestion window,and wherein the processor is configured to set at least a size of the second congestion window based upon the first transmissionrate, the size of the second congestion window, the second transmission rate and the size of the first congestion window.

7,366,096

System and method for movement detection and congestion response for transport layer protocol

Nokia CorporationSwami; Yogesh Prem 370 H04J 20030221 1 92%

Abstract: A system, apparatus, and method for determining network capacity and managing network congestion in response toa change in an end-to-end communication path between sender and receiver hosts. A receiver mobility notification is providedby the receiver host to the sender host. The sender host determines whether the receiver host has moved between networks orsub-networks using the receiver mobility notification. If the sender host determines that the receiver host has moved from one network/subnet to another network/subnet, a congestion state at the sender host is reset to correspond to the new end-to-end communication path established between the sender host and the receiver host in the new subnet. MainClaim: A method for determining network capacity and managing network congestion in response to a change in an end-to-end communication path between a sender host and a receiver host, the method comprising: receiving at the sender host areceiver mobility notification from the receiver host by receiving a mobility flag in a header field of segments sent from thereceiver host to the sender host, wherein receiving a mobility flag comprises receiving a mobility bit having a first stateindicating no movement from a first subnet to a second subnet and a second state indicating movement from the first subnet tothe second subnet; determining at the sender host whether the receiver host has moved from a first subnet to a second subnetusing the receiver mobility notification; and resetting a congestion state at the sender host to correspond to a new end-to-end communication path between the sender host and the receiver host in the second subnet, if the sender host determines that thereceiver host has moved from the first subnet to the second subnet; and receiving the mobility bit in the first state if thereceiver host further moves from the second subnet to one of a third subnet or the first subnet.

7,177,272

System and method for optimizing link throughput in response to non-congestion-related packet loss

Nokia Corporation Swami; Yogesh 370 H04J 20030625 2 92%

Abstract: A system, apparatus, and method for providing secure loss recovery for packet loss due to bit errors and other non-congestion-related packet loss occurring over the communication link. An intermediary node in a network between a sendingnode and a receiving node identifies packet loss due to bit errors (PLB), or other non-congestion-based packet loss, over a network connection between the sending module and the network node. A loss notification signal is sent from the network nodeto the sending module in response to identification of the non-congestion-based packet loss. The PLB is verified at the sending module. A first loss recovery procedure is performed, different from a second loss recovery procedure associated withcongestion-based packet loss, if the PLB is verified at the sending module. MainClaim: A method for increasing throughput over network connections experiencing data loss due to non-congestion-based packet loss, comprising: identifying, at a network node, non-congestion-based packet loss over a network connection between a sending module and the network node; sending a loss notification signal from the network node to the sending module inresponse to identification of the non-congestion-based packet loss; verifying the non-congestion-based packet loss at the sending module independently of the receipt of loss notification signals; and performing a first loss recovery procedure, differentfrom a second loss recovery procedure associated with congestion-based packet loss, if the non-congestion-based packet loss is verified at the sending module.

7,007,062 Methods and apparatuses for transferring data

Apple Computer, Inc.Serenyi; Denis | LeCroy; Chris 709 G06F 20010108 0 100%

Abstract: The present invention provides several methods and apparatuses for transmitting multimedia data using streamingmedia protocols such as real-time transfer protocols (RTP) and real-time streaming protocols (RTSP) in a computer network environment. A request for RTP data is sent from the caching proxy server to the server. The request may be for one specifictype of data or multiple unrelated types of data. The server responds to the request indicating its support for the requesteddata. The caching proxy server determines whether to proceed or terminate the data transmission process based on theresponse provided by the server. If it is determined to proceed with the data transmission process, the caching proxy informsthe server to send the requested data. The server sends the requested data in a body of a RTP packet. The RTP packet uses aRTP Meta-Info payload format, which includes a body and a field header. The field header includes fields to identify thestreaming media data, and the field body includes the requested streaming media data. MainClaim: A method for operating a caching proxy server comprising:

sending a first request for streaming media data to a server, the first request including a second request for data associatedwith the streaming media data, the second request including an identifier which represents one of several possible types of thedata associated with the streaming media data, wherein the data associated with the streaming media data have an RTP Meta-Information payload format, which includes a field header to identify a type of the data associated with the streaming mediadata, and a field body to include the data associated with the streaming media data;

receiving a response from the server indicating support for the requested streaming media data;

informing the server to send the supported data associated with the streaming media data;

www.patentics.com


receiving the streaming media data from the server in a body of a packet;

receiving a third request from a client to send streaming media data; and

sending the requested streaming media data to the client.

7,640,350 Transferring objects within an ongoing file transfer operation

Nokia Corporation Bouet; Stephane 709 G06F 20011220 1 92%

Abstract: The invention discloses a method of sending pictures for display individually or as a series of pictures in a mini-clip on a receiving device during a lengthy file transfer. The invention, although not strictly limited to, is particularly suitable for use in aBluetooth environment using the Object Exchange (OBEX) protocol. In an embodiment of the invention, a picture or series ofpictures (710,720,730) are encapsulated within a Application Parameters header of the ongoing long file transfer. When picturedata is too large to fit into a single header the data may be segmented and spanned over several headers. The headers containparameters that define display characteristics such as picture display time and mini-clip or series refresh rate, thereby lending the method particularly well for the display of advertising content. MainClaim: A method, comprising: transmitting, during an ongoing packet transfer operation in which packets of content aretransferred between a sending device and a receiving device, picture data in addition to said content, at least a portion of saidpicture data for display on a display associated with the receiving device during said ongoing packet transfer, wherein saidpacket transfer comprises a plurality of packets and at least one of the plurality of packets comprises a payload portion and aseparate header portion comprising the at least a portion of said picture data, wherein said picture data is a binary image filehaving a binary based format used to define transmission of encoded bitmap data; wherein the header portion includes at leastone parameter that controls the display of the at least a portion of said picture data on the display associated with the receivingdevice during the ongoing packet transfer.

5,444,709 Protocol for transporting real time data

Apple Computer, Inc. Riddle; Guy G. 370 H04J 19930930 0 100%

Abstract: A real-time data stream is transmitted in data packets from a data source in accordance with a predeterminedprotocol over a shared network. Data packets of said real-time data stream are received at a data destination connected to thelocal area network. The data destination then reconstitutes the real-time data stream using information included in the data packets in accordance with the predetermined protocol. More particularly, a plurality of data frames are transmitted from thedata source, each including at least one data packet. Each data packet includes a sequence number S identifying the datapacket as the Sth data packet transmitted in the data stream and a frame number N identifying the data packet as belonging toan Nth frame transmitted in the data stream. Data packets that are the first data packets in respective frames to which theybelong and data packets that are the last data packets in respective frames to which they belong include flags identifying themas such. At least some of the data packets are received at the data destination and, using sequence numbers, frame numbers,and the flags in the data packets, complete data frames received at the data destination are identified. Data frames that aretimely received, as judged in relation to received data packets belonging to other frames, are forwarded to a higher-level process. Packets not belonging to complete data frames timely received are discarded. In this manner, the isochronous nature ofthe real-time data stream is maintained. MainClaim: A method of transmitting over a shared computer network a data stream captured from a real time data signal ascapture is proceeding, comprising the steps of:

transmitting from a data source a plurality of data frames each including a frame number N identifying the data frame as an Nthframe transmitted in said data stream;

receiving at least some of said data frames at a data destination;

judging in relation to receipt of other data frames whether each data frame received has been timely received;

forwarding data frames that have been timely received to a higher level process; and

discarding data frames not timely received;

wherein at least some data frames are transmitted only once regardless of whether or not they are received at said datadestination.

2008/0320171 METHOD AND SYSTEM FOR HEADER COMPRESSION

NOKIA CORPORATION

Walsh; Rod | Luoma; Juha-Pekka | Saaranen; Anne

709 G06F 20080819 1 95%

Abstract: A compression context for a plurality of packets is established with a receiving device. Each of these packets isassociated with one or more reliable multicast protocols, such as the Layered Coding Transform (LCT) protocol, theAsynchronous Layered Coding (ALC) protocol, the FLUTE protocol, the MUPPET protocol, and the NACK-Oriented Reliable Multicast (NORM) protocol. Upon establishment of the compression context, a compressed packet is generated for one of theplurality of packets and transmitted to the receiving device. The compressed packet has a reduced number of bits in its header.Upon receipt, the receiving device decompresses the compressed packet based on the compression context. MainClaim: A receiver apparatus, comprising:(a) a processor configured to process a compression context for a plurality ofpackets, the plurality of packets associated with at least a reliable multicast protocol, wherein each of the plurality of packetsincludes a header having a plurality of header fields; and(b) a receiver coupled to the processor, configured to receive acompressed packet for one of the plurality of packets, the compressed packet having a reduced number of bits in its header;saidcompressed packet formed by compression in one of a plurality of states ranging from an initialization and refresh state forsending packets having substantially complete header information, to more compressed states for sending one or more packetswith headers having progressively more compressed header information, said compression adaptively reverting from said morecompressed states to said initialization and refresh state to accommodate unidirectional receivers of the multicast packets,wherein the reverting in compression states is triggered at an expiration of a timer or a sequence counter of the multicastpackets;(c) said processor further configured to decompress the compressed packet based on the compression context.

www.patentics.com


7,558,882

System for header compression of a plurality of packets associated with a reliable multicast protocol

NOKIA Corporation

Walsh; Rod | Luoma; Jukka-Pekka | Saaranen; Anne

709 G06F 20080819 1 95%

Abstract: A compression context for a plurality of packets is established with a receiving device. Each of these packets isassociated with one or more reliable multicast protocols, such as the Layered Coding Transform (LCT) protocol, theAsynchronous Layered Coding (ALC) protocol, the FLUTE protocol, the MUPPET protocol, and the NACK-Oriented Reliable Multicast (NORM) protocol. Upon establishment of the compression context, a compressed packet is generated for one of theplurality of packets and transmitted to the receiving device. The compressed packet has a reduced number of bits in its header.Upon receipt, the receiving device decompresses the compressed packet based on the compression context. MainClaim: A receiver apparatus, comprising: (a) a processor configured to process a compression context for a plurality ofpackets, the plurality of packets associated with at least a reliable multicast protocol, wherein each of the plurality of packetsincludes a header having a plurality of header fields; and (b) a receiver coupled to the processor, configured to receive acompressed packet for one of the plurality of packets, the compressed packet having a reduced number of bits in its header;said compressed packet formed by compression in one of a plurality of states ranging from an initialization and refresh state forsending packets having substantially complete header information, to more compressed states for sending one or more packetswith headers having progressively more compressed header information, said compression adaptively reverting from said morecompressed states to said initialization and refresh state to accommodate unidirectional receivers of the multicast packets,wherein the reverting in compression states is triggered at an expiration of a timer or a sequence counter of the multicastpackets; (c) said processor further configured to decompress the compressed packet based on the compression context.

7,430,617 Method and system for header compression

Nokia Corporation

Walsh; Rod | Luoma; Juha-Pekka | Saaranen; Anne

709 G06F 20031219 1 94%

Abstract: A compression context for a plurality of packets is established with a receiving device. Each of these packets isassociated with one or more reliable multicast protocols, such as the Layered Coding Transform (LCT) protocol, theAsynchronous Layered Coding (ALC) protocol, the FLUTE protocol, the MUPPET protocol, and the NACK-Oriented Reliable Multicast (NORM) protocol. Upon establishment of the compression context, a compressed packet is generated for one of theplurality of packets and transmitted to the receiving device. The compressed packet has a reduced number of bits in its header.Upon receipt, the receiving device decompresses the compressed packet based on the compression context. MainClaim: A packet transmission method, comprising: (a) establishing with a receiving device a compression context for aplurality of packets, the plurality of packets associated with at least a reliable multicast protocol, wherein each of the plurality ofpackets includes a header having a plurality of header fields; (b) generating a compressed packet for one of the plurality ofpackets, the compressed packet having a reduced number of bits in its header; said compressed packet formed by compressionin one of a plurality of states ranging from an initialization and refresh state for sending packets having substantially completeheader information, to more compressed states for sending one or more packets with headers having progressively morecompressed header information, said compression adaptively reverting from said more compressed states to said initializationand refresh state to accommodate unidirectional receivers of the multicast packets, wherein the reverting in compression statesis triggered at an expiration of a timer or a sequence counter of the multicast packets; and (c) transmitting the compressedpacket to the receiving device.

5,745,699

Dynamic address assignment in an arbitrarily connected network


Lynn; Kerry Eugene | Oppenheimer; Alan | Ritter; Michael Walker | Zweig; Jonathan Marcus | Mullins; Jeffery L.

709 G06F 19961018 0 100%

Abstract: A method and apparatus for assigning a unique network address to a first node within a network which is arbitrarilyconnected. The first node may include a shared network resource, such as a networked printer device, or a modem, in additionto a stand-alone computer system. The network may include a network which is wireless, wherein various nodes comprise radiotransceiver circuitry, including radio frequency modems. A first provisional network address for use in assigning the uniquenetwork address is determined by the first node. The first node broadcasts probes containing the provisional network addressuntil a first probe response to one of the probes is received or a first interval of time elapses. If the first probe response to oneof the probes is received, then the first node determines a second provisional network address and repeats selection of theaddress and broadcasting, until no probe response is received in the first interval of time. Using the first provisional networkaddress, the first node broadcasts forward probes in the network until a second probe response to one of the forward probes isreceived by the first node or a second period of time has transpired. If a second probe response to one of the forward probes isreceived by the first node, then the first node determines a third provisional network address and repeats the steps of selecting,broadcasting probes and forward probes until no the response is received in the second interval of time. The final provisionalnetwork address may be used as the unique network address for the first node. MainClaim: In a network comprising a first node and a second node in wireless communication, a method of assigning a uniquenetwork address within said network to said first node, comprising the following steps:

a. said first node in said network determining a first provisional network address for use in assigning said unique networkaddress;

b. said first node broadcasting a first probe containing said first provisional network address until a first probe response to saidfirst probe is received or a first interval of time has transpired;

c. if said first probe response to said first probe is received, then said first node determining a second provisional networkaddress and repeating steps b and c, said second provisional network address becoming said first provisional network address,until no said first probe response is received in said first interval of time;

d. using said first provisional network address, broadcasting by said second node, a second probe in said network until a secondprobe response to said second probe is received by said first node or a second period of time has transpired, wherein said

www.patentics.com


second probe comprises a forward probe that includes a radius remaining number indicating whether another node in saidnetwork may re-broadcast said forward probe;

e. if said second probe response to said second probe is received, then said first node determining a third provisional networkaddress and repeating steps b through e, said third provisional network address becoming said first provisional network address,until no said second probe response is received in said second interval of time; and

f. using said first provisional network address as said unique network address for said first node.

7,729,350 Virtual multicast routing for a cluster having state synchronization

Nokia, Inc.

Singh; Ravi I. | Bahadur; Rahul | Hunt; Peter Frederick

370 H04L 20041230 1 92%

Abstract: A system, apparatus, and method are directed to managing multicast routing using a network cluster. A clustermaster actively participates in multicast control protocol communications with the cluster neighbors, while non-master member nodes, do not participate in the protocols' operation outside of the cluster. However, each cluster member maintains virtually thesame protocol state, such that should the master become unavailable, another cluster member may assume the master rolewith minimum delay. New members to the cluster are synchronized by receiving initial protocol state information from themaster. After the initial protocol state synchronization, cluster members actively monitor the network to acquire new protocolstate information. In addition, cluster members exchange protocol state information between themselves that may not beobtainable off the network. Filtering of multicast data packets is performed by each cluster member, to load balance multicastdata traffic across the cluster members. MainClaim: A system, comprising: a first network device configured to operate as a cluster master within a cluster, the firstnetwork device being configured to direct sending of initial protocol state information to a cluster member when the clustermember is joining the cluster, direct sending of a multicast control protocol packet to at least one network device external to thecluster, receive a multicast data packet, and direct forwarding of the multicast data packet towards a destination when the firstnetwork device is associated with the multicast data packet; and a second network device configured to operate as the clustermember within the cluster, the second network device being configured to receive the initial protocol state information from thefirst network device during a joining of the second network device to the cluster, monitor the network for additional protocolstate information, employ the additional protocol state information to update a state of the second network device whenadditional protocol state information is received, receive a multicast data packet, direct forwarding of the multicast data packettowards a destination when the second network device is associated with the multicast data packet, receive a multicast controlprotocol packet from the at least one network device external to the cluster, and drop the multicast control protocol packetrather than responding to the multicast control protocol packet.

2004/0264372

Quality of service (QoS) routing for Bluetooth personal area network (PAN) with inter-layer optimization

Nokia Corporation Huang, Leping 370 H04L 20030627 1 92%

Abstract: This invention grows out of an appreciation by the inventor that the QoS is an important metric for a Bluetooth (BT)PAN, as unpredictable indoor radio conditions can degrade the QoS and the stability of the routing protocol that is used toguarantee the QoS. In a first aspect this invention provides a traffic measurement embodiment that updates the QoSinformation in all nodes along the path of a packet. This embodiment functions to monitor the end-to-end QoS quality, and improves the protocol stability. In a second aspect this invention provides a cross-layer optimization embodiment by which the BT Link layer information (e.g., LinkSupervision_Timeout and RSSI) is integrated into the PAN routing protocol, to furtherenhance the stability of the routing protocol. MainClaim: A method for operating a wireless network comprised of end nodes and at least one intermediate node, comprising:at an originating node of a session with a destination node, initiating a route search by sending a Route Request message; atthe destination node, or another node having knowledge of the destination node, replying to the originating node with a RouteReply message when there is a valid route, where route delay information relative to the responding node is contained withinthe Route Reply message; and selecting a route with a smallest route delay to send a packet from the originating node to thedestination node.

2003/0110291

Method and device for route searching in a bluetooth ad-hoc network

Nokia Corporation Chen, Hongyuan 709 G06F 20011212 1 92%

Abstract: A method for transmitting a route request in an ad-hoc network having master nodes and slave nodes includes transmitting the route request to the master nodes of the network via a unicast transmission and transmitting a reply identifyingthe route. Each node of the network which receives the request performs a route request algorithm. The algorithm may beimplemented in the network layer of the device protocol stack or in the link layer of the device protocol stack. MainClaim: A method for transmitting a route request for a route between a source node and a destination node in an ad-hoc network and for transmitting a reply identifying the route, the ad-hoc network including a plurality of nodes including at least one master node in at least one piconet, said method comprising: transmitting the route request from the receiving node in thead-hoc network to the at least one master node of said at least one piconet via a unicast transmission; and generating a routereply and sending the route reply to the source node, the route reply identifying the route in the ad-hoc network between the source node and the destination node.

6,831,928

Method and apparatus for ensuring compatibility on a high performance serial bus

Apple Computer, Inc.Hauck; Jerrold V. | Whitby-Strevens; Colin

370 H04J 20000217 0 100%

Abstract: Various methods for ensuring compatibility between devices utilizing the IEEE 1394-1995 serial bus standard and new implementations of the standard are disclosed. Methods are disclosed which a allow border nodes to speed filter a Legacy cloud.Methods are disclosed which allow a BOSS node to speed filter a Legacy cloud. A method for ensuring compatibility is disclosedwhich comprises the acts of determining whether the B PHY desires to communicate at a speed on a bus having a peer devicenot capable of communicating at the speed; and speed filtering the peer device if the B PHY determines that the peer devicecannot communicate at the speed. Various data packets and methods for transmitting data packets are also disclosed to satisfythe needs discussed herein. MainClaim: In a data communications system having at least one Legacy cloud coupled to at least one Beta cloud and further

www.patentics.com


having at least one border node, a method for ensuring compatibility comprising:

waiting until the border node receives a packet;

issuing a data prefix packet by said border node into the Legacy cloud when said border node receives a packet;

determining whether said border node has received or transmitted a Legacy packet; and

appending said Legacy packet onto the end of said data prefix and transmitting said Legacy format packet into said Legacy cloudif said border node has received or transmitted a Legacy packet.

2005/0111490

Communications bus having low latency interrupts and control signals, hotpluggability error detection and recovery, bandwidth allocation, network integrity verification, protocol tunneling and discoverability features

Nokia Corporation Gillet, Michel 370 H04L 20041007 6 92%

Abstract: Disclosed are methods and apparatus to control data and command flow over a physical communications channelbetween a transmitter and a receiver, and more specifically to provide a protocol for a point-to-point serial bus architecture with low latency time for flow control and other signaling, regardless of the length of the data packet frame. The abstract data flowcontrol protocol can be employed by various buses as it interacts only with the lowest protocol layers. Separate buffers for dataand control can be used to allow the bus to be compatible with slower buses also to support additional control functions withoutinvolving a higher protocol layer. MainClaim: A communications bus comprising a datalink layer coupled to a physical layer, said datalink layer comprising amultiplexer operable to multiplex at least one abstract protocol to be superimposed on a datalink layer frame and channelprotocol.

7,668,202


Nokia Corporation Gillet; Michel 370 H04J 20041007 6 92%

Abstract: Disclosed are methods and apparatus to control data and command flow over a physical communications channelbetween a transmitter and a receiver, and more specifically to provide a protocol for a point-to-point serial bus architecture with low latency time for flow control and other signaling, regardless of the length of the data packet frame. The abstract data flowcontrol protocol can be employed by various buses as it interacts only with the lowest protocol layers. Separate buffers for dataand control can be used to allow the bus to be compatible with slower buses also to support additional control functions withoutinvolving a higher protocol layer. MainClaim: An apparatus comprising: a communications bus; and a processor configured to implement a protocol stackcomprising a datalink layer coupled to a physical layer, where the protocol stack operates with a protocol having frames, whereeach frame is comprised of a plurality of channels, where each channel is comprised of at least one token, where at least onechannel of the plurality of channels is defined as a low latency channel for traffic having a low latency requirement, where saiddatalink layer is operable to intersperse at least one low latency channel token with tokens from at least one other channel toobtain a set of interspersed tokens, where the processor is further configured to transmit the set of interspersed tokens toanother node via the communications bus.

5,150,464 Local area network device startup process


Sidhu; Gursharan S. | Oppenheimer; Alan B. | Mathis; James E.

709 G06F 19900606 0 100%

Abstract: Method used by a first entity, typically a computer system, on a communication system for assigning itself a uniqueaddress known as a network address, which comprises a network number and a node identification number. The entitydetermines a unique network address for itself within a local subset of entities known as a local area network (LAN). A signal isthen transmitted to determine whether a router is connected to the LAN, and if so, to determine if the network number of theaddress is within a range allowed by the router. If the network number is not within a range allowed by the router, then anothernetwork number is selected from a range of numbers provided by the router and another node ID are selected. It is determinedwhether this value is being used by any other entities in the LAN, and if so, node ID's are selected until an unused networkaddress is ascertained. If all node ID's for an address are checked, then another network number is selected from the range andnode ID's are again selected to determine a unique address. Once a unique address is ascertained, this is stored back into aparameter RAM area for a subsequent power up initialization and is used for the unique identification of the first entity. MainClaim: In a communication system for transferring data between a plurality of entities coupled together in saidcommunication system, said communication system including subsets of said plurality of entities which each have at least onerouting means interconnecting each of said subsets with other subsets in said communication system, said subsets including alocal subset of entities which comprises a first entity, a method used by the first entity for assigning itself a unique address onthe communication system, comprising the steps of:

a. if a first value is stored in a first storage means, then performing the following steps:

i. storing the first value in a second storage means;

www.patentics.com


ii. transmitting a first signal to said local subset of entities to determine if the first value is used for the unique identification ofanother entity in said local subset of entities;

iii. if the first value is used for the unique identification of said another entity in said local subset of entities then receiving asecond signal from another entity in said local subset of entities within a first predetermined amount of time;

iv. storing the value in said second storage means in said first storage means;

b. if the first value has not been stored in the first storage means, or if the first value has been stored in the first storage meansand the second signal is received then performing the following steps:

i. randomly selecting a third value and storing said third value in the second storage means;

ii. transmitting a third signal to said local subset of entities to determine if the third value is used for the unique identification ofsaid another entity;

iii. if the third value is used for the unique identification of said another entity then receiving a fourth signal from said anotherentity in said local subset of entities, randomly selecting a fourth value, storing the fourth value in the second storage meansand repeating steps b.ii and b.iii until the fourth signal is not received, the fourth value becoming the third value at thebeginning of each repetition of step b.ii;

iv. storing the value in said second storage means in said first storage means;

c. transmitting a fifth signal to said local subset of entities to request information from a first routing means coupled to the localsubset of entities;

d. if a sixth signal is received from the routing means within a second predetermined period of time, the sixth signal including alist of values for the local subset of entities, then performing the following steps:

i. if a first portion of the value contained within the second storage means does not equal one value in the list of values providedin the sixth signal, then randomly selecting a fifth value from the list of values provided in said sixth signal and storing said fifthvalue in the second storage means;

ii. transmitting a seventh signal to said local subset of entities to determine if the value contained in the second storage meansis used for the unique identification of said another entity;

iii. if the value contained in the second storage means is used for the unique identification of said another entity then receivingan eighth signal from another entity in said local subset of entities, randomly selecting a sixth value from the list of valuesprovided in the sixth signal, and storing the sixth value in the second storage means, said sixth value having a first portionequivalent to the first portion of said second storage means and repeating steps d.ii and d.iii until the eighth signal is notreceived or until all possible sixth values have been stored in said second storage means;

iv. if all possible sixth values have been stored in the second storage means then randomly selecting a seventh value from saidlist of values in said sixth signal, and storing said seventh value in said second storage means and repeating step d.ii.;

v. storing the value in said second storage means in said first storage means;

e. using said value in said first storage means as said unique identification for said first entity.

2007/0223494

Method for the resolution of addresses in a communication system

Nokia Corporation

Hyyrynen; Altti | Korkeila; Janne | Hoving; Patrick | Kuikka; Mikko

370 H04L 20060621 1 95%

Abstract: The invention relates to a method for address resolution in a communication system. Each node is configured with amanagement node physical address. A node assuming the role of a management node transmits a known management nodephysical address to a via a network segment. The management node physical address is associated with the network segment inthe switch. Address resolution queries are unicasted from other nodes to the switch using the management node physicaladdress. The switch relays the queries to the network segment of the management node. From the queries the managementnode records logical address and physical address pairs pertaining to other nodes. MainClaim: A method for address resolution in a communication system comprising configuring a management node physicaladdress in a first node and a second node; said first node detecting that it must act as a management node; transmitting saidmanagement node physical address from said first node to a switch via a first network segment; associating said managementnode physical address with said first network segment in said switch; transmitting an address resolution query message fromsaid second node via a second network segment to said switch, said address resolution query message comprising saidmanagement node physical address, a logical address of said second node and a physical address of said second node; saidswitch transmitting said address resolution query to said first network segment; said first node recording an association betweensaid logical address of said second node and the physical address of said second node; and said first node providing to saidsecond node information on at least one association between a physical address and a logical address of a third node.

6,775,258

Apparatus, and associated method, for routing packet data in an ad hoc, wireless communication system

Nokia Corporationvan Valkenburg; Sander | Palomar; Marc Solsona

370 H04Q 20000317 3 95%

Abstract: Apparatus, and an associated method, by which to route packets of data between a data source node and a data

www.patentics.com


destination node in an ad hoc, wireless network, such as a Bluetooth scatternet. Data routing tables are provided to each node,and header information extracted from a packet header is used by such tables. Routing of a packet of data is effectuated in ahop-by-hop manner to effectuate the communication of the packet from the data source node to the data destination node. MainClaim: In a multinode, ad hoc, wireless communication system having at least a data source node and a data destinationnode, and the communication system selectably and dynamically formed of a first piconet at which the data source node ispositioned and a second piconet at which a data destination node is positioned, each of the first and at least second piconetshaving a master node and at least one slave node, the at least one slave node capable of communication of the packets of dataonly to an associated master node, the data source node forming a selected one of a slave node and a master node of the firstpiconet and the data destination node a selected one of a slave node and a master node of the second piconet, an improvementof apparatus for facilitating routing of packets of data between the data source node and the data destination node by way of acommunication path, the communication path having at least one node, inclusive of the data destination node, said apparatuscomprising:

at least one first routing table embodied at each of the at least one node of the communication path and having an incomingdata ledger and an outgoing data ledger, said first routing table for facilitating mapping an incoming data packet to an outgoingdata packet, said first routing table populated with values extracted from header information of the packets, the packets routedin a first manner using values of the at least one first routing table when the node at which said at least one first routing table isembodied forms a slave node and the packets routed in a second manner using values of the at least one first routing tablewhen the node at which said at least one first routing table is embodied forms a master node.

2007/0291665

LAN TOPOLOGY DETECTION AND ASSIGNMENT OF ADDRESSES

Nokia CorporationHAUENSTEIN; MARKUS | Niggemeier; Peter

370 H04L 20070226 3 95%

Abstract: A method, system, device and computer program product for automatically detecting a topology of a local areanetwork, LAN. The LAN may be included in a telecommunication node, e.g. a base transceiver station. The LAN includes acentral host and further hosts connected to the LAN. The central host sends topology descriptors to the hosts connected to theLAN, the hosts each reporting at least one of the received topology descriptors and other information to the central host. Thecentral host can thus build up a topology data base describing the network topology. The topology descriptors are sent inbroadcast frames to the hosts. A host, after having received a topology descriptor, may create one or more dedicated addresses,e.g. from the topology descriptor, and return the address(es) to the central host which may store the address(es). MainClaim: A method for detecting a network topology of a local area network, the local area network comprising a central hostand at least one further host, the method comprising:sending topology descriptors from the central host to the at least onefurther host;receiving a sent topology descriptor at the at least one further host;each of the at least one further host reportingthe received topology descriptor to the central host;the central host building up a topology data base describing the networktopology based on the reported received topology descriptors.

7,447,927 Method and apparatus for waking up a sleeping system

Apple Inc.Siegmund; Dieter W. 713 G06F 20050823 0 100%

Abstract: One embodiment of the present invention provides a system that wakes up a sleeping target system located on atarget LAN (Local Area Network) from a remote system located on a remote LAN. Note that, since the sleeping target system isin a sleep state, it receives packets of a lower-layer protocol which cannot be used by the remote system to directly sendpackets to the sleeping target system. During operation, the remote system creates a wake-up packet. The remote system then uses a second protocol to send the wake-up packet to a relay agent located on the target LAN. Note that using the upper-layer protocol enables the remote system to communicate with the relay agent even though they are on different LANs. Uponreceiving the first wake-up packet, the relay agent uses the lower-layer protocol to send a second wake-up packet to the sleeping target system, which causes the sleeping target system to wake up. Recall that the remote system cannot use thelower-layer protocol to send a wake-up packet directly to the sleeping target system because the remote system and thesleeping target system are on different LANs. The remote system overcomes this limitation by first sending a wake-up packet to the relay agent using the upper-layer protocol, which causes the relay agent to send another wake-up packet to the sleeping target system using the lower-layer protocol. MainClaim: A method for waking up a sleeping target system located on a target LAN (Local Area Network) from a remotesystem on a remote LAN, wherein the sleeping target system receives packets of a first protocol which cannot be used by theremote system to send a packet directly to the sleeping target system because the remote system and the sleeping targetsystem are on different LANs, the method comprising: creating a first wake-up packet, wherein creating the first wake-un packet involves determining an IP (Internet Protocol) address of a relay agent located on the target LAN based on an IP addressof the sleeping target system and a subnet mask; and sending the first wake-up packet to the relay agent using a second protocol; wherein sending the first wake-up packet to the relay agent causes the relay agent to use the first protocol to send asecond wake-up packet to the sleeping target system, which causes the sleeping target system to wake up; and wherein thefirst wake-up packet is a network-layer packet which includes a DHCP (Dynamic Host Configuration Protocol) reply packet whoseheader contains: a client hardware address field which is set to a link-layer address of the sleeping target system; a client IP address field which is set to a network-layer address associated with the link-layer address of the sleeping target system; and a relay agent network-layer address field which is set to a network-layer address associated with an interface of the relay agent which is coupled with the target LAN, wherein the relay agent located on the target LAN is a DHCP relay agent.

2007/0002822 Multi homing transport protocol on a multi-processor arrangement

Nokia Corporation Huang; Hui 370 H04J 20060112 1 93%

Abstract: The invention proposes a processing arrangement (to be used in a communication device, for example), wherein theprocessing arrangement comprises at least one data processing unit (1), and a communication unit (2) connected to the dataprocessing unit (1), wherein the at least one data processing unit (1) is configured to perform data processing and thecommunication unit (2) is configured to provide a connection to the external, a packet transport control is used for theconnection to the external, in which a plurality of addresses may be assigned to the communication unit (2), and thecommunication unit and the data processing unit comprise delivering means (13, 23) for delivering packets, which are to bedelivered between the data processing unit (1) and the external, via an encapsulated connection (3) between the dataprocessing unit and communication unit. The invention also proposes a corresponding communication method. MainClaim: A processing arrangement, comprising: at least one data processing unit for performing data processing; and acommunication unit, connected to the data processing unit, for providing a connection to an external wherein a packet transportcontrol is used for the connection to the external, in which a plurality of addresses may be assigned to the communication unit,and wherein the communication unit and the data processing unit comprise delivering means for delivering packets, which are to

www.patentics.com


be delivered between the data processing unit and the external, via an encapsulated connection between the data processingunit and communication unit.

2008/0046571 Pervasive inter-domain dynamic host configuration

Nokia CorporationTuononen; Janne | Poyhonen; Petteri 709 G06F 20061108 1 93%

Abstract: There is provided pervasive dynamic host configuration in a communication system comprising a plurality of domainsbeing separated from each other by intermediary devices blocking host configuration messages, including encapsulation-based dynamic host configuration messaging and an enhanced host apparatus for dynamic host configuration. MainClaim: A method, comprising:obtaining a host configuration message to be transferred from a source entity to adestination entity, the destination entity of the host configuration message being located in a different domain than the sourceentity of the host configuration message, the domains being separated from each other by intermediary devices configured toblock host configuration messages;encapsulating the obtained host configuration message based on an encapsulationprocedure; andtransferring the encapsulated host configuration message toward the destination entity.

7,613,193

Apparatus, method and computer program product to reduce TCP flooding attacks while conserving wireless network bandwidth

Nokia CorporationSwami; Yogesh P. | Le; Franck 370 H04L 20060203 1 92%

Abstract: A method for operating a firewall includes: in response to the firewall receiving a TCP SYN request packet that is senttowards a first node from a second node, the TCP SYN request packet comprising a sequence value ("seq"), sending to thesecond node a SYN|ACK packet, the SYN|ACK packet comprising a seq and an ack_sequence value ("ack_seq"), where ack_seqof the SYN|ACK packet is not equal to the TCP SYN request packet's seq+1; and in response to the firewall receiving a TCP RSTpacket from the second node, verifying that the seq in the TCP RST packet matches the ack_seq of the SYN|ACK packet and, if itdoes, designating the connection with the second node as an authorized connection. MainClaim: A method comprising: in response to a firewall receiving a transport control protocol synchronization (TCP SYN)request packet that is sent towards a first node from a second node, said TCP SYN request packet comprising a sequence value("seq"), sending to the second node an acknowledgement and synchronization (SYN|ACK) packet, said SYN|ACK packet comprising a seq and an ack_sequence value ("ack_seq"), where ack_seq of the SYN|ACK packet is not equal to the TCP SYNrequest packet's seq+1, wherein the ack_seq of the SYN|ACK packet is determined by a function that utilizes a secret valueknown to the firewall, IP address information, and a HASH function, wherein the secret value is not known to the second node;in response to receiving a transport control protocol reset (TCP RST) packet from the second node, verifying that the seq in theTCP RST packet matches the ack_seq of the SYN|ACK packet and, if it does, designating the connection with the second node asan authorized connection; sending an additional transport control protocol (TCP) packet to the second node, where theadditional TCP packet does not have a SYN or ACK flag but does comprise a sequence value ("seq") equal to the seq of the TCPSYN request packet; after designating the connection with the second node as an authorized connection, using the seq of anadditional received TCP RST packet to construct a synchronization (SYN) packet similar to the original TCP SYN request packet;and sending the constructed SYN packet to the first node to further enable a secure connection.

6,996,624 Reliable real-time transport protocol

Apple Computer, Inc. LeCroy; Chris | Vaughan; Gregory

709 G06F 20010927 0 100%

Abstract: Reliability is added to RTP by having a client acknowledge to the server each of the RTP packets received by theclient, and retransmitting from the server to the client any of the packets that remain unacknowledged subsequent to expirationof a predetermined time duration subsequent to the timestamp. The server continuously determines a maximum number ofbytes that may be contained in the RTP packets streaming into the network and, in the event a number of bytes in the RTPpackets exceeds the maximum number, discontinues streaming of the RTP packets until it is determined that the number ofbytes is less than the maximum number. The server also continuously determines a present streaming rate at which the RTPpackets are streamed into the network wherein the present streaming rate exceeds the normal streaming rate. MainClaim: In a computer network having at least one client and at least one server, said client and said server beingselectively in communication with each other over said network, said server streaming into said network a plurality of Real-time Transport Protocol, RTP, packets addressed for said client at a normal streaming rate commensurate with a rate of reading saidpackets at said client, each of said RTP packets including at least a sequence number and a timestamp, a reliable RTP methodcomprising:

acknowledging to said server each of said RTP packets received by said client;

re-transmitting from said server to said client any of said RTP packets that remain unacknowledged subsequent to expiration ofa predetermined time duration subsequent to said timestamp;

continuously determining a maximum number of bytes that may be contained in said RTP packets streaming into said networkand, in the event a number of bytes in said RTP packets exceeds said maximum number, discontinuing streaming of said RTPpackets until said determining step indicates said number of bytes is less than said maximum number; and

continuously determining a present streaming rate at which said RTP packets are streamed into said network wherein saidpresent streaming rate exceeds said normal streaming rate.

2004/0186877 Method and device for multimedia streaming Nokia Corporation

Wang, Ru-Shang | Varsa, Viktor | Leon, David | Aksu, Emre Baris | Curcio, Igor Danilo Diego

709 G06F 20030321 1 93%

Abstract: A method to provide to a sender of RTP packets the actual receiver buffer fullness level in a receiver of the RTPpackets at a certain time instant represented as remaining playout duration in time. The receiver sends in an RTCP report thesequence number of a selected RTP packet in the receiver buffer and the time difference between the scheduled playout time ofthis packet and the current time. Based on this timing information, the sender calculates the amount of time it would take forthe receiver buffer to empty if the receiver continues to playout at normal speed and no further RTP packets arrive to thereceiver buffer. This receiver buffer fullness level information can be used at the sender to adjust the transmission rate and/or

www.patentics.com


nominal playout rate of the RTP packets in order to maintain a targeted receiver buffer fullness level. MainClaim: A method for adaptively controlling fullness level of a receiver buffer in a streaming client in a multimediastreaming system, the streaming system comprising a streaming server capable of providing streaming data in packets at atransmission rate to the streaming client for allowing the client to playout at least a portion of the packets at a playout rate,wherein each packet has a sequence number, and wherein the receiver buffer is used to store at least a portion of the streamingdata in order to compensate for a difference between the transmission rate and the playout rate so as to allow the client to havea sufficient amount of the streaming data to playout in a non-disruptive manner, and the stored portion of the streaming data inthe receiver buffer includes a sequence of packets to be played out, said sequence including a first packet to be played out and alast packet to be played out, said method comprising the steps of: providing to the server a message including informationindicative of remaining playout duration in time in the receiver at a time instant; and adjusting in the server the transmissioncharacteristic at which the streaming data is provided to the client.

7,606,928

Method and device for controlling receiver buffer fullness level in multimedia streaming

Nokia Corporation

Wang; Ru-Shang | Varsa; Viktor | Leon; David | Aksu; Emre Baris | Curcio; Igor Danilo Diego

709 G06F 20030321 1 93%

Abstract: A method to provide to a sender of RTP packets the actual receiver buffer fullness level in a receiver of the RTPpackets at a certain time instant represented as remaining playout duration in time. The receiver sends in an RTCP report thesequence number of a selected RTP packet in the receiver buffer and the time difference between the scheduled playout time ofthis packet and the current time. Based on this timing information, the sender calculates the amount of time it would take forthe receiver buffer to empty if the receiver continues to playout at normal speed and no further RTP packets arrive to thereceiver buffer. This receiver buffer fullness level information can be used at the sender to adjust the transmission rate and/ornominal playout rate of the RTP packets in order to maintain a targeted receiver buffer fullness level. MainClaim: A method for adaptively controlling fullness level of a receiver buffer in a streaming client, the streaming clientadapted to receive a sequence of packets from a streaming server through a communication link, said method comprising:selecting in the streaming client one of the packets in the sequence to be played out, the selected one packet having ascheduled playout time, wherein the receiver buffer is adapted for storing at least part of the sequence of packets; conveyingthrough the communication link a message from the streaming client to the streaming server including information indicative ofthe scheduled playout time of the selected packet in the sequence to be played out; and determining in the server the fullnesslevel of the receiver buffer at least partly based on the information for adjusting transmission characteristic in the streamingserver, wherein the fullness level is computed based on a sequence number of the selected packet, a time difference betweenthe scheduled playout time of the selected packet and a current time, and the sequence number of a last packet in the sequenceto be played out.

2005/0254508

Cooperation between packetized data bit-rate adaptation and data packet re-transmission

Nokia CorporationAksu, Emre Baris | Leon, David | Curcio, Igor

370 H04L 20040513 1 93%

Abstract: A method for improving a cooperation between a packetized data bit-rate adaptation and a data packet re-transmission transmits data packets from a server to a client with a first bit-rate; stores transmitted data packets in a server buffer; stores transmitted data packets in a client buffer; signals impairment information related to an impairment oftransmitted data packets during transmitting to the server, wherein the signaled impairment information is analyzed by theserver to decide if a re-transmission of data packets stored in the server buffer is required; and signals client buffer informationrelated to a state of the client buffer to the server, wherein the client buffer information is analyzed by the server to decide if are-transmission of data packets is required. MainClaim: A method for improving a cooperation between a packetized data bit-rate adaptation and a data packet re-transmission, comprising: transmitting data packets from a server to a client with a first bit-rate; at least temporarily storing at least one of said transmitted data packets in at least one server buffer; at least temporarily storing at least one of saidtransmitted data packets in a client buffer; signaling impairment information related to an impairment of at least one of saidtransmitted data packets during said transmitting to said server, wherein said signaled impairment information is analyzed bysaid server to decide if a re-transmission of at least one data packet stored in said server buffer from said server to said client isrequired; signaling client buffer information related to a state of said client buffer to said server; and transmitting data packetsfrom said server to said client with a second bit-rate, wherein said second bit-rate is at least partially determined based on said client buffer information, and wherein at least one data packet transmitted with said first bit-rate and stored in said server buffer is further stored in said server buffer when said transmitting of said data packets from said server to said client with saidsecond bit-rate starts.

5,410,543

Method for connecting a mobile computer to a computer network by using an address server

Apple Computer, Inc.Seitz; Gregory W. | Findley; Sean J. | Beisel; Philipp W.

370 H04J 19940705 0 100%

Abstract: This invention provides a method for connecting a mobile computer to a computer network by using an addressserver. The mobile computer connects itself to a network and requests an address server to represent it on the network. Theaddress server accepts packets intended for the mobile computer and redirects them to the current actual address of the mobilecomputer. As the mobile computer moves, it reports its new actual address to the address server, so that packets intended forthe mobile computer can be redirected to the new actual address. MainClaim: A method for connecting a mobile computer to a computer network by using an address server, the methodcomprising the steps of:

establishing the address server on the network;

representing the mobile computer by a represented address on the address server;

connecting the mobile computer to the network, and reporting its new actual address to the address server;

at the address server, redirecting messages to the represented address to the new actual address of the mobile computer,except blocking broadcasted routing table maintenance protocol messages; and

www.patentics.com


repeating the connecting and redirecting steps as the mobile computer moves to new addresses on the network.

2008/0002686 Maintaining an existing connection between nodes

Nokia CorporationValli; Jyrki | Pohja; Seppo 370 H04L 20061221 1 96%

Abstract: The present invention refers to a method performed in and corresponding nodes constituting a system which isconfigured to maintain an existing connection between a first node (A) and a second node (B) communicating with each othervia a connection within a communication network. Data is communicated between the nodes (A, B) via the connection on thebasis of addresses assigned to the respective nodes. The addresses are managed by an address management node (Addr_Serv)of the communication network. The system comprises a detector unit (A2), at the first node (A), configured to detect an outageof the existing connection between the nodes (A, B), a consulting unit (A3), at said first node (A), configured to consult afterdetecting the outage of the connection, the address management node (Addr_Serv) of the communication network to verify theaddress assigned to the second node (B), a transceiver unit(AS1), at said address management node (Addr_Serv), configured toreturn a current address assigned to the second node (B) responsive to a request from the consulting unit to the first node, anda connection re-establisher unit (A5), at said first node (A), configured to re-establish the connection based on the current address assigned to the second node (B). MainClaim: A method of maintaining a connection between a first node and a second node, comprising:detecting, by the firstnode, an outage of an existing connection between the first and second nodes;consulting, by said first node, after detecting theoutage of the connection, an address management node of a communication network to verify an address assigned to thesecond node;returning, from said address management node, a current address assigned to the second node; andre-establishing the existing connection, by said first node, based on the current address assigned to the second nodewherein datais communicated between the first and second nodes on the basis of addresses assigned to the respective nodes, and whereinthe addresses are managed by the address management node of the communication network.

6,930,988 Method and system for fast IP connectivity in a mobile network

Nokia Corporation Koodli; Rajeev | Perkins; Charles E.

370 H04Q 20021028 1 95%

Abstract: An apparatus, system, and method are directed to managing connectivity in a network by expediting the ability of amobile node to send Internet Protocol (IP) packets subsequent to a handover. The mobile node is configured to determine anunconfirmed address for use on an access router. Upon establishing a link-layer connection, and before establishing a network-layer connection with the access router, the mobile node employs the unconfirmed address to send an IP packet to the accessrouter. Employing the unconfirmed address prior to network-layer connectivity enables the reduction of handover latencies. Ifthe access router determines that the unconfirmed address conflicts with an existing address, the access router provides amessage to the mobile node indicating the conflict in addresses. In response to the message, the mobile node performs actionsto resolve the address conflict. MainClaim: An apparatus for managing connectivity in a network, comprising:

(a) a network interface that employs a packet-based protocol to send and receive packets;

(b) a mobile node configured to perform actions, including:

determining an unconfirmed address; and

if the mobile node is handed over to a router, and a network-layer connection is unestablished with the router, employing the network interface to provide a packet including the unconfirmed address to the router, wherein the mobile node singularlyconfirms the use of the unconfirmed address.

7,058,052

System and method for using a mobile router tunneling protocol to locate functionality in a distributed architecture

Nokia Corporation Westphal; Cedric 370 H04L 20030411 1 95%

Abstract: The system and method provides virtual mobility to an application by using a mobile router tunneling protocol(MRTP). The system and method use a MRTP to enable bi-directional tunneling between gateways so as to facilitate processingat a second network cluster in a way that is transparent to the user. MainClaim: A method performed in an originating gateway communicatively coupled to a first network cluster, comprising:invoking a trigger by an application in the originating gateway when at least one predetermined circumstance occurs; uponreceipt of the trigger, maintaining a service location in a fixed network environment using a bi-directional tunnel to a second network cluster according to a mobile router tunneling protocol; receiving a packet addressed in the first network cluster;resolving a new destination in the second network cluster of the received packet based on the maintaining; and forwarding thepacket to the resolved destination in a manner that is transparent to a sender of the packet and that does not require furtherauthentication of the sender or encapsulation of the packet.

7,317,694 Method and apparatus for border node behavior on a full-duplex bus

Apple Inc.Hauck; Jerrold V. | Whitby-Strevens; Colin

370 H04L 20030805 0 100%

Abstract: A method is disclosed for determining and communicating the existence of a hybrid bus. The method comprises theacts of determining whether the node has a connection to a Legacy link layer; if the node determines that it has a connection toa Legacy link layer, then transmitting a Self-ID packet without a Speed Code; and if the node determines that it does not have aconnection to a Legacy link layer, then transmitting a Self-ID packet without a Speed Code. MainClaim: In a full-duplex communications system having at least one node compliant with the P1394b standard, a methodfor determining and communicating the existence of a hybrid bus comprising the acts of: determining whether a node has aconnection to a Legacy link layer; if said node determines that it has a connection to a Legacy link layer, then transmitting aSelf-ID packet without a Speed Code; and if said node determines that it does not have a connection to a Legacy link layer, thentransmitting a Self-ID packet with a Speed Code.

Communications bus having low latency interrupts and control signals, hotpluggability error detection and

www.patentics.com


2005/0111490

recovery, bandwidth allocation, network integrity verification, protocol tunneling and discoverability features



7,668,202






710 G06F 20030805 0 100%

Abstract: A method for determining and communicating the existence of a hybrid bus is disclosed. The method determineswhether a connected node is a border node and forwards isochronous and asynchronous requests if the node is not a bordernode. If the node is a border node, a Border low request is issued if there are no asynchronous requests to forward. If there areasynchronous requests to forward then these asynchronous requests are forwarded. A Border low request is issued if there areno isochronous requests to forward; otherwise any isochronous requests to be forwarded are forwarded. MainClaim: In a full-duplex communications system having at least one node in communication with other nodes over a fullduplex bus, a method for determining and communicating the existence of a hybrid bus comprising the acts of: determiningwhether the at least one node is a border node; forwarding isochronous and asynchronous requests if said at least one node isnot a border node; and if said at least one node is a border node, then; determining whether said at least one node has anyasynchronous requests to forward; issuing a Border_low request if there are no asynchronous requests to forward; forwardingsaid asynchronous requests if there are asynchronous requests to forward; determining whether there are any isochronousrequests to forward; issuing a Border_low request if there are no isochronous requests to forward; and forwarding saidisochronous requests if there are isochronous requests to forward; wherein at least one of said Border_low requestscommunicates to at least one non-border node that said at least one non-border node is communicating on a hybrid bus.

2005/0111490




Communications bus having low latency interrupts and control signals, hotpluggability error detection and

www.patentics.com


7,668,202

recovery, bandwidth allocation, network integrity verification, protocol tunneling and discoverability features





370 H04L 20030805 0 100%

Abstract: A method relating to the behavior of border nodes within a high performance serial bus system is disclosed. A methodis disclosed for determining a path to a senior border node comprising the acts of: determining whether a B PHY has received aSelf-ID packet without a Speed Code on at least one port; and marking the at least one port on the B PHY that was last toreceive a Self-ID packet without a Speed Code as the path to the senior border node and canceling by the B PHY of any otherports within the node that have been marked as the path to the senior border node if the B PHY has received a Self-ID packet without a Speed Code on the at least one port. MainClaim: In a full-duplex communications system having at least one B PHY containing at least one port, a method fordetermining a path to a senior border node comprising the acts of: determining whether a B PHY has received a Self-ID packet without a Speed Code on at least one port; and marking said at least one port on said B PHY that was last to receive a Self-ID packet without a Speed Code as the path to the senior border node and canceling by said B PHY of any other ports within saidnode that have been marked as the path to the senior border node if said B PHY has received a Self-ID packet without a Speed Code on said at least one port.

2005/0111490




7,668,202




5,282,270 Network device location using multicast

Apple Computer, Inc.Oppenheimer; Alan B. | Findley; Sean J. | Sidhu;

709 H04L 19900606 0 100%

www.patentics.com


Gursharan S.

Abstract: A method and apparatus for determining the location of an entity using an alias (or entity name) in a communicationsystem. A second node or entity transmits a first signal to a first router connected to a first local network of the communicationsystem including the alias, wherein the alias includes a zone name. The first router forwards a second signal including the entityname from the first signal to other routers in the network until a second router connected to nodes having the zone name in theentity name is located. Each second router translates the second signal into a third signal which includes the alias, and using afirst zone multicast address, multicasts the third signal to a first set of nodes. Each node of the first set of nodes determineswhether the zone name contained within the alias is equal to a zone identifier for each node of the first set of nodes. Each nodehaving the zone name determines whether the alias contained within the third signal is equal to alias information for the node. Afirst entity having the alias then transmits a fourth signal, which includes its network address, to the second entity in responseto the third signal. MainClaim: In a communication system for transferring data between a plurality of devices, a method for determining thelocation of a first entity on the communication system, comprising the steps of:

a. a second entity transmitting a first signal to a first routing means connected to a first local network of the communicationsystem, wherein the first signal includes an alias, wherein the alias includes a zone name, and the first local network includesthe second entity;

b. the first routing means translating the first signal into a second signal which includes the alias, and transmitting the secondsignal to at least one second routing means, each at least one second routing means coupled to at least one second localnetwork of the communication system;

c. each at least one second routing means computing a second zone multicast address from said zone name, translating thesecond signal into a third signal which includes the alias, and the second zone multicast address, and transmitting the thirdsignal to a first set of nodes, the first set of nodes comprising at least one first node, each node of the first set of nodes having afirst zone multicast address, wherein the first zone multicast address is equivalent to the second zone multicast address;

d. each node of the first set of nodes determining whether the zone name contained within the alias is equal to a zone identifiercontained in each node of the first set of nodes, the first set of nodes comprising a second set of nodes, each node of the secondset of nodes having the zone identifier equal to the zone name contained within the alias

e. each node of the second set of nodes determining whether the alias contained within the third signal is equal to aliasinformation contained within each node of the second set of nodes, the second set of nodes comprising the first entity, the firstentity having an alias equal to the alias contained within the third signal; and

f. the first entity transmitting a fourth signal to the second entity, the fourth signal including the address of the first entity.

2007/0291665



370 H04L 20070226 3 95%

Abstract: A method, system, device and computer program product for automatically detecting a topology of a local areanetwork, LAN. The LAN may be included in a telecommunication node, e.g. a base transceiver station. The LAN includes acentral host and further hosts connected to the LAN. The central host sends topology descriptors to the hosts connected to theLAN, the hosts each reporting at least one of the received topology descriptors and other information to the central host. Thecentral host can thus build up a topology data base describing the network topology. The topology descriptors are sent inbroadcast frames to the hosts. A host, after having received a topology descriptor, may create one or more dedicated addresses,e.g. from the topology descriptor, and return the address(es) to the central host which may store the address(es). MainClaim: A method for detecting a network topology of a local area network, the local area network comprising a central hostand at least one further host, the method comprising:sending topology descriptors from the central host to the at least onefurther host;receiving a sent topology descriptor at the at least one further host;each of the at least one further host reportingthe received topology descriptor to the central host;the central host building up a topology data base describing the networktopology based on the reported received topology descriptors.

6,775,258



370 H04Q 20000317 3 94%

Abstract: Apparatus, and an associated method, by which to route packets of data between a data source node and a datadestination node in an ad hoc, wireless network, such as a Bluetooth scatternet. Data routing tables are provided to each node,and header information extracted from a packet header is used by such tables. Routing of a packet of data is effectuated in ahop-by-hop manner to effectuate the communication of the packet from the data source node to the data destination node. MainClaim: In a multinode, ad hoc, wireless communication system having at least a data source node and a data destinationnode, and the communication system selectably and dynamically formed of a first piconet at which the data source node ispositioned and a second piconet at which a data destination node is positioned, each of the first and at least second piconetshaving a master node and at least one slave node, the at least one slave node capable of communication of the packets of dataonly to an associated master node, the data source node forming a selected one of a slave node and a master node of the firstpiconet and the data destination node a selected one of a slave node and a master node of the second piconet, an improvementof apparatus for facilitating routing of packets of data between the data source node and the data destination node by way of acommunication path, the communication path having at least one node, inclusive of the data destination node, said apparatuscomprising:

at least one first routing table embodied at each of the at least one node of the communication path and having an incomingdata ledger and an outgoing data ledger, said first routing table for facilitating mapping an incoming data packet to an outgoingdata packet, said first routing table populated with values extracted from header information of the packets, the packets routedin a first manner using values of the at least one first routing table when the node at which said at least one first routing table isembodied forms a slave node and the packets routed in a second manner using values of the at least one first routing table

www.patentics.com


when the node at which said at least one first routing table is embodied forms a master node.

2007/0189329 System for combining networks of different addressing schemes

Nokia Corporation Latvala; Mikael 370 H04J 20060622 2 94%

Abstract: A system for combining networks of different addressing schemes comprises the incorporation of at least oneinterstitial function between at least one address realm of the one network and at least one address realm of another networkfor mapping an address between the different addressing schemes. Preferably, the interstitial function uses a public addressrealm as root address realm wherein the address realms are organized in a hierarchical manner and the address realm withoutany parents is the root address realm. The location of each node within the combined networks may be expressed as a list ofindividual realm specific addresses from the different address realms given in a specified order, wherein said listed addressestogether form a common universal address of said node. MainClaim: A method for combining networks of different addressing schemes, comprising: incorporating at least oneinterstitial function between at least one first address realm of a first network and at least one second address realm of a secondnetwork for mapping an address between the different addressing schemes.

5,388,213

Method and apparatus for determining whether an alias is available to uniquely identify an entity in a communications system


Oppenheimer; Alan B. | Findley; Sean J. | Sidhu; Gursharan S.

709 H04L 19931029 0 100%

Abstract: A method and apparatus for determining whether an alias (or entity name) is available for use in a communicationsystem. A transmitting node or entity transmits a first signal including the alias over the communication system. The aliasincludes a zone name. If the transmitting node receives a reply signal to the first signal, then the alias is not available for use.Otherwise the alias is available for use. The transmitting node transmits the first signal to a first router connected to a first localnetwork of the communication system. The first router forwards a second signal including the entity name from the first signalto other routers in the network until a second router connected to nodes having the zone name in the entity name is located.Each second router translates the second signal into a third signal which includes the alias, and using a first zone multicastaddress, multicasts the third signal to a first set of nodes. Each node of the first set of nodes determines whether the zone namecontained within the alias is equal to a zone identifier for each node of the first set of nodes. Each node having the zone namedetermines whether the alias contained within the third signal is equal to alias information for the node. If an entity in the firstset of nodes has the alias, then the entity transmits a reply signal, which includes its network address, to the transmitting node. MainClaim: In a communication system for transferring data between a plurality of devices, a method used by a first entity fordetermining whether an alias is available to uniquely identify said first entity, said first entity being a networkable computerresource, the method comprising the steps of:

A) said first entity broadcasting a first signal to a first local area network, wherein said first entity is directly coupled to said firstlocal network, wherein said first signal includes said alias, said alias including a zone name,

B) a first routing means of said first local area network translating said first signal into a second signal which includes said alias,said first routing means being coupled to at least one second routing means which is directly coupled to at least one second localarea network of said communication system,

C) said first routing means forwarding said second signal to said at least one second routing means,

D) said at least one second routing means computing a zone multicast address from said zone name,

E) said at least one second routing means translating said second signal into a third signal which includes said alias and saidzone multicast address,

F) if said at least one second local area network includes a first set of nodes having said zone multicast address, then

F1) said at least one second routing means multicasting said third signal over said second network,

F2) if a second entity of said first set of nodes has said alias, then said second entity transmitting a fourth signal to said firstentity, said fourth signal including it network address of said second entity,

G) if said first entity receives said fourth signal, then

G1) said first entity entering said network address into a names table in said first entity, said names table associating saidnetwork address with said alias, and

G2) said first entity determining that said alias is not available to uniquely identify said first entity; and

H) if said first entity does not receive said fourth signal, said first entity determining that said alias is available to uniquelyidentify said first entity.

2007/0291665



370 H04L 20070226 3 95%

Abstract: A method, system, device and computer program product for automatically detecting a topology of a local areanetwork, LAN. The LAN may be included in a telecommunication node, e.g. a base transceiver station. The LAN includes acentral host and further hosts connected to the LAN. The central host sends topology descriptors to the hosts connected to theLAN, the hosts each reporting at least one of the received topology descriptors and other information to the central host. The

www.patentics.com


central host can thus build up a topology data base describing the network topology. The topology descriptors are sent inbroadcast frames to the hosts. A host, after having received a topology descriptor, may create one or more dedicated addresses,e.g. from the topology descriptor, and return the address(es) to the central host which may store the address(es). MainClaim: A method for detecting a network topology of a local area network, the local area network comprising a central hostand at least one further host, the method comprising:sending topology descriptors from the central host to the at least onefurther host;receiving a sent topology descriptor at the at least one further host;each of the at least one further host reportingthe received topology descriptor to the central host;the central host building up a topology data base describing the networktopology based on the reported received topology descriptors.

2007/0189329 System for combining networks of different addressing schemes

Nokia Corporation Latvala; Mikael 370 H04J 20060622 2 94%

Abstract: A system for combining networks of different addressing schemes comprises the incorporation of at least oneinterstitial function between at least one address realm of the one network and at least one address realm of another networkfor mapping an address between the different addressing schemes. Preferably, the interstitial function uses a public addressrealm as root address realm wherein the address realms are organized in a hierarchical manner and the address realm withoutany parents is the root address realm. The location of each node within the combined networks may be expressed as a list ofindividual realm specific addresses from the different address realms given in a specified order, wherein said listed addressestogether form a common universal address of said node. MainClaim: A method for combining networks of different addressing schemes, comprising: incorporating at least oneinterstitial function between at least one first address realm of a first network and at least one second address realm of a secondnetwork for mapping an address between the different addressing schemes.

6,775,258



370 H04Q 20000317 3 94%

Abstract: Apparatus, and an associated method, by which to route packets of data between a data source node and a datadestination node in an ad hoc, wireless network, such as a Bluetooth scatternet. Data routing tables are provided to each node,and header information extracted from a packet header is used by such tables. Routing of a packet of data is effectuated in ahop-by-hop manner to effectuate the communication of the packet from the data source node to the data destination node. MainClaim: In a multinode, ad hoc, wireless communication system having at least a data source node and a data destinationnode, and the communication system selectably and dynamically formed of a first piconet at which the data source node ispositioned and a second piconet at which a data destination node is positioned, each of the first and at least second piconetshaving a master node and at least one slave node, the at least one slave node capable of communication of the packets of dataonly to an associated master node, the data source node forming a selected one of a slave node and a master node of the firstpiconet and the data destination node a selected one of a slave node and a master node of the second piconet, an improvementof apparatus for facilitating routing of packets of data between the data source node and the data destination node by way of acommunication path, the communication path having at least one node, inclusive of the data destination node, said apparatuscomprising:

at least one first routing table embodied at each of the at least one node of the communication path and having an incomingdata ledger and an outgoing data ledger, said first routing table for facilitating mapping an incoming data packet to an outgoingdata packet, said first routing table populated with values extracted from header information of the packets, the packets routedin a first manner using values of the at least one first routing table when the node at which said at least one first routing table isembodied forms a slave node and the packets routed in a second manner using values of the at least one first routing tablewhen the node at which said at least one first routing table is embodied forms a master node.


Apple Computer, Inc.Hauck; Jerrold V | Whitby-Strevens; Colin

370 H04J 20030805 0 100%

Abstract: A method for determining and communicating the existence of a hybrid bus In a full-duplex communications system having plurality of nodes, wherein one of the nodes is compliant with the P1394b standard and receives a Self-ID packet from the bus, comprising the acts of examining received Self-ID packets by the P1394b compliant node for the absence of a SpeedCode; and presuming the existence of a hybrid bus if any of the received Self-ID packets do not contain a Speed Code. MainClaim: In a full-duplex communications system having plurality of nodes, wherein one of the nodes is compliant with IEEEP1394b high-speed serial bus standard and receives a Self-ID packet from a high-speed serial bus connecting the plurality of node, a method for determining and communicating the existence of a hybrid bus comprising the acts of:

examining received Self-ID packets by IEEE the P1394b compliant node for the absence of a Speed Code; and

determining the existence of a hybrid bus if any of said received Self-ID packets do not contain a Speed Code.

2005/0111490



Abstract: Disclosed are methods and apparatus to control data and command flow over a physical communications channelbetween a transmitter and a receiver, and more specifically to provide a protocol for a point-to-point serial bus architecture with low latency time for flow control and other signaling, regardless of the length of the data packet frame. The abstract data flowcontrol protocol can be employed by various buses as it interacts only with the lowest protocol layers. Separate buffers for dataand control can be used to allow the bus to be compatible with slower buses also to support additional control functions withoutinvolving a higher protocol layer. MainClaim: A communications bus comprising a datalink layer coupled to a physical layer, said datalink layer comprising a

www.patentics.com


multiplexer operable to multiplex at least one abstract protocol to be superimposed on a datalink layer frame and channelprotocol.

7,668,202





Apple Computer, Inc.Hauck; Jerrold V. | Whitby-Strevens; Colin

370 G06F 20000118 0 100%

Abstract: A method and apparatus relating to the behavior of border nodes within a high performance serial bus system isdisclosed. A method for determining and communicating the existence of a hybrid bus is disclosed. A method for determining apath to a senior border node is disclosed, as is a method for identifying a senior border node Various methods for properlyissuing gap tokens within a beta cloud are disclosed. A method for returning control to the senior border node is disclosed. Amethod for determining whether a BOSS node may issue a grant is disclosed. MainClaim: In a serial bus communications system, a method for determining whether a BOSS node may issue a grant for apipelined Beta request comprising:

providing a first and second indicator; and

issuing a grant for a pipelined Beta request by the BOSS only when both said first and second indicators are set.

2005/0111490




7,668,202



Abstract: Disclosed are methods and apparatus to control data and command flow over a physical communications channelbetween a transmitter and a receiver, and more specifically to provide a protocol for a point-to-point serial bus architecture with low latency time for flow control and other signaling, regardless of the length of the data packet frame. The abstract data flowcontrol protocol can be employed by various buses as it interacts only with the lowest protocol layers. Separate buffers for dataand control can be used to allow the bus to be compatible with slower buses also to support additional control functions withoutinvolving a higher protocol layer. MainClaim: An apparatus comprising: a communications bus; and a processor configured to implement a protocol stackcomprising a datalink layer coupled to a physical layer, where the protocol stack operates with a protocol having frames, whereeach frame is comprised of a plurality of channels, where each channel is comprised of at least one token, where at least one

www.patentics.com


channel of the plurality of channels is defined as a low latency channel for traffic having a low latency requirement, where saiddatalink layer is operable to intersperse at least one low latency channel token with tokens from at least one other channel toobtain a set of interspersed tokens, where the processor is further configured to transmit the set of interspersed tokens toanother node via the communications bus.

6,031,833

Method and system for increasing throughput in a wireless local area network


Fickes; Stanley L. | Geiger; Edward W. | Mincher; Richard W.

370 H04J 19970501 0 100%

Abstract: Method and system aspects for increasing throughput in a WLAN are provided. In a method aspect, a packet istransmitted from a first end station in the WLAN, the packet including an indication of a next end station in a chain of endstations having data ready for transmission in the WLAN. The method further includes transferring control of access before apredetermined time period has been exceeded to the next end station in the chain of end stations based upon the indicator. Inaddition, the method includes maintaining access to the network for a plurality of cooperating end stations established throughcontinuous indication of the next end station in the chain of end stations without exceeding a maximum access time. In asystem aspect, the system includes a first end station, the first end station transmitting a packet in the WLAN, and a second endstation in a chain end stations cooperating with the first end station and acknowledging the packet from the first end stationbefore a predetermined time period has been exceeded, the second end station identifying a next end station in the chain end ofend stations to have access in the WLAN. Further, transmission access to the WLAN continues with the next end station in thechain end stations when the predetermined time period is not exceeded between transmitting and acknowledging. MainClaim: A method for increasing throughput in a wireless local area network (WLAN), the method comprising:

transmitting a packet from a first end station in the WLAN, the packet including an indication of a next end station in a chain ofend stations having data ready for transmission in the WLAN;

transferring control of access before a predetermined time period has been exceeded by the first end station to the next endstation in the chain of end stations based on the indication;

maintaining access to the network for a plurality of cooperating end stations established through continuous indication of thenext end station in the chain of end stations without exceeding a maximum access time.

2007/0237076 Node Nokia CorporationBalandin; Sergey | Gillet; Michel 370 H04L 20070329 1 93%

Abstract: A node arranged to communicate with at least one further node; comprising: a buffer arranged to receive datatransmitted from the at least one further node; an output arranged to transmit data to the at least one further network element,wherein the data comprises information about the ability for the buffer to receive further data transmitted from the furthernode. MainClaim: An apparatus, comprising: a buffer configured to receive data transmitted from at least one node; and an outputconfigured to transmit data to the at least one node, wherein the data comprises information about an ability for the buffer toreceive further data transmitted from the node.

2009/0323697

DATA PAYLOAD TRANSMISSION VIA CONTROL PLANE SIGNALING

NOKIA CORPORATION

CELENTANO; Ulrico | SALOKANNEL; Juha | KAAJA; Harald | MARIN; Janne

370 H04L 20080627 1 92%

Abstract: A system for implementing a communication transports in a configuration that may utilize control plane resources forthe conveyance of data. A communication protocol may be originally designed to support planned data conveyance at a dataplane. This strategy may improve quality of service for the transport, but may impact the execution speed of communication dueto the required overhead involved in scheduling. In view of this limitation, messages that are sensitive to delay may benegatively impacted by scheduling steps occurring in mediums such as described above. Execution speed may be increased byrouting certain payloads to the control plane for transmission in a beacon signal, which avoids the overhead inherent in the dataplane. MainClaim: A method, comprising:determining whether at least a portion of data to be transmitted corresponds to at least onetransmission condition;if the at least a portion of data corresponds to at least one transmission condition, transmitting the atleast a portion of data in a beacon signal packet in a wireless transport; andtransmitting the at least a portion of data using dataplane resources in the wireless transport if the at least a portion of data does not correspond to at least one transmissioncondition.

4,689,786 Local area network with self assigned address method


Sidhu; Gursharan S. | Oppenheimer; Alan B. | Kenyon, Jr.; Lawrence A. | Hochsprung; Ronald R.

370 H04J 19850321 0 100%

Abstract: A local area network is disclosed including apparatus and methods for transferring data between a plurality of dataprocessing resources ("agents") coupled to a cable. In the preferred embodiment, a plurality of agents are coupled to a commoncable for data transmission and reception. An agent newly coupled to the cable dynamically assigns itself a unique address onthe cable to which other agents may send data. Once an agent has been assigned a final address, it may then transmit to, andreceive data from, other agents on the cable. An agent desiring to send data to a receiving agent follows a three stephandshake, wherein the sending agent transmits an "RTS" signal and within a predetermined time must receive a "CTS" signalfrom the receiving agent. The sending agent then transmits a data frame within a predetermined time after the CTS signal isreceived. The failure to detect a return CTS signal within the predetermined time denotes a collision condition. Re-transmission is attempted using a linear back off method which is adjusted based on previous cable traffic history. MainClaim: An apparatus for assigning a unique address to a data processing device coupled to a communication medium topermit the transfer of data between a plurality of said agents on said medium, comprising:

transceiver means coupled to each of said agents for transmitting signals onto said medium and receiving signals transmitted onsaid medium by another agent;

www.patentics.com


address assignment means coupled to each of said agents to permit each of said agents to assign itself a unique address on saidcommunication medium, said address assignment means including:

random number generating means for generating a random number within a predefined range for use as a tentative address;

address storage means coupled to said random number generating means for storing said tentative address;

first signal generation means coupled to said address storage means and said transceiver means for generating an enquiry(ENQ) signal and transmitting at least one said ENQ signal to a device having said tentative address on said communicationmedium;

acknowledge signal receiving means coupled to said transceiver means for receiving an acknowledge (ACK) signal transmittedby an agent other than said agent being assigned a unique address in response to its receipt of said ENQ signal, saidacknowledge receiving means signalling said random number generating means to generate another random number as atentative address upon the receipt of said ACK signal;

timing means coupled to said acknowledge signal receiving means for storing said tentative address as a final address in saidaddress storage means in the absence of the receipt of said ACK signal within a predetermined time (IFG) after the last ENQsignal has been transmitted;

whereby said agent is assigned a unique address on said communication medium.

7,324,549 Synchronisation communication systems Nokia Corporation

Addy; Tim | Vainikka; Markku | Viero; Timo | Brockington; William | Vahataini; Markku

370 H04J 20030305 3 92%

Abstract: A method and apparatus of transmitting data at a line rate to a bus operating at a bus rate includes transmitting thedata in a packet format having a plurality of frames each having a plurality of time slots. Each time slot has successive messagegroups, and each message group includes a plurality of data messages containing the data and an idle code containing none ofthe data. A number of idle codes in each frame is selected such that the bus rate matches the line rate. Various communicationbuses, and methods of synchronizing data are implemented. MainClaim: A method of transmitting data at a line rate to a bus operating at a bus rate, the method comprising transmittingthe data in a packet format consisting of a plurality of frames each having a plurality of time slots, each time slot havingsuccessive message groups, wherein each message group comprises a plurality of data messages containing said data and anidle code containing no said data; wherein the number of idle codes in each frame is selected so that the bus rate matches theline rate.

4,661,902 Local area network with carrier sense collision avoidance


Hochsprung; Ronald R. | Kenyon, Jr.; Lawrence A. | Oppenheimer; Alan B. | Sidhu; Gursharan S.

370 G06F 19850321 0 100%

Abstract: A local area network is disclosed including apparatus and methods for transferring data between a plurality of dataprocessing resources ("agents") coupled to a cable. In the preferred embodiment, a plurality of agents are coupled to a commoncable for data transmission and reception. An agent newly coupled to the cable dynamically assigns itself a unique address onthe cable to which other agents may send data. Once an agent has been assigned a final address, it may then transmit to, andreceive data from, other agents on the cable. An agent desiring to send data to a receiving agent follows a three stephandshake, wherein the sending agent transmits an "RTS" signal and within a predetermined time must receive a "CTS"signalfrom the receiving agent. The sending agent then transmits a data frame within a predetermined time after the CTS signal isreceived. The failure to detect a return CTS signal within the predetermined time denotes a collision condition. Re-transmission is attempted using a linear back off method which is adjusted based on previous cable traffic history. MainClaim: A communication medium for transferring data between a plurality of data processing devices ("agents") includinga sending agent and a receiving agent, comprising:

sensing means coupled to said sending agent for therein if said medium is currently carrying data of another agent and isthereby in use;

timing means coupled to said sending agent for timing a first predetermined waiting period once said medium is idle andavailable for use;

first random number generating means coupled to said sending agent for generating a random number within a predefinedrange corresponding to a second waiting period prior to transmittng data on said communication medium to said receivingagent;

first signal generation means coupled to said sending agent for generating a first signal and transmitting said signal to saidreceiving agent;

signal receiving means coupled to said sending agent for receiving a signal transmitted from said receiving agent to said sendingagent within a second predetermined time (IFG) after said sending agent has transmitted said first signal;

data transmission means coupled to said sending agent for transmitting data to said receiving agent within said IFG time afterreceiving said signal from said receiving agent;

www.patentics.com


whereby data is transferred between said sending and receiving agents coupled to said communication medium.

7,324,549 Synchronisation communication systems Nokia Corporation


370 H04J 20030305 3 92%


7,600,037

Real time transmission of information content from a sender to a receiver over a network by sizing of a congestion window in a connectionless protocol

Apple Inc. Tucker; Rusty 709 G06F 20060314 0 100%

Abstract: A stream of packets is started at a slow rate to enable competing streams to achieve transmission rate equilibrium.The transmission window is initialized to a size smaller than an acceptable window advertised by the receiving client. Uponreceipt of an acknowledgement from the client that a packet has been successfully transmitted, the size of the transmissionwindow is increased by the size of the acknowledged packet. This increase continues until a threshold is reached, at which timefurther increases are constrained by the maximum permitted segment size. MainClaim: A computer-implemented method for real time transmission of information content from a sender to a receiver overa network, comprising the following steps: defining an initial size for a congestion window that establishes a number ofsuccessive packets of information that can be transmitted by said sender without acknowledgment from the receiver;transmitting the number of packets established by the congestion window; upon detecting acknowledgment of a packet from thereceiver, increasing the size of the congestion window by the size of the acknowledged packet; and continuing to increase thesize of the congestion window by the size of an acknowledged packet for each detected acknowledgment until an establishedthreshold is reached.

2007/0286077 COMMUNICATION SYSTEM Nokia Corporation Wu; Yi 370 H04L 20070426 1 92%

Abstract: A method of transmitting data in a communication system. Data packets are transmitted from a first node to asecond node on a first channel. An acknowledgement packet is transmitted from the second node to the first node on a secondchannel in response to receiving a number of packets on the first channel. The number of data packets that the acknowledgmentpacket is sent in response to is adjustable. MainClaim: A method of transmitting data in a communication system, comprising:transmitting data packets from a first nodeto a second node on a first channel; andtransmitting an acknowledgement packet from the second node to the first node on asecond channel in response to receiving a number of packets on the first channel,wherein the number of data packets that theacknowledgment packet is sent in response to is adjustable.

5,889,962

Method and system for providing an additional identifier for sessions in a file server


Hanif; Mohammad | Stinson; Kevin | Yanagihara; Kazuhisa

709 G06F 19951013 0 100%

Abstract: A system and method for increasing the number of entities that can be serviced by a file server. The file serverincludes a plurality of server session sockets (SSSs), and means for assigning an entity identification number and one of theplurality of SSSs to a request from one of the number of entities, wherein each SSS can support a plurality of entities. MainClaim: A file server which allows for increasing a number of entities that can be serviced comprising:

a plurality of server session sockets (SSSs), each of the plurality of SSSs comprising an addressable entity within the file serverfor enabling communications, a plurality of entity identification numbers being associated with each of the plurality of SSSs;

means for assigning a particular SSS of the plurality of SSSs and assigning an entity identification number of the plurality ofentity identification numbers associated with the particular SSS of the plurality of SSSs to a request from one of the number ofentities; and

means within the file server for matching the entity identification number and the particular SSS to a communication from theone of the number of entities.

2004/0267910 Single-point management system for devices in a cluster

NOKIA INC.

Treppa, Basil | Mittal, Ajay | Koneru, Srikanth | Xu, Laura | Matai, Ajay

709 G06F 20030624 2 93%

Abstract: The present invention provides cluster management from a single application. A user may perform managementtasks on all of the devices within the cluster using a GUI or a CLI. The system automatically discovers the members of thecluster and acquires a configuration lock on the devices preventing other users from performing conflicting operations. If aproblem occurs during a configuration, the devices may be rolled back to a previous working configuration. A message format isprovided to help ensure message integrity beyond the security provided by a secure transport. An aggregator aggregatesconfiguration information and motored data and allows the information to be presented according to a user's requirements.

www.patentics.com


MainClaim: A system for cluster management that allows the configuration and monitoring of a cluster from a single-point, comprising: a network interface configured to communicate with nodes in the cluster; a memory configured to store informationrelating to cluster management; a configuration subsystem coupled to a remote management broker, wherein the remotemanagement broker is configured to distribute information between the nodes in the cluster; a processor configured to performactions, including: accessing the cluster from the single-point; obtaining information relating to devices within the cluster;presenting the information to a user; and determining network management (NM) operations to perform to the cluster; andperforming the determined NM operations.

2004/0267913 System for joining a cluster by cloning configuration

NOKIA INC. Koneru, Srikanth 709 G06F 20030625 1 92%

Abstract: The present invention clones configuration information onto a device joining a cluster. A Configuration AcquisitionSystem (CAS) component, which, using a list of attributes to be cloned, connects to a cluster member, interacts with the clustermember to retrieve all the attributes, reconciles the values of the attributes from the cluster member with the values of theattributes in its own configuration and applies the reconciled configuration to its Configuration Subsystem. MainClaim: A method for cloning a node associated with a cluster, comprising: determining configuration information to clonefrom the cluster; and automatically cloning the configuration information onto the node.

7,587,475 System for joining a cluster by cloning configuration

Nokia Siemens Networks Oy

Koneru; Srikanth 709 G06F 20030625 1 92%

Abstract: The present invention clones configuration information onto a device joining a cluster. A Configuration AcquisitionSystem (CAS) component, which, using a list of attributes to be cloned, connects to a cluster member, interacts with the clustermember to retrieve all the attributes, reconciles the values of the attributes from the cluster member with the values of theattributes in its own configuration and applies the reconciled configuration to its Configuration Subsystem. MainClaim: A method for cloning a node associated with a cluster, the method comprising: employing a configurationacquisition system included in the node to determine configuration information to clone from a cluster member accessed by thenode by connecting to the cluster member and retrieving the configuration information from the cluster member; automaticallycloning the configuration information onto a configuration subsystem of the node; reconciling the retrieved configurationinformation with a local configuration associated with the configuration acquisition system; applying the reconciled configurationinformation onto the node; determining when to trigger the cloning of the node; and determining when the cloning is successfuland when the cloning is successful adding the node to the cluster, and when the cloning is not successful, creating an error.

7,080,132 Presentation during network address acquisition

Apple Computer, Inc. Cheshire; Stuart 709 G06F 20010119 0 100%

Abstract: A method and apparatus for instructing a processing system to present information. In one embodiment of theinvention a server processing system on a network uses the DHCP protocol to provide network configuration information for aclient processing system. The server processing system uses DHCP option code 56 to include presentation information with theconfiguration information sent to the client. Option code 56 allows for text messages to be presented by the client processingsystem and also allows URL-formatted text that may cause web pages or other internet resources to be presented by the clientprocessing system. Because the presentation information is included with the network configuration information, information ispresented when the client processing system uses the configuration information (e.g., upon network initialization). MainClaim: A method, implemented on a processing system, comprising: receiving a request for network configurationinformation from a client processing system; sending network configuration information from a server processing system to theclient processing system using a Dynamic Host Configuration Protocol ("DHCP"), the network configuration information havingadded to it, at least one of presentation information, or an address representative or said presentation information formatted inaccordance with the DHCP, wherein said presentation information is automatically displayed upon network initialization throughthe DHCP on the client processing system without any input action from a user of the client processing system, when the clientprocessing system uses the network configuration information.

2003/0088792

System and method for providing exploit protection with message tracking

Nokia, Inc.Card, James | Smith, Gregory J. 713 G06F 20021211 1 94%

Abstract: A method and system for providing protection from exploits to devices connected to a network. The system andmethod include a component for determining whether an encapsulation has been applied to an attachment associated with amessage and unencapsulating such encapsulated attachment, and a component that performs at least one decompression of theattachment when the attachment is compressed. If it is determined that the message, including the attachment, is to bescanned, a component is included that determines whether a header, body, and/or attachment of the message includes exploits.A device that receives messages that are directed to the network employs the components above to provide exploit protectionfor at least one of the messages. MainClaim: A system for providing protection from an exploit to a device connected to a network, comprising: (a) a contentfilter that receives a message that is directed to the device; (b) a message tracker that is coupled to the content filter and isconfigured to determine whether the message is an unscanned message; and (c) a scanner component that is coupled to themessage tracker and that is configured to receive the unscanned message and to determine whether at least one element of themessage includes an exploit.

6,941,478


Nokia, Inc. Card; James | Smith; Gregory J.

713 G06F 20021211 2 93%

Abstract: A method and system for providing protection from exploits to devices connected to a network. The system andmethod include a component for determining whether an encapsulation has been applied to an attachment associated with amessage and unencapsulating such encapsulated attachment, and a component that performs at least one decompression of theattachment when the attachment is compressed. If it is determined that the message, including the attachment, is to bescanned, a component is included that determines whether a header, body, and/or attachment of the message includes exploits.A device that receives messages that are directed to the network employs the components above to provide exploit protectionfor at least one of the messages. MainClaim: A system for providing protection from an exploit to a device connected to a network, comprising:

a content filter that receives a message that is directed to the device;

www.patentics.com


a message tracker that is coupled to the content filter and is configured to perform actions, including:

determining a size of a message component associated with the message;

if the size is less than or equal to a pre-determined size; identifying the message as unscanned;

if the size exceeds the pre-determined size, then:

determining a first value associated with the message, and if the first value is the same as a stored second value associated withthe message, identifying the message as a scanned message;


determining the first value associated with the message, and if the first value is different from the stored second value,identifying the message as unscanned; and

a scanner component that is coupled to the message tracker and that is configured to receive the unscanned message and todetermine whether at least one element of the message includes an exploit.

2003/0018774 System and method for load balancing in ad hoc networks

Nokia CorporationFlinck, Hannu | Nilsson, Lars Anders

709 G06F 20020612 1 93%

Abstract: A method and system for load balancing in ad hoc networks. An ad hoc node stores address information associatedwith a gateway that provides a communication path between an ad hoc network and another network. When other ad hoc nodesrequest the address information from the gateway, an ad hoc node through which the request passes may respond by providingthe information. This allows responding to requests for address information to be load balanced over the nodes of an ad hocnetwork. MainClaim: A method for load balancing in a network, comprising: (a) employing a first ad hoc node to store addressinformation associated with a gateway that provides a communication path between an ad hoc network and another network;(b) employing a second ad hoc node to send a request for the address information; and (c) employing the first ad hoc node toprovide the address information in reply to the request.

7,013,346 Connectionless protocol Apple Computer, Inc. Tucker; Rusty 709 G06F 20001006 0 100%

Abstract: Packets transmitted from a server into a computer network are assigned a sequence number, a retransmit time and atime to live. Each packet is retransmitted upon the expiration of the retransmit time if no acknowledgment has been receivedfrom a client to which the packet was sent. The packet is removed from a retransmit buffer if the time to live timer expires priorto any acknowledgment being received. Multiple acknowledgments may be combined into a coalesced acknowledgment. MainClaim: A method for real time transmission of frame-based content between a network server and a network clientcomprising the steps of:

designating individual packets of said content as either a frame packet that contains information for reconstructing an entireframe of said content or a differential packet that contains changes to a frame;

assigning to each of said packets a sequence number and a timer for retransmission retention, wherein the duration of thetimers for frame packets is longer than for differential packets;

transmitting each of said packets to said network client;

detecting an acknowledgment for one or more packets received at said network client;

retransmitting any of said packets for which no acknowledgment is detected if their respective timers have not expired; and

terminating the retention of each packet whose timer has expired, wherein differential packets are removed more frequentlythan frame packets in order to ensure that critical information is not lost when an acknowledgment is not detected.

7,460,472

System and method for transmitting information in a communication network

Nokia Corporation

Le; Huihua | Wu; Haitao | Jin; Yuehui | Zhang; Dongmei | Ma; Jian

370 H04J 20031014 1 95%

Abstract: A method and system for transmitting information between a sending means and a receiving means using packets forinformation transmission. The receipt of transmitted packets is acknowledged and unacknowledged packets are retransmittedfrom the sending means. The amount of transmitted unacknowledged information or the number of consecutiveunacknowledged packets is detected, and the reason for information or packet loss is determined based on the amount oftransmitted unacknowledged information or the number of consecutive unacknowledged packets. This amount is compared witha path maximum transmission unit (PMTU) to determine the reason for loss. A single or small number of unacknowledgedpackets is determined to be a result of Bit Error Rate (BER), whereas a larger number of consecutive unacknowledged packetsmay be determined to be congestion. Congestion control parameters are kept unchanged when the reason for loss is caused byBit Error Rate (BER), whereas control parameters are changed when the reason for loss is congestion. MainClaim: A method, comprising: transmitting information between a sender and a receiver using packets for informationtransmission, wherein the receipt of transmitted packets is acknowledged to the sender, and unacknowledged packets areretransmitted from the sender; detecting one of an amount of transmitted unacknowledged information and a number ofconsecutive unacknowledged packets; determining a reason for information or packet loss based on the amount of transmittedunacknowledged information or the number of consecutive unacknowledged packets; adjusting transmission parameters by thesender, depending on whether the determined reason is a bit error rate or congestion; the sender enabling bundling wherein

www.patentics.com


information is bundled in a packet; checking whether bundling is enabled; and changing a determining parameter to determinethe reason for information or packet loss depending on whether or not bundling is enabled.

2005/0022089 System and method for a communication network

Nokia Corporation

Le, Huihua | Wu, Haitao | Jin, Yuehui | Zhang, Dongmei | Ma, Jian

714 H04Q 20031014 1 95%

Abstract: A method and system for transmitting information between a sending means and a receiving means using packets forinformation transmission. The receipt of transmitted packets is acknowledged and unacknowledged packets are retransmittedfrom the sending means. The amount of transmitted unacknowledged information or the number of consecutiveunacknowledged packets is detected, and the reason for information or packet loss is determined based on the amount oftransmitted unacknowledged information or the number of consecutive unacknowledged packets. This amount is compared witha path maximum transmission unit (PMTU) to determine the reason for loss. A single or small number of unacknowledgedpackets is determined to be a result of Bit Error Rate (BER), whereas a larger number of consecutive unacknowledged packetsmay be determined to be congestion. Congestion control parameters are kept unchanged when the reason for loss is caused byBit Error Rate (BER), whereas control parameters are changed when the reason for loss is congestion. MainClaim: A method for transmitting information between a sender and a receiver using packets for information transmission,wherein the receipt of transmitted packets is acknowledged to the sender, and unacknowledged packets are retransmitted fromthe sender, the method comprising: detecting one of an amount of transmitted unacknowledged information and a number ofconsecutive unacknowledged packets; determining a reason for information or packet loss based on the amount of transmittedunacknowledged information or the number of consecutive unacknowledged packets; and adjusting transmission parameters bythe sender, depending on whether the determined reason is a bit error rate or congestion.

2006/0059256

Signaling a state of a transmission link via a transport control protocol

Nokia Corporation Kakani; Naveen K. 709 G06F 20040910 1 95%

Abstract: A method, a system, a sender, a receiver, a device and software applications are shown for transferring datasegments, wherein data segments are sent from a sender to a receiver, wherein said sender receives acknowledgements fromsaid receiver, and wherein said acknowledgements acknowledge reception of said sent data segments at said receiver andcontain information on whether at least one transmission link within a data network between said sender and receiver undergoesbad transmission conditions. In an embodiment of the invention, timers associated with each of said sent data segments,respectively, are started, and it is decided if it is possible to prolong timers that have expired before acknowledgements of datasegments associated with said timers are received at least in partial dependence on said information whether at least onetransmission link within a data network between said sender and receiver undergoes bad transmission conditions. MainClaim: A method for transferring data segments between a sender and a receiver, comprising: sending one or more datasegments from said sender to said receiver, and receiving one or more acknowledgements from said receiver, wherein saidacknowledgements acknowledge reception of said sent data segments at said receiver and contain information on whether atleast one transmission link within a data network between said sender and receiver undergoes bad transmission conditions.

5,742,599

Method and system for supporting constant bit rate encoded MPEG-2 transport over local ATM networks

Apple Computer, Inc.Lin; Mengjou | Periyannan; Alagu | Singer; David

370 H04L 19960226 0 100%

Abstract: A system and method for supporting constant bit rate encoded MPEG-2 transport over local Asynchronous Transfer Mode (ATM) networks. The present invention encapsulates constant bit rate encoded MPEG-2 transport packets, which are 188 bytes is size, in an ATM AAL-5 Protocol Data Unit (PDU), which is 65,535 bytes in size. The method and system includesinserting a plurality of MPEG-2 transport packets into a single AAL-5 PDU, inserting a segment trailer into the ATM packet after every two MPEG packets, and then inserting an ATM trailer at the end of the ATM packet. In a preferred embodiment, 10 or 12MPEG-2 transport packets are packed into one AAL-5 PDU to yield a throughput 70.36 and 78.98 Mbits/sec, respectively, thereby supporting fast forward and backward playing of MPEG-2 movies via ATM networks. MainClaim: A method for encoding a stream of first data packets over a network, the network transmitting data in second datapackets whose size is significantly larger than the first data packets, the method comprising the steps of:

(a) packing a plurality of first data packets into a single second data packet;

(b) inserting a segment trailer into the single second data packet after at least two first data packets; and

(c) inserting a trailer at the end of the single second data packet.

2006/0253600 Buffering in streaming delivery Nokia Corporation Hannuksela; Miska 709 G06F 20060406 1 92%

Abstract: Buffering packets of a media stream for transmission from a transmitting device to a receiving device. Media packetsare formed from at least one kind of media information in a stream generator; at least one transmission frame is generated onthe basis of media packets to be transmitted; packets to be transmitted are formed from the at least one transmission frame;and a transmission schedule is generated for packets to be transmitted. In addition, a first step and a second step ofhypothetical decoding are also performed. The first step of hypothetical decoding is performed according to the transmissionschedule and comprises buffering the packets to be transmitted according to the transmission schedule to a first hypotheticaldecoding buffer; and outputting packets from the first hypothetical decoding buffer on a transmission frame basis. The secondstep of hypothetical decoding comprises controlling the buffer occupancy level of the first hypothetical decoding buffer and thesecond hypothetical decoding buffer by controlling at least one of the following: the operation of the stream generator; thegeneration of at least one transmission frame; the transmission schedule. MainClaim: A method for buffering packets of a media stream comprising: forming media packets from at least one kind ofmedia information in a stream generator; generating at least one transmission frame on the basis of media packets to betransmitted; forming packets to be transmitted from the at least one transmission frame; generating a transmission schedule forpackets to be transmitted; performing a first step of hypothetical decoding according to the transmission schedule comprising:buffering the packets to be transmitted according to the transmission schedule to a first hypothetical decoding buffer; andoutputting packets from the first hypothetical decoding buffer on a transmission frame basis; performing a second step ofhypothetical decoding comprising: buffering packets formed on the basis of the output from the first hypothetical decodingbuffer; controlling the buffer occupancy level of the first hypothetical decoding buffer and the second hypothetical decoding

www.patentics.com


buffer by controlling at least one of the following: the operation of the stream generator; the generation of at least onetransmission frame; the transmission schedule.

5,517,494

Method and system of multicast routing for groups with a single transmitter

Apple Computer, Inc. Green; Mark A. 370 H04L 19940930 0 100%

Abstract: A method of implementing a multicast routing protocol in routers is provided to manage the assignment of multicasttransport addresses and to forward data from a single transmitting endpoint to multiple receiving endpoints. This method inconjunction with a method for implementing the multicast routing protocol as a transport protocol layer service for endpointsprovides an internet wide multicast transport service. The multicast transport service provides the capability of transmitting datafrom a single source to multiple receivers on interconnected networks efficiently and without having to send duplicate copies ofthe data on any single network. Routers and endpoints transmit and receive multicast packets in a manner which is independentof the network layer datagram protocols used by the multicast transport service. Multicast control packets are exchanged usinga multicast transaction protocol which allows routers and endpoints to execute transactions in a manner that does not requireeither routers to know the state of specific endpoints or endpoints to know the state of specific routers. MainClaim: A method for creating a multicast distribution tree in a computer system, comprising the steps of:

transmitting, by a listener computer, coupled by a common network, to a first designated router, a join group request which includes a multicast address which contains a network number that identifies a particular network and which requests data fromthe particular network,

scanning, by the first designated router, the forwarding table of the first designated router to locate the particular multicastrequest included in the join group request, to determine whether the first designated router is currently receiving data from theparticular multicast address, and if not, then

scanning, by the first designated router, the routing table of the first designated router to locate the network number containedin the particular multicast address and a corresponding second designated router, coupled to a network common to that of thefirst designated router, for receiving data from the particular network, and

requesting, by the first designated router, transmission of data from the particular network through the second designatedrouter.

7,310,335 Multicast routing in ad-hoc networks

Nokia NetworksGarcia-Luna-Aceves; Jose J. | Spohn; Marcelo

370 H04L 20001031 1 96%

Abstract: Multicast routing in ad-hoc networks by exchange of multicast group update information and routing tree informationamong neighboring routers is disclosed. A router propagates multicast group update information based on the updateinformation and the routing tree information. A router also determines whether to forward multicast data packets based oncontrol information in the multicast data packets and the routing tree information. MainClaim: A method for communicating multicast group membership information in a network between a plurality of routersin a multicast group, the method comprising: reporting routing tree information from each of the plurality of routers reports toother routers of said plurality of routers, wherein the routing tree information comprises a source tree for a unicast routingprotocol; receiving update information at a second router in the network from a first router, said update information comprisingupdate information on a multicast group and a network address of said first router; using said update information to indicatethat said first router is becoming a member of said multicast group; determining, based at least in part on said updateinformation and the routing tree information reported by said first router, whether said second router is to transmit said updateinformation so that all members of said multicast group remain connected, by determining if said source tree reported by saidfirst router has said second router as a root of a subtree from which said first router is excluded, and if at least one neighborrouter of said second router in said subtree is not a member of said multicast group; and in response to a positivedetermination, transmitting said update information from said second router to said at least one neighbor router of said secondrouter.

2008/0144532 Address resolution request mirroring Nokia Corporation

Chamarajanagar; Raveendra | Hunt; Peter | Kimble; Scott | Nguyen; Tuyen

370 H04L 20061215 2 95%

Abstract: Address Resolution Protocol (ARP) request mirroring can provide a mechanism for synchronizing link-layer adjacency information among network elements. This application can be useful, for example, for internet protocol (IP) routing networkelements in a high-availability configuration. MainClaim: A method, comprising:receiving an address resolution request from an active node;transmitting a second requestmirroring the request when the request meets a predetermined condition;updating an address resolution cache based oninformation in the request; andassuming responsibilities of the active node when the active node fails.

2008/0144634 Selective passive address resolution learning

Nokia Corporation

Chamarajanagar; Raveendra | Hunt; Peter | Kimble; Scott | Nguyen; Tuyen | Rashiyamany; Giritharan

370 H04L 20061215 2 95%

Abstract: Selective passive address resolution protocol (ARP) learning can provide a passive mechanism to synchronize linklayer adjacency information among network elements. Selective passive ARP learning can be implemented by a modification tothe ARP requests processing of the standby node, with a filter list containing a set of match rules for target network addresses.The implementation, thus, can be a configurable filter that enables software modules to specify a set of internet protocol (IP)addresses that the ARP input engine should monitor. MainClaim: A method, comprising:receiving an address resolution request from a neighbor node of an active node;updating anaddress resolution cache based on information in the request when the request meets a predetermined condition; andassumingresponsibilities of the active node when the active node fails.

www.patentics.com


6,069,887

Method and system for synchronization in a wireless local area network


Geiger; Edward W. | Fickes; Stanley L. | Mincher; Richard W. | Mullins; Jeffrey L.

370 H04J 19970528 0 100%

Abstract: Aspects for achieving and utilizing synchronization among end stations in a wireless local area network (WLAN) areprovided. In a method aspect, the method includes receiving a packet with a time synchronization field value from a first endstation in a second end station of a communication group. The method further includes comparing upon receipt of the packet thetime synchronization field value with a local time value in the second end station to determine whether the local time valuerequires updating to maintain synchronization between the first and second end stations. The comparing further determineswhether a difference between the time synchronization field value and the local time value is greater than zero, and when thedifference is greater than zero, the local time value is updated to the time synchronization field value. In a system aspect, thesystem includes at least two end stations, wherein each of the at least two end stations further includes a local clock unit, and atransmit/receive control unit coupled to the local clock unit. A time synchronization field register in the transmit/receive controlunit stores a value of the local clock unit, with one of the at least two end stations comparing a time synchronization fieldregister value of a packet upon receipt from another of the at least two end stations with a value of the local clock unit todetermine whether updating of the local clock unit is necessary. MainClaim: A method for achieving synchronization among at least two end stations in a communication group of a wirelesslocal area network (WLAN), the method comprising:

receiving a packet with a time synchronization field value from a first end station of the at least two end stations by a secondend station of the at least two end stations of the communication group; and

comparing upon receipt of the packet the time synchronization field value with a local time value in the second end station todetermine whether the local time value requires updating to maintain synchronization between the first and second end stationswithout requiring maintenance of communication with a master node end station by the first and second end stations.

7,180,915

Apparatus, and an associated method, for facilitating synchronization in a wireless mesh network

Nokia CorporationBeyer; David A. | Arrakoski; Jori | Kasslin; Mika

370 H04J 20011221 1 93%

Abstract: Apparatus, and associated method, by which to synchronize nodes in a wireless mesh network, such as a fixedbroadband network or a moving ad-hoc mesh network. Time stamps are added to data packets at a reference node definedpursuant to a pseudo hierarchy. The data packets are communicated by the reference node to a receiving node. The time stampinformation is extracted therefrom, to provide an indication of a time reference value from which the time stamp information isformed. Registers are maintained at the nodes with updated values of the timing information, used in time synchronizationbetween the nodes of the mesh network. MainClaim: In a wireless mesh network having a first communication station and at least a second communication station, animprovement of apparatus for time-synchronizing communication of data between the first and at least second communication stations, respectively, said apparatus comprising: a network time register coupled to receive a time reference signal of valuesrepresentative of a reference time, said network time register for buffering and maintaining updated values of the referencetime; and a data formatter coupled to said network time register, said data formatter for formatting the data to becommunicated between the first and at least second communication stations of the wireless mesh network, the data, onceformatted, including indicia associated with the updated values of the reference time buffered at said network time register,further comprising a latch register coupled to said network time register, said latch register for latching buffered values of thereference time buffered at said network time register.

2009/0213771 FORWARDING IN DISTRIBUTED WIRELESS NETWORKS

Nokia CorporationCelentano; Ulrico | Kaaja; Harald | Salokannel; Juha

370 H04B 20080225 1 92%

Abstract: A method, system, and computer program product are disclosed for providing a forwarding feature in the WiMediaMAC communication protocol or in other suitable communication protocols. The method enables a forwarder device to indicateits capability to operate as a forwarder device in its beacon transmissions and to enable an initiating device to utilize theforwarder device for communicating data and/or network control information to destination devices that can be accessedthrough the forwarder device over two or more hops. MainClaim: A method, comprising:receiving information from a wireless device including an indication of said wireless device'scapability to forward data within a network, said information further including descriptive information regarding at least oneother wireless device in the network accessible through the wireless device; anddetermining whether to wirelessly transmit datato said wireless device, for forwarding said data to the at least one other wireless device based on said received information.

2009/0279464

POWER SAVE MECHANISM FOR WIRELESS COMMUNICATION DEVICES

NOKIA CORPORATIONKAKANI; Naveen | MAJKOWSKI; Jakub

370 G08C 20080509 1 92%

Abstract: Method, apparatus, and computer program product embodiments are disclosed to enable power save modes ofoperation between mobile wireless devices for direct data transfer in an infrastructure BSS. An example embodiment inserts in amessage that is transmitted by the transmitting mobile wireless device, a specified time when a next active direct data transferperiod will start so that the devices can remain in power save mode in a direct data transfer link until that time. Then, when thenext active direct data transfer period is about to start, the receiving device sends a trigger signal based on the specified time,the trigger signal indicating that the next period is about to start. This confirms to the transmitting device that the receivingdevice has awakened, so that the transmitting device may start transmitting the data to the receiving device via the direct datatransfer link. MainClaim: A method, comprising:transmitting, by a transmitting wireless device, an indication to a receiving wireless devicewhen a next active direct data transfer period will start so that the devices can remain in power save mode in a direct datatransfer link until that time; andreceiving from the receiving device, a trigger signal based on said indication, the trigger signalindicating that the next period is about to start, so that the transmitting device can start transmitting data to the receivingdevice via the direct data transfer link.

Jones; Anne |

www.patentics.com


7,366,788 Method and apparatus for media data transmission

Apple Inc.

Geagan; Jay | Gong; Kevin L. | Periyannan; Alagu | Singer; David W.

709 G06F 20040226 0 100%

Abstract: Methods and apparatuses for processing media data transmitted in a data communication medium. A digitalprocessing system is provided with a time related sequence of media data provided to the digital processing system based on aset of data, wherein the set of data indicates a method to transmit the time related sequence of media data according to atransmission protocol. The set of data, itself, is a time related sequence of data associated with the time related sequence ofmedia data. The time related sequence of media data may be presented and/or stored by the digital processing system. MainClaim: A method implemented by a digital processing system to process media data, said method comprising: retrieving atime related sequence of media data that is received by said digital processing system as packets based on a set of data,wherein said set of data indicates a method to transmit said time related sequence of media data to said digital processingsystem according to defined packetizing characteristics, and wherein said set of data is a time related sequence of dataassociated with said time related sequence of media data.

2009/0119594

FAST AND EDITING-FRIENDLY SAMPLE ASSOCIATION METHOD FOR MULTIMEDIA FILE FORMATS

Nokia Corporation Hannuksela; Miska 715 G06F 20081028 9 95%

Abstract: Systems and methods for using sample numbers to pair timed metadata samples with media or hint samples isprovided. A timed metadata sample can be paired with media or hint samples since a sample number contained in the timemedia sample is provided relative to the appropriate media or hint track. Additionally, an offset of sample numbers, applicable toscenarios where a plurality of timed metadata samples exist, may be added to the provided sample number to obtain the actualsample number within the media or hint track. MainClaim: A method of organizing at least one of media and multimedia data in at least one file, comprising:storing a firstsample, a first piece of data, a second sample, and a second piece of data in at least one file, the at least one of the media andmultimedia data including the first and second samples, the first piece of data being associated with the first sample, and thesecond piece of data being associated with the second sample;associating a first sample number with the firstsample;associating a second sample number with the second sample;including a sample number offset in the at least onefile;including a first base sample number associated with the first piece of data in the at least one file, the first sample numberbeing derivable from the sample number offset and the first base sample number; andincluding a second base sample numberassociated with the second piece of data in the at least one file, the second sample number being derivable from the samplenumber offset and the second base sample number.

2009/0055417

SEGMENTED METADATA AND INDEXES FOR STREAMED MULTIMEDIA DATA

NOKIA CORPORATION Hannuksela; Miska M.

707 G06F 20080819 9 94%

Abstract: A method of organizing streamed data includes storing streamed data in a file, identifying metadata applicable to asubset of the streamed data, and forming at least one group of one or more samples of the streamed data, each sample in agroup having identical metadata content for a metadata type. The file may be in accordance with ISO base media file format.The storing streamed data in a file may include storing in a reception hint track. The at least one group may be indicated in asample group description box. The metadata type may be indicated by a grouping type and grouping instance data, the groupingtype specifying semantics of the grouping instance data and the metadata content. The metadata content may comprise ametadata payload and zero or more metadata payload extensions, where the metadata payload is included in a first structureand the zero or more metadata payload extensions are included in a second structure. MainClaim: A method of organizing streamed data, comprising:storing streamed data in a file;identifying metadata applicableto a subset of the streamed data; andforming at least one group of one or more samples of the streamed data, each sample in agroup having identical metadata content for a metadata type.

2009/0177942

SYSTEMS AND METHODS FOR MEDIA CONTAINER FILE GENERATION

NOKIA CORPORATIONHannuksela; Miska Matias | Peltotalo; Jani

714 H03M 20090108 9 94%

Abstract: A method includes organizing a first media source block in the media container file; calculating forward errorcorrection (FEC) redundancy data based on the first media source block; organizing the FEC redundancy data in at least one FECreservoir in the media container file; providing, in the media container file, meta data providing an association between the firstmedia source block and the at least one FEC reservoir; storing the first media source block as a first elementary item in themedia container file; and providing, in the media container file, information that the first elementary item comprises the firstmedia source block MainClaim: A method of generating a media container file, comprising:organizing a first media source block in the mediacontainer file;calculating forward error correction (FEC) redundancy data based on the first media source block;organizing theFEC redundancy data in at least one FEC reservoir in the media container file;providing, in the media container file, meta dataproviding an association between the first media source block and the at least one FEC reservoir;storing the first media sourceblock as a first elementary item in the media container file; andproviding, in the media container file, information that the firstelementary item comprises the first media source block.

5,894,480

Method and apparatus for operating a multicast system on an unreliable network

Apple Computer, Inc. Hoffert; Eric M. | Green; Mark A.

370 H04J 19971008 0 100%

Abstract: A multicast network system comprises a data network which provides a medium for data transfer. A media sourcehaving a control packet and media packets coupled to the data network broadcasts the control packet and the media packets tothe data network and rebroadcasts the control packet in conjunction with the media packets to the data network. A mediareceiver is coupled to the network and receives the control packet and the media packets from the data network to process thecontrol packet and the media packets to produce a media output. MainClaim: A multicast network system comprising:

a data network which provides a medium for transfer of digital signals; and

www.patentics.com


a media source providing to the data network

a media packet, and

a control packet including format information that enables processing of the media packet, wherein said control packet isrepeatedly transmitted in conjunction with said media packet.

2006/0080436

System and method for multimedia streaming using interleaved packetization

Nokia CorporationWang; Ru-Shang | Miller; Keith 709 G06F 20041007 2 92%

Abstract: Methods, devices, systems, program products and computer-implemented methods for communication of non-interleaved and interleaved packets of streamed data are disclosed. A method of streaming multimedia includes transmitting asignal from a client device to a multimedia server. The signal is indicative of desired settings for the client device to receivepackets of streamed data. The desired settings include at least one of an amount of a total buffer memory allocated to bufferingof interleaved packets and an indication of acceptability of all packetization types available to the server. MainClaim: A method for multimedia streaming, comprising: transmitting a signal from a client device to a multimedia server,the signal being indicative of desired settings for the client device to receive packets of streamed data, wherein the desiredsettings include at least one of an amount of a total buffer memory allocated to buffering of interleaved packets and anindication of acceptability of all packetization types available to the server.



Jones; Anne | Geagan; Jay | Gong; Kevin L. | Periyannan; Alagu | Singer; David W.

709 G06F 19980825 0 100%

Abstract: Methods and apparatuses for processing media data transmitted in a data communication medium. A digitalprocessing system is provided with a time related sequence of media data provided to the digital processing system based on aset of data, wherein the set of data indicates a method to transmit the time related sequence of media data according to atransmission protocol. The set of data, itself, is a time related sequence of data associated with the time related sequence ofmedia data. The time related sequence of media data may be presented and/or stored by the digital processing system. MainClaim: A method implemented by a digital processing system to process media data, said method comprising:

receiving at said digital processing system a time related sequence of media data which is received by said digital processingsystem based on a set of data, wherein said set of data indicates a method to transmit said time related sequence of media datato said digital processing system according to a transmission protocol, and wherein said set of data is a time related sequence ofdata associated with said time related sequence of media data; and

presenting at said digital processing system a media sequence associated with said time related sequence of media data.

2009/0119594




2009/0177942



714 H03M 20090108 9 93%


2009/0055417


NOKIA CORPORATIONHannuksela; Miska M. 707 G06F 20080819 9 93%

www.patentics.com



5,561,670

Method and apparatus for operating a multicast system on an unreliable network

Apple Computer, Inc.Hoffert; Eric M. | Green; Mark A. 370 H04J 19940513 0 100%

Abstract: A multicast network system comprises a data network which provides a medium for data transfer. A media sourcehaving a control packet and media packets coupled to the data network broadcasts the control packet and the media packets tothe data network and rebroadcasts the control packet in conjunction with the media packets to the data network. A mediareceiver is coupled to the network and receives the control packet and the media packets from the data network to process thecontrol packet and the media packets to produce a media output. MainClaim: A method of operating a multicast network comprising the steps of:

transmitting a media packet digital signal on the multicast network; and

transmitting a control packet digital signal on the multicast network, wherein the control packet digital signal includes formatinformation on the media packet digital signal.

2006/0080436

System and method for multimedia streaming using interleaved packetization

Nokia Corporation Wang; Ru-Shang | Miller; Keith

709 G06F 20041007 2 92%

Abstract: Methods, devices, systems, program products and computer-implemented methods for communication of non-interleaved and interleaved packets of streamed data are disclosed. A method of streaming multimedia includes transmitting asignal from a client device to a multimedia server. The signal is indicative of desired settings for the client device to receivepackets of streamed data. The desired settings include at least one of an amount of a total buffer memory allocated to bufferingof interleaved packets and an indication of acceptability of all packetization types available to the server. MainClaim: A method for multimedia streaming, comprising: transmitting a signal from a client device to a multimedia server,the signal being indicative of desired settings for the client device to receive packets of streamed data, wherein the desiredsettings include at least one of an amount of a total buffer memory allocated to buffering of interleaved packets and anindication of acceptability of all packetization types available to the server.

7,457,255

Method and apparatus for providing link-local IPv4 addressing across multiple interfaces of a network node

Apple Inc. Cheshire; Stuart D. 370 H04L 20040625 0 100%

Abstract: A system to provide link-local IPv4 addressing across multiple interfaces of a network-node. The network-node broadcasts an Address Resolution Protocol (ARP) request packet on multiple interfaces which asks for the hardware address of anetwork node whose link-local IPv4 address is Y. In response, the network-node receives an ARP-reply packet on an interface from a target network-node. If Y is present in the ARP cache and is associated with a different interface, the source network-node chooses a winner interface, and updates the ARP cache so that Y is associated with the winner interface. The network-node sends one or more contention-resolution packets on the loser interface to cause a loser network-node to choose another link-local IPv4 address for itself. MainClaim: A method for providing link-local addressing across multiple interfaces of a source network-node, comprising: broadcasting an address-resolution request packet on interfaces Z1 and Z2 of the source network-node, wherein the source

network-node currently associates the link-local protocol-layer address Y with interface Z1, and wherein the address-resolution

request packet requests an hardware address which is associated with link-local protocol-layer address Y; receiving an address-resolution reply packet at the source network-node on interface Z2, thereby causing a contention between interfaces Z1 and Z2;

determining a winner between interfaces Z1 and Z2; and in response to determining that Z2 is the winner, associating link-local

protocol-layer address Y with interface Z2, and sending a contention-resolution packet on interface Z1, thereby causing a target

network-node whose link-local protocol-layer address is Y to choose a link-local protocol-layer address which is different from Y.

2007/0058606 Routing data packets from a multihomed host

Nokia Corporation Koskelainen; Juha 370 H04L 20051115 2 93%

Abstract: The invention allows routing data packets from a multihomed host. A default gateway is associated with each ofnetwork addresses associated with the multihomed host. One of the associated network addresses is assigned to a data packetto be sent from the multihomed host as its source address. A routing table of the multihomed host is searched for a routematching a destination address of the data packet. It is determined, in response to one of no route found and the found routebeing a default route of the routing table, which of the default gateways is associated with the assigned source address, and thedata packet is dispatched to this determined default gateway. MainClaim: A method of routing data packets from a multihomed host, the method comprising: assigning a source address to adata packet to be sent from said multihomed host, said multihomed host having at least two associated network addresses, adefault gateway associated with each of said at least two associated network addresses, and said source address being one ofsaid at least two associated network addresses; determining a destination address of said data packet; searching a routing tableof said multihomed host for a route for said data packet, said route to match said destination address of said data packet;examining results of said searching; and in response to one of no route found and a found route being a default route of saidrouting table: determining a default gateway associated with said assigned source address, and dispatching said data packet tosaid default gateway associated with said assigned source address.

www.patentics.com


7,296,092

Apparatus for inter-domain communications including a virtual switch for routing data packets between virtual interfaces of the virtual switch

Nokia, Inc. Nguyen; Tuyen 709 G06F 20040630 1 92%

Abstract: An apparatus for a multi-domain computer system includes multiple virtual system domains, each having anassociated, independent routing instance. A virtual switch is created to forward packets between the domains. The virtual switchis configured to operate substantially as if it were a physical layer-2 switch. The virtual switch and the virtual domains are connected together by virtual interfaces, where the virtual switch, the virtual domains, and the virtual interfaces are all createdin software. Further, protocols such as ARP, IP, and/or IPv6 operate over the virtual interfaces in substantially the same waythat they would over Ethernet. Also, each domain has a software driver that behaves like an Ethernet driver, and has a 48-bit Ethernet-like address that is used for the physical address. MainClaim: A network device for inter-domain communications, comprising: a transceiver that is configured to transmit and receive packets over a network based, in part, on a network protocol; and a processor that is configured to create a virtualswitch that is configured to receive a packet at one of a plurality of interfaces associated with the virtual switch, wherein theplurality of interfaces includes a plurality of virtual interfaces, and wherein the virtual switch is configured to be associated withat least three virtual interfaces, and to provide the packet at another of the plurality of interfaces, wherein the virtual switch isconfigured to provide the packet at the other of the plurality of interfaces by determining if a destination address for the packetis included in a neighbor cache table that is associated with the virtual switch, and wherein the virtual switch is furtherconfigured to add an entry to a neighbor cache table such that the entry includes a source address of the packet, and furtherincludes the one of the plurality of interfaces that received the packet.

5,796,954

Method and system for maximizing the use of threads in a file server for processing network requests

Apple Computer, Inc.Hanif; Mohammad | Yanagihara; Kazuhisa

709 G06F 19951013 0 100%

Abstract: A system and method for maximizing the use of threads in a file server process for processing requests received fromentities on a network. The file server process includes a first socket and a plurality of second sockets for receiving requests fromentities on a network. The file server process comprises a first queue for storing requests received from the first socket, and asecond queue for storing requests received from the plurality of second sockets. The file server processes the requests in thefirst queue with a first set of threads, and processes the requests in the second queue with a second set of threads. MainClaim: A method for maximizing the use of threads in a file server process for processing requests received from entitieson a network, the file server process including a fist socket and a plurality of second sockets for receiving requests from entitieson a network, the method comprising the steps of:

(a) providing a first queue for storing requests received from the first socket, the requests received from the first socketincluding a first type of request for opening a session;

(b) providing a second queue for storing requests received form the plurality of second sockets, the requests received from theplurality of second sockets being a second type of request;

(c) processing the first type of request in the first queue with a first set of threads; and

(d) processing the second type of request in the second queue with a second set of threads.

2004/0215578 Controlling usage of system resources by a network manager

Nokia, Inc. Das, Debashis 705 H04L 20030409 2 92%

Abstract: The aspects of the present invention manage an allocation of resources for network devices in a networked system.With an aspect of the invention, a usage of a resource is gauged by a number of tokens that are associated with an action for adesignated network device. The action is assigned at least one thread, where a thread corresponds to a process that supportsthe action. As requested, processes are initiated when an available number of tokens in a token pool can support the action. Arequest is stored in a request queue if a required number of tokens or threads are not available. The associated action for thedesignated network device is subsequently initiated when the required number of tokens and threads are available. When anaction for a device completes, the assigned tokens and threads are released for reassignment in order to initiate an action foranother device. MainClaim: A method for controlling a system resource, the method comprising: (a) receiving a first request to initiate a firstaction for a first network device; (b) determining a first required number of tokens that is necessary to execute the first action,wherein the first required number of tokens corresponds to a first usage of the system resource that is allocated to execute thefirst action; (c) determining an available number of tokens remaining in a token pool; (d) if the available number of tokens is asgreat as the first required number of tokens, initiating the first action for the first network device; and (e) in response to (d),reducing the available number of tokens by the first number of tokens.




370 H04J 19980825 0 100%

Abstract: The present invention relates to information which allows transmission of time related data over a datacommunication medium. In one embodiment, a set of data includes at least one instruction to cause a digital processing systemto generate a set of packets representing a time related sequence of media data. The set of packets is associated with atransmission protocol. The set of data includes a time related sequence of data which is associated with the time relatedsequence of media data. MainClaim: A computer readable medium containing media data and information which indicates how to transmit said mediadata from one digital processing system to another digital processing system, said computer readable medium comprising:

www.patentics.com


a first time related sequence of data; a second time related sequence of data comprising a hint track that indicates how topacketize said first time related sequence of data in a media file for transmission over a network according to a particularnetwork transmission protocol, wherein said second time related sequence of data is associated with said first time relatedsequence of data.

2009/0119594




2009/0177942



714 H03M 20090108 9 92%


2009/0055417



707 G06F 20080819 9 92%





370 H04J 19980825 0 100%

Abstract: Methods and apparatuses for processing media data for transmission in a data communication medium. A set of dataindicates how to transmit a time related sequence of media data according to a transmission protocol. The set of data, includesa time related sequence of data which is associated with the time related sequence of media data. The set of data may beutilized by a digital processing system to transmit the time related sequence of media data (e.g., by packets generatedaccording to the transmission protocol and the set of data). MainClaim: A computer readable medium comprising:

a time related sequence of media data;

a set of data which, when pressed by a digital processing system, indicates to said digital presences how to transmit said timerelated sequence of media data according to a transmission protcol, wherein said set of data is a time related sequence of dataassociated with and separate from said time related sequence of media data;

a first set of instructions to cause a digital processing system to determine a format of said time related sequence of mediadata;

a second set of instructions to cause said digital processing system to determine said transmission protocol, wherein said

www.patentics.com


transmission protocol comprises a packet data protocol.

2009/0119594




2009/0177942



714 H03M 20090108 9 93%


2009/0055417



707 G06F 20080819 9 92%





370 H04J 20021114 0 100%

Abstract: Methods and apparatuses for processing media data for transmission in a data communication medium. A set of dataindicates how to transmit a time related sequence of media data according to a transmission protocol. The set of data, includesa time related sequence of data which is associated with the time related sequence of media data. The set of data may beutilized by a digital processing system to transmit the time related sequence of media data (e.g., by packets generatedaccording to the transmission protocol and the set of data). MainClaim: A method implemented by a digital processing system for processing media data, said method comprising:

creating on a first digital processing system a set of data to indicate how to packetize a time related sequence of media data fortransmission according to defined packetizing characteristics, wherein said set of data varies with different packetizingcharacteristics; and

storing said set of data on a storage device coupled to the first digital processing system, wherein said set of data is a timerelated sequence of data associated with said time related sequence of media data.

2009/0119594



Abstract: Systems and methods for using sample numbers to pair timed metadata samples with media or hint samples is

www.patentics.com


provided. A timed metadata sample can be paired with media or hint samples since a sample number contained in the timemedia sample is provided relative to the appropriate media or hint track. Additionally, an offset of sample numbers, applicable toscenarios where a plurality of timed metadata samples exist, may be added to the provided sample number to obtain the actualsample number within the media or hint track. MainClaim: A method of organizing at least one of media and multimedia data in at least one file, comprising:storing a firstsample, a first piece of data, a second sample, and a second piece of data in at least one file, the at least one of the media andmultimedia data including the first and second samples, the first piece of data being associated with the first sample, and thesecond piece of data being associated with the second sample;associating a first sample number with the firstsample;associating a second sample number with the second sample;including a sample number offset in the at least onefile;including a first base sample number associated with the first piece of data in the at least one file, the first sample numberbeing derivable from the sample number offset and the first base sample number; andincluding a second base sample numberassociated with the second piece of data in the at least one file, the second sample number being derivable from the samplenumber offset and the second base sample number.

2009/0177942



714 H03M 20090108 9 92%


2009/0055417



707 G06F 20080819 9 92%





370 H04J 20000829 0 100%


creating on a first digital processing system a set of data to indicate how to packetize a time related sequence of media dataaccording to a particular network transmission protocol, wherein said set of data varies with different network transmissionprotocols; and

storing said set of data on a storage device coupled to the first digital processing system, wherein said set of data is a timerelated sequence of data associated with and separate from said time related sequence of media data.

2009/0119594



Abstract: Systems and methods for using sample numbers to pair timed metadata samples with media or hint samples isprovided. A timed metadata sample can be paired with media or hint samples since a sample number contained in the timemedia sample is provided relative to the appropriate media or hint track. Additionally, an offset of sample numbers, applicable toscenarios where a plurality of timed metadata samples exist, may be added to the provided sample number to obtain the actualsample number within the media or hint track. MainClaim: A method of organizing at least one of media and multimedia data in at least one file, comprising:storing a firstsample, a first piece of data, a second sample, and a second piece of data in at least one file, the at least one of the media andmultimedia data including the first and second samples, the first piece of data being associated with the first sample, and thesecond piece of data being associated with the second sample;associating a first sample number with the firstsample;associating a second sample number with the second sample;including a sample number offset in the at least one

www.patentics.com


file;including a first base sample number associated with the first piece of data in the at least one file, the first sample numberbeing derivable from the sample number offset and the first base sample number; andincluding a second base sample numberassociated with the second piece of data in the at least one file, the second sample number being derivable from the samplenumber offset and the second base sample number.

2009/0177942



714 H03M 20090108 9 92%


2009/0055417







709 G06F 20020621 0 100%

Abstract: Methods and apparatuses for processing media data transmitted in a data communication medium. A digitalprocessing system is provided with a time related sequence of media data provided to the digital processing system based on aset of data, wherein the set of data indicates a method to transmit the time related sequence of media data according to atransmission protocol. The set of data, itself, is a time related sequence of data associated with the time related sequence ofmedia data. The time related sequence of media data may be presented and/or stored by the digital processing system. MainClaim: A machine readable medium containing executable program instructions, which when executed on a digitalprocessing system cause the digital processing system to perform a method comprising:

retrieving at said digital processing system a time related sequence of media data which is received by said digital processingsystem based on a set of data, wherein said set of data indicates a method to transmit said time related sequence of media datato said digital processing system according to a transmission protocol, and wherein said set of data is a time related sequence ofdata associated with said time related sequence of media data; and

presenting at said digital processing system said time related sequence media data.

2009/0119594




2009/0177942



714 H03M 20090108 9 92%

www.patentics.com



2009/0055417




5,841,989

System and method for efficiently routing data packets in a computer interconnect

Apple Computer, Inc. James; David V. | Stone; Glen D.

709 G06F 19960408 0 100%

Abstract: A method and system for efficiently routing data packets in a computer interconnect includes a plurality of nodesforming a ringlet, generally including two connections between each pair of nodes configured to allow communication in eitherdirection between each pair of nodes. One sequence of such connections forms a run moving,-for example left-to-right between a series of nodes. The other sequence of connections forms a right-to-left run. Selected nodes are configured to provide two cross-over paths, each from one run to the other, so the two runs are linked to form a circle or ringlet. One or more selectednodes provide an optional connection between the two runs, thus allowing a fast path or short cut to the opposing run. A fastpath may include a uni- or bidirectional cross through path in an intermediate node. In one preferred embodiment, a single nodecan provide both cross-over paths, but can also support a cross-between path for each run, allowing a packet to continue on the same run, rather than the default path that crosses over to the opposite run. The method and system includes data informationin a packet that can be used to decide whether to switch the packet through a fast path or to let it continue on the "normal"path. Routing decisions are based on a path field within each packet. This field is updated when taking a faster path (forexample, a cross-through or cross-between path). The update techniques allow data packet path lengths to be reduced, whilealso providing a packet-aging capability. A scrubber is provided to manage packet aging and to remove packets that have notbeen removed from the ringlet but are no longer useful. MainClaim: A system for efficiently routing data packets, each of the data packets including data information, the systemcomprising:

a plurality of nodes forming a ringlet; at least one of the plurality of nodes including an optional data path forming a faster pathbetween a first run and a second run in the ringlet for faster transmission of the data packets within the ringlet, and at least oneof the plurality of nodes having a scrubber capable of being activated for responding to the data information of the data packetspassing therethrough; and

means responsive to the data information within the one of the data packets and the location of the faster paths for reducing thelength of the path traversed by the data packet within the ringlet.

2004/0146062

System and method for network card switchovers in an IP network

Nokia Inc.Parikh, Vimal | Gupta, Amar | Ho, Chi Fai

370 H04L 20030127 1 92%

Abstract: The system provides an IP network card that comprises a redundancy configuration register; an interface; andredundancy mapping logic. The redundancy configuration register stores card configuration data. The interface receives slotactive signals from other cards. The redundancy mapping logic is communicatively coupled to the register and interface. Thelogic maps a packet to a slot having an active card based on the data in the register, an address in the packet, and received slotactive signals. MainClaim: A IP network switching system, comprising: a first egress IP network card connectable to a switching device; asecond egress IP network card redundant to the first egress IP network card and connectable to the switching device; and aningress IP network card connectable to the switching device and having hardware-based logic for determining which of the first egress IP network card or the second egress IP network card is active.

6,947,375

System and method for network card switchovers in an IP network

Nokia Inc.Parikh; Vimal | Gupta; Amar | Ho; Chi Fai

370 H04L 20030127 1 92%

Abstract: The system provides an IP network card that comprises a redundancy configuration register; an interface; andredundancy mapping logic. The redundancy configuration register stores card configuration data. The interface receives slotactive signals from other cards. The redundancy mapping logic is communicatively coupled to the register and interface. Thelogic maps a packet to a slot having an active card based on the data in the register, an address in the packet, and received slotactive signals.

www.patentics.com


MainClaim: A IP network switching system, comprising:

a first egress IP network card connectable to a switching device;

a second egress IP network card redundant to the first egress IP network card and connectable to the switching device; and

an ingress IP network card connectable to the switching device and having hardware-based logic for determining which of the first egress IP network card or the second egress IP network card is active;

wherein the ingress IP network card is further connectable to a network node and receives, from the network node, addressinformation corresponding to one of the first or second egress IP network cards;

wherein the logic modifies the address information if the egress IP network card represented by the address information isinactive;

wherein the first egress IP network card is represented by a first address, the second egress IP network card is represented by asecond address which differs from the first address by only the least significant bit, and wherein the logic modifies the addressinformation by modifying only the least significant bit.

2009/0296569 Ring network and method for automatic protection swicthing

Nokia Siemens Networks GmbH & Co. KG

Ramalho Ribeiro Dos Santos; Jose Miguel | De Frias Rebelo Nunes; Pedro Ricardo

370 G06F 20060515 1 92%

Abstract: A method for automatic protection switching in a ring network detects a link failure at a first interface of a node,generates a first link down message and sends the first link down message along the second direction of the ring network. Upongeneration or receipt of the first link down message by the redundancy manager, the redundancy manager is unblocked suchthat non-control frames of the at least one automatic protection switching domain are no longer blocked by the redundancymanager. Upon generation or receipt of the first link down message by one of the nodes, the node having at least one entryassigning an address to the second interface IF2, deletes only the entries in the forwarding database of the node which assignan address to the first interface of said node. Deleted entries are then updated in the forwarding database. MainClaim: A method for automatic protection switching in a ring network,the ring network comprising at least one automaticprotection switching domain and a plurality of nodes;each of the nodes comprising an address, a forwarding database, a firstinterface and a second interface;each of the nodes being arranged in the ring network such that the first interface faces a firstdirection and the second interface faces a second direction of the ring network;the forwarding database of each node comprisinga plurality of entries;an entry of the forwarding database of a node assigning an address to one of the interfaces of saidnode;one of the nodes being a redundancy manager, which blocks during normal operation non-control frames of the at least one automatic protection switching domain,the method comprising the steps of:A) detecting a link failure at the first interface ofa first one of the nodes;B) generating a first link down message by the first one of the nodes and sending said first link downmessage along the second direction of the ring network;C) upon generation or receipt of the first link down message by theredundancy manager, unblocking the redundancy manager such that non-control frames of the at least one automatic protection switching domain are no longer blocked by the redundancy manager;D) upon generation or receipt of the first link downmessage by one of the nodes, said node having at least one entry assigning an address to the second interface IF2, deletingonly the entries in the forwarding database of said node which assign an address to the first interface of said node; andE)updating deleted entries in the forwarding database of the node mentioned in step D).

6,829,648 Method and apparatus for preparing media data for transmission



709 G06F 19991223 0 100%


retrieving from a digital storage system a set of data which indicates how to transmit a time related sequence of media dataaccording to defined packetizing characteristics related to communications protocols, wherein said set of data is a time relatedsequence of data associated with said time related sequence of media data.

2009/0119594



Abstract: Systems and methods for using sample numbers to pair timed metadata samples with media or hint samples isprovided. A timed metadata sample can be paired with media or hint samples since a sample number contained in the timemedia sample is provided relative to the appropriate media or hint track. Additionally, an offset of sample numbers, applicable toscenarios where a plurality of timed metadata samples exist, may be added to the provided sample number to obtain the actualsample number within the media or hint track. MainClaim: A method of organizing at least one of media and multimedia data in at least one file, comprising:storing a firstsample, a first piece of data, a second sample, and a second piece of data in at least one file, the at least one of the media andmultimedia data including the first and second samples, the first piece of data being associated with the first sample, and thesecond piece of data being associated with the second sample;associating a first sample number with the firstsample;associating a second sample number with the second sample;including a sample number offset in the at least onefile;including a first base sample number associated with the first piece of data in the at least one file, the first sample numberbeing derivable from the sample number offset and the first base sample number; andincluding a second base sample number

www.patentics.com


associated with the second piece of data in the at least one file, the second sample number being derivable from the samplenumber offset and the second base sample number.

2009/0177942



714 H03M 20090108 9 92%


2009/0055417




5,408,506 Distributed time synchronization system and method

Apple Computer, Inc.Mincher; Richard W. | Lynn; Kerry E. 375 H04L 19930709 0 100%

Abstract: A distributed time synchronization system and method synchronizes nodes within a frequency hopping spreadspectrum (FHSS) local area network (LAN) group to a virtual master clock value. Each node system of the present inventioncomprises a CPU, an input device, a display device, a printer or hard copy device, a given amount of RAM and ROM memory, adata storage device, a local clock, a transmitter/receiver, an antenna, a virtual master clock processor, and a common data bus.The method of the present invention comprises the inclusion of a node's local clock value in a message just prior to transmissionover the network, storage of a node's local clock value in RAM after an incoming message has been received, and the calculationof the time delay between the sending node and the receiving node by the virtual master clock processor. The virtual masterclock processor utilizes this time delay in maintaining a virtual master clock value, which it uses in adjusting the value of thenode's local clock at periodic intervals. This synchronizes the receiving node to the virtual master clock value. If the magnitudeof the time delay exceeds a maximum allowed value, the magnitude is clamped to the maximum allowed value, therebymaintaining synchronization within a predetermined tolerance. A node can receive a message transmitted over the FHSS LANregardless of the message address. Synchronization is therefore maintained without requiring a node to be able to communicatewith any specific node within the FHSS LAN group. MainClaim: A distributed time synchronization system for a wireless communications network having a plurality of nodesystems, each node system comprising:

a display device for displaying information to the user, the display device having an input;

an input device for inputting information to the system, the input device having an output;

a local clock having an input and an output for providing a timing signal, the input of the local clock for receiving a signal toadjust the local clock;

a transmitter/receiver for receiving and translating radio signals into digital signals and for translating and transmitting digitalsignals into radio signals in response to digital control signals, the transmitter/receiver coupled to an antenna to receive andtransmit radio signals, the transmitter/receiver having an input and an output for processing digital signals;

a virtual master clock processing means for calculating the value of a virtual master clock for the node system, the virtualmaster clock processing means coupled to the transmitter/receiver, the virtual master clock processing means extracting timesynchronization information from each message received over the network during a predetermined time interval and using thesynchronization information extracted from each message received to calculate the value of the virtual master clock;

a processing unit for adding synchronization information to each message sent by the transmitter/receiver, and for using thevalue of the virtual master clock to adjust the local clock, the processing unit having inputs and outputs coupled to the inputdevice, the display device, the local clock, the transmitter/receiver and the virtual master clock processing means; and

a memory for storing data and routines, the memory having inputs and outputs, the memory including a first memory areastoring a routine for sending messages with time synchronization information, a second memory area storing a routine forreceiving messages and storing a local clock value corresponding to each message received, and a third memory area storing aroutine for adjusting the local clock using extracted synchronization information, the first and second memory areas coupled to

www.patentics.com


the transmitter/receiver and the processing unit, and the third memory area coupled to the local clock and the virtual masterclock processing means.

7,274,761 Device synchronisation over a network

Nokia Corporation

Muller; Thomas | Joeressen; Olaf | Schnitzler; Jurgen | Schetelig; Markus

375 H04L 20010621 1 92%

Abstract: A transceiver for operating in a network wherein the transceiver is arranged to synchronize to a time referencecommon to the network having distinguishable instances, the transceiver containing a controller for effecting the reading orwriting of a real time clock at an identified instance of the common time reference; a transmitter for transmitting anidentification of the real time clock value of a first instance and an identification of the first instance, and a receiver for receivinga transmitted identification of a real time clock value and an identification of a first instance. MainClaim: A device comprising: a controller for reading a real time clock at an identified instance of a common time referencehaving distinguishable instances, wherein the device is arranged to synchronise to the common time reference; and atransmitter for transmitting, in a network comprising the device and at least one receiver, an identification of the real time clockvalue for a first instance and an identification of the first instance.

6,959,013 Communication network Nokia Mobile Phones Limited

Müller; Thomas | Joeressen; Olaf J. | Schetelig; Markus

370 H04J 19990924 1 92%

Abstract: A transmitter for transmitting an intermittent sequence of messages to maintain synchronization between thetransmitter and a receiver. The transmitter includes control apparatus which provides messages for transmission, each messageforms part of a sequence of messages and includes control information and timing information, and transmission apparatuswhich transmits each message. A receiver for synchronizing with a sequence of the transmitted messages. The receiver includesreceiver and synchronization apparatus responsive, when enabled, to the control information in the message to indicate to thecontrol apparatus reception of the message. The control apparatus controls power conservation by disabling the receiver andsynchronization apparatus for a period of time dependent upon the timing information and enabling the receiver andsynchronization apparatus to receive a following message in the sequence. MainClaim: A transmitter for transmitting an intermittent sequence of messages to maintain synchronization between thetransmitter and at least one receiver, comprising:

control means arranged to provide messages for transmission, each of said messages forming part of said sequence ofmessages and comprising control information for effecting synchronization, including timing information, wherein said timinginformation is dependent upon when the transmission of a following message in the sequence occurs; and

transmission means, responsive to said control means, for transmitting each of said messages,

wherein said sequence of messages comprises a sequence of groups of messages each of said groups of messages comprising aplurality of messages in series,

wherein said following message is a message in a following group,

wherein said following group is the next group, and

wherein said control means is arranged to vary the time between the transmission of a pair of successive groups of messages byan amount such that there is coincidence between the time of transmission of a message in the following group of the pair andthe expected time of transmission, in the absence of a variation, of a message in the following group.

5,721,818

Method and system for enabling a file server to service multiple networks of the same network protocol family by invoking multiple instances of a network session protocol


Hanif; Mohammad | Vierling; Michael | Yanagihara; Kazuhisa

709 G06F 19960125 0 100%

Abstract: A system and method for enabling a file server to service a plurality of physical networks, wherein each of thenetworks has a network protocol of the same type. The system and method comprises a single instance of a filing protocol, andan object-oriented class for implementing a session protocol. The system and method further comprises means for invoking aplurality of session protocol instances, where each one of the plurality of session protocol instances corresponds to one of theplurality of physical networks. Each one of the plurality of session protocol instances services the corresponding physical networkand communicates with the single instance of the filing protocol, which enables the single instance of the filing protocol toservice the plurality of physical networks. MainClaim: A file server capable of servicing a plurality of physical networks of the same network protocol family, the fileserver comprising:

a single instance of a filing protocol; and

means for invoking a plurality of second protocol instances, each one of the plurality of second protocol instances correspondingto one of the plurality of physical networks, wherein each one of the plurality of second protocol instances services thecorresponding physical network and communicates with a single instance of the fling protocol, which enables the single instanceof the filing protocol to service the plurality of networks, wherein the second protocol is a session protocol.

7,472,177 System and method for selecting of versions for SNMP communication

Nokia Inc. Bose; Vaijayanti 709 G06F 20040623 1 92%

Abstract: A system and method are directed towards enabling and/or disabling a selection of a version of a networkmanagement protocol, such as SNMP. When a networking system is configured using an earlier version of SNMP, such as version

www.patentics.com


1 or 2, and is to be reconfigured to employ a later version such as version 3, certain options are to be reconfigured. Suchoptions for example, include usage of a community string. When the networking system is to be configured back to the earlierversion, the options are again reconfigured. The present invention enables an administrator of the computing system to managesuch changes, in part, by abstracting the switching details, without the need to track a progression of events. Moreover, a stateof the versions is tracked, such that if the networking system is switched back to version 1 or 2, the last configured communitystring value is restored. MainClaim: A method comprising: providing an interface configured to enable selecting from a plurality of versions of a networkmanagement protocol; using the interface to select a first version of the network management protocol from the plurality ofversions; providing, through the interface, an option associated with the selected first version; inhibiting access within theinterface to another option associated with another version of the network management protocol within the plurality of versions;and saving a configuration associated with the first version, wherein the configuration is based, in part, on a selection of theprovided option.

7,320,029 Quality of service definition for data streams

Nokia Corporation

Rinne; Janne Petri | Liljeberg; Mika | Jouppi; Jarkko Juhani

709 G06F 20010629 6 92%

Abstract: The invention relates to a device, system and method a method for applying a certain Quality of Service (QoS) to adata stream (31a 31c, 32a 32b, 33a) of an application (31 33) communicating data over a sockets connection. The methodcomprises providing a uniquely identifiable identifier (UID, Stream Type) the application (31 33) or to the data stream (31a 31c,32a 32b, 33a) from or to the application, and associating said identifier (UID, Stream Type) with a particular QoS in order toapply the particular QoS to the particular application (31 33) or to the particular data stream (31a 31c, 32a 32b, 33a), whichapplication or data stream is identified by the identifier. MainClaim: A method comprising: providing a unique identifier (UID, Stream Type) to an application executing in a terminaldevice, the unique identifier uniquely identifying at least one of the application and the data stream from or to the application;providing the unique identifier in addition to a port number to a protocol stack in the terminal device; determining an associationbetween said identifier and a particular Quality of Service (QoS) policy in the protocol stack using a database stored in saidterminal device; determining in the protocol stack within the terminal device QoS parameters contained in the QoS policy;transmitting from said terminal device to the network the QoS parameters to be applied to the data stream from or to theapplication; and applying the (QoS) parameters to the data stream of the application communicating data over a socketsconnection.

2004/0267910 Single-point management system for devices in a cluster

NOKIA INC.

Treppa, Basil | Mittal, Ajay | Koneru, Srikanth | Xu, Laura | Matai, Ajay

709 G06F 20030624 2 92%

Abstract: The present invention provides cluster management from a single application. A user may perform managementtasks on all of the devices within the cluster using a GUI or a CLI. The system automatically discovers the members of thecluster and acquires a configuration lock on the devices preventing other users from performing conflicting operations. If aproblem occurs during a configuration, the devices may be rolled back to a previous working configuration. A message format isprovided to help ensure message integrity beyond the security provided by a secure transport. An aggregator aggregatesconfiguration information and motored data and allows the information to be presented according to a user's requirements. MainClaim: A system for cluster management that allows the configuration and monitoring of a cluster from a single-point, comprising: a network interface configured to communicate with nodes in the cluster; a memory configured to store informationrelating to cluster management; a configuration subsystem coupled to a remote management broker, wherein the remotemanagement broker is configured to distribute information between the nodes in the cluster; a processor configured to performactions, including: accessing the cluster from the single-point; obtaining information relating to devices within the cluster;presenting the information to a user; and determining network management (NM) operations to perform to the cluster; andperforming the determined NM operations.

5,898,876

Efficient arbitration within point-to-point ringlet-based computer systems

Apple Computer, Inc. James; David V. 709 G06F 19970321 0 100%

Abstract: A method and system for providing arbitration within a ringlet-type interconnect of a computer system are described. By providing different arbitration values as part of out-of-band information and introducing asymmetry at a scrubber node, fairallocation of interconnect bandwidth is achieved. The number of arbitration values can be extended from a basic set to provideadditional functionality to handle specialized traffic situations. MainClaim: A computer system comprising:

a plurality of nodes connected in a ring using a plurality of point-to-point links;

at least one forwarding device associated with each of said plurality of nodes for forwarding data packets and idle symbols via anassociated one of said plurality of point-to-point links;

wherein said idle symbols include a field containing a first arbitration value; and

a scrubber associated with one of said plurality of nodes for performing maintenance functions associated with forwarding of saiddata packets and for converting said first arbitration value to a second arbitration value wherein said first arbitration valuecommands said plurality of nodes to stop sending said data packets and said second arbitration value permits said plurality ofnodes to send one more of said data packets.

6,654,811 Backpressure arrangement in client-server environment

Nokia Inc.

Chaskar; Hemant M. | Ravikanth; Rayadurgam | Said; Inas | Vaananen; Pasi | Dimitrou; Eleftherios | Turkia; Mikko

709 G06F 20000413 2 96%

www.patentics.com


Abstract: A line interface card apparatus includes: a packet queue memory for storing packets; a physical layer having first andsecond buffers, the physical layer being connected to the packet queue memory by a data bus and being connected to a pluralityof links; and a queue manager connected to the packet queue memory and to the physical layer by a control bus. Upon one ofthe plurality of links transmitting a request for data packets to the physical layer, the physical layer transmits the request viathe control bus to the queue manager; the queue manager instructs the packet queue memory to transmit requested datapackets to the physical layer via the data bus; each data packet is transmitted from the packet queue memory to the physicallayer in one or more packet fragments which are stored in one of the first and second buffers, and upon all of the one or morepacket fragments of one data packet being stored in one of the first and second buffers, the data packet is transmitted to thelink transmitting the request for data packets. MainClaim: A line interface card apparatus comprising:

a data bus;

a control bus;

a packet queue memory for storing a plurality of data packets;

a physical layer having first and second buffers, said physical layer being connected to said packet queue memory by said databus and being adapted to be connected to a plurality of links to transmit data from said first and second physical layer bufferson the links;

a queue manager connected to said packet queue memory and to said physical layer by said control bus;

wherein, said queue manager is responsive to said physical layer transmitting to said queue manager via said control bus, arequest for a first particular data packet, by instructing said packet queue memory to transfer the first particular data packet tosaid physical layer via said data bus, the first particular data packet being transferred from said packet queue memory to saidphysical layer in one or more packet fragments, the packet fragments being stored in one of said first and second buffers fortransmission on the certain link, and upon the last fragment of the first particular data packet being transferred to the certainlink said queue manager locates a new packet to be transferred to a link in response to a further request.

2007/0058649 Packet queuing system and method NOKIA CORPORATION

Kytomaa; Jouni | Peltonen; Janne K. 370 H04L 20050614 1 94%

Abstract: There is disclosed a method of queuing packets received at an input to at least one device for processing, the methodcomprising the steps of: allocating each received packet to at least one arrival queue of the device; placing each packet in theallocated queue if said queue is not full, otherwise dropping said packet; scheduling packets from the device arrival queue to atleast one transfer queue; responsive to transfer of a packet to a transfer queue, generating an interrupt from the device to aprocessor; at the processor, responsive to receipt of an interrupt, allocating the packet to one of a plurality of processor queues;placing the packet in the allocated processor queue if said queue is not full, otherwise dropping said packet; and schedulingpackets from the processor queues for processing. MainClaim: A method of queuing packets for processing, the method comprising the steps of: a. allocating each receivedpacket to at least one arrival queue; b. placing each packet in the allocated queue if said queue is not full, otherwise droppingsaid packet; c. scheduling packets from the arrival queue to at least one transfer queue; d. responsive to transfer of a packet toa transfer queue, generating an interrupt; e. responsive to receipt of an interrupt, allocating the packet to one of a plurality ofprocessor queues; f. placing the packet in the allocated processor queue if said queue is not full, otherwise dropping saidpacket; and g. scheduling packets from the processor queues for processing.

6,914,882 Method and apparatus for improved queuing

Nokia, Inc. Merani; Lalit | Bhat; Ravi Bail

370 H04B 20010330 1 92%

Abstract: A queue scheduler that distributes a partition worth of bandwidth to a plurality of queues according to a weightassigned to each of the queues. The plurality of queues are arranged from a highest priority to a lowest priority. The queues areserviced by the scheduler until each of the corresponding weights is consumed for each queue. The higher priority queues areserviced before the lower priority queues. MainClaim: An apparatus comprising:

a plurality of users;

resources that are partitioned according to a ranking of bandwidth associated with users, wherein the resources are partitionedaccording to a highest bandwidth supported by a node and an amount of bandwidth provided to each of the plurality of users isranked from highest to lowest; and

a queue scheduler that

a) schedules one or more packets within the node during scheduling cycles, wherein each scheduling cycle is partitioned intoregions that are coextensive with the highest bandwidth supported by the node and each schedule cycle is coextensive with ahighest counting modulo partitions, and

b) services users associated with the highest bandwidth in at least one partition during each scheduling cycle and servicesconsecutive bandwidth partitions of user associated with lower bandwidths across several cycles, wherein a number ofscheduling cycles between servicing of consecutive bandwidth partitions increases as the bandwidth associated with the userdecreases and the partition spacing for servicing a lower bandwidth user is determined by multiplying a number of lowerbandwidth users that can be serviced by the next highest bandwidth by a partition modulo of the next highest bandwidth.

6,862,627

Method and system for preventing a timeout from reaching a network host

Apple Computer, Inc. Cheshire; Stuart David

709 G06F 20001212 0 100%

Abstract: A method and system for preventing a timeout from reaching a network host when bringing up a down link that is

www.patentics.com


slow to waken. The method generally comprises receiving a request to access an information. If a link along a path to a remotecomputer containing the information is down, the link is established while concurrently returning a plurality of imposterresponses, such as domain names, until the network link is established. Software implementing this method may be stored andexecuted in any network host. This method is particularly advantageous when waiting for a dial-up telephone connection to a network to be established. MainClaim: A method comprising:

receiving from a requester a request to access an information;

if a link to a first remote computer containing the information is down, establishing the link while concurrently returning aplurality of imposter responses, which comprise a plurality of imposter domain names that allows the requester to send arequest for each of the plurality of the imposter responses to make a communication to the first remote computer appear asuninterrupted and to prevent a timeout to reach the requester, until the link is established, wherein returning the plurality ofimposter domain names comprises appending a text string to the domain name to create a current imposter domain name thatis one of the plurality of imposter domain names: and instructing the requester that the domain name is an alias for the currentimposter domain name.

2004/0267837

System and method for updating network appliances using urgent update notifications

Nokia Inc.

Wang, Bing | Lee, Anson | Albertao, Felipe | Card, James | Scott, Robert P.

707 G06F 20030630 1 96%

Abstract: The invention provides a system and method for updating network appliances using urgent update notifications. Thenetwork appliances periodically initiates connection to "poll" updates from the update server and the update server collects IPaddresses from the connections and updates an IP address log. The update server obtains updates for the network appliancesand determines whether a particular update is urgent. When an urgent update is available, the server delivers an urgent updatenotification (UUN) to each known network appliance through an existing port used for messaging. Each network appliancereceives the UUN and distinguishes it from other messages. In response to the UUN, each network appliance automaticallyconnects to the server, obtains the urgent update and installs the urgent update. MainClaim: A method for updating network appliances, comprising: determining an urgent update; creating an urgent updatenotification (UUN) associated with the urgent update; sending the UUN to the network appliances as messages; and providingthe urgent update to the network appliances.

6,941,478


Nokia, Inc.Card; James | Smith; Gregory J. 713 G06F 20021211 2 94%

Abstract: A method and system for providing protection from exploits to devices connected to a network. The system andmethod include a component for determining whether an encapsulation has been applied to an attachment associated with amessage and unencapsulating such encapsulated attachment, and a component that performs at least one decompression of theattachment when the attachment is compressed. If it is determined that the message, including the attachment, is to bescanned, a component is included that determines whether a header, body, and/or attachment of the message includes exploits.A device that receives messages that are directed to the network employs the components above to provide exploit protectionfor at least one of the messages. MainClaim: A system for providing protection from an exploit to a device connected to a network, comprising:

a content filter that receives a message that is directed to the device;

a message tracker that is coupled to the content filter and is configured to perform actions, including:

determining a size of a message component associated with the message;

if the size is less than or equal to a pre-determined size; identifying the message as unscanned;


determining a first value associated with the message, and if the first value is the same as a stored second value associated withthe message, identifying the message as a scanned message;


determining the first value associated with the message, and if the first value is different from the stored second value,identifying the message as unscanned; and

a scanner component that is coupled to the message tracker and that is configured to receive the unscanned message and todetermine whether at least one element of the message includes an exploit.

7,134,142 System and method for providing exploit protection for networks

Nokia Inc. Smith; Gregory J. 726 H04L 20020412 1 94%

Abstract: A method and system for providing protection from exploits to devices connected to a network. The system andmethod include a component for determining whether an encapsulation has been applied to an attachment and unencapsulatingsuch encapsulated attachments, a component that performs at least one decompression of the attachment when the attachmentis compressed, a component that determines whether a header, body, and/or attachment of a message includes an exploit, anda component that holds and optionally cleans messages that include exploits. A device that receives messages that are directedto the network employs the components above to provide exploit protection for at least one of the messages. MainClaim: A system for providing protection from exploits to devices connected to a network, comprising: (a) a content filter

www.patentics.com


that receives a message that is directed to at least one of the devices and that includes a header, a body, and an attachment,wherein the content filter determines an encapsulation that has been applied to the attachment prior to the system receiving themessage and unencapsulates the attachment; (b) a decompression component that is coupled to the content filter and thatperforms at least one decompression of the attachment when the attachment is compressed; (c) a scanner component that iscoupled to the decompression component and that determines whether the header includes an exploit, wherein exploitprotection software from at least two vendors is employed and wherein the header includes a field having a defined size and thescanner determines that the header includes the exploit when a size of data in the field is other than the defined size; (d) aquarantine component that is coupled to the scanner component and that holds the message when the message includes anexploit; and (e) a device that receives messages that are directed to the network and that employs at least the scannercomponent to provide exploit protection for at least one of the messages.

7,321,933

Method and system for preventing a timeout from reaching a network host

Apple Inc.Cheshire; Stuart David 709 G06F 20050120 0 100%

Abstract: A method and system for preventing a timeout from reaching a network host when bringing up a down link that isslow to waken. The method generally comprises receiving a request to access an information. If a link along a path to a remotecomputer containing the information is down, the link is established while concurrently returning a plurality of imposterresponses, such as domain names, until the network link is established. Software implementing this method may be stored andexecuted in any network host. This method is particularly advantageous when waiting for a dial-up telephone connection to a network to be established. MainClaim: A method of execution of computer readable instructions by a processor comprising: receiving a first request toaccess an information on a remote computer identified by a domain name; if a link to the remote computer containing theinformation is down, establishing the link while sending one or more imposter domain names until the link is established.

2009/0129301 Configuring a user device to remotely access a private network

Nokia Corporation and Recordation

Belimpasakis; Petros

370 H04B 20071115 1 92%

Abstract: Configuring a mobile device to remotely access a private network involves determining, via the private network, firstnetwork parameters that enable the mobile device utilize to a computing service of the private network. The device alsodetermines, via a gateway coupled to the private network, second network parameters that allow the mobile to utilize thecomputing service via a public network. The first and second network parameters are stored on the mobile device. A request isreceived from a user of the mobile device to access the computing service. It is determined that the mobile device is not on theprivate network. In response to determining that the mobile device is not on the private network, the second networkparameters are utilized to access the computing service via the gateway in response to the request. MainClaim: An apparatus comprising:at least one network interface, memory, and a processor coupled to the memory and thenetwork interface, wherein the memory stores instructions that causes the processor to:while on the private network:determinefirst network parameters that enable the apparatus to utilize a computing service of the private network;determine, from agateway coupled to the private network and the public network, second network parameters that allow the apparatus to utilizethe computing service via the public network, wherein the gateway selectably blocks connection attempts from the publicnetwork to the private network; andwhile on the public network:receive a request from the user interface to access thecomputing service;determine that the apparatus is not on the private network; andutilize the second network parameters toaccess the computing service via the gateway in response to determining that the apparatus is not on the private network.

6,141,677 Method and system for assigning threads to active sessions

Apple Computer, Inc.Hanif; Mohammad | Yanagihara; Kazuhisa

718 G06G 19951013 0 100%

Abstract: A method and system for processing active AFP sessions by a multithreaded file system process. The file server iscoupled to entities on a network, wherein an open AFP session is created when the file server and an entity on the networkestablish communication, and an active AFP session is created when an AFP session has a pending request. The method andsystem comprises monitoring the file server for active AFP sessions. When a first active AFP session having at least one AFPrequest becomes available, the method and system assigns a first one of the threads to the first active AFP session forprocessing. The method and system preempts the processing of the first active AFP session by the first one of the threads whenadditional active AFP sessions are available so that the first one of the threads becomes available to process additional activeAFP sessions, whereby equal processing time is provided to each one of the active AFP sessions. MainClaim: A method for processing active sessions by a file system process, wherein a file server is coupled to entities on anetwork and an open session is created when the file server and an entity on the network establish communication, and whereinan active session is created when an open session has a pending request, the method comprising the steps of:

(a) monitoring the file server for active sessions;

(b) assigning a first one of the threads to a first active session having at least one request for processing the first active session;

(c) preempting the processing of the first active session by the first one of the threads, prior to the complete processing of thefirst active session, when additional active sessions are available; and

(d) assigning the first one of the threads to each of the active sessions in a round robin fashion to process one or more requestsof each one of the active sessions, whereby equal processing time is provided to each one of the active sessions.

2004/0215578 Controlling usage of system resources by a network manager

Nokia, Inc. Das, Debashis 705 H04L 20030409 2 93%

Abstract: The aspects of the present invention manage an allocation of resources for network devices in a networked system.With an aspect of the invention, a usage of a resource is gauged by a number of tokens that are associated with an action for adesignated network device. The action is assigned at least one thread, where a thread corresponds to a process that supportsthe action. As requested, processes are initiated when an available number of tokens in a token pool can support the action. Arequest is stored in a request queue if a required number of tokens or threads are not available. The associated action for thedesignated network device is subsequently initiated when the required number of tokens and threads are available. When anaction for a device completes, the assigned tokens and threads are released for reassignment in order to initiate an action foranother device.

www.patentics.com


MainClaim: A method for controlling a system resource, the method comprising: (a) receiving a first request to initiate a firstaction for a first network device; (b) determining a first required number of tokens that is necessary to execute the first action,wherein the first required number of tokens corresponds to a first usage of the system resource that is allocated to execute thefirst action; (c) determining an available number of tokens remaining in a token pool; (d) if the available number of tokens is asgreat as the first required number of tokens, initiating the first action for the first network device; and (e) in response to (d),reducing the available number of tokens by the first number of tokens.

6,725,278

Smart synchronization of computer system time clock based on network connection modes

Apple Computer, Inc. Gonzalez; Julio A. 709 G06F 19980917 0 100%

Abstract: A method and apparatus are provided for performing synchronization of a time clock maintained by a computersystem based on the network connection modes of the computer system. The technique allows the time clock of the computersystem to be synchronized at the earliest opportunity that will not result in a disruption or inconvenience to the user. Whensynchronization of the time clock is required, and the computer system does not already have an active network connection, thecomputer system queries a configuration database to determine its default network connection mode. If the default connectionmode is potentially user disruptive (e.g., use of a dial out modem is required), synchronization of the time clock is notperformed until an active network connection has been established. If the default connection mode is not likely to be user-disruptive (e.g., doesn't require a modem connection), then a network connection is immediately established to synchronize thetime clock. MainClaim: A method of controlling synchronization of a clock maintained by a processing system, the method comprising:

determining whether a network connection mode of the processing system is user transparent;

if the network connection mode is determined not to be user transparent, then accessing a network to synchronize the clockonly when the processing system has an active connection to the network; and

if the connection mode is determined to be user transparent, then establishing an active connection to the network tosynchronize the clock when the processor system does not have an active connection to the network.

2005/0289228 System and method for managing a change to a cluster configuration

Nokia Inc.Srikanth, Koneru | Karlekar, Kripakaran

709 G06F 20040625 1 92%

Abstract: An apparatus and method are directed to managing a configuration of a cluster of members. The invention employsan atomic cluster configuration approach that includes applying a change to the configuration uniformly across the members inthe cluster. Each member within the cluster is initialized to a transaction mode. If all members are in the transaction mode, achange is provided to each member, which evaluates the received change. If the change is determined to be unacceptable forany of the members, the change is determined to be globally unacceptable, and is rejected for all the members in the cluster. MainClaim: A method for managing a configuration change to a cluster, comprising: receiving the configuration change;sending the configuration change to each member of the cluster; determining if the configuration change is unacceptable by anymember of the cluster, and if it is determined that the configuration change is unacceptable by any member of the cluster,directing each cluster member to disregard the configuration change; and if each member of the cluster indicates that theconfiguration change is acceptable, directing each member of the cluster to apply the configuration change.

7,436,783

Method and apparatus for detecting a router that improperly responds to ARP requests

Apple Inc.Cheshire; Stuart D. | Graessley; Joshua V.

370 H04L 20050404 0 100%

Abstract: One embodiment of the present invention provides a system that detects a non-compliant router that incorrectly responds to all address-resolution-protocol (ARP) requests, including ARP requests for link-local IP addresses. This is accomplished by sending an ARP request asking for an Ethernet address associated with a link-local IP address, wherein the link-local IP address is a reserved link-local IP address, which should not be assigned to any device. If a response is received tothe ARP request, the system determines that the response was sent by a non-compliant router that incorrectly responds to all ARP requests, including ARP requests for link-local IP addresses. MainClaim: A method for detecting a device that incorrectly responds to address-resolution-protocol (ARP) requests, comprising: sending an ARP probe for a link-local address; when a response is received to the ARP probe, sending an ARPrequest to the responding device asking for an Ethernet address associated with a reserved IP address, wherein the reserved IPaddress is an Ipv4 link-local broadcast address 169.254.255.255 or an IPv4 link-local address 169.254.0.0, which should not be assigned to any device; and if a response is received from the device to the ARP request, placing the address of the device on ablack list associated with a range of link-local IP addresses: and ignoring subsequent ARP responses from source addresses inthe black list for the link-local address range, so that subsequent ARP responses pertaining to that address range from thedevice will be ignored.

2007/0058606 Routing data packets from a multihomed host Nokia Corporation Koskelainen; Juha 370 H04L 20051115 2 94%

Abstract: The invention allows routing data packets from a multihomed host. A default gateway is associated with each ofnetwork addresses associated with the multihomed host. One of the associated network addresses is assigned to a data packetto be sent from the multihomed host as its source address. A routing table of the multihomed host is searched for a routematching a destination address of the data packet. It is determined, in response to one of no route found and the found routebeing a default route of the routing table, which of the default gateways is associated with the assigned source address, and thedata packet is dispatched to this determined default gateway. MainClaim: A method of routing data packets from a multihomed host, the method comprising: assigning a source address to adata packet to be sent from said multihomed host, said multihomed host having at least two associated network addresses, adefault gateway associated with each of said at least two associated network addresses, and said source address being one ofsaid at least two associated network addresses; determining a destination address of said data packet; searching a routing tableof said multihomed host for a route for said data packet, said route to match said destination address of said data packet;examining results of said searching; and in response to one of no route found and a found route being a default route of saidrouting table: determining a default gateway associated with said assigned source address, and dispatching said data packet tosaid default gateway associated with said assigned source address.

www.patentics.com


2008/0144532 Address resolution request mirroring Nokia Corporation

Chamarajanagar; Raveendra | Hunt; Peter | Kimble; Scott | Nguyen; Tuyen

370 H04L 20061215 2 93%

Abstract: Address Resolution Protocol (ARP) request mirroring can provide a mechanism for synchronizing link-layer adjacency information among network elements. This application can be useful, for example, for internet protocol (IP) routing networkelements in a high-availability configuration. MainClaim: A method, comprising:receiving an address resolution request from an active node;transmitting a second requestmirroring the request when the request meets a predetermined condition;updating an address resolution cache based oninformation in the request; andassuming responsibilities of the active node when the active node fails.

2008/0144634 Selective passive address resolution learning

Nokia Corporation

Chamarajanagar; Raveendra | Hunt; Peter | Kimble; Scott | Nguyen; Tuyen | Rashiyamany; Giritharan

370 H04L 20061215 2 92%

Abstract: Selective passive address resolution protocol (ARP) learning can provide a passive mechanism to synchronize linklayer adjacency information among network elements. Selective passive ARP learning can be implemented by a modification tothe ARP requests processing of the standby node, with a filter list containing a set of match rules for target network addresses.The implementation, thus, can be a configurable filter that enables software modules to specify a set of internet protocol (IP)addresses that the ARP input engine should monitor. MainClaim: A method, comprising:receiving an address resolution request from a neighbor node of an active node;updating anaddress resolution cache based on information in the request when the request meets a predetermined condition; andassumingresponsibilities of the active node when the active node fails.

5,509,126

Method and apparatus for a dynamic, multi-speed bus architecture having a scalable interface

Apple Computer, Inc.Oprescu; Florin | Teener; Michael D. 710 B06F 19930316 0 100%

Abstract: A dynamic, multi-speed bus architecture comprising a plurality of variable speed, fixed size links for coupling a plurality of devices together in an arbitrary network arrangement in which each device coupled to the bus comprises a novelcommunications node having a scalable interface for enabling the local hosts of the devices to communicate via the multi-speed bus. The interface provided within each node comprises a first module and a second module interconnected via a fixed speed,variable size bus. The first module is coupled to the local host of a device via a fixed speed, fixed size bus for converting a firstdata packet received from the local host into a second data packet of an appropriate form for transmission on the fixed speed,variable size bus disposed between the two modules. The second module receives the second data packet and converts it into athird data packet of an appropriate form for transmission onto the variable speed, fixed size link coupling the device to themulti-speed bus. The first and second modules further perform the same conversions in reverse so as to provide for reception ofdata packets transferred on the multi-speed bus. With such a design of the interface disposed between the link of the multi-speed bus and the local host of each device, it is possible to provide the components for performing the data packet transferconversions necessary to realize a true dynamic, multi-speed bus in addition to providing a truly scalable architecture havingupward compatibility with future devices. MainClaim: A method for transferring fixed size, variable length data packets from a first node to a second node via a variablespeed, fixed size link forming a multi-speed bus, the first node coupled to a first device comprising a local host for managing theoperations of the first device, the method comprising:

transferring a fixed size, variable length first data packet generated by the local host of the first device to a first module via afixed speed, fixed size first bus, the first module comprising a first converter;

converting the first data packet into a variable size, variable length second data packet;

transferring the second data packet from the first module onto a fixed speed, variable size second bus;

supplying the second data packet from the second bus as input to a second module, the second module comprising a secondconverter and a port connecting the second module to the link;

converting the second data packet into a fixed size, variable length third data packet;

transferring the third data packet to the second node via the link.

2006/0184710

Bridge between a single channel high speed bus and a multiple channel low speed bus

Nokia Inc.

Valdivia; David A. | Karuppampalayam; Jayagopal | Lappin; James B. JR.

710 G06F 20050217 2 93%

Abstract: An apparatus for enabling communication between components in a network device includes a network processorproviding data signals based on a PLx format; a multiport I/O controller having an IX bus interface and a plurality of MAC layerinterfaces; and a bridge for bi-directionally converting the streaming data from the network processor to the I/O controller. MainClaim: An apparatus for enabling communication between components in a network device, comprising: a networkprocessor providing data signals based on a PLx format; a multiport I/O controller having an IX bus interface and a plurality ofMAC layer interfaces; and a bridge for bi-directionally converting the streaming data from the network processor to the I/Ocontroller.

Method and apparatus for transmitting and Mullins; Jeffery L. |

www.patentics.com


5,404,374 receiving encoded data using multiple frequency coding

Apple Computer, Inc.Geiger; Edward W.

375 H04K 19930712 0 100%

Abstract: In a communication system including a plurality of networked stations that communicate using a slow frequencyhopping system, a method for encoding a packet of data in a transmitting station and decoding the data in a receiving station.In the transmitting station, the packet is divided into data segments. Error correction segments are added to correct the datasegments. The segments are fragmented into a series of fragments, and a data error control field is calculated for each fragmentand appended thereto. The data units including the segments are transmitted, and in a receiving station all or a portion of thebursts are received. The DEC field for each received fragment is calculated and compared with the received DEC field todetermine whether each fragment is good or bad. If there are a sufficient number of fragments in each column, then the datacan be reconstructed. MainClaim: In a communication system for networking a plurality of stations, each of which includes a transmitter and areceiver, a method for encoding a packet of data supplied by a Medium Access Control ("MAC") layer in a transmitting stationthat transmits said data in a series of N bursts and decoding received data units in a receiving station that receives at least oneof said bursts, said method comprising the steps of:

(a) in said transmitting station, forming said packet into at least one data segment having a first data byte unit and a seconddata byte unit;

(b) forming an error correction (EC) segment from said data segment, said EC segment having a first EC byte unit that correctserrors in said first data byte unit and a second EC byte unit that corrects errors in the second data byte unit;

(c) fragmenting each of said data segment and EC segment into a plurality of fragments;

(d) for each fragment, calculating a data error control (DEC) field and including said DEC field in the segment associated withsaid fragment so that each segment together with its associated DEC fields defines a data unit ("DU");

(e) transmitting said DUs in a series of N bursts;

(f) receiving at least one of said bursts in a receiving station;

(g) utilizing the DEC field to mark each fragment in said received bursts as one of good and bad; and

(h) defining a plurality of fragment columns, each fragment column defined to include a fragment from each of said N bursts,and, for each of said fragment columns, totaling a number of good fragments, and if said number of good fragments is greaterthan a number (N-e) that is the minimum number of fragments necessary to reconstruct the data in the fragments of eachcolumn, then reconstructing the packet.

7,324,549 Synchronisation communication systems

Nokia Corporation


370 H04J 20030305 3 95%


7,280,524 Receiver controlled isochronous transmission

Nokia Corporation Muller; Thomas | Schnitzler; Jurgen

370 G06F 20010112 1 94%

Abstract: A Bluetooth radio transceiver, for receiving isochronous data, comprising: receiving means for receiving data;determining mean for determining whether the received data has been correctly or incorrectly received; validation means fordetermining whether the received data is current; and transmission means, for transmitting, in response to received data, apositive acknowledgement of reception when the received data has been correctly received, a negative acknowledgement whenthe received data has been incorrectly received and the received data is current and a positive acknowledgement when thereceived data has been incorrectly received and the received data is not current. The determination of whether data is currentoccurs at the receiver as opposed to the transmitter. MainClaim: A radio transceiver, for receiving data, comprising: receiving means for receiving data; determining means fordetermining whether the received data has been correctly or incorrectly received; validation means for determining whether thereceived data is current; transmission means, for transmitting, in response to the received data, a positive acknowledgement ofreception when the received data has been correctly received, a negative acknowledgement when the received data has beenincorrectly received and the received data is current and a positive acknowledgement when the received data has beenincorrectly received and the received data is not current.

2007/0263708 Receiver Controlled Isochronous Transmission

NOKIA CORPORATIONMuller; Thomas | Schnitzler; Jurgen 375 H04B 20070608 1 94%

Abstract: A Bluetooth radio transceiver, for receiving isochronous data, comprising: receiving means for receiving data;determining means for determining whether the received data has been correctly or incorrectly received; validation means fordetermining whether the received data is current; and transmission means, for transmitting, in response to received data, a

www.patentics.com


positive acknowledgement of reception when the received data has been correctly received, a negative acknowledgement whenthe received data has been incorrectly received and the received data is current and a positive acknowledgement when thereceived data has been incorrectly received and the received data is not current is described. The determination of whether datais current occurs at the receiver as opposed to the transmitter. MainClaim: An apparatus comprising: a receiving component configured to receive data; a determining component configuredto determine whether the received data has been correctly or incorrectly received; a validation component configured todetermine whether the received data satisfies a condition; a transmission component, configured to transmit, in response to thereceived data, a positive acknowledgement of reception when the received data has been correctly received, a negativeacknowledgement when the received data has been incorrectly received and the received data satisfies the condition, and apositive acknowledgement when the received data has been incorrectly received and the received data does not satisfy thecondition.

7,624,021 Universal container for audio data Apple Inc.

Stewart; William G. | McCartney; James E. | Wyatt; Douglas S.

704 G10L 20040702 0 100%

Abstract: Storing audio data encoded in any of a plurality of different audio encoding formats is enabled by parametricallydefining the underlying format in which the audio data is encoded, in audio format and packet table chunks. A flag can be usedto manage storage of the size of the audio data portion of the file, such that premature termination of an audio recordingsession does not result in an unreadable corrupted file. This capability can be enabled by initially setting the flag to a value thatdoes not correspond to a valid audio data size and that indicates that the last chunk in the file contains the audio data. Stateinformation for the audio data, to effectively denote a version of the file, and a dependency indicator for dependent metadata,may be maintained, where the dependency indicator indicates the state of the audio data on which the metadata is dependent. MainClaim: A method for handling audio information, comprising: storing a set of chunks in a single audio file, wherein said setof chunks includes an audio data chunk and a plurality of metadata chunks; wherein each chunk of said set of chunks includesmetadata indicating a chunk size; storing, as part of said single audio file, a flag that initially is in a first state to indicate that alast chunk in said single audio file is said audio data chunk that contains audio data; while parsing said single audio file, acomputing device performing the steps of determining whether said flag is in said first state; and if said flag is in said first state,then determining a size for said audio data chunk based on a file size of said single audio file and a starting position of said lastchunk in said single audio file; and if said flag is not in said first state, then determining a size for said audio data chunk byreading audio data chunk size information stored in said single audio file.

2009/0119594




2009/0055417


NOKIA CORPORATIONHannuksela; Miska M.

707 G06F 20080819 9 93%


2009/0177942



714 H03M 20090108 9 92%

Abstract: A method includes organizing a first media source block in the media container file; calculating forward errorcorrection (FEC) redundancy data based on the first media source block; organizing the FEC redundancy data in at least one FECreservoir in the media container file; providing, in the media container file, meta data providing an association between the firstmedia source block and the at least one FEC reservoir; storing the first media source block as a first elementary item in themedia container file; and providing, in the media container file, information that the first elementary item comprises the firstmedia source block MainClaim: A method of generating a media container file, comprising:organizing a first media source block in the media container file;calculating forward error correction (FEC) redundancy data based on the first media source block;organizing theFEC redundancy data in at least one FEC reservoir in the media container file;providing, in the media container file, meta dataproviding an association between the first media source block and the at least one FEC reservoir;storing the first media source

www.patentics.com


block as a first elementary item in the media container file; andproviding, in the media container file, information that the firstelementary item comprises the first media source block.

7,596,223 User control of a secure wireless computer network

Apple Inc.Vogel, III; "J" Leslie 380 H04L 20000912 0 100%

Abstract: A wireless network is established between a station and an access point for the network using a sequence ofmessages that securely transmit authentication information from the station to the access point for validation by the accesspoint, and subsequently transmit a shared key necessary to establish the wireless network from the access point to the stationwhen the station is validated. MainClaim: A computerized method of establishing a secure wireless communication channel between an access point and astation, the channel being encrypted with a channel key, the method comprising: the access point receiving a connectionrequest from the station to initiate a setup connection between the access point and the station; the access point sending ashared key to the station in response to the connection request if the access point is capable of handling a connection to thestation; the access point selecting a secret access point key subsequent to sending the shared key; the access point generatinga self-distributed key using the secret access point key; the access point generating a first value using the secret access point key and a second value from the station, wherein the second value has been generated by the station using a secret stationkey; the access point sending the first value to the station, wherein the station uses the first value and the secret station key tocalculate the self-distributed key; the access point receiving an encrypted user name and an encrypted password from the station, wherein the station has encrypted the user name and the password with the self-distributed key; and the access point decrypting the user name and the password to check for validity; the access point encrypting the channel key using the self-distributed key if the user name and the password are valid; and the access point sending the encrypted channel key to thestation to cause the station to terminate the setup connection and to establish a secured connection with the access point usingthe channel key.

7,545,941

Method of initializing and using a security association for middleware based on physical proximity

Nokia CorporationSovio; Sampo | Ginzboorg; Philip | Ekberg; Jan-Erik

380 G06F 20040224 1 93%

Abstract: A computer system, method, and computer program product for controlling data communication in an ad-hoc network that connects a wireless device and a nearby wireless device. The method stores an application directory, determines apriority for each entry in the application directory, identifies a selected entry based on the priority, and examines the attributesand security parameters associated with the selected entry. When the security parameters indicate to use a secure connection,the method establishes a security association to support the data communication by querying a database for an existing securityassociation that will satisfy the security parameters. When the query is successful, the method reuses the existing securityassociation. When the query is unsuccessful, the method creates a new security association by establishing a privileged sidechannel to the nearby wireless device, negotiating the new security association over the privileged side channel, and storing thenew security association. MainClaim: A system comprising: a short-range ad hoc network that connects a wireless device to a nearby wireless device,each device including a memory device; and a processor disposed in communication with the memory device, the processorconfigured to: store an application directory in a middleware layer, the directory having at least one entry, each entry includingan application program identifier, attributes, and security parameters; determine a priority for each entry in the applicationdirectory; identify a selected entry based on the priority; examine the attributes and the security parameters for the selectedentry; and independently establish a security association to support a data communication when the security parameters directthe selected entry to use a secure connection.

2007/0076879

System, method and computer program product for authenticating a data agreement between network entities

Nokia CorporationAsokan; Nadarajah | Nyberg; Kaisa 380 H04K 20051003 1 93%

Abstract: A method for authenticating a data agreement between first and second network entities can include the first networkentity committing to the agreed data value, and transmitting the committed data value and a first random value to the secondnetwork entity. The first network entity can receive a second random value, and can then open the committed data value suchthat the second network entity can check the committed data value. If successful, the second network entity can calculate athird check string, and the first network entity can similarly calculate a fourth check string, based upon the data value and thefirst and second random values. The first network entity can calculate the fourth check string without the second network entitycommitting to the data value. The method can then include comparing the check strings such that the agreed data can beconsidered authenticated based upon the comparison. MainClaim: A first network entity for authenticating a data agreement with a second network entity, the first network entitycomprising: a processing element capable of committing to a first data value by forming a first check string based upon aselected first random value, and transmitting the first check string to the second network entity, wherein the processing elementis capable of receiving a selected second random value from the second network entity; thereafter, wherein the processingelement is capable of opening the commitment to the first data value by transmitting the first random value to the secondnetwork entity such that the second network entity is capable of checking the committed first data value based upon the firstcheck string and a second check string having been calculated based upon the first random value, the second network entitythereafter being capable of calculating a third check string based upon the first data value and the first and second randomvalues, wherein the processing element is capable of calculating a fourth check string based upon a second data value and thefirst and second random values, the fourth check string being calculated without the second network entity committing to thesecond data value or opening the commitment to the second data value, wherein the processing element is capable ofcomparing or facilitating comparison of the third and fourth check strings, the data agreement being authenticated based uponthe comparison, and wherein the processing element is capable of comparing or facilitating comparison of the third and fourthcheck strings when the second network entity successfully checks the committed first data value.

2008/0320308 Method for remote message attestation in a communication system

Nokia CorporationKostiainen; Kari Timo Juhani | Asokan; Nadarajah

713 H04L 20070620 1 93%

Abstract: The invention relates to a method for remote attestation. In the method is created a first asymmetric key pair in atrusted platform module in an electronic device. A first public key and software platform state information are certified with anattestation identity key associated with the trusted platform module to produce a first certificate. A second asymmetric key pair

www.patentics.com


is produced in an application within the electronic device. The second public key is certified with said first secret key to producea second certificate. A message is signed with the second secret key to provide a message signature in the first electronicdevice. The message and the message signature, software platform state information, the first certificate and the secondcertificate are sent to a second electronic device. MainClaim: A method comprising:creating a first asymmetric key pair in a trusted platform module of a first electronic device,said first asymmetric key pair comprising a first public key and a first secret key;associating said first public key with softwareplatform state information within said first electronic device;certifying said first public key and said software platform stateinformation with an attestation identity key associated with said trusted platform module to produce a first certificate;creating asecond asymmetric key pair in an application within said first electronic device, said second asymmetric key pair comprising asecond public key and a second secret key;certifying said second public key with said first secret key to produce a secondcertificate;signing a message with the second secret key to provide a message signature in said first electronic device;providingsaid message and said message signature to a second electronic device; andproviding said software platform state information,said first certificate and said second certificate to said second electronic device.

5,471,503

Scanning method for receiving a transmission in a communication system with slow frequency hopping and coding

Apple Computer, Inc.Altmaier; Paulette R. | Potrebic; Peter J.

375 H04B 19921229 0 100%

Abstract: A scanning method for receiving a signal in a frequency hopped communication system that transmits a packethaving N segments that are encoded with an error correction code that allows recovery of a packet even if e segments areerasures. A receiving station continuously scans the first p (1≤p≤e+1) channels, testing each channel for the existence of atransmission. If detected, a segment is received, and then the receiving station sequences through the remaining channels,receiving the segments if possible, and then applying error correction to the complete transmission. This technique of scanningthe first several channels, receiving the first unimpaired segment, and thereby gaining the ability to recover all unimpairedsegments enables the full theoretical power of a coded, slow frequency hopped system to be realized. MainClaim: In a decentralized communication system for communicating between two or more of a plurality of stations each ofwhich includes a transmitter and a receiver, a method for detecting and receiving a packet of data transmitted by an arbitrarytransmitting station of said plurality of stations that first encodes and arranges the packet into a plurality of N segments, andthen transmits the packets using frequency hopping in a predetermined channel sequence of N radio frequencies, said methodcomprising the steps of:

(a) in an arbitrary receiving station that is initially unsynchronized with said transmitting station, scanning a subset offrequencies of said N radio frequencies, said subset including a first plurality p (p<N) of frequencies in said predeterminedchannel sequence wherein a scan time for each frequency of said subset is substantially less than the time necessary to receivea segment;

(b) testing for the presence of a transmission on each of said p scanned frequencies;

(c) if a transmission is detected on one of said p scanned frequencies, then performing a receiving step (d), otherwise returningto step (a); and

(d) if a transmission is detected in the step (c), then synchronizing the receiving station with the transmitted packet, receivingthe segment, hopping to the next frequency in the predetermined channel sequence and receiving a segment on that channeland continuing to hop and receive until the Nth segment has been received, otherwise returning to step (a).

7,295,546 Method for synchronizing bluetooth packets

Nokia Corporation Reunam ki; Jukka 370 H04J 20030226 1 93%

Abstract: In Bluethooth medium rate packets, the access code and the header are frequently modulated by Gausian FrequencyShift Keying, and the actual payload is phase-modulated by a differential Quadrature Phase Shift Keying or an 8-ary DQPSK scheme. Guard time and a synchronization sequence are placed between the header and the payload parts because of the needto change the modulation scheme and because of the ease in packet transfer. A sequence having a form of ABA is added to aBarker sequence having a form of BABBAAA for providing the synchronization sequence having the form of ABABABBAAA, whereA and B are different states in a binary representation. MainClaim: A method for improving synchronization between one communication device and another communication deviceusing a packet, wherein the packet comprises an access code, a header and a payload segment, and the access code comprisesan N-symbol synchronization word for synchronization purposes, wherein N is a positive integer and wherein the N-symbol synchronization word is a generalized Barker sequence either in a first form or a second form with symbols A and B, wherein inthe first form the generalized Barker sequence consists of a two-symbol part having a form of BA preceding an N-2 -symbol part, and wherein in the second form the generalized Barker sequence consists of a two-symbol part having a form of AB following a different N-2 -symbol part, and wherein A is different from B in a binary representation, said method comprising:adding at least a 3-symbol sequence having a form of ABA immediately preceding the N-symbol synchronization word when the generalized Barker sequence is in the first form, and adding said at least 3-symbol sequence immediately following the N-symbol synchronization word when the generalized Barker sequence is in the second form.

2004/0165576 Method for synchronizing bluetooth packets

Nokia Corporation Reunamaki, Jukka 370 H04J 20030226 1 93%

Abstract: In Bluethooth medium rate packets, the access code and the header are frequently modulated by Gausian FrequencyShift Keying, and the actual payload is phase-modulated by a differential Quadrature Phase Shift Keying or an 8-ary DQPSK scheme. Guard time and a synchronization sequence are placed between the header and the payload parts because of the needto change the modulation scheme and because of the ease in packet transfer. A sequence having a form of ABA is added to aBarker sequence having a form of BABBAAA for providing the synchronization sequence having the form of ABABABBAAA, whereA and B are different states in a binary representation. MainClaim: A method for improving synchronization between one communication device and another communication deviceusing a packet, wherein the packet comprises an access code, a header and a payload segment, and the access code comprisesan N-symbol synchronization word for synchronization purposes, wherein the N-symbol synchronization word is a generalized Barker sequence either in a first form or a second form, wherein in the first form the generalized Barker sequence consists of a

www.patentics.com


two-symbol part having a form of (BA) preceding an (N-2)-symbol part, and wherein in the second form the generalized Barkersequence consists of a two-symbol part having a form of (AB) following a different (N-2)-symbol part, and wherein A is different from B in a binary representation, said method comprising the step of: extending the synchronization word for providing anextended synchronization word of at least (N+3) symbols by adding at least a 3-symbol sequence having a form of ABA immediately preceding the N-symbol synchronization word when the generalized Barker sequence is in the first form, and addingsaid at least a 3-symbol sequence immediately following the N-symbol synchronization word when the generalized Barker sequence is in the second form.

7,120,852

Method and apparatus for packet aggregation in a wireless communication network

Nokia Corporation Terry; John | Jokela; Jari

714 H03M 20040628 1 93%

Abstract: A method and apparatus for aggregating packets in a wireless communication system. The data to be transmitted isselected and packetized and formed into frames for transmission. Rather than send each frame individually, frames are groupedand transmitted with grouping indicia informing the recipients how to acknowledge successful receipt of the transmitted data.ACKs are sent at a predetermined time, or all together, divided by subcarrier in the case of an OFDMA network. MainClaim: In a wireless communication system operable to communicate packetized data according to a channel accessprotocol, an improved method of communicating the data packets, said method comprising the steps of: forming, in atransmitting station, the data to be transmitted into a plurality of packets; selecting a group of packets for aggregatetransmission from the plurality of packets; creating grouping indicia associated with the selected packet group in thetransmitting station, the grouping indicia being indicative of the recipients of each of the packets and identifying differentrecipients for at least two packets of the same packet group; and assembling at least one transmission frame including theselected packet group and the grouping indicia.

7,532,862

Method and apparatus for configuring a wireless device through reverse advertising

Apple Inc. Cheshire; Stuart D. 455 H04B 20020319 0 100%

Abstract: One embodiment of the present invention provides a system that uses reverse advertising to configure a new wirelessdevice to join an existing wireless network. During operation, the new wireless device broadcasts an advertisement for itself. Inresponse to the advertisement, the new wireless device receives information from an existing wireless device on the existingwireless network. This information specifies how to join the existing wireless network. Next, the new wireless device uses theinformation to configure itself to join the existing wireless network. MainClaim: A method for using reverse advertising to configure a new wireless device to join an existing wireless network,comprising: broadcasting a service advertisement from the new wireless device on a new wireless network, wherein the serviceadvertisement can be received by more than one device on the existing wireless network; in response to the serviceadvertisement, the new wireless device receiving information from an existing wireless device that is on the existing wirelessnetwork, wherein receiving the information from the existing wireless device involves: receiving a request to join the newwireless network from the existing wireless device; allowing the existing wireless device to join the new wireless network; andreceiving information from the existing wireless device specifying how to join the existing wireless network; wherein the newwireless network and the existing wireless network are different networks; wherein the information specifies how to join theexisting wireless network and includes a packet which is associated with one or more of: the name of the existing wirelessnetwork, encryption key type, encryption key, IP (Internet Protocol) address of the new wireless device, subnet mask, IPgateway address, and DNS (Domain Name System) server address; and enabling the new wireless device to join the existingwireless network based on the information.

2005/0266826

Method for establishing a security association between a wireless access point and a wireless node in a UPnP environment

Nokia Corporation Vlad, Stirbu 455 H04M 20040601 1 95%

Abstract: A system and method provide for the intuitive establishment of a security association between devices. To join anetwork of devices, a user device sends user parameters for the user device to an administrator device using an out-of-band communication protocol. The administrator device sends the user parameters to an access point device using a Universal Plugand Play Simple Object Access Protocol (UPnP SOAP) Set action. The access point device saves the user parameters in a localdatabase. The administrator device retrieves access point parameters from the access point device using the UPnP SOAP Getaction. The administrator device sends the access point parameters to the user device using the out-of-band communication protocol. The user device connects to the access point device using the access point parameters to configure a secureconnection. Preferably, a location limited channel is used by the user device to communicate with the administrator device. MainClaim: A user device for establishing a security association, the user device comprising: a memory that holds a securityassociation application; a location limiting component, wherein the location limiting component is configured to: send userparameters to an administrator device; and receive access point parameters from the administrator device; a communicationinterface, wherein the communication interface connects to an access point using the received access point parameters; and anelectronic circuit coupled to the location limiting component and to the communication interface to execute the securityassociation application.

6,985,697

Method and system for wirelessly managing the operation of a network appliance over a limited distance

Nokia, Inc.Smith; Gregory J | Scott; Robert Paxton

455 H04B 20030922 1 94%

Abstract: A wireless communication interface in a network appliance that enables secure wireless management of the networkappliance over a relatively limited (short) distance with a mobile node. The operator of the mobile node is authenticated andcommunication between the network appliance and the mobile node is encrypted. Even if an unauthorized person was able to bepositioned in relatively close proximity to a network appliance such as within the physical confines of a data center, theseauthentication and encryption measures would make it extremely difficult for unauthorized wireless management of theoperation of the network appliance. MainClaim: A method for enabling management of a network appliance with a mobile node, comprising

enabling the network appliance to provide a beacon, wherein the beacon is created by a radio signal that is generated with

www.patentics.com


relatively low power;

if the mobile node receives the beacon, enabling the mobile node to pair with the network appliance;

if the mobile node is paired with the network appliance, pushing an application from the mobile node to the network appliance;and

enabling the mobile node to wirelessly communicate at least one management operation to the pushed application over arelatively short distance, wherein the management operation is provided to the network appliance for execution.

2006/0274726

System and method for accessing a web server on a device with a dynamic IP-address residing behind a firewall

Nokia CorporationWikman; Johan | Dosa; Ferenc | Palko; Sakari

370 H04L 20050603 1 93%

Abstract: A system and method for providing access to a web server on an electronic device positioned within a firewall. Agateway device including a gateway server is provided outside of the firewall. The gateway device includes an IP address thatcorresponds to the same DNS extension that is used in the DNS name of the web server. When a client device attempts tocontact the web server through the DNS name, the request is transmitted to the gateway server, which in turn communicateswith the web server. MainClaim: A method of providing access to a web server on an electronic device residing behind a firewall, comprising: havinga gateway server positioned outside of the firewall, the gateway server possessing an IP address corresponding to apredetermined DNS extension, wherein the DNS name of the web server includes the predetermined DNS extension; upon aclient device attempting to contact the electronic device using the DNS name, having the gateway server receive the contactattempt and information contained therein; and having the gateway server transmit the information included in the contactattempt to the web server.

7,587,495 Automatic configuration of controller computers in a network

APPLE Inc

Albouze; Jean Francois | Margolis; Michael R.

709 G06F 20040826 0 100%

Abstract: A system for automatic configuration of computers on a network is disclosed. In a first aspect a storage area networkis disclosed. The network comprises at least one controller; and a plurality of clients coupled to the at least one controller. Thenetwork includes a storage device coupled to the at least one controller and the plurality of clients. The controller uponattachment to the network registers itself and notifies the plurality of clients. The plurality of clients then interrogates thecontroller. Each of the plurality of clients updates its configuration based upon the interrogation.In a second aspect, a methodfor configuration of computers in a network is disclosed. The method comprises registering at least one controller uponattachment to the network and notifying a plurality of clients by the at least one controller The method includes interrogatingthe at least one controller by each of the plurality of clients. The plurality of clients are updated based upon the interrogation. MainClaim: An Internet Protocol network comprising: a plurality of controller computers; and a plurality of clients coupled tothe plurality of controller computers; wherein the plurality of controller computers in response to attachment to the network areoperable to automatically self-register themselves using a discovery mechanism within each of the plurality of clients; and tonotify the plurality of clients, and each of the plurality of clients to interrogate the plurality of controller computers and each ofthe plurality of clients to update its configuration based upon the interrogation; and wherein any of the plurality of clients tostart a synchronization sequence to interrogate the plurality of controller computers, filtering out those controller computerswhich are not part of the network and querying the configuration of a first controller it finds that is coupled to the network,wherein each of the controller computers and each of the plurality of clients perform the following: providing for allocating IPaddresses without a Dynamic Host Configuration Protocol (DHCP) server; providing for translating between names and IPaddresses without a Domain Name System (DNS) server; and, locating or advertising services without a directory server.

2006/0015513

System, network entities and computer programs for configuration management of a dynamic host configuration protocol framework

Nokia Corporation Poyhonen; Petteri | Tuononen; Janne

707 G06F 20050516 1 92%

Abstract: A system, network entities and computer programs to provide a dynamic configuration data storage system for botha standard DHCPv4 and DHCPv6 framework. Together with standard DHCPv4 and DHCPv6 protocol functionalities, the inventionprovides auto-configuration of configuration parameters from network servers to hosts, e.g. to mobile terminals. MainClaim: A system for configuration management of a dynamic host configuration protocol framework, the systemcomprising: at least one dynamic host control protocol server; at least one configuration storage; at least one storage manager;and at least one network server; wherein a configuration storage is connected to at least one dynamic host control protocolserver and to at least one storage manager, and is configured to store configuration data used by the at least one dynamic hostcontrol protocol server; wherein a storage manager is connected to at least one configuration storage and to at least onenetwork server, and is configured to maintain configuration data content in the at least one configuration storage and managesignaling and data transfer between the at least one configuration storage and the at least one network server, wherein anetwork server is connected to at least one storage manager, and is configured to provide the at least one storage manager withconfiguration data; and wherein the storage manager dynamically updates configuration data content in the at least oneconfiguration storage.

7,570,939 RFID network arrangement

Apple Inc. Culbert; Michael 455 H04M 20050906 0 100%

Abstract: A system for automatic configuration and authentication of network devices is disclosed. A network base station, e.g.,a wireless router, includes an RFID transceiver. A network device includes an RFID tag. Then the network device is brought intoproximity with the base station, an exchange of information takes place between the RFID transceiver in the base station andthe RFID tag in the device. When the network device is powered on, it reads the information in its RFID tag and uses thisinformation to establish a limited connection to the base station. Once connected, the base station and network device exchangeauthentication and encryption parameters over the limited connection and thus establish a fully functional and secure networkconnection between the network base station and the network device. MainClaim: A method for configuring a wireless networking device, the method comprising: interacting with an RFID tag in the

www.patentics.com


wireless networking device when the networking device is brought into physical proximity with a wireless networking basestation, such that the interaction causes configuration information to be exchanged between the RFID tag and an RFIDtransceiver in the base station that facilitates establishment of a wireless network connection between the networking deviceand the base station; and storing the configuration information to the RFID tag persistently, whereby future establishment of awireless connection between the networking device and the base station is established without interacting with an RFIDtransceiver.

2009/0052421

DISTINGUISHING BETWEEN DEVICES OF DIFFERENT TYPES IN A WIRELESS LOCAL AREA NETWORK (WLAN)

Nokia CorporationStirbu; Vlad | Saaranen; Mika | Hussmann; Holger

370 H04W 20080820 1 93%

Abstract: A method and system for distinguishing between devices of different types (e.g., mobile and stationary devices) in awireless local area network (WLAN) in order to provide additional services to one or the other. The method includes obtaining adevice type for the terminal, and providing specific services to the terminal if the terminal is a device of a certain type. MainClaim: A method for distinguishing between device types in a wireless local area network (WLAN) in order to provideadditional services to one type of device, the method comprising:obtaining a device type, the device type including one of amobile type and a stationary type, for a terminal in a wireless local area network; andproviding additional device type-specific services to the terminal if the terminal is a first device type belonging to a first device class.

2008/0222701 Using secondary bearer to detect proximity of a device

NOKIA CORPORATION Saaranen; Mika | Hussmann; Holger

726 H04L 20070305 1 92%

Abstract: A new and unique method or apparatus for providing protected transport of digital content from a first device to asecond device, featuring activating a proximity link between the first and second devices; performing proximity detectionbetween the first device and the second device; delivering the digital content from the first device to second device over acommunications link when it is determined that the proximity between devices is within a predetermined range. The proximitylink may take the form of a wireless link that is limited in its range with adequate authentication mechanisms, and may be eitheris an additional link compared to, for example, a wireless broadband link, or may even form part of the wireless broadband linkif its broadband is sufficient. In operation, an actual streaming transfer or other suitable data transfer would be provided fromone device to the other device using the additional link, such as the wireless broadband link. In particular, the proximity linkmay ensure that the physical proximity of the other device is in a certain range. MainClaim: A method for providing protected transport of digital content from a first device to a second devicecomprising:activating a proximity link between the first and second devices;performing proximity detection between the firstdevice and the second device;delivering the digital content from the first device to second device over a communications linkwhen it is determined that the proximity between devices is within a predetermined range.

2009/0327713

SYSTEM AND METHOD FOR ESTABLISHING BEARER-INDEPENDENT AND SECURE CONNECTIONS

Nokia Corporation

Marin; Janne | Kostiainen; Kari | Asokan; Nadarajah | Moloney; Seamus | Ginzboorg; Philip | Lafuente; Javiar

713 H04L 20061116 1 92%

Abstract: A system and method for efficiently enabling local security connectivity between electronic devices over multiplebearers. Electronic devices are configured to advertise, over each bearer, their respective configuration parameters for eachbearer. After a connection has been established between the electronic devices over a first bearer, the two electronic devicesuse the first bearer to establish connections over the other bearers using the configuration parameters contained in theadvertisements and advertised over the first bearer. Shared keys are established for the other bearers either using keys derivedfrom the first shared key or by using the first secure connection as an out-of-band channel. The present invention also provides for the creation of an ad hoc WLAN connection once a Bluetooth connection has been established. MainClaim: A method of establishing a secure connection between a first electronic device and a second electronic device overmultiple bearers, comprising:establishing a connection with the second electronic device over a first bearer;receiving a firstadvertisement from the second electronic device over the first bearer, the first advertisement including configuration parametersfor at least a portion of the other bearers which are supported by the second electronic device;using the configurationparameters received in the first advertisement to establish connections over at least a portion of the other bearers that aresupported by both the first and second electronic devices.

6,523,113 Method and apparatus for copy protection Apple Computer, Inc.

Wehrenberg; Paul J. 713 H04L 19981109 0 100%

Abstract: Copy protection techniques that utilize a watermark and a permission key are disclosed. The copy protectiontechniques can provide single-copy copy protection in addition to different levels of copy protection. The permission key and thewatermark can also permit the invention to yield variable levels of copy protection. In one embodiment, content including awatermark is transmitted to a recipient. The recipient is allowed to read the content but not record the content unless therecipient possesses a permission key. MainClaim: A method of copy protecting content comprising:

receiving content to be recorded, the content including a watermark encoded in the content and the watermark indicating thatthe content is copy protected;

receiving an encrypted permission key;

decrypting the encrypted permission key providing a decrypted permission key;

extracting the watermark from the content;

comparing the decrypted permission key and the watermark to determine if the decrypted permission key and the watermarkmatch; and

permitting the recording of the content if the decrypted permission key and the watermark match and otherwise prohibiting the

www.patentics.com


recording of the content.

6,959,090 Content Protection scheme for a digital recording device

Nokia Corporation

Alve; Jukka | Mårtensson; Jan | Lidholm; Ola | Niemi; Valtteri | Tomberg; Juha | Kärkäs; Pasi | Pekonen; Harri | Suominen; Rami

380 H04L 20001120 1 92%

Abstract: A recording device for digital data streams, such as digital TV broadcasts or digitized music, stores copies of programcontent encrypted by a key unique to the recording device. Distribution of program content is thus discouraged, since intelligibleplayback of program content would not be obtained on another recording device, which would have a different key. To reducemanufacturing complexity which would result from requiring all bits of a key to inhere in hardware, a first portion of the keyinheres in hardware and a second portion is selected from among several candidates residing in a memory device, the key beingdetermined by combining the first and second portions according to predetermined rules. The second portion is reselected atpredetermined intervals from among the candidates. Only payload portions of packets are encrypted while header portions areleft in the clear in order to facilitate ancillary functions of recorder such as fast forward, fast rewind, and program search. MainClaim: A method of recording digital data, comprising:

receiving packets of a digital data stream in a recording and playback device;

encrypting the received packets in the recording and playback device according to an encryption key unique to the recording andplayback device, wherein the recording and playback device includes a readout path for at least a portion of the encryption key,the readout path being connectable to an external IC tester;

storing the encrypted packets;

arranging the readout path to be disabled by a first irrevocable condition and to be re-enabled by a second irrevocable condition, and

arranging a path essential to functioning of the recording and playback device to be disabled by said second irrevocablecondition.

7,424,615 Mutually authenticated secure key exchange (MASKE)

Apple Inc.

Jalbert; Christopher P. | Wallace; Leland A. | O'Rourke; David M.

713 H04L 20010730 0 100%

Abstract: The invention provides a cryptographic method which includes receiving at a first entity a second public key MA. At

least one of a first session key KB and a first secret SB may be generated based on the second public key MA. A first random

nonce NB may be generated which may be encrypted with at least one of the first session key KB and the first secret SB to

obtain an encrypted random nonce. The encrypted random nonce may be transmitted from the first entity. In response totransmitting the encrypted random nonce, the first computer may receive a data signal containing a modification of the firstrandom nonce NB+1. If the modification of the first random nonce NB+1 was correctly performed, then at least one of (i)

opening a communication link at the first computer, and (ii) generating a first initialization vector IB is performed.

MainClaim: A cryptographic method, including: generating, at a first entity, a first public key MB, the first public key MB being

session specific; receiving from a second entity, at the first entity, a second public key MA, the second public key MA being

session specific; generating, at the first entity, a first secret SB by hashing one or more parameters that are known to the first

entity and the second entity, at least one of the parameters being a result of hashing one or more of the following: a firstpassword PB, the first public key MB, and the second public key MA; generating, at the first entity, a first session key KB, the

first session key KB being different from the first secret SB, both the first session key KB and the first secret SB being computed

from the second public key MA; encrypting, at the first entity, a first random nonce NB with the first session key KB or the first

secret SB to obtain a first encrypted result; encrypting, at the first entity, the first encrypted result with the other one of the first

session key KB or the first secret SB to obtain an encrypted random nonce; transmitting the encrypted random nonce from the

first entity to the second entity; receiving a response to the encrypted random nonce; and authenticating through determiningwhether the response includes a correct modification of the first random nonce NB.

7,366,905 Method and system for user generated keys and certificates

Nokia Corporation Paatero; Lauri 713 H04L 20020228 1 95%

Abstract: A method and system to allow user generation of a private-public key pair and an associated user generated certificate to establish the identity of a user based upon signing the user generated certificate with a private key of a private-public key pair associated with a certificate issued by a Certification Authority (CA). The user generated certificate therebyallows the user that generated the certificate to establish a secure session with a third party without multiple use of thecertificate issued by the CA, typically for use on another network infrastructure. The method and system are particularly usefulfor establishing a secure session, such as a Secure Socket Layer session using a personal computer, where the CA certificate isassociated with a wireless identity module of a wireless device. MainClaim: A method comprising: having an identity authenticated in a first system; a second system causing a key to begenerated for use in the second system; the second system generating a certificate for the key; and establishing the identity ofa user in the second system by signing the certificate for the key using the authenticated identity of the user in the first system,wherein the certificate for the key for use in the second system contains usage limitations, including a temporal limit on usage,wherein the temporal limit requires that once a secure socket layer session on the second system is completed, the certificate ora corresponding key is destroyed, wherein said usage limitations also include a limit on use of said key for encryption only,which excludes use of said key for signature verification; and wherein the first system is a wireless communication system and

www.patentics.com


wherein the second system is a computer connected to an Internet.

2003/0163700 Method and system for user generated keys and certificates

Nokia Corporation Paatero, Lauri 713 H04L 20020228 1 95%

Abstract: A method and system to allow user generation of a private-public key pair and an associated user generated certificate to establish the identity of a user based upon signing the user generated certificate with a private key of a private-public key pair associated with a certificate issued by a Certification Authority (CA). The user generated certificate therebyallows the user that generated the certificate to establish a secure session with a third party without multiple use of thecertificate issued by the CA, typically for use on another network infrastructure. The method and system are particularly usefulfor establishing a secure session, such as a Secure Socket Layer session using a personal computer, where the CA certificate isassociated with a wireless identity module of a wireless device. MainClaim: A method of authenticating a user of a second system where the user has an authenticated identity in a firstsystem, comprising the steps of: the second system causing a key to be generated for use in the second system; the secondsystem generating a certificate for the key; and signing the certificate for the key using the authenticated identity of the user inthe first system.

2008/0123842

Association of a cryptographic public key with data and verification thereof

Nokia Corporation Pohja; Seppo 380 H04L 20061103 1 94%

Abstract: The invention allows a creator of a key pair--a public and a private key--to associate user data with the public key in such a way that verification data needed to cryptographically verify the association can be made public without compromisingthe key pair. An integer for use as a public exponent in the public key is derived such that it is a function of the user data to beassociated with the public key. MainClaim: A method comprising:generating a first prime number P and a second prime number Q;randomly deriving aninteger E as a function of a given random input number a and a bit string representation u of given user data; andgenerating, inresponse to the derived integer E and a product (P-1)(Q-1) being relatively prime and further in response to the derived integerE both exceeding 1 and remaining below the product (P-1)(Q-1), a cryptographic key pair comprising a private key and an associated public key with the derived integer E used as a public exponent in the public key in order to create a cryptographicassociation between the public key and the given user data.

5,444,781 Method and apparatus for decryption using cache storage

Apple Computer Inc.

Lynn; Kerry E. | Zweig; Jonathan M. | Mincher; Richard W.

380 H04C 19940606 0 100%

Abstract: A method and apparatus for decryption using cache storage wherein imported ciphertext is decrypted to produceunencrypted plaintext data. As a communication sequence containing an initialization vector and a block of ciphertext isimported, the initialization vector is applied to a cache and to a decoder. The initialization vector is then compared with otherinitialization vectors stored in the cache to determine whether the specific initialization vector has previously been received andstored. If the specific initialization vector is found to be stored in the cache, then the PN sequence associated with thatinitialization vector is written to the decoder, and the stored PN sequence is used to decode the imported ciphertext. If adetermination is made that the initialization vector has not been previously received, then the read cache signal instructs themultiplexer to connect the PN generator to the decoder, and the initialization vector is used to generate a new PN sequence. Inorder to improve the efficiency of future ciphertext decoding utilizing this specific initialization vector, the PN sequenceassociated with the initialization vector is then stored in the cache together with its corresponding initialization vector. When thenext block of ciphertext is received using the same initialization vector, the PN sequence need not be regenerated by the PNgenerator, but rather may be read from the cache as a stored sequence. MainClaim: An apparatus for decryption using cache storage, the apparatus comprising:

a memory for storing at least one number sequence;

a control signal responsive to the contents of the memory which indicates whether a selected number sequence is stored in the

a switch having a first sequence input coupled to the output of the memory, for selectively outputting the first sequence inputresponsive to the indication of the control signal; and

a decoder which receives the output of the switch as a first input and receives encrypted data as a second input, and combinesthese first and second inputs to produce decrypted data.

7,007,050

Method and apparatus for improved pseudo-random number generation

Nokia Corporation Saarinen; Markku-Juhani

708 G06F 20010517 6 95%

Abstract: A pseudo-random number generator (PRNG) for a cryptographic processing system is disclosed in which the PRNG isreseeded at each instance of input entropy and in which a standard timestamp variable used in determining random sequenceoutputs is replaced with a running counter. The method employed by the PRNG demonstrates increased resistance to iterative-guessing attacks and chosen-input attacks than those of previous technologies. The PRNG is suitable for use in, for example, amobile telephone system for accomplishing secure communications. MainClaim: A method for seeding a pseudo-random number generator (PRNG), comprising:

storing a plurality of state variables including an internal key, a seed value and a counter variable based on a hash output in anoutput buffer for use by a PRNG in determining a random number;

receiving successive input entropy signals;

clearing the output buffer upon receipt of each of said successive input entropy signals; and

www.patentics.com


calculating new state variables after receipt of each of said successive input entropy signals, wherein each of said successiveinput entropy signals comprise an input seed and said state variables comprise at least one constant expressed as a binarynumber, said calculating, in an initial state of the PRNG, further comprises:

receiving the input seed;

concatenating the input seed with a first constant;

determining a first output based on a hash of the concatenated input seed and the first constant;

concatenating the input seed with a second constant;

determining a second output based on a hash of the concatenated input seed and the second constant;

determining a key based on at least a portion of the first output, the key for determining a random number; and

determining a counter variable based on a portion of the second output, the counter variable for determining a random number.

5,452,358

Method and apparatus for improving the security of an electronic codebook encryption scheme utilizing a data dependent encryption function

Apple Computer, Inc.Normile; James O. | Chu; Ke-Chiang 380 H04L 19940208 0 100%

Abstract: An apparatus and method for improving the security of an electronic codebook encryption scheme comprises atransmitter unit for encoding or encrypting data and a separate authorized receiver for decoding or decrypting data. Both thetransmitter and receiver share a common secret key that has been communicated through a separate channel. The transmitterincludes a Mapping Table (MTable) that comprises a table of functions, where a first series of incrementally numberedexpressions are equated with a second series of randomly generated numbers. The plaintext is input into the transmitter andapplied to the MTable to provide ciphertext. The PN generator supplies a unique random sequence of binary digits. Theciphertext byte and random number byte associated with each byte of plaintext data are exchanged to change the relationshipswithin the MTable. An Inverse Mapping Table (IMTable) is included in the receiver and is created by reversing the relationshipsbetween the sequential numbers and the mapping numbers in the MTable. From the encrypted communication, the ciphertext isseparated and the respective functions for each ciphertext byte and random number byte are again exchanged, and theassociated plaintext byte and random number byte are further exchanged to produce an MTable identical to that of thetransmitter and unencrypted plaintext data identical to that originally encoded. MainClaim: An apparatus for the communication of encrypted data, the apparatus comprising a transmitter for encodingplaintext data, the transmitter comprising:

a first Pseudorandom Number (PN) generator for generating and outputting a first Pseudorandom Number (PN) sequence; and

a Mapping Table (MTable) comprising a plurality of storage positions, the MTable having inputs for receiving plaintext data andthe first PN sequence and an output for communicating encrypted ciphertext, the ciphertext being produced by the datadependent mapping of plaintext data.

7,007,050



708 G06F 20010517 6 94%









www.patentics.com






5,345,508 Method and apparatus for variable-overhead cached encryption


Lynn; Kerry E. | Zweig; Jonathan M. | Mincher; Richard W.

380 H04L 19930823 0 100%

Abstract: A digital encryption structure allows the varying of the computational overhead by selectively reusing, according tothe desired level of security, a pseudorandom encoding sequence at the transmitter end and by storing and reusingpseudorandom decoding sequences, associated with one or more transmitters at the receiver end. A public initialization vector iscombined with a secret key to produce a deterministic sequence from a pseudorandom number generator. This pseudorandomsequence in turn, is used to convert plaintext to ciphertext. The sequence may be selectively reused by storing the sequence toa transmitter memory cache and iteratively reading the sequence from memory according to a counter which controls the levelof security of the encryption system. The ciphertext is decrypted on the receiver end by invertibly combining the ciphertext withthe same pseudorandom sequence used by the transmitter to originally encode the plaintext. The pseudorandom sequence isindependently generated by the receiver end using the original key and initialization vector used in the transmitter end. Oncegenerated in the receiver, the pseudorandom sequence is stored in a receiver cache for reuse with each iterative use of thestored transmitter pseudorandom sequence. MainClaim: An apparatus for variable-overhead cached encryption and decryption comprising:

(i) a transmitter for encrypting plaintext data, the transmitter further comprising:

a first memory for storing at least one Pseudorandom Number (PN) sequence and for outputting a selected PN sequence;

an encoder which receives the selected PN sequence from the first memory as a first input and receives the plaintext data as asecond input, and responsive to these first and second inputs produces the encrypted data;

(ii) a receiver for decrypting encrypted data, the receiver comprising:

a second memory for storing at least one Pseudorandom Number (PN) sequence;

a receiver PN generator which generates and provides as an output the same selected PN sequence which is received by theencoder;

a control signal responsive to the contents of the second memory which indicates whether the selected PN sequence is stored inthe second memory;

switching means having a first sequence input coupled to the output of the second memory and a second sequence inputcoupled to the output of the receiver PN generator, for outputting one of the sequence inputs responsive to the indication of thecontrol signal; and

a decoder which receives the output of the switching means as a first input and receives the encrypted data as a second input,and combines these first and second inputs to produce decrypted data.

7,007,050


Nokia CorporationSaarinen; Markku-Juhani 708 G06F 20010517 6 95%







www.patentics.com








5,438,622

Method and apparatus for improving the security of an electronic codebook encryption scheme utilizing an offset in the pseudorandom sequence

Apple Computer, Inc. Normile; James O. | Chu; Ke-Chiang

380 H04L 19940121 0 100%

Abstract: A method and apparatus for improving the security of an electronic codebook encryption scheme comprises atransmitter unit for encoding or encrypting data and a separate authorized receiver for decoding or decrypting the data. Duringthe encryption of the plaintext data, a randomly generated offset is introduced into the PN sequence to vary the starting point ofthe PN sequence as it is applied to the plaintext data. The offset is encrypted with the secret key and the unencrypted IV,encrypted offset, and ciphertext are exported by the transmitter to the receiver for decrypting. The encoded communication isimported by the receiver and the encrypted offset portion is extracted. The receiver combines the encrypted offset with thesecret key to decipher the offset value. The offset and PN sequence are then combined with the ciphertext, using an XOR gate,to recover the original plain text from the ciphertext. In an alternative embodiment, the encoding PN sequence is composed ofmultiple, non-contiguous random sequence segments comprising a two-dimensional array. An incremental IV ID is generated for each IV issued in the creation of a segment. Each random sequence segment is identifiable by its IV ID. The starting point atwhich the random sequence segments are applied to a string of plaintext data is deferred from the beginning of the first randomsequence segment in accordance with a composite offset. MainClaim: An apparatus for the communication of encrypted data, the apparatus comprising a transmitter which furthercomprises:

a first Pseudorandom Number (PN) generator for generating a first sequence of pseudorandom numbers;

an offset generator which operates to select a subset of the first sequence of pseudorandom numbers; and

an encoder comprising a first input for receiving the subset of the first sequence of pseudorandom numbers and a second inputfor receiving an original sequence of plaintext data, in which the encoder combines the subset of the first sequence ofpseudorandom numbers and the sequence of plaintext data to produce an encrypted data output.

7,007,050



708 G06F 20010517 6 93%











www.patentics.com




6,587,563 Cryptographic system using chaotic dynamics Apple Computer, Inc.

Crandall; Richard Eugene 380 H04L 19970215 0 100%

Abstract: The invention is a cryptographic system using chaotic dynamics. A set of initial conditions is generated from theprivate key and becomes input to the chaotic system. The chaotic system generates a set of final conditions from which thepublic key is derived. The public key is distributed to the public. The public key can be used to encrypt a message that is thendecrypted using the private key. An adjustable back door of the invention derived from a set of interim conditions can be used inconjunction with the public key to derive the private key. The degree of difficulty involved in deriving the private key isdependent on the adjustable back door. That is the value of the back door can be adjusted to vary the difficulty involved inderiving the private key. In one embodiment of the invention, the chaotic system is based on the "N-body" problem to provide cryptographic security. MainClaim: A method of generating a key in a cryptosystem comprising the steps of:

generating a private key;

deriving a set of initial conditions using said private key;

applying said set of initial conditions as input to an N body chaotic system;

said N body chaotic system generating a set of final conditions from said set of initial conditions; and

generating a hash key from said set of final conditions.

7,007,050



708 G06F 20010517 6 93%













2004/0236695 Authentication of data Nokia CorporationYang, Fan | Koskivirta, Tero | Knuutila, Timo

705 H04K 20030814 1 92%

Abstract: A method and apparatus for authentication of data includes inputting of data into a first layer of a hashing functionfor rotation based hashing, then inputting results from the first layer to a second layer of the hashing function for substitutionbased hashing. Feedback is provided from the second layer to the first layer and digests are output from the first and secondlayers. MainClaim: A method for authentication of data, the method comprising: inputting data into a first layer of a hashing functionfor rotation based hashing; inputting results from the first layer to a second layer of the hashing function for substitution basedhashing; providing feedback from the second layer to the first layer; and outputting digests from the first and second layers.

Method and apparatus for authentication of Nokia Siemens Yang; Fan |

www.patentics.com


7,702,097 data using different hash functions and feedback

Networks Oy Koskivirta; Tero | Knuutila; Timo

380 H04K 20030814 1 92%

Abstract: A method and apparatus for authentication of data includes inputting of data into a first layer of a hashing functionfor rotation based hashing, then inputting results from the first layer to a second layer of the hashing function for substitutionbased hashing. Feedback is provided from the second layer to the first layer and digests are output from the first and secondlayers. MainClaim: A method for outputting digests from a sender to a receiver for data authentication, the method comprising:inputting, by a processor, data into a first layer of a hashing function for rotation based hashing; inputting, by the processor,results from the first layer to a second layer of the hashing function for substitution based hashing; providing, by the processor,feedback from the second layer to the first layer; and outputting, by the processor, digests, corresponding to the data, directlyfrom the first layer to the receiver and directly from the second layer to the receiver for data authentication.

6,374,217

Fast update implementation for efficient latent semantic language modeling

Apple Computer, Inc.Bellegarda; Jerome R. 704 G10L 19990312 0 100%

Abstract: Speech or acoustic signals are processed directly using a hybrid stochastic language model produced by integrating alatent semantic analysis language model into an n-gram probability language model. The latent semantic analysis languagemodel probability is computed using a first pseudo-document vector that is derived from a second pseudo-document vector with the pseudo-document vectors representing pseudo-documents created from the signals received at different times. The firstpseudo-document vector is derived from the second pseudo-document vector by updating the second pseudo-document vector directly in latent semantic analysis space in response to at least one addition of a candidate word of the received speech signalsto the pseudo-document represented by the second pseudo-document vector. Updating precludes mapping a sparse representation for a pseudo-document into the latent semantic space to produce the first pseudo-document vector. A linguistic message representative of the received speech signals is generated. MainClaim: A method for performing speech recognition comprising:

receiving speech signals;

processing the received speech signals directly using a language model produced by integrating a latent semantic analysislanguage model into an n-gram probability language model, wherein the latent semantic analysis language model probability iscomputed using a first pseudo-document vector derived from a second pseudo-document vector, the first and second pseudo-document vectors representing pseudo-documents created from the received speech signals at different points in time; and

generating a linguistic message representative of the received speech signals.

2006/0064177

System and method for measuring confusion among words in an adaptive speech recognition system

Nokia CorporationTian; Jilei | Sivadas; Sunil | Lahti; Tommi

700 G05B 20050609 21 98%

Abstract: A system and method are proposed for measuring confusability or similarity between given entry pairs, including textstring pairs and acoustic model pairs, in systems such as speech recognition and synthesis systems. A string edit distance(Levenshiten distance) can be applied to measure distance between any pair of text strings. It also can be used to calculate aconfusion measurement between acoustic model pairs of different words and a model-driven method can be used to calculate a HMM model confusion matrix. This model-based approach can be efficiently calculated with low memory and low computationalresources. Thus it can improve the speech recognition performance and models trained from text corpus. MainClaim: A method of measuring confusion between word sequences in a word sequence recognition system, comprising:having a new word sequence entered into an electronic device; creating a new transcription of the new word sequence using apronunciation-modeling system; computing a distance between the new transcription and at least one prior transcription of aprior word sequence stored in a database if such a prior transcription exists; and if the computed distance is less than apredefined threshold, informing a user of a potential confusion between the new word sequence and the prior word sequence.

7,319,960 Speech recognition method and system

Nokia CorporationRiis; Soren | Koumpis; Konstantinos

704 G10L 20011219 8 96%

Abstract: A speech recognition system uses a phoneme counter to determine the length of a word to be recognized. The resultis used to split a lexicon into one or more sub-lexicons containing only words which have the same or similar length to that ofthe word to be recognized, so restricting the search space significantly. In another aspect, a phoneme counter is used toestimate the number of phonemes in a word so that a transition bias can be calculated. This bias is applied to the transitionprobabilities between phoneme models in an HNN based recognizer to improve recognition performance for relatively short orlong words. MainClaim: A speech recognition system in which a word to be recognized is represented as a sequence of phonetic segmentmodels in which a transition probability represents the probability of the occurrence of a transition between the models,comprising: means for estimating the number of phonetic segments in the word to be recognized; and means for biasing thetransition probabilities in dependence on the estimated number of phonetic segments in the word.

2007/0078653 Language model compression Nokia Corporation Olsen; Jesper 704 G10L 20051003 10 95%

Abstract: A method for compressing a language model that comprises a plurality of N-grams and associated N-gram probabilities. The method comprises forming at least one group of N-grams from the plurality of N-grams; sorting N-gram probabilities associated with the N-grams of the at least one group of N-grams; and determining a compressed representation of the sorted N-gram probabilities. The at least one group of N-grams may be formed from N-grams of the plurality of N-grams that are conditioned on the same (N-1)-tuple of preceding words. The compressed representation of the sorted N-gram probabilities may be a sampled representation of the sorted N-gram probabilities or may comprise an index into a codebook. Theinvention further relates to an according computer program product and device, to a storage medium for at least partiallystoring a language model, and to a device for processing data at least partially based on a language model. MainClaim: A method for compressing a language model that comprises a plurality of N-grams and associated N-gram probabilities, said method comprising: forming at least one group of N-grams from said plurality of N-grams; sorting N-gram probabilities associated with said N-grams of said at least one group of N-grams; and determining a compressed representation

www.patentics.com


of said sorted N-gram probabilities.

6,778,952

Method for dynamic context scope selection in hybrid N-gram+LSA language modeling

Apple Computer, Inc. Bellegarda; Jerome R.

704 G06F 20020912 0 100%

Abstract: A method and system for dynamic language modeling of a document are described. In one embodiment, a number oflocal probabilities of a current document are computed and a vector representation of the current document in a latent semanticanalysis (LSA) space is determined. In addition, a number of global probabilities based upon the vector representation of thecurrent document in an LSA space is computed. Further, the local probabilities and the global probabilities are combined toproduce the language modeling. MainClaim: A method comprising:

computing a plurality of global probabilities of an input word based on a context having a dynamic scope determined bydiscounting words observed prior to the input word according to an exponential function, the context represented by a vector ina latent semantic analysis (LSA) space, wherein the vector representation is generated from at least one decomposition matrixof a singular value decomposition of a co-occurrence matrix, W, between M words in a vocabulary V and N documents in a textcorpus T and wherein the vector representation vq at time q is defined as ##EQU6##

where nq is the number of words observed up to time q, np is the number of words observed up to time p, ip is the index of the

word observed at time p, εip is the normalized entropy of the word observed at time p within T, 0<λ≤1, ui

p is the left singular

vector at time p of the singular value decomposition of W, and S is the diagonal matrix of singular values of the singular valuedecomposition of W;

computing a plurality of local probabilities of the input word; and

combining the local probabilities and the global probabilities to produce a language model probability for the input word.

2006/0064177



700 G05B 20050609 21 97%



Abstract: A method for compressing a language model that comprises a plurality of N-grams and associated N-gram probabilities. The method comprises forming at least one group of N-grams from the plurality of N-grams; sorting N-gram probabilities associated with the N-grams of the at least one group of N-grams; and determining a compressed representation of the sorted N-gram probabilities. The at least one group of N-grams may be formed from N-grams of the plurality of N-grams that are conditioned on the same (N-1)-tuple of preceding words. The compressed representation of the sorted N-gram probabilities may be a sampled representation of the sorted N-gram probabilities or may comprise an index into a codebook. Theinvention further relates to an according computer program product and device, to a storage medium for at least partiallystoring a language model, and to a device for processing data at least partially based on a language model. MainClaim: A method for compressing a language model that comprises a plurality of N-grams and associated N-gram probabilities, said method comprising: forming at least one group of N-grams from said plurality of N-grams; sorting N-gram probabilities associated with said N-grams of said at least one group of N-grams; and determining a compressed representation of said sorted N-gram probabilities.

2006/0074924

Optimization of text-based training set selection for language processing modules

Nokia Corporation Tilei; Jian | Nurminen; Jani K.

707 G06F 20040917 11 96%

Abstract: A device and a method provide for selection of a database from a corpus using an, optimization function. The methodincludes defining a size of a database, calculating a distance using a distance function for each pair in a set of pairs, andexecuting an optimization function using the distance to select each entry saved in the database until the number of savedentries equals the size of the database. Each pair in the set of pairs includes either two entries selected from a corpus or oneentry selected from a set of previously selected entries and another entry selected from a set of a remaining portion of thecorpus. The distance function may be a Levenshtein distance function or a generalized Levenshtein distance function. MainClaim: A method of selecting a database from a corpus, the method comprising: defining a size of a database; calculatinga coefficient for at least one pair in a set of pairs; and executing a function to select each entry to be saved in the database untila number of entries of the database equals the size of the database.

7,191,118

Method for dynamic context scope selection in hybrid N-gram+LSA language modeling

Apple, Inc.Bellegarda; Jerome R. 704 G06F 20040812 0 100%

Abstract: A method and system for dynamic language modeling of a document are described. In one embodiment, a number of

www.patentics.com


local probabilities of a current document are computed and a vector representation of the current document in a latent semanticanalysis (LSA) space is determined. In addition, a number of global probabilities based upon the vector representation of thecurrent document in an LSA space is computed. Further, the local probabilities and the global probabilities are combined toproduce the language modeling. MainClaim: A method of dynamic language modeling of a document comprising: computing a plurality of local probabilities of acurrent document; determining a vector representation of the current document in a latent semantic analysis (LSA) space,wherein the current document has a dynamic scope determined by discounting previously observed words according to anexponential function; computing a plurality of global probabilities based upon the vector representation of the current documentin an LSA space; and combining the local probabilities and the global probabilities to produce the language modeling.

2006/0064177



700 G05B 20050609 21 97%


2007/0078653 Language model compression

Nokia Corporation Olsen; Jesper 704 G10L 20051003 10 96%


2006/0074924



707 G06F 20040917 11 96%


7,149,695

Method and apparatus for speech recognition using semantic inference and word agglomeration

Apple Computer, Inc.Bellegarda; Jerome R. 704 G10L 20001013 0 100%

Abstract: A method and apparatus for command recognition using semantic inference and word agglomeration is describedherein. According to one aspect of the present invention, a method for recognizing a voice command comprises recognizing asequence of words received as the voice command. The sequence of words is further agglomerated into a sequence of word n-tuples. Semantic inference is applied to the sequence of word n-tuples to recognize the voice command. MainClaim: A method for recognizing speech, the method comprising: recognizing a sequence of words; processing thesequence of words using word agglomeration that replaces the sequence of words with an associated n-tuple sequence, the n-tuple sequence comprising word n-tuples that are all strings of n consecutive words in the sequence of words, wherein the n-tuple sequence is represented by a vector representation in a semantic space; and classifying the processed sequence of wordsas a predetermined command based on the vector representation of the n-tuple sequence in the semantic space.

2006/0064177



700 G05B 20050609 21 97%

Abstract: A system and method are proposed for measuring confusability or similarity between given entry pairs, including textstring pairs and acoustic model pairs, in systems such as speech recognition and synthesis systems. A string edit distance(Levenshiten distance) can be applied to measure distance between any pair of text strings. It also can be used to calculate aconfusion measurement between acoustic model pairs of different words and a model-driven method can be used to calculate a HMM model confusion matrix. This model-based approach can be efficiently calculated with low memory and low computationalresources. Thus it can improve the speech recognition performance and models trained from text corpus. MainClaim: A method of measuring confusion between word sequences in a word sequence recognition system, comprising:

www.patentics.com


having a new word sequence entered into an electronic device; creating a new transcription of the new word sequence using apronunciation-modeling system; computing a distance between the new transcription and at least one prior transcription of aprior word sequence stored in a database if such a prior transcription exists; and if the computed distance is less than apredefined threshold, informing a user of a potential confusion between the new word sequence and the prior word sequence.

2006/0074924



707 G06F 20040917 11 96%


2005/0267755 Arrangement for speech recognition Nokia Corporation Suontausta, Janne 704 G10L 20040527 15 96%

Abstract: A speech recognizer comprises a random access memory, a downloader for loading decision trees from a set ofdecision trees into said random access memory, a vocabulary comprising one or more words of a language, a divider for dividingat least one word of the vocabulary into subwords, and a transcription generator adapted to process at least one subword. Thedownloader is adapted to download a subset of the set of decision trees at a time into said random access memory. Thetranscription generator is further adapted to generate at least one phoneme transcription for the subword using the subset ofdecision trees. The speech recognizer also comprises a combiner for combining the generated phoneme transcriptions of thesubwords to obtain phoneme transcriptions of said one or more words. The invention also relates to a device, a system, amodule, a method, a computer program product and a data structure. MainClaim: A speech recognizer comprising: a random access memory; a downloader for loading decision trees from a set ofdecision trees into said random access memory; a vocabulary comprising one or more words of a language; a divider fordividing at least one word of said vocabulary into subwords; a transcription generator adapted to process at least one subword,wherein the downloader is adapted to download a subset of the set of decision trees at a time into said random access memory,and the transcription generator is further adapted to generate at least one phoneme transcription for said subword using saidsubset of the decision trees; and a combiner for combining generated phoneme transcriptions of the subwords to obtainphoneme transcriptions of said one or more words.

6,477,488

Method for dynamic context scope selection in hybrid n-gram+LSA language modeling


704 G06F 20000310 0 100%

Abstract: A method and system for dynamic language modeling of a document are described. In one embodiment, a number oflocal probabilities of a current document are computed and a vector representation of the current document in a latent semanticanalysis (LSA) space is determined. In addition, a number of global probabilities based upon the vector representation of thecurrent document in an LSA space is computed. Further, the local probabilities and the global probabilities are combined toproduce the language modeling. MainClaim: A method of dynamic language modeling of a document comprising:

computing a plurality of local probabilities of a current document;

determining a vector representation of the current document in a latent semantic analysis (LSA) space, wherein the vectorrepresentation of the current document in an LSA space is based upon a plurality of temporally ordered words and is generatedfrom at least one decomposition matrix of a singular value decomposition of a co-occurrence matrix, W, between M words in a vocabulary V and N documents in a text corpus T;

computing a plurality of global probabilities based upon the vector representation of the current document in an LSA space; and

combining the local probabilities and the global probabilities to produce the language modeling.

2006/0064177



700 G05B 20050609 21 97%



Abstract: A method for compressing a language model that comprises a plurality of N-grams and associated N-gram probabilities. The method comprises forming at least one group of N-grams from the plurality of N-grams; sorting N-gram

www.patentics.com


probabilities associated with the N-grams of the at least one group of N-grams; and determining a compressed representation of the sorted N-gram probabilities. The at least one group of N-grams may be formed from N-grams of the plurality of N-grams that are conditioned on the same (N-1)-tuple of preceding words. The compressed representation of the sorted N-gram probabilities may be a sampled representation of the sorted N-gram probabilities or may comprise an index into a codebook. Theinvention further relates to an according computer program product and device, to a storage medium for at least partiallystoring a language model, and to a device for processing data at least partially based on a language model. MainClaim: A method for compressing a language model that comprises a plurality of N-grams and associated N-gram probabilities, said method comprising: forming at least one group of N-grams from said plurality of N-grams; sorting N-gram probabilities associated with said N-grams of said at least one group of N-grams; and determining a compressed representation of said sorted N-gram probabilities.

2006/0074924


Nokia CorporationTilei; Jian | Nurminen; Jani K. 707 G06F 20040917 11 96%


7,289,950 Extended finite state grammar for speech recognition systems

Apple Inc.Bellegarda; Jerome R. | Silverman; Kim E. A.

704 G06F 20040921 0 100%

Abstract: An extended finite state grammar structure is generated from a finite state grammar. The extended finite stategrammar structure includes word subgraphs representing a set of pre-defined word strings for words in the finite state grammar, and a set of all possible word strings for the words. The extended finite state grammar structure can be used totransform audio input into one or more of the word strings. MainClaim: A computerized method comprising: generating an extended finite state grammar structure comprising a first wordsub-graph representing a set of pre-defined word strings for words in a finite state grammar, and a second word sub-graph representing a set of all possible word strings for the words in the finite state grammar, wherein the extended finite stategrammar structure is subsequently used to transform audio input into at least one of the word strings.

2006/0064177



700 G05B 20050609 21 96%


2006/0074669 Speech grammars having priority levels Nokia Corporation Seppala; Esa H. 704 G10L 20040923 10 95%

Abstract: In a speech recognition environment where time constraint limits the use of stored grammars in matching with aspeech, the phonemes converted words are built into a number of trees of different priority levels so that the number of thetrees combined into a concatenated tree for speech recognition is based at least partly on the time constraint. The trees of alower priority level are used only when the time constraint allows such use and the trees of a higher priority level are used atleast partly prior to the trees of a lower priority level being used. MainClaim: A method of organizing grammars for use in an electronic device, the grammars having grammar items organizedinto trees of ordered branches, said method comprising: ranking at least a part of the grammar items according to a grammarrule; sorting at least part of the grammar items into grammar groups of different priority levels based at least partly on theranking; and building at least one tree separately for the grammar groups.

2006/0293889 Error correction for speech recognition systems

Nokia CorporationKiss; Imre | Leppanen; Jussi Artturi

704 G10L 20050627 3 94%

Abstract: Words in a sequence of words that is obtained from speech recognition of an input speech sequence are presented toa user, and at least one of the words in the sequence of words is replaced, in case it has been selected by a user for correction.Words with a low recognition confidence value are emphasized; alternative word candidates for the at least one selected wordare ordered according to an ordering criterion; after replacing a word, an order of alternative word candidates for neighboringwords in the sequence is updated; the replacement word is derived from a spoken representation of the at least one selectedword by speech recognition with a limited vocabulary; and the word that replaces the at least one selected word is derived froma spoken and spelled representation of the at least one selected word. MainClaim: A method for correcting words in a sequence of words that is obtained from speech recognition of an input speechsequence, said method comprising: presenting said sequence of words to a user, wherein each word in said sequence of wordsis associated with a respective recognition confidence value, and wherein at least one word in said sequence of words isautomatically emphasized in dependence on its recognition confidence value; and replacing at least one word in said sequenceof words, in case it has been selected by a user for correction.

Large-vocabulary speech

www.patentics.com


5,839,106

recognition using an integrated syntactic and semantic statistical language model


704 G01L 19961217 0 100%

Abstract: Methods and apparatus for performing large-vocabulary speech recognition employing an integrated syntactic and semantic statistical language model. In an exemplary embodiment, a stochastic language model is developed using a hybridparadigm in which latent semantic analysis is combined with, and subordinated to, a conventional n-gram paradigm. The hybrid paradigm provides an estimate of the likelihood that a particular word, chosen from an underlying vocabulary will occur given aprevailing contextual history. The estimate is computed as a conditional probability that a word will occur given an "integrated"history combining an n-word, syntactic-type history with a semantic-type history based on a much larger contextual framework. Thus, the exemplary embodiment seamlessly blends local language structures with global usage patterns to provide, in a singlelanguage model, the proficiency of a short-horizon, syntactic model with the large-span effectiveness of semantic analysis. MainClaim: A speech recognition system, comprising:

a pre-processor receiving an acoustic signal and processing the acoustic signal to produce an acoustic feature sequence; and

a recognition processor receiving the acoustic feature sequence and processing the acoustic feature sequence using a multiple-span stochastic language model to form a linguistic message, wherein the multiple-span stochastic language model includes a local span providing an immediate word context and a large span providing a global word context.

2006/0064177



700 G05B 20050609 21 97%


7,043,431

Multilingual speech recognition system using text derived recognition models

Nokia CorporationRiis; So | Jensen; Ka | Pedersen; Morten With

704 G10L 20010831 6 95%

Abstract: There is provided a novel approach for generating multilingual text-to-phoneme mappings for use in multilingual speech recognition systems. The multilingual mappings are based on the weighted output from a neural network text-to-phoneme model, trained on data mixed from several languages. The multilingual mappings used together with a branchedgrammar decoding scheme is able to capture both inter- and intra-language pronunciation variations which is ideal for multilingual speaker independent recognition systems. A significant improvement in overall system performance is obtained fora multilingual speaker independent name dialing task when applying multilingual instead of language dependent text-to-phoneme mapping. MainClaim: A method of speech recognition in order to identify a speech command as a match to a written text commandcomprising the steps: providing a text input from a text database; receiving an acoustic input; generating sequences ofmultilingual phoneme symbols based on said text input by means of a multilingual text-to-phoneme module; generating variations of pronunciations which are recognizable in response to said sequences of multilingual phoneme symbols determinedby use of a branched grammar; and comparing said variations of pronunciations with the acoustic input in order to find a match.

7,319,960 Speech recognition method and system Nokia Corporation

Riis; Soren | Koumpis; Konstantinos

704 G10L 20011219 8 95%


5,737,490

Method and apparatus for constructing continuous parameter fenonic hidden markov models by replacing phonetic models with continous fenonic models


Austin; Stephen Christopher | de Souza; Peter Vincent

704 G01L 19961022 0 100%

Abstract: A method and apparatus for constructing a hidden Markov model comprised of multiple fenones characterized by theirduration and a set of acoustic properties. The present invention provides a sequence of fenones to model a speech event. Thesequence may undergo modifications to improve the overall performance of the model. MainClaim: A method of constructing a hidden Markov model of a given speech event comprising the steps of:

www.patentics.com


providing a sequence of phonetic models representing the given speech event;

creating a plurality of fenones associated with acoustic vectors, wherein each of the plurality of fenones is a hidden Markovmodel representing an acoustic event; and

creating a fenonic model for said given speech event, wherein each of the sequence of phonetic models is replaced by at leastone of the plurality of fenones, such that the fenonic model comprises a sequence of fenones.

7,505,950 Soft alignment based on a probability of time alignment

Nokia CorporationTian; Jilei | Nurminen; Jani | Popa; Victor

706 G06F 20060426 3 96%

Abstract: Systems and methods are provided for performing soft alignment in Gaussian mixture model (GMM) based and othervector transformations. Soft alignment may assign alignment probabilities to source and target feature vector pairs. The vectorpairs and associated probabilities may then be used calculate a conversion function, for example, by computing GMM trainingparameters from the joint vectors and alignment probabilities to create a voice conversion function for converting speech soundsfrom a source speaker to a target speaker. MainClaim: A method comprising: receiving a first sequence of feature vectors associated with a source speaker for processingbased on operations controlled by a processor; receiving a second sequence of feature vectors associated with a target speaker;generating a third sequence of joint feature vectors, wherein the generation of each joint feature vector is based on: a firstvector from the first sequence; a first vector from the second sequence; and a first probability value representing the probabilitythat the first vector from the first sequence and the first vector from the second sequence are time aligned to the same featurein their respective sequences; and applying the third sequence of joint feature vectors as a part of a voice conversion process.

2008/0082333 Prosody Conversion NOKIA CORPORATIONNurminen; Jani K. | Helander; Elina 704 G10L 20060929 8 96%

Abstract: A contour for a syllable (or other speech segment) in a voice undergoing conversion is transformed. The transform ofthat contour is then used to identify one or more source syllable transforms in a codebook. Information regarding the contextand/or linguistic features of the contour being converted can also be compared to similar information in the codebook whenidentifying an appropriate source transform. Once a codebook source transform is selected, an inverse transformation isperformed on a corresponding codebook target transform to yield an output contour. The corresponding codebook targettransform represents a target voice version of the same syllable represented by the selected codebook source transform. Theoutput contour may be further processed to improve conversion quality. MainClaim: A method comprising:(a) receiving data for a plurality of segments of a passage in a source voice, wherein the datafor each segment of the plurality models a prosodic component of the source voice for that segment;(b) identifying a targetvoice entry in a codebook for each of the source voice passage segments, wherein each of the identified target voice entriesmodels a prosodic component of a target voice for a different segment of codebook training material, and wherein the codebooktraining material is substantially different from the passage; and(c) generating a target voice version of the plurality of passagesegments by altering the modeled source voice prosodic component for each segment to replicate the target voice prosodiccomponent modeled by the target voice entry identified for that segment in (b).

2007/0088552 Method and a device for speech recognition


Abstract: Method for speech recognition comprising inputting frames comprising samples of an audio signal; forming a featurevector comprising a first number of vector components for each frame; projecting the feature vector onto at least two subspacesso that the number of components of each projected feature vector is less than the first number and the total number ofcomponents of the projected feature vectors is the same as the first number; defining a set of mixture models for eachprojected vector which provides the highest observation probability; analysing the set of mixture models to determine therecognition result. When the recognition result is found, the method comprises determining a confidence measure for therecognition result, the determining comprising determining a probability that the recognition result is correct; determining anormalizing term; and dividing the probability by the normalizing term. MainClaim: A method for speech recognition comprising: inputting frames comprising samples of an audio signal; forming afeature vector comprising a first number of vector components for each frame; projecting the feature vector onto at least twosubspaces so that the number of components of each projected feature vector is less than the first number and the total numberof components of the projected feature vectors is the same as the first number; defining a set of mixture models for eachprojected vector which provides the highest observation probability; analysing the set of mixture models to determine therecognition result; when the recognition result is found, determining a confidence measure for the recognition result, thedetermining comprising: determining a probability that the recognition result is correct; determining a normalizing term byselecting, for each state, one mixture model among said set of mixture models, which provides the highest likelihood; anddividing the probability by said normalizing term; wherein the method further comprises comparing the confidence measure to athreshold value to determine whether the recognition result is reliable enough.

5,706,397

Speech recognition system with multi-level pruning for acoustic matching

Apple Computer, Inc. Chow; Yen-Lu 704 G10L 19951005 0 100%

Abstract: A method of constructing a new active list of phone models from an existing active list of phone models duringacoustic matching of a speech recognition system is described. A vector quantized speech vector is compared against each ofthe phone models in the existing active list to obtain a phone best score for each of the phone models of the existing active list.A best phone best score is determined among all the phone best scores of the phone models to obtain a global best score. Aphone model of the phone models from the existing active list is added to the new active list of phone models if the phone bestscore of that phone model is within a first predetermined value of the global best score. A next phone model of the existingphone of the existing active list is added to the new active list if the phone ending score of that existing phone is within a secondpredetermined value of a best score of the existing phone model. A next (e.g. first) phone model of a next word of a particularphone model of the existing active list is added to the new active list if the ending score of that particular phone model is withina third predetermined value of the global best score. MainClaim: A method of constructing a new active list of phone models from an existing active list of phone models duringacoustic matching of a speech recognition system, comprising the steps of:

(A) comparing a speech frame against each of the phone models in the existing active list to obtain a phone best score for eachof the phone models of the existing active list;

www.patentics.com


(B) adding a next phone model of a first phone model of the phone models of the existing active list to the new active list if thephone best score of the first phone model is within a first predetermined value of a phone ending score of the first phone model.



704 G10L 20011219 8 96%


2006/0064177



700 G05B 20050609 21 96%


7,043,431



704 G10L 20010831 6 96%


6,154,722

Method and apparatus for a speech recognition system language model that integrates a finite state grammar probability and an N-gram probability


704 G10L 19971218 0 100%

Abstract: A method and an apparatus for a speech recognition system that uses a language model based on an integrated finitestate grammar probability and an n-gram probability are provided. According to one aspect of the invention, speech signals arereceived into a processor of a speech recognition system. The speech signals are processed using a speech recognition systemhosting a language model. The language model is produced by integrating a finite state grammar probability and an n-gram probability. In the integration, the n-gram probability is modified based on information provided by the finite state grammarprobability; thus, the finite state grammar probability is subordinate to the n-gram probability. The language model is used by a decoder along with at least one acoustic model to perform a hypothesis search on an acoustic sequence to provide a wordsequence output. The word sequence generated is representative of the received speech signals. MainClaim: A method for recognizing speech comprising: receiving speech signals into a processor; processing the received speech signals using a language model produced by integrating a finite state grammar probability andan n-gram probability with the finite state grammar probability being subordinated to the n-gram probability, wherein the language model comprises a probability that is specified by the equation ##EQU4## where, wq is the word about to be

predicted, Hq is the admissible history for this particular word, G is the probabilistic finite state grammar, Sq is the present

sentence up to wq, and V is the vocabulary to which wq belongs; and

generating a word sequence representative of the received speech signals.

2006/0064177 System and method for measuring confusion among words in an

Nokia Corporation Tian; Jilei | Sivadas; Sunil |

700 G05B 20050609 21 97%

www.patentics.com


adaptive speech recognition system

Lahti; Tommi




704 G10L 20011219 8 97%


7,043,431



704 G10L 20010831 6 96%


6,208,971

Method and apparatus for command recognition using data-driven semantic inference

Apple Computer, Inc.Bellegarda; Jerome R. | Silverman; Kim E. A.

704 G10L 19981030 0 100%

Abstract: A method and apparatus for command recognition using data-driven semantic inference includes recognizing a sequence of words received as the voice command. Data-driven semantic inference is then used with the recognized sequenceof words to recognize the voice command. Thus, the command is identified on the basis of the semantics of words of the spokencommand rather than the particular grammar of each of predetermined different ways the command could be worded. MainClaim: A method for recognizing a voice command, the method comprising:

recognizing a sequence of words received as the voice command; and

using data-driven semantic inference with the recognized sequence of words to recognize the voice command.

2006/0064177



700 G05B 20050609 21 96%


2006/0074924



707 G06F 20040917 11 95%

Abstract: A device and a method provide for selection of a database from a corpus using an, optimization function. The method

www.patentics.com


includes defining a size of a database, calculating a distance using a distance function for each pair in a set of pairs, andexecuting an optimization function using the distance to select each entry saved in the database until the number of savedentries equals the size of the database. Each pair in the set of pairs includes either two entries selected from a corpus or oneentry selected from a set of previously selected entries and another entry selected from a set of a remaining portion of thecorpus. The distance function may be a Levenshtein distance function or a generalized Levenshtein distance function. MainClaim: A method of selecting a database from a corpus, the method comprising: defining a size of a database; calculatinga coefficient for at least one pair in a set of pairs; and executing a function to select each entry to be saved in the database untila number of entries of the database equals the size of the database.

2005/0267755 Arrangement for speech recognition

Nokia Corporation Suontausta, Janne 704 G10L 20040527 15 94%


6,836,760

Use of semantic inference and context-free grammar with speech recognition system

Apple Computer, Inc.Bellegarda; Jerome R. | Silverman; Kim E. A.

704 G10L 20000929 0 100%

Abstract: A method and apparatus to use semantic inference with speech recognition systems includes recognizing at least onespoken word, processing the spoken word using a context-free grammar, deriving an output from the context-free grammar, and translating the output to a predetermined command. MainClaim: A machine-implemented method for speech recognition comprising:

recognizing at least one spoken word;

processing said spoken word using a context-free grammar;

deriving an output from said context-free grammar; and

translating said output into a predetermined command, wherein said translating comprises semantically inferring saidpredetermined command from said output.



2006/0064177



700 G05B 20050609 21 96%


www.patentics.com


2006/0074669 Speech grammars having priority levels

Nokia Corporation Seppala; Esa H. 704 G10L 20040923 10 95%


5,680,510

System and method for generating and using context dependent sub-syllable models to recognize a tonal language

Apple Computer, Inc.Hon; Hsiao-Wuen | Yuan; Bao-Sheng 704 G10L 19950126 0 100%

Abstract: A speech recognition system for Mandarin Chinese comprises a preprocessor, HMM storage, speech identifier, andspeech determinator. The speech identifier includes pseudo initials for representing glottal stops that precede syllables of lonefinals. The HMM storage stores context dependent models of the initials, finals, and pseudo initials that make the syllables ofMandarin Chinese speech. The models may be dependent on associated initials or finals and on the tone of the syllable. Thespeech determinator joins the initials and finals and pseudo initials and finals according to the syllables of the speech identifier.The speech determinator then compares input signals of syllables to the joined models to determine the phonetic structure ofthe syllable and the tone of the syllable. The system also includes a smoother for smoothing models to make recognitions morerobust. The smoother comprises an LDM generator and a detailed model modifier. The LDM generator generates less detailedmodels from the detailed models, and the detailed model modifier smoothes the models with the less detailed models. A methodfor recognizing Mandarin Chinese speech includes the steps of arranging context dependent, sub-syllable models; comparing an input signal to the arranged models; and selecting the arrangement of models that best matches the input signal to recognizethe phonetic structure and tone of the input signal. MainClaim: A speech recognition system for recognizing syllables of a language, the syllables of the language each beingformed from an initial sub-syllable and a final sub-syllable, the speech recognition system comprising:

a speech identifier for storing a plurality of valid combinations of initial sub-syllables and final sub-syllables;

a storage device for storing a plurality of initial sub-syllable models and final sub-syllable models; and

a speech determinator for receiving:

an input signal to be recognized via a first input;

the plurality of valid combinations from the speech identifier via a second input; and

the plurality of models from the storage device via a third input;

wherein, after the speech determinator receives the input signal, the plurality of valid combinations and the plurality of models,the speech determinator creates appended models from the received plurality of models according to the received plurality ofvalid combinations, each appended model comprising a final sub-syllable model appended to the end of an initial sub-syllable model, compares the input signal to each appended model, and then generates and outputs a signal indicating one of theappended models that most closely matches the input signal.

2008/0082333 Prosody Conversion NOKIA CORPORATION Nurminen; Jani K. | Helander; Elina

704 G10L 20060929 8 95%




704 G10L 20011219 8 95%

Abstract: A speech recognition system uses a phoneme counter to determine the length of a word to be recognized. The resultis used to split a lexicon into one or more sub-lexicons containing only words which have the same or similar length to that ofthe word to be recognized, so restricting the search space significantly. In another aspect, a phoneme counter is used toestimate the number of phonemes in a word so that a transition bias can be calculated. This bias is applied to the transitionprobabilities between phoneme models in an HNN based recognizer to improve recognition performance for relatively short orlong words. MainClaim: A speech recognition system in which a word to be recognized is represented as a sequence of phonetic segment

www.patentics.com


models in which a transition probability represents the probability of the occurrence of a transition between the models,comprising: means for estimating the number of phonetic segments in the word to be recognized; and means for biasing thetransition probabilities in dependence on the estimated number of phonetic segments in the word.

2006/0064177



700 G05B 20050609 21 95%


7,702,509 Unsupervised data-driven pronunciation modeling

Apple Inc. Bellegarda; Jerome R.

704 G10L 20061121 0 100%

Abstract: Pronunciation for an input word is modeled by generating a set of candidate phoneme strings having pronunciationsclose to the input word in an orthographic space. Phoneme sub-strings in the set are selected as the pronunciation. In one aspect, a first closeness measure between phoneme strings for words chosen from a dictionary and contexts within the inputword is used to determine the candidate phoneme strings. The words are chosen from the dictionary based on a secondcloseness measure between a representation of the input word in the orthographic space and orthographic anchorscorresponding to the words in the dictionary. In another aspect, the phoneme sub-strings are selected by aligning the candidate phoneme strings on common phoneme sub-strings to produce an occurrence count, which is used to choose the phoneme sub-strings for the pronunciation. MainClaim: A computerized method comprising: receiving pronunciation data for an out-of-vocabulary word, the pronunciation data comprising phoneme sub-strings selected from candidate phoneme strings having pronunciation data associated with orthographic anchors that are close to a vector representation of the out-of-vocabulary word in an orthographical vector space defined by a dictionary; and reproducing the pronunciation data for the out-of-vocabulary word as an audible signal.

2007/0073541 Method for compressing dictionary data

Nokia Corporation Tian; Jilei 704 G10L 20061129 5 93%

Abstract: The invention relates to pre-processing of a pronunciation dictionary for compression in a data processing device, the pronunciation dictionary comprising at least one entry, the entry comprising a sequence of character units and a sequence ofphoneme units. According to one aspect of the invention the sequence of character units and the sequence of phoneme units arealigned using a statistical algorithm. The aligned sequence of character units and aligned sequence of phoneme units areinterleaved by inserting each phoneme unit at a predetermined location relative to the corresponding character unit. MainClaim: An electronic device comprising a processing unit and a memory for storing a pre-processed pronunciation dictionary including a first set of units having character units and a second set of units having phoneme units, the units of thefirst set and the units of the second set being aligned and interleaved by having each phoneme unit at a predetermined locationrelative to the corresponding character unit, wherein the electronic device is configured to find a matching entry for a text stringinput from the pre-processed pronunciation dictionary using said first set of units of the entry from the predetermined locations; the electronic device is configured to select from said matching entry phoneme units of said second set of units frompredetermined locations; and the electronic device is configured to concatenate the selected phoneme units into a sequence ofphoneme units.



704 G10L 20020913 0 100%

Abstract: Pronunciation for an input word is modeled by generating a set of candidate phoneme strings having pronunciationsclose to the input word in an orthographic space. Phoneme sub-strings in the set are selected as the pronunciation. In one aspect, a first closeness measure between phoneme strings for words chosen from a dictionary and contexts within the inputword is used to determine the candidate phoneme strings. The words are chosen from the dictionary based on a secondcloseness measure between a representation of the input word in the orthographic space and orthographic anchorscorresponding to the words in the dictionary. In another aspect, the phoneme sub-strings are selected by aligning the candidate phoneme strings on common phoneme sub-strings to produce an occurrence count, which is used to choose the phoneme sub-strings for the pronunciation. MainClaim: A computerized method comprising: generating a set of candidate phoneme strings having pronunciations close toan input word in an orthographic space based on a first closeness measure between phoneme strings for words chosen from adictionary and contexts within the input word, the choice of words from the dictionary based on a second closeness measurebetween a representation of the input word in the orthographic space and orthographic anchors corresponding to the words inthe dictionary; and selecting phoneme sub-strings from the set as a pronunciation for the input word.

2006/0074924



707 G06F 20040917 11 97%

Abstract: A device and a method provide for selection of a database from a corpus using an, optimization function. The methodincludes defining a size of a database, calculating a distance using a distance function for each pair in a set of pairs, andexecuting an optimization function using the distance to select each entry saved in the database until the number of savedentries equals the size of the database. Each pair in the set of pairs includes either two entries selected from a corpus or oneentry selected from a set of previously selected entries and another entry selected from a set of a remaining portion of thecorpus. The distance function may be a Levenshtein distance function or a generalized Levenshtein distance function. MainClaim: A method of selecting a database from a corpus, the method comprising: defining a size of a database; calculatinga coefficient for at least one pair in a set of pairs; and executing a function to select each entry to be saved in the database until

www.patentics.com


a number of entries of the database equals the size of the database.

2006/0064177



700 G05B 20050609 21 96%




7,313,523

Method and apparatus for assigning word prominence to new or previous information in speech synthesis

Apple Inc.Bellegarda; Jerome R. | Silverman; Kim E. A.

704 G10L 20030514 0 100%

Abstract: A method and apparatus is provided for generating speech that sounds more natural. In one embodiment, wordprominence and latent semantic analysis are used to generate more natural sounding speech. A method for generating speechthat sounds more natural may comprise generating synthesized speech having certain word prominence characteristics andapplying a semantically-driven word prominence assignment model to specify word prominence consistent with the way humans assign word prominence. A speech representative of a current sentence is generated. The determination is made whetherinformation in the current sentence is new or previously given in accordance with a semantic relationship between the currentsentence and a number of preceding sentences. A word prominence is assigned to a word in the current sentence in accordancewith the information determination. MainClaim: An apparatus for assigning word prominence in synthetic speech comprising: a memory having stored thereon a setof instructions; and a processing device coupled with the memory, the processing device, when executing the set of instructions,to generate a speech representative of a current sentence, determine whether an information in the current sentence is new orpreviously given based on a semantic relationship between the current sentence and a number of preceding sentences, andassign a word prominence to a word in the current sentence in accordance with the information determination.

2006/0064177



700 G05B 20050609 21 95%


2009/0157385 Inverse Text Normalization

Nokia Corporation Tian; Jilei 704 G06F 20071214 14 94%

Abstract: Embodiments are directed to efficient multilingual inverse text normalization (ITN) of text in spoken form to producenormalized text for display. Embodiments are directed to preprocessing the multilingual text into a language-independent representation, tokenizing text in spoken form, segmenting the tokenized text into ITN items by grouping consecutive wordsusing an ITN lexicon, classifying the ITN items into ITN categories by using the ITN lexicon or tagged information from languagemodel, applying one or more ITN rules that are selected based on the ITN categories into which ITN items have been classifiedto rewrite the ITN items; and post processing the ITN item and outputting inversely normalized text in written form for display.The ITN lexicon may include ITN lexicon entries that are each located within an ITN category in the ITN lexicon. MainClaim: A method comprising:segmenting text in spoken form into inverse text normalization items by groupingconsecutive words using an inverse text normalization lexicon;classifying the inverse text normalization items into inverse textnormalization categories by using the inverse text normalization lexicon;applying one or more inverse text normalization rules

www.patentics.com


that are selected based on the inverse text normalization categories into which inverse text normalization items have beenclassified to rewrite the inverse text normalization items; andpost processing the inverse text normalization item and outputtinginversely normalized text in written form for display.






704 G10L 20021122 0 100%

Abstract: Pronunciation for an input word is modeled by generating a set of candidate phoneme strings having pronunciationsclose to the input word in an orthographic space. Phoneme sub-strings in the set are selected as the pronunciation. In one aspect, a first closeness measure between phoneme strings for words chosen from a dictionary and contexts within the inputword is used to determine the candidate phoneme strings. The words are chosen from the dictionary based on a secondcloseness measure between a representation of the input word in the orthographic space and orthographic anchorscorresponding to the words in the dictionary. In another aspect, the phoneme sub-strings are selected by aligning the candidate phoneme strings on common phoneme sub-strings to produce an occurrence count, which is used to choose the phoneme sub-strings for the pronunciation. MainClaim: A computerized method comprising: receiving, by a client from a server, an orthographic space; generating a set ofcandidate phoneme strings having pronunciations close to an input word in the orthographic space; and selecting phoneme sub-strings from the set as a pronunciation for the input word.

2006/0074924



707 G06F 20040917 11 96%


2006/0064177



700 G05B 20050609 21 96%





www.patentics.com


7,353,164 Representation of orthography in a continuous vector space

Apple Inc.Bellegarda; Jerome R. 704 G06F 20020913 0 100%

Abstract: An orthographic anchor for each word in a dictionary is created in an orthographic space by mapping the words and aset of letter patterns characteristic of the words into the orthographic space. In one aspect the orthographic anchors are row orcolumn vectors resulting from a decomposition of a matrix of feature vectors created by the mapping. In another aspect, apronunciation for an input word is modeled based on a set of candidate phoneme strings that have pronunciations close to theinput word in the orthographic space. MainClaim: A computerized method comprising: mapping words in a dictionary and a set of letter patterns that arecharacteristic of the words into an orthographic space to create orthographic anchors, each orthographic anchor correspondingto a word in the dictionary, wherein the mapping comprises: creating a matrix of feature vectors from the letter patterns andthe words; decomposing the matrix into row vectors and column vectors; and selecting vectors from one of the row vectors andcolumn vectors as the orthographic anchors.

2006/0074924




2006/0064177



700 G05B 20050609 21 95%





5,884,261 Method and apparatus for tone-sensitive acoustic modeling

Apple Computer, inc.

de Souza; Peter V. | Fineberg; Adam B. | Hon; Hsiao-Wuen | Yuan; Baosheng

704 G10L 19940707 0 100%

Abstract: Tone-sensitive acoustic models are generated by first generating acoustic vectors which represent the input data. The input data is separated into multiple frames and an acoustic vector is generated for each frame which represents the input dataover its corresponding frame. A tone-sensitive parameter is then generated for each of the frames which indicates the tone ofthe input data at its corresponding frame. Tone-sensitive parameters are generated in accordance with two embodiments. First,a pitch detector may be used to calculate a pitch for each of the frames. If a pitch cannot be detected for a particular frame,then a pitch is created for that frame based on the pitch values of surrounding frames. Second, the cross covariance betweenthe autocorrelation coefficients for each frame and its successive frame may be generated and used as the tone-sensitive parameter. Feature vectors are then created for each frame by appending the tone-sensitive parameter for a frame to the acoustic vector for the same frame. Then, using these feature vectors, acoustic models are created which represent the inputdata. MainClaim: A method for generating a tone-dependent acoustic model comprising the steps of:

(a) generating a plurality of acoustic vectors representing a plurality of input data frames;

(b) generating a plurality of tone-sensitive parameters corresponding to said data frames;

www.patentics.com


(c) creating a plurality of feature vectors corresponding to said data frames by appending said plurality of tone-sensitive parameters to said plurality of acoustic vectors; and

(d) creating an acoustic model from said plurality of feature vectors.



706 G06F 20060426 3 97%


2007/0256189

SOFT ALIGNMENT IN GAUSSIAN MIXTURE MODEL BASED TRANSFORMATION

NOKIA CORPORATIONTian; Jilei | Nurminen; Jani | Popa; Victor

800 C12N 20060426 6 97%

Abstract: Systems and methods are provided for performing soft alignment in Gaussian mixture model (GMM) based and othervector transformations. Soft alignment may assign alignment probabilities to source and target feature vector pairs. The vectorpairs and associated probabilities may then be used calculate a conversion function, for example, by computing GMM trainingparameters from the joint vectors and alignment probabilities to create a voice conversion function for converting speech soundsfrom a source speaker to a target speaker. MainClaim: A method for time aligning a first sequence of feature vectors with a second sequence of feature vectors comprisingthe steps of: receiving a first sequence of feature vectors associated with a source; receiving a second sequence of featurevectors associated with a target; and generating a third sequence of joint feature vectors, wherein the generation of each jointfeature vector is based on: a first vector from the first sequence; a first vector from the second sequence; and a first probabilityvalue representing the probability that the first vector from the first sequence and the first vector from the second sequence arealigned to the same feature in their respective sequences.

2007/0088552 Method and a device for speech recognition Nokia Corporation Olsen; Jesper 704 G10L 20051017 9 97%


7,124,081

Method and apparatus for speech recognition using latent semantic adaptation


704 G10L 20010928 0 100%

Abstract: A method and apparatus for speech recognition using latent semantic adaptation is described herein. According toone aspect of the present invention, a method for recognizing speech comprises using latent semantic analysis (LSA) togenerate an LSA space for a collection of documents and to continually adapt the LSA space with new documents as theybecome available. Adaptation of the LSA space is optimally two-sided, taking into account the new words in the new documents. Alternatively, adaptation is one-sided, taking into account the new documents but discarding any new words appearing in thosedocuments. MainClaim: A method for generating a speech recognition database comprising: generating a latent semantic analysis (LSA)space from a training corpus of documents representative of a language, wherein the LSA space includes one or more documentvectors; receiving a new document that represents a change in the language; and adapting the LSA space to reflect the changein the language, wherein the adapting includes changing a position of the one or more document vectors in the LSA space by thechange in the language.

2006/0064177



700 G05B 20050609 21 95%

Abstract: A system and method are proposed for measuring confusability or similarity between given entry pairs, including textstring pairs and acoustic model pairs, in systems such as speech recognition and synthesis systems. A string edit distance(Levenshiten distance) can be applied to measure distance between any pair of text strings. It also can be used to calculate aconfusion measurement between acoustic model pairs of different words and a model-driven method can be used to calculate a

www.patentics.com


HMM model confusion matrix. This model-based approach can be efficiently calculated with low memory and low computationalresources. Thus it can improve the speech recognition performance and models trained from text corpus. MainClaim: A method of measuring confusion between word sequences in a word sequence recognition system, comprising:having a new word sequence entered into an electronic device; creating a new transcription of the new word sequence using apronunciation-modeling system; computing a distance between the new transcription and at least one prior transcription of aprior word sequence stored in a database if such a prior transcription exists; and if the computed distance is less than apredefined threshold, informing a user of a potential confusion between the new word sequence and the prior word sequence.

2006/0074924



707 G06F 20040917 11 94%




5,828,999

Method and system for deriving a large-span semantic language model for large-vocabulary recognition systems

Apple Computer, Inc. Bellegarda; Jerome R. | Chow; Yen-Lu

704 G10L 19960506 0 100%

Abstract: A system and method for deriving a large-span semantic language model for a large vocabulary recognition system is disclosed. The method and system maps words from a vocabulary into a vector space, where each word is represented by avector. After the vectors are mapped to the space, the vectors are clustered into a set of clusters, where each cluster representsa semantic event. After clustering the vectors, a probability that a first word will occur given a history of prior words is computedby (i) calculating a probability that the vector representing the first word belongs to each of the clusters; (ii) calculating aprobability of each cluster occurring in a history of prior words; and weighting (i) by (ii) to provide the probability. MainClaim: A method for deriving a large-span semantic language model for a large vocabulary recognition system, the method comprising the steps of:

(a) mapping words into a vector space, where each word is represented by a vector;

(b) clustering the vectors into a set of clusters, where each cluster represents a semantic event;

(c) computing a first probability that a first word will occur given a history of prior words by,

(i) calculating a second probability that a vector representing the first word belongs to each of the clusters, the secondprobability capable of being independent of a location of the first word in a sentence;

(ii) calculating a third probability of each cluster occurring in a history of prior words; and

(iii) weighting the second probability by the third probability.

2006/0064177



700 G05B 20050609 21 95%

Abstract: A system and method are proposed for measuring confusability or similarity between given entry pairs, including textstring pairs and acoustic model pairs, in systems such as speech recognition and synthesis systems. A string edit distance(Levenshiten distance) can be applied to measure distance between any pair of text strings. It also can be used to calculate aconfusion measurement between acoustic model pairs of different words and a model-driven method can be used to calculate a HMM model confusion matrix. This model-based approach can be efficiently calculated with low memory and low computationalresources. Thus it can improve the speech recognition performance and models trained from text corpus. MainClaim: A method of measuring confusion between word sequences in a word sequence recognition system, comprising:having a new word sequence entered into an electronic device; creating a new transcription of the new word sequence using apronunciation-modeling system; computing a distance between the new transcription and at least one prior transcription of a

www.patentics.com


prior word sequence stored in a database if such a prior transcription exists; and if the computed distance is less than apredefined threshold, informing a user of a potential confusion between the new word sequence and the prior word sequence.




2006/0074924




5,832,434

Method and apparatus for automatic assignment of duration values for synthetic speech

Apple Computer, Inc. Meredith; Scott E. 704 G10L 19970117 0 100%

Abstract: The present invention automatically determines sound duration values, based on context, for phonetic symbols whichare produced during text-to-speech conversion. The context-dependent and static attributes of the phonetic symbols are checked and specified. Then, the phonetic symbols are processed by a set of sequential duration-specification rules which set the duration value for each phonetic symbol. MainClaim: A system for computing phonetic sound pronunciation duration values, comprising:

computer text memory storing computer text;

phoneme memory storing phonemes representing pronunciation of said text and, corresponding to each of said phonemes,duration value data including a minimum duration value, a maximum duration value, the difference value between the maximumduration value and the minimum duration value, and a duration interval value which is defined in terms of a predeterminednumber of duration value intervals;

duration rule memory storing duration rules and corresponding duration modification values, each duration modification valuebeing defined in terms of the predetermined number of duration value intervals; and

a processor, coupled to the computer text memory, the phoneme memory and the duration rule memory, for using the durationrules to test the phonemes representing the computer text to determine if any of the duration rules are satisfied and forcomputing a pronunciation duration value based on modification values of satisfied duration rules.




2008/0091427 Hierarchical word indexes used for efficient N-gram storage


Abstract: Systems and methods are provided for compressing data models, for example, N-gram language models used in speech recognition applications. Words in the vocabulary of the language model are assigned to classes of words, for example,

www.patentics.com


by syntactic criteria, semantic criteria, or statistical analysis of an existing language model. After word classes are defined, thefollower lists for words in the vocabulary may be stored as hierarchical sets of class indexes and word indexes within each class.Hierarchical word indexes may reduce the storage requirements for the N-gram language model by more efficiently representing multiple words in a single list in the same follower list. MainClaim: A method for storing an N-gram model in a memory of a device, comprising:identifying a plurality of wordclasses;receiving a vocabulary of words, wherein each word in the vocabulary is associated with at least one of the plurality ofclasses;associating a follower list with each word in the vocabulary;storing in the memory information associated with a firstword in the vocabulary, the information comprising:(1) a first class index corresponding to a class in which at least a subset ofthe follower list is a member, and(2) a first plurality of word indexes corresponding to at least a subset of the follower list for thefirst word, wherein said word indexes are indexed based on the first class index.

7,643,990

Global boundary-centric feature extraction and associated discontinuity metrics

Apple Inc.Bellegarda; Jerome R. 704 G10L 20031023 0 100%

Abstract: Portions from time-domain speech segments are extracted. Feature vectors that represent the portions in a vectorspace are created. The feature vectors incorporate phase information of the portions. A distance between the feature vectors inthe vector space is determined. In one aspect, the feature vectors are created by constructing a matrix W from the portions anddecomposing the matrix W. In one aspect, decomposing the matrix W comprises extracting global boundary-centric features from the portions. In one aspect, the portions include at least one pitch period. In another aspect, the portions include centeredpitch periods. MainClaim: A machine-implemented method comprising: i. extracting, via a microprocessor, portions from speech segments,the portions surrounding a segment boundary within a phoneme; ii. identifying time samples from the portions; iii. constructinga matrix W containing first data corresponding to the time samples from the portions surrounding the segment boundary withinthe phoneme and second data corresponding to the portions; iv. deriving feature vectors that represent the portions in a vectorspace by decomposing the matrix W containing the first data corresponding to the time samples from the portions surroundingthe segment boundary within the phoneme and the second data corresponding to the portions; and v. determining a distancebetween the feature vectors in the vector space.


704 G10L 20060929 8 93%




706 G06F 20060426 3 93%


2007/0256189



800 C12N 20060426 6 93%


6,366,884 Method and apparatus for improved duration modeling of phonemes

Apple Computer, Inc.Bellegarda; Jerome R. | Silverman; Kim

704 G10L 19991108 0 100%

Abstract: A method and an apparatus for improved duration modeling of phonemes in a speech synthesis system are provided.According to one aspect, text is received into a processor of a speech synthesis system. The received text is processed using a

www.patentics.com


sum-of-products phoneme duration model that is used in either the formant method or the concatenative method of speechgeneration. The phoneme duration model, which is used along with a phoneme pitch model, is produced by developing a non-exponential functional transformation form for use with a generalized additive model. The non-exponential functional transformation form comprises a root sinusoidal transformation that is controlled in response to a minimum phoneme durationand a maximum phoneme duration. The minimum and maximum phoneme durations are observed in training data. The receivedtext is processed by specifying at least one of a number of contextual factors for the generalized additive model. An inverse ofthe non-exponential functional transformation is applied to duration observations, or training data. Coefficients are generated foruse with the generalized additive model. The generalized additive model comprising the coefficients is applied to at least onephoneme of the received text resulting in the generation of at least one phoneme having a duration. An acoustic sequence isgenerated comprising speech signals that are representative of the received text. MainClaim: A method for producing synthetic speech comprising:

receiving text into a processor;

processing the text using a phoneme duration model, the phoneme duration model produced by developing a functionaltransformation form with an inflection point for use with a generalized additive model, wherein the generalized additive model isspecifically designed to calculate phoneme durations for speech synthesis; and

generating speech signals representative of the received text.





704 G10L 20011219 8 95%






704 G10L 20021219 0 100%

Abstract: A method and an apparatus for improved duration modeling of phonemes in a speech synthesis system are provided.According to one aspect, text is received into a processor of a speech synthesis system. The received text is processed using asum-of-products phoneme duration model that is used in either the formant method or the concatenative method of speechgeneration. The phoneme duration model, which is used along with a phoneme pitch model, is produced by developing a non-exponential functional transformation form for use with a generalized additive model. The non-exponential functional transformation form comprises a root sinusoidal transformation that is controlled in response to a minimum phoneme duration

www.patentics.com


and a maximum phoneme duration. The minimum and maximum phoneme durations are observed in training data. The receivedtext is processed by specifying at least one of a number of contextual factors for the generalized additive model. An inverse ofthe non-exponential functional transformation is applied to duration observations, or training data. Coefficients are generated foruse with the generalized additive model. The generalized additive model comprising the coefficients is applied to at least onephoneme of the received text resulting in the generation of at least one phoneme having a duration. An acoustic sequence isgenerated comprising speech signals that are representative of the received text. MainClaim: A method comprising:

identifying a non-exponential functional transformation that defines a shape containing an inflection point, wherein thefunctional transformation comprises a root sinusoidal transformation; and

incorporating the functional transformation into a generalized additive model for modeling phoneme durations.






2006/0064177



700 G05B 20050609 21 93%




704 G10L 19971218 0 100%

Abstract: A method and an apparatus for improved duration modeling of phonemes in a speech synthesis system are provided.According to one aspect, text is received into a processor of a speech synthesis system. The received text is processed using asum-of-products phoneme duration model that is used in either the formant method or the concatenative method of speechgeneration. The phoneme duration model, which is used along with a phoneme pitch model, is produced by developing a non-exponential functional transformation form for use with a generalized additive model. The non-exponential functional transformation form comprises a root sinusoidal transformation that is controlled in response to a minimum phoneme durationand a maximum phoneme duration. The minimum and maximum phoneme durations are observed in training data. The receivedtext is processed by specifying at least one of a number of contextual factors for the generalized additive model. An inverse ofthe non-exponential functional transformation is applied to duration observations, or training data. Coefficients are generated foruse with the generalized additive model. The generalized additive model comprising the coefficients is applied to at least one

www.patentics.com


phoneme of the received text resulting in the generation of at least one phoneme having a duration. An acoustic sequence isgenerated comprising speech signals that are representative of the received text. MainClaim: A method for producing synthetic speech comprising:

receiving text into a processor;

processing the text using a phoneme duration model, the phoneme duration model produced by developing a non-exponential functional transformation form for use with a generalized additive model, wherein the non-exponential functional transformation is expressed by ##EQU3## where x comprises one or more of a plurality of contextual factors influencing the duration of aphoneme, A is the minimum phoneme duration observed in training data, B is the maximum phoneme duration observed intraining data, α controls the amount of shrinking and expansion on either side of a main inflection point, and β controls the position of the main inflection point; and

generating speech signals representative of the received text.


704 G10L 20060929 8 96%




704 G10L 20011219 8 95%







704 G01L 20020222 0 100%

Abstract: A method and an apparatus for improved duration modeling of phonemes in a speech synthesis system are provided.According to one aspect, text is received into a processor of a speech synthesis system. The received text is processed using asum-of-products phoneme duration model that is used in either the formant method or the concatenative method of speechgeneration. The phoneme duration model, which is used along with a phoneme pitch model, is produced by developing a non-exponential functional transformation form for use with a generalized additive model. The non-exponential functional transformation form comprises a root sinusoidal transformation that is controlled in response to a minimum phoneme durationand a maximum phoneme duration. The minimum and maximum phoneme durations are observed in training data. The receivedtext is processed by specifying at least one of a number of contextual factors for the generalized additive model. An inverse ofthe non-exponential functional transformation is applied to duration observations, or training data. Coefficients are generated foruse with the generalized additive model. The generalized additive model comprising the coefficients is applied to at least onephoneme of the received text resulting in the generation of at least one phoneme having a duration. An acoustic sequence is

www.patentics.com


generated comprising speech signals that are representative of the received text. MainClaim: A method for modeling phoneme durations comprising:

calculating durations for a phoneme using a generalized additive model that incorporates influences of contextual factors on thedurations, the generalized additive model including a functional transformation that describes a shape containing an inflectionpoint.






2006/0064177



700 G05B 20050609 21 93%


5,852,801

Method and apparatus for automatically invoking a new word module for unrecognized user input

Apple Computer, Inc. Hon; Hsiao-Wuen | Chow; Yen-Lu

704 G01L 19951004 0 100%

Abstract: A method for reducing recognition errors in a speech recognition system that has a user interface, which instructs theuser to invoke a new word acquisition module upon a predetermined condition, and that improves the recognition accuracy forpoorly recognized words. The user interface of the present invention suggests to a user which unrecognized words may be newwords that should be added to the recognition program lexicon. The user interface advises the user to enter words into a newword lexicon that fails to present themselves in an alternative word list for two consecutive tries. A method to improve therecognition accuracy for poorly recognized words via language model adaptation is also provided by the present invention. Thepresent invention increases the unigram probability of an unrecognized word in proportion to the score difference between theunrecognized word and the top one word to guarantee recognition of the same word in a subsequent try. In the event that thescore of unrecognized word is unknown (i.e., not in the alternative word list), the present invention increases the unigramprobability of the unrecognized word in proportion to the difference between the top one word score and the smallest score inthe alternative list. MainClaim: A computer implemented method for improving the accuracy of a speech recognition system, said methodcomprising the steps of:

www.patentics.com


a) detecting a user speech signal;

b) if the user speech signal is not found by the user from an alternative user input candidate list, instructing the user to inputthe user speech signal again;

c) if the user speech signal is still not found by the user in the alternative user input candidate list, prompting the user to input arepresentation of the speech signal using a keyboard and invoking a new word module; and

d) adapting a language model using the new word module.



704 G10L 20050627 3 97%


2007/0100619

Key usage and text marking in the context of a combined predictive text and speech recognition system

Nokia Corporation Purho; Juha 704 G10L 20051102 1 94%

Abstract: A combined predictive speech and text recognition system. The present invention combines the functionality of textinput programs with speech input and recognition systems. With the present invention, a user can both manually enter text andspeak desired letters, words or phrases. The system receives and analyzes the provided information and provides one or moreproposals for the completion of words or phrases. This process can be repeated until an adequate match is found. MainClaim: A method of using text and speech information to predict a character string that is desired to be entered into anelectronic device, comprising: receiving a voice input from a user; receiving designated text input from the user; using apredictive model to generate at least one candidate character string based upon the voice input and the designated text input;and exhibiting the at least one candidate character string to the user.

7,043,431



704 G10L 20010831 6 94%


5,832,428

Search engine for phrase recognition based on prefix/body/suffix architecture

Apple Computer, Inc.Chow; Yen-Lu | Hon; Hsiao-Wuen 704 G10L 19951004 0 100%

Abstract: A method of constructing a language model for a phrase-based search in a speech recognition system and an apparatus for constructing and/or searching through the language model. The method includes the step of separating a pluralityof phrases into a plurality of words in a prefix word, body word, and suffix word structure. Each of the phrases has a body wordand optionally a prefix word and a suffix word. The words are grouped into a plurality of prefix word classes, a plurality of bodyword classes, and a plurality of suffix word classes in accordance with a set of predetermined linguistic rules. Each of therespective prefix, body, and suffix word classes includes a number of prefix words of same category, a number of body words ofsame category, and a number of suffix words of same category, respectively. The prefix, body, and suffix word classes are theninterconnected together according to the predetermined linguistic rules. A method of organizing a phrase search based on theabove-described prefix/body/suffix language model is also described. The words in each of the prefix, body, and suffix classesare organized into a lexical tree structure. A phrase start lexical tree structure is then created for the words of all the prefixclasses and the body classes having a word which can start one of the plurality of phrases while still maintaining connections ofthese prefix and body classes within the language model. MainClaim: A method implemented in a digital processing system of constructing a language model in a speech recognitionsystem, comprising:

receiving speech signals into a processor;

storing a plurality of phrases into a plurality of words in a prefix word, body word, and suffix word structure, wherein each of thephrases has a body word and optionally a prefix word and optionally a suffix word;

www.patentics.com


grouping the words into a plurality of prefix word classes, a plurality of body word classes, and a plurality of suffix word classesin accordance with a set of predetermined linguistic rules, wherein each of the respective prefix, body, and suffix word classesincludes a number of prefix words of a first category, a number of body words of a second category, and a number of suffixwords of a third category, respectively;

storing data elements representing interconnections among the prefix, body, and suffix word classes together according to thepredetermined linguistic rules, wherein the language model generates signals representative of the received speech signalsduring a phrase-based search.



Abstract: Systems and methods are provided for compressing data models, for example, N-gram language models used in speech recognition applications. Words in the vocabulary of the language model are assigned to classes of words, for example,by syntactic criteria, semantic criteria, or statistical analysis of an existing language model. After word classes are defined, thefollower lists for words in the vocabulary may be stored as hierarchical sets of class indexes and word indexes within each class.Hierarchical word indexes may reduce the storage requirements for the N-gram language model by more efficiently representing multiple words in a single list in the same follower list. MainClaim: A method for storing an N-gram model in a memory of a device, comprising:identifying a plurality of wordclasses;receiving a vocabulary of words, wherein each word in the vocabulary is associated with at least one of the plurality ofclasses;associating a follower list with each word in the vocabulary;storing in the memory information associated with a firstword in the vocabulary, the information comprising:(1) a first class index corresponding to a class in which at least a subset ofthe follower list is a member, and(2) a first plurality of word indexes corresponding to at least a subset of the follower list for thefirst word, wherein said word indexes are indexed based on the first class index.

2009/0157385 Inverse Text Normalization Nokia Corporation Tian; Jilei 704 G06F 20071214 14 96%

Abstract: Embodiments are directed to efficient multilingual inverse text normalization (ITN) of text in spoken form to producenormalized text for display. Embodiments are directed to preprocessing the multilingual text into a language-independent representation, tokenizing text in spoken form, segmenting the tokenized text into ITN items by grouping consecutive wordsusing an ITN lexicon, classifying the ITN items into ITN categories by using the ITN lexicon or tagged information from languagemodel, applying one or more ITN rules that are selected based on the ITN categories into which ITN items have been classifiedto rewrite the ITN items; and post processing the ITN item and outputting inversely normalized text in written form for display.The ITN lexicon may include ITN lexicon entries that are each located within an ITN category in the ITN lexicon. MainClaim: A method comprising:segmenting text in spoken form into inverse text normalization items by groupingconsecutive words using an inverse text normalization lexicon;classifying the inverse text normalization items into inverse textnormalization categories by using the inverse text normalization lexicon;applying one or more inverse text normalization rulesthat are selected based on the inverse text normalization categories into which inverse text normalization items have beenclassified to rewrite the inverse text normalization items; andpost processing the inverse text normalization item and outputtinginversely normalized text in written form for display.




6,704,710 Assigning meanings to utterances in a speech recognition system

Apple Computer, Inc. Strong; Robert Don 704 G10L 20011012 0 100%

Abstract: Assigning meanings to spoken utterances in a speech recognition system. A plurality of speech rules is generated,each of the of speech rules comprising a language model and an expression associated with the language model. At one interval(e.g. upon the detection of speech in the system), a current language model is generated from each language model in thespeech rules for use by a recognizer. When a sequence of words is received from the recognizer, a set of speech rules whichmatch the sequence of words received from the recognizer is determined. Each expression associated with the language modelin each of the set of speech rules is evaluated, and actions are performed in the system according to the expressions associatedwith each language model in the set of speech rules. MainClaim: A machine-readable medium having stored thereon a sequence of instructions which when executed by a processing system cause said processing system to perform a method of speech recognition in a speech recognition system, themethod comprising:

storing a language model defining the syntax of a set of sequences of words which may be recognized in each of a plurality ofspeech rules;

storing an expression defining the meaning of each of said set of sequences of words in each of said plurality of speech rules;

providing said language model to a recognizer and responsive thereto, receiving a recognized sequence of words from said

www.patentics.com


recognizer;

determining a set of said plurality of speech rules which include language models matching said recognized sequence of words;and

evaluating said expression for each of said set of said plurality of speech rules and performing actions according to each saidexpression which is evaluated.








5,757,964

System and method for automatic subcharacter unit and lexicon generation for handwriting recognition

Apple Computer, Inc.Lee; Kai-Fu | Chow; Yen-Lu | Grajski; Kamil

382 G06K 19970729 0 100%

Abstract: A system for automatic subcharacter unit and lexicon generation for handwriting recognition comprises a processingunit, a handwriting input device, and a memory wherein a segmentation unit, a subcharacter generation unit, a lexicon unit, anda modeling unit reside. The segmentation unit generates feature vectors corresponding to sample characters. The subcharactergeneration unit clusters feature vectors and assigns each feature vector associated with a given cluster an identical label. Thelexicon unit constructs a lexical graph for each character in a character set. The modeling unit generates a Hidden Markov Modelfor each set of identically-labeled feature vectors. After a first set of lexical graphs and Hidden Markov Models have beencreated, the subcharacter generation unit determines for each feature vector which Hidden Markov Model produces a highestlikelihood value. The subcharacter generation unit relabels each feature vector according to the highest likelihood value, afterwhich the lexicon unit and the modeling unit generate a new set of lexical graphs and a new set of Hidden Markov models,respectively. The feature vector relabeling, lexicon generation, and Hidden Markov Model generation are performed iterativelyuntil a convergence criterion is met. The final set of Hidden Markov Model model parameters provide a set of subcharacter unitsfor handwriting recognition, where the subcharacter units are derived from information inherent in the sample charactersthemselves. MainClaim: In a handwriting recognition system having a processing unit, a handwriting input device, and a memory, a methodfor automatic subcharacter unit and lexicon generation comprising the steps of:

retrieving a plurality of sample characters, each sample character representing a reference character within a character set;

partitioning each sample character into a set of segments with associated time intervals;

creating a feature vector corresponding to each segment;

www.patentics.com


clustering the feature vectors according to a distance metric;

storing in each feature vector a label identifying a cluster with which the feature vector is associated;

creating a pattern recognition model for each set of identically-labeled feature vectors;

selecting a feature vector;

determining which pattern recognition model produces a highest likelihood value for the selected feature vector;

storing a label identifying the pattern recognition model producing the highest likelihood value in the selected feature vector;

determining whether a convergence criterion has been satisfied; and

if said convergence criterion is satisfied, incorporating the segment corresponding to said labeled feature vector into a lexicon ofsubcharacters for said handwriting recognition system.

2006/0064177



700 G05B 20050609 21 93%





2006/0074924




5,796,916

Method and apparatus for prosody for synthetic speech prosody determination

Apple Computer, Inc. Meredith; Scott E. 704 G10L 19950526 0 100%

Abstract: In a synthetic speech system intonation of a natural utterance is automatically applied to a synthesized utterance.The present invention applies the desired intonation of the natural utterance to the synthesized utterance by aligning voicingsections of the natural utterance to the synthesized utterance. The voicing sections are initially delineated by voiced versusunvoiced, based on default voicing specifications for the synthetic utterance and on pitch tracker analysis of the naturalutterance, and an attempt is made to align individual sections thereby. If no initial alignment occurs then a further attempt ismade by varying the default voicing specifications of the synthesized utterance. If alignment is still not achieved, then each ofthe utterances, natural and synthetic, is considered a single large voicing section, which thus forces alignment therebetween.Once alignment occurs, the intonation of the natural utterance is applied to the synthetic utterance thereby providing thesynthetic utterance with the desired, more natural, intonation. Further, the synthetic utterance having intonation specificationcan be graphically displayed so that the user may view and interactively and graphically modify the intonation specification forthe synthetic utterance.

www.patentics.com


MainClaim: A method for specifying synthetic speech intonation, comprising the steps of:

(a) obtaining natural pitch and duration values for a natural voicing section of a natural utterance;

(b) obtaining synthetic pitch and duration values for a synthetic voicing section of a synthetic equivalent to the naturalutterance;

(c) aligning the natural voicing section to the synthetic voicing section; and

(d) replacing the synthetic pitch and duration values of the synthetic voicing section with the natural pitch and duration values.

2007/0016421

Correcting a pronunciation of a synthetically generated speech object

Nokia CorporationNurminen; Jani | Mikkola; Hannu | Tian; Jilei

704 G10L 20050712 4 94%

Abstract: This invention relates to a method, a device and a software application product for correcting a pronunciation of aspeech object. The speech object is synthetically generated from a text object in dependence on a segmented representation ofthe text object. It is determined if an initial pronunciation of the speech object, which initial pronunciation is associated with aninitial segmented representation of the text object, is incorrect. Furthermore, in case it is determined that the initialpronunciation of the speech object is incorrect, a new segmented representation of the text object is determined, which newsegmented representation of the text object is associated with a new pronunciation of the speech object. MainClaim: A method for correcting a pronunciation of a speech object, wherein said speech object is synthetically generatedfrom a text object in dependence on a segmented representation of said text object, said method comprising: determining if aninitial pronunciation of said speech object, which initial pronunciation is associated with an initial segmented representation ofsaid text object, is incorrect; and determining, in case it is determined that said initial pronunciation of said speech object isincorrect, a new segmented representation of said text object, which new segmented representation of said text object isassociated with a new pronunciation of said speech object.

6,546,369

Text-based speech synthesis method containing synthetic speech comparisons and updates

Nokia CorporationButh; Peter | Dufhues; Frank 704 G10L 20000505 3 94%

Abstract: The invention specifies a simple reproduction method with improved pronunciation for voice-controlled systems with text-based speech synthesis even when the stored train of characters to be synthesized does not follow the general rules ofspeech reproduction. According to the invention, the method of "copying" the original spoken input text into the otherwisesynthesized reproduction text, which is the current state of the art, is avoided, which will significantly increase the acceptance ofthe user of the voice-controlled system due to the process invented. More specifically, when there is actual spoken speech inputthat corresponds to a stored train of characters, the converted train of characters is compared to the speech input beforereproduction of the train of characters described phonetically according to general rules and converted to a purely syntheticform. When the converted train of characters is found to deviate from the speech input by a value above a threshold value, atleast one variation of the converted train of characters is created. This variation is then output instead of the converted train ofcharacters as long as this variation deviates from the speech input by a value below the threshold value. MainClaim: A reproduction method for voice-controlled systems with text-based speech synthesis, comprising the steps of:

converting a stored string of characters described phonetically according to general rules into a pure synthetic form;

if there is an actually spoken speech input that corresponds to said stored string of characters, comparing said pure syntheticform of said string of characters with said speech input before reproduction of said string of characters;

if a deviation is detected in said pure synthetic form of said string of characters that has a value greater than a threshold value,creating at least one variation of said pure synthetic form of said string of characters;

comparing one of said variations with said speech input; and

outputting one of said variations instead of said pure synthetic form of said string of characters, if the deviation of one of saidvariations from said speech input is less than said threshold value.

7,043,431



704 G10L 20010831 6 92%


5,602,960 Continuous mandarin chinese speech recognition system

Apple Computer, Inc. Hon; Hsiao-Wuen | Chow; Yen-Lu |

704 G10L 19940930 0 100%

www.patentics.com


having an integrated tone classifier

Lee; Kai-Fu

Abstract: A speech recognition system for continuous Mandarin Chinese speech comprises a microphone, an A/D converter, asyllable recognition system, an integrated tone classifier, and a confidence score augmentor. The syllable recognition systemgenerates N-best theories with initial confidence scores. The integrated tone classifier has a pitch estimator to estimate the pitchof the input once and a long-term tone analyzer to segment the estimated pitch according to the syllables of each of the N-best theories. The long-term tone analyzer performs long-term tonal analysis on the segmented, estimated pitch and generates along-term tonal confidence signal. The confidence score augmentor receives the initial confidence scores and the long-term tonal confidence signals, modifies each initial confidence score according to the corresponding long-term tonal confidence signal, re-ranks the N-best theories according to the augmented confidence scores, and outputs the N-best theories. MainClaim: An integrated tone classifier for performing long-term tonal analysis of an input signal of continuous speech of a tonal language, the integrated tone classifier comprising:

a pitch estimator, having an input coupled to receive the input signal and an output, for estimating the pitch contour of the inputsignal; and

a long-term tone analyzer, having an input coupled to the output of the pitch estimator and an output forming an output of theintegrated tone classifier, for segmenting an estimated pitch contour generated by the pitch estimator into units and forperforming long-term tonal analysis on the units of the segmented, estimated pitch.


704 G10L 20060929 8 95%




704 G10L 20011219 8 95%






Abstract: Assigning meanings to spoken utterances in a speech recognition system. A plurality of speech rules is generated,each of the of speech rules comprising a language model and an expression associated with the language model. At one interval(e.g. upon the detection of speech in the system), a current language model is generated from each language model in thespeech rules for use by a recognizer. When a sequence of words is received from the recognizer, a set of speech rules whichmatch the sequence of words received from the recognizer is determined. Each expression associated with the language modelin each of the set of speech rules is evaluated, and actions are performed in the system according to the expressions associated

www.patentics.com


with each language model in the set of speech rules. MainClaim: A method of associating meanings to utterances in a speech recognition system comprising the following steps:

a. providing a plurality of speech rules, each speech rule comprising a language model and an expression defining a meaning ofsaid speech rule;

b. generating a current language model from each said language model of said plurality of speech rules and providing saidcurrent language model to a recognizer;

c. said recognizer recognizing words in detected speech by referencing said current language model to generate a recognizedsequence of words;

d. receiving said recognized sequence of words from said recognizer, and determining that said recognized sequence of wordsmatches a phrase of a first speech rule of said plurality of speech rules and that said recognized sequence of words comprises atleast one word that matches a phrase of a second speech rule of said plurality of speech rules; and

e. evaluating a first expression of the first speech rule and a second expression of the second speech rule, wherein theevaluation of the first expression depends on the evaluation of the second expression, and performing actions in said speechrecognition system only after evaluating the first and second expressions.








5,384,892 Dynamic language model for speech recognition

Apple Computer, Inc. Strong; Robert D. 704 G10L 19921231 0 100%

Abstract: A method of speech recognition which determines acoustic features in a sound sample; recognizes words comprisingthe acoustic features based on a language model, which determines the possible sequences of words that may be recognized;and the selection of an appropriate response based on the words recognized. Information about what words may be recognized,under which conditions those words may be recognized, and what response is appropriate when the words are recognized, isstored, in a preferred embodiment, in a data structure called a speech rule. These speech rules are partitioned according to thecontext in which they are active. When speech is detected, concurrent with acoustic feature extraction, the current state of thecomputer system is used to determine which rules are active and how they are to be combined in order to generate a languagemodel for word recognition. A language model is dynamically generated and used to find the best interpretation of the acousticfeatures as a word sequence. This word sequence is then matched against active rules in order to determine the appropriateresponse. Rules that match all or part of the word sequence contribute data structures representing the "meaning" of the wordsequence, and these data structures are used by the rule actions in order to generate an appropriate response to the spoken

www.patentics.com


utterance. MainClaim: A method of speech recognition in a speech recognition system comprising the following steps:

a. determining acoustic features in a sound sample;

b. upon commencing said determination of said acoustic features, determining possible combinations of words which may berecognized by said speech recognition system and storing said possible combinations of words as a current language model, saidcurrent language model being generated from a plurality of speech rules each comprising a language model and an associatedaction, each said language model in each of said plurality of speech rules including a plurality of states, words definingtransitions between said plurality of states, and terminal states;

c. upon the completion of said generation of said current language model, recognizing words comprising said acoustic featuresby traversing states in said current language model until reaching said terminal states in said current language model; and

d. subsequent to said step of recognizing words, determining a matched speech rule from said plurality of speech rules used tocreate said current language model and said words and performing said action associated with said matched speech rule.









5,761,687

Character-based correction arrangement with correction propagation


Hon; Hsiao-Wuen | Beauregard; Gerald T. | Hulteen; Eric A.

715 G06F 19951005 0 100%

Abstract: A method of correcting a text in a data processing system is described. The method includes the step of locating afirst incorrect character in the text. A character list of alternative characters for the first incorrect character is then shown to theuser who replaces the first incorrect character with a correct character from the character list. The change of the first incorrectcharacter is then propagated through a remainder of the text in accordance with a matching score and a language probabilityscore of the remainder of the text with respect to the correct character to correct any subsequent incorrect character in the text. MainClaim: A method of correcting a text in a data processing system, comprising the steps of:

(A) recognizing an input pattern using a pattern recognition system and locating a first incorrect character which is a portion of aword in the text;

(B) showing to the user a character list of alternative characters for the first incorrect character and allowing the user to select acorrect character which is a portion of a word to replace the first incorrect character from the character list, each of said

www.patentics.com


alternative characters being a portion of a word;

(C) propagating a change of the first incorrect character through a remainder of the text in accordance with a matching scoreand a language probability score of the remainder of the text with respect to the correct character to correct any subsequentincorrect character in the text.



704 G10L 20050627 3 98%


7,181,388 Method for compressing dictionary data


Abstract: The invention relates to pre-processing of a pronunciation dictionary for compression in a data processing device, the pronunciation dictionary comprising at least one entry, the entry comprising a sequence of character units and a sequence ofphoneme units. According to one aspect of the invention the sequence of character units and the sequence of phoneme units arealigned using a statistical algorithm. The aligned sequence of character units and aligned sequence of phoneme units areinterleaved by inserting each phoneme unit at a predetermined location relative to the corresponding character unit. MainClaim: A method for pre-processing a pronunciation dictionary for compression in a data processing device, thepronunciation dictionary comprising at least one entry, the entry comprising a sequence of character units and a sequence ofphoneme units, the method comprising: aligning said sequence of character units and said sequence of phoneme units using astatistical algorithm so that the alignment between said character units and said phoneme units is determined; and interleavingsaid aligned sequence of character units and said aligned sequence of phoneme units by inserting each phoneme unit at apredetermined location relative to the corresponding character unit.

2007/0073541 Method for compressing dictionary data Nokia Corporation Tian; Jilei 704 G10L 20061129 5 94%




Abstract: Assigning meanings to spoken utterances in a speech recognition system. A plurality of speech rules is generated,each of the of speech rules comprising a language model and an expression associated with the language model. At one interval(e.g. upon the detection of speech in the system), a current language model is generated from each language model in thespeech rules for use by a recognizer. When a sequence of words is received from the recognizer, a set of speech rules whichmatch the sequence of words received from the recognizer is determined. Each expression associated with the language modelin each of the set of speech rules is evaluated, and actions are performed in the system according to the expressions associatedwith each language model in the set of speech rules. MainClaim: A computer implemented method comprising: determining a set of speech rules which match a spoken sequence ofwords by searching a current language model, said spoken sequence of words received through an audio input, said currentlanguage model generated from a plurality of speech rules according to a current operating context, wherein each of saidplurality of speech rules comprises a language model and an expression; and evaluating said expressions in said currentlanguage model to assign a meaning to said spoken sequence of words.




www.patentics.com





5,613,036 Dynamic categories for a speech recognition system


Abstract: Maintaining dynamic categories for speech rules in a speech recognition system which has a plurality of speech ruleseach comprising a language model and action. Each speech rule indicates whether the language model includes a flag identifyingwhether the words in the language model is dynamic according to changing data in the speech recognition system. At periodicintervals, such as system initialization or application program launch time, for each flag in each speech rule which indicates thatwords in the language model are dynamic, the words of each of the language model(s) are updated depending upon the state ofthe system. Concurrent with the determination of acoustic features during speech recognition, a current language model can becreated based upon the language models from these speech rules. MainClaim: A method of maintaining dynamic categories for speech rules in a speech recognition system having an acousticfeature extractor which is separate from said speech rules, said method comprising the following steps:

a. creating a plurality of speech rules each comprising a language model and associated action to be performed in said speechrecognition system, each said language model including a phrase list having a phrase comprising a sequence of words that maybe recognized by a speech recognizer, each of said plurality of speech rules further comprising a dynamic flag identifyingwhether said words in said sequence of words are dynamic such that additional words may be added to the sequence of wordsand one of said words in said sequence of words is capable of being deleted from said sequence of words;

b. at periodic intervals during run time of said speech recognition system, for each dynamic flag in each said speech ruleidentifying that said words in said sequence of words are dynamic, dynamically determining said words in each said sequence ofwords based on data stored in said speech recognition system;

c. determining acoustic features in a sound sample, wherein said acoustic features are distinct from said speech rules; and

d. creating a current language model based upon each said language model from each of said plurality of said speech rules, andmaking said current language model available to the speech recognizer.




Abstract: A speech recognizer comprises a random access memory, a downloader for loading decision trees from a set ofdecision trees into said random access memory, a vocabulary comprising one or more words of a language, a divider for dividingat least one word of the vocabulary into subwords, and a transcription generator adapted to process at least one subword. Thedownloader is adapted to download a subset of the set of decision trees at a time into said random access memory. Thetranscription generator is further adapted to generate at least one phoneme transcription for the subword using the subset ofdecision trees. The speech recognizer also comprises a combiner for combining the generated phoneme transcriptions of the

www.patentics.com


subwords to obtain phoneme transcriptions of said one or more words. The invention also relates to a device, a system, amodule, a method, a computer program product and a data structure. MainClaim: A speech recognizer comprising: a random access memory; a downloader for loading decision trees from a set ofdecision trees into said random access memory; a vocabulary comprising one or more words of a language; a divider fordividing at least one word of said vocabulary into subwords; a transcription generator adapted to process at least one subword,wherein the downloader is adapted to download a subset of the set of decision trees at a time into said random access memory,and the transcription generator is further adapted to generate at least one phoneme transcription for said subword using saidsubset of the decision trees; and a combiner for combining generated phoneme transcriptions of the subwords to obtainphoneme transcriptions of said one or more words.



5,390,279 Partitioning speech rules by context for speech recognition


Abstract: Partitioning speech recognition rules for generation of a current language model and interpretation in a speechrecognition system. Contexts for each of speech recognition rules are determined when each of the speech rules will be active.At one interval (e.g. initialization of the system), common contexts for the speech rules are determined and grouped orpartitioned into speech rule sets according to these common contexts. Rapid and efficient generation of a language model uponthe detection of a current context at a second interval (e.g. upon the detection of speech in one embodiment) then may beperformed. Subsequent to the generation of the language model, interpretation may be performed using the speech recognitionrules grouped into these common contexts. MainClaim: A method of continuous speech recognition including dynamic generation of a current language model andinterpretation in a speech recognition system according to a current context comprising the following steps:

a. associating with each of a plurality of speech rules, a context wherein each of said speech rules will be active:

b. during initialization of said speech recognition system, determining common contexts for said plurality of speech rules, andpartitioning said plurality of speech rules into a partition of speech rule sets according to said common contexts wherein each ofsaid plurality of speech rules resides in only one of said speech rule sets of said partition;

c. upon the detection of speech, determining said current context of said speech recognition system;

d. determining all speech rule sets which each have a context matching said current context, and storing said matched speechrule sets as a context matched set of speech rules;

e. dynamically generating a current language model from said context matched set of speech rules in said partition for use by aspeech recognizer;

f. said speech recognizer using said current language model to recognize words contained in said speech; and

g. an interpreter using said context matched set of speech to interpret and perform actions according to said words recognizedby said speech recognizer.






Abstract: Embodiments are directed to efficient multilingual inverse text normalization (ITN) of text in spoken form to producenormalized text for display. Embodiments are directed to preprocessing the multilingual text into a language-independent representation, tokenizing text in spoken form, segmenting the tokenized text into ITN items by grouping consecutive wordsusing an ITN lexicon, classifying the ITN items into ITN categories by using the ITN lexicon or tagged information from languagemodel, applying one or more ITN rules that are selected based on the ITN categories into which ITN items have been classifiedto rewrite the ITN items; and post processing the ITN item and outputting inversely normalized text in written form for display.The ITN lexicon may include ITN lexicon entries that are each located within an ITN category in the ITN lexicon.

www.patentics.com


MainClaim: A method comprising:segmenting text in spoken form into inverse text normalization items by groupingconsecutive words using an inverse text normalization lexicon;classifying the inverse text normalization items into inverse textnormalization categories by using the inverse text normalization lexicon;applying one or more inverse text normalization rulesthat are selected based on the inverse text normalization categories into which inverse text normalization items have beenclassified to rewrite the inverse text normalization items; andpost processing the inverse text normalization item and outputtinginversely normalized text in written form for display.





Apple Inc. Strong; Robert Don 704 G10L 20061013 0 100%

Abstract: Assigning meanings to spoken utterances in a speech recognition system. A plurality of speech rules is generated,each of the speech rules comprising a language model and an expression associated with the language model. At one interval(e.g. upon the detection of speech in the system), a current language model is generated from each language model in thespeech rules for use by a recognizer. When a sequence of words is received from the recognizer, a set of speech rules whichmatch the sequence of words received from the recognizer is determined. Each expression associated with the language modelin each of the set of speech rules is evaluated, and actions are performed in the system according to the expressions associatedwith each language model in the set of speech rules. MainClaim: A machine implemented method comprising: determining a set of possible operating contexts of a data processingsystem; generating for each possible operating context in the set of possible operating contexts a language model for use inrecognizing a spoken set of words received through an audio input.




5,737,487

Speaker adaptation based on lateral tying for large-vocabulary continuous speech recognition


Bellegarda; Jerome R. | Butzberger; John W. | Chow; Yen-Lu

704 G10L 19960213 0 100%

Abstract: A system and method for performing speaker adaptation in a speech recognition system which includes a set ofreference models corresponding to speech data from a plurality of speakers. The speech data is represented by a plurality ofacoustic models and corresponding sub-events, and each sub-event includes one or more observations of speech data. A degreeof lateral tying is computed between each pair of sub-events, wherein the degree of tying indicates the degree to which a firstobservation in a first sub-event contributes to the remaining sub-events. When adaptation data from a new speaker becomes available, a new observation from adaptation data is assigned to one of the sub-events. Each of the sub-events is then populated with the observations contained in the assigned sub-event based on the degree of lateral tying that was computed between each pair of sub-events. The reference models corresponding to the populated sub-events are then adapted to account for speech pattern idiosyncrasies of the new speaker, thereby reducing the error rate of the speech recognition system. MainClaim: A method of performing speaker adaptation in a speech recognition system which includes a set of referencemodels corresponding to speech data from a plurality of speakers, the speech data represented by a plurality of acoustic modelsand corresponding sub-events, wherein each sub-event includes one or more observations of speech data, the method comprising the steps of:

(a) computing a degree of lateral tying between each pair of sub-events, wherein the degree of tying indicates the degree to which a first observation in a first sub-event contributes to the remaining sub-events;

(b) assigning a new observation from adaptation data of a new speaker to one of the sub-events;

(c) populating each of the sub-events with a transformed version of the observation contained in the assigned sub-event based on the degree of lateral tying computed between each pair of sub-events;

www.patentics.com


(d) adapting the reference models that correspond to the populated sub-events to account for speech pattern idiosyncrasies of the new speaker, thereby reducing the error rate of the speech recognition system.




2007/0256189



800 C12N 20060426 6 96%


2004/0039573 Pattern recognition Nokia Corporation Vasilache, Marcel 704 G10L 20030327 10 96%

Abstract: A method for determining a set of distortion measures in a pattern recognition process, where a sequence of featurevectors is formed from a digitized incoming signal to be recognized, said pattern recognition being based upon said set ofdistortion measures. The method comprises comparing (S10) a first feature vector in said sequence with a first number (M1) oftemplates from a set of templates representing candidate patterns, based on said comparison, selecting (S12) a second number(M2) of templates from said template set, the second number being smaller than the first number, and comparing (S14) asecond feature vector only with said selected templates. The method can be implemented in a device for pattern recognition. MainClaim: A method for determining a set of distortion measures in a pattern recognition process where a sequence of featurevectors is formed from a digitized incoming signal to be recognized, said pattern recognition being based upon said set ofdistortion measures, comprising: comparing a first feature vector in said sequence with a first number of templates from a set oftemplates representing candidate patterns, based on said comparison, selecting a second number of templates from saidtemplate set, the second number being smaller than the first number, and comparing a second feature vector only with saidselected templates.

6,052,481

Automatic method for scoring and clustering prototypes of handwritten stroke-based data

Apple Computers, Inc. Grajski; Kamil A. | Chow; Yen-Lu

382 G06K 19940902 0 100%

Abstract: A system and method for processing stroke-based handwriting data for the purposes of automatically scoring andclustering the handwritten data to form letter prototypes. The present invention includes a method for processing digitizedstroke-based handwriting data of known character strings, where each of the character strings is represented by a plurality ofmathematical feature vectors. In this method, each one of the plurality of feature vectors is labelled as corresponding to aparticular character in the character strings. A trajectory is then formed for each one of the plurality of feature vectors labelledas corresponding to a particular character. After the trajectories are formed, a distance value is calculated for each pair oftrajectories corresponding to the particular character using dynamic time warping method. The trajectories which are within asufficiently small distance of each other are grouped to form a plurality of clusters. The clusters are used to define handwritingprototypes which identify subcategories of the character. MainClaim: A method for processing digitized stroke-based handwriting data of known character strings, each segment of saidknown character strings being represented by a feature vector, said method comprising the steps of:

determining a trajectory of said feature vectors in each of said known character strings corresponding to a particular character,an ith one of said trajectories Ti having n of said feature vectors, Ti ={P1i,P2i, . . . Pni }, and a jth one of said trajectories Tj

having m of said feature vectors, Tj ={P1j, P2j, . . . Pmj };

determining a separation distance di,j between each pair of said trajectories Ti and Tj by

www.patentics.com


forming a distance matrix Di,j where a (k,l) entry Di,j (k,l) of said distance matrix Di,j is equal to a distance between Pki, a kth

one of said feature vectors of said trajectory Ti, and Plj, an lth one of said feature vectors of said trajectory Tj ;

determining an entry-to-entry path in said distance matrix Di,j from Di,j (1,1) to Di,j (n,m) such that a sum of entries along said

entry-to-entry path is a minimum, and setting said sum equal to said separation distance di,j ; and

grouping said trajectories into clusters, such that said separation distance of a first pair of said trajectories in a first cluster issmaller than said separation distance of a second pair of said trajectories, said trajectories of said second pair being in differentones of said clusters.



7,689,638

Method and device for determining and outputting the similarity between two data strings

Nokia Corporation Theimer; Wolfgang | Ross; Andree

708 G06F 20021128 1 93%

Abstract: The present invention discloses a method and device for determining and outputting a similarity measure betweentwo data strings each data string comprising data entities, comprising: receiving a first data string, receiving a second datastring, which is characterized by determining consecutively following data entities in the first data string, determining therelative positions of the consecutively following data entities in the first data string, determining similar data entities with thesame order in the second data string, determining the relative positions of the determined data entities in the second datastring, determining a matching measure by determining how far the relative positions of data entities in the second data stringmatch with the relative positions of consecutively following data entities in the first data string, and outputting a similaritymeasure which corresponds to the matching measure of at least one comparison result. MainClaim: A method comprising: receiving a first data string in an electronic component, receiving a second data string in saidelectronic component, determining pairs of consecutively following data entities in said first data string in a processing unit,determining the relative positions of said pairs of consecutively following data entities in said first data string in said processingunit, allocating a position label to each of said data entities in the first data string in said processing unit, numbering same dataentities according to their relative position in accordance with the position label in said processing unit, determining similar dataentities with the same order in said second data string in said processing unit, determining the relative positions of saiddetermined data entities in said second data string in said processing unit, determining a matching measure by determining howfar the relative positions of data entities in said second data string match with the relative positions of consecutively followingdata entities in said first data string in said processing unit, and determining a similarity measure which corresponds to thematching measure of at least one comparison result in said processing unit, repeating said determination of said similaritymeasure with a number of received second data strings in said processing unit, and outputting by an interface said determinedsimilarity measures for said data strings according to the amount of similarity to said first data string, wherein said first datastring of entities and said second data string of entities are data strings relating to one of associative text string, genomeanalysis, speech recognition, and musical melody.

2007/0256189



800 C12N 20060426 6 92%


5,689,617

Speech recognition system which returns recognition results as a reconstructed language model with attached data values


Pallakoff; Matthew G. | Rodarmer; Kurt W. | Reeves; Arthur Arlo

704 G10L 19950314 0 100%

Abstract: A speech recognition system operating on a computer system, where the speech recognition system uses a languagemodel with embedded structure and attached data values, and the speech recognition system returns recognition results as areconstructed language model with embedded structure and attached data values. An application program can receive andtraverse the embedded structure of the recognition results and use the attached data values to improve the speed and accuracyof interpretation of the speech recognition results.

www.patentics.com


MainClaim: A method of speech recognition for a speech recognition system operating on a computer system, comprising thesteps of:

the speech recognition system generating a language model with embedded structure and attached data values;

the speech recognition system receiving a sound signal;

the speech recognition system processing the sound signal to extract speech features;

the speech recognition system comparing and matching the speech features to the language model for generating a recognitionresult having the embedded structure and attached data values of the language model for those portions of the language modelmatched to the speech features.








6,122,616 Method and apparatus for diphone aliasing

Apple Computer, Inc. Henton; Caroline G.

704 G10L 19960703 0 100%

Abstract: The present invention improves upon electronic speech synthesis using pre-recorded segments of speech to fill in for other missing segments of speech. The formalized aliasing approach of the present invention overcomes the ad hoc aliasingapproach of the prior art which oftentimes generated less than satisfactory speech synthesis sound output. By formalizing therelationship between missing speech sound samples and available speech sound samples, the present invention provides astructured approach to aliasing which results in improved synthetic speech sound quality. Further, the formalized aliasingapproach of the present invention can be used to lessen storage requirements for speech sound samples by only storing asmany sound samples as memory capacity can support. MainClaim: A method for speech synthesis in an electronic speech synthesis system, the speech synthesis method comprising:

a) storing in a memory of the electronic speech synthesis system a voice table comprised of a set of phonetic waveforms, eachphonetic waveform of the set of phonetic waveforms corresponding to a demi-diphone of the voice table;

b) receiving as an input to the electronic speech synthesis system a phonetic string representative of speech to be synthesizedby electronic speech system, the phonetic string comprising diphones, the diphones comprising demi-diphones;

c) generating synthetic speech of the phonetic string representative of speech in the electronic speech synthesis system byoutputting stored voice table phonetic waveforms by:

www.patentics.com


i) retrieving a stored voice table phonetic waveform corresponding to a demi-diphone of the input phonetic string representative of speech in the case of the demi-diphone of the phonetic string representative of speech having a phonetic waveform in thevoice table corresponding to the demi-diphone;

ii) retrieving a stored voice table phonetic waveform not corresponding to a demi-diphone of the input phonetic string representative of speech in the case of the demi-diphone of the phonetic string representative of speech not having a phonetic waveform in the voice table corresponding to the demi-diphone by locating a substitute demi-diphone of the voice table having a corresponding stored voice table phonetic waveform which has phonetic features meeting:

A) a threshold set of phonetic features of the demi-diphone not having a corresponding stored voice table phonetic waveform,wherein the threshold set describes a minimum set of characteristics that must be share d by:

6,546,369


Nokia Corporation Buth; Peter | Dufhues; Frank

704 G10L 20000505 3 94%

Abstract: The invention specifies a simple reproduction method with improved pronunciation for voice-controlled systems with text-based speech synthesis even when the stored train of characters to be synthesized does not follow the general rules ofspeech reproduction. According to the invention, the method of "copying" the original spoken input text into the otherwisesynthesized reproduction text, which is the current state of the art, is avoided, which will significantly increase the acceptance ofthe user of the voice-controlled system due to the process invented. More specifically, when there is actual spoken speech inputthat corresponds to a stored train of characters, the converted train of characters is compared to the speech input beforereproduction of the train of characters described phonetically according to general rules and converted to a purely syntheticform. When the converted train of characters is found to deviate from the speech input by a value above a threshold value, atleast one variation of the converted train of characters is created. This variation is then output instead of the converted train ofcharacters as long as this variation deviates from the speech input by a value below the threshold value. MainClaim: A reproduction method for voice-controlled systems with text-based speech synthesis, comprising the steps of:






2007/0016421



704 G10L 20050712 4 93%


7,043,431



704 G10L 20010831 6 92%


5,768,422 Method for training an adaptive statistical classifier to discriminate

Apple Computer, Inc. Yaeger; Larry S. 382 G06K 19950808 0 100%

www.patentics.com


against inproper patterns

Abstract: A statistical classifier that can be used for pattern recognition is trained to recognize negative, or improper patternsas well as proper patterns that are positively associated with desired output classes. A set of training samples includes both thenegative and positive patterns, and target output values for the negative patterns are set so that no recognized class isindicated. The negative patterns are selected for training with less frequency than the positive patterns, and their effect ontraining is also modified, so that training is focused more heavily on positive patterns. MainClaim: A method for training a statistical classifier to estimate the probabilities that input patterns are associated witheach of a predetermined set of classes, comprising the steps of:

selecting a first, positive set of training patterns each associated with a class in said set;

selecting a second, negative set of training patterns not associated with any class in said set;

combining said first set and said second sets into a training set;

processing training patterns in said training set through a process comprising the following steps for each training pattern that isprocessed;

computing a set of target values corresponding to each class in said set of classes, such that:

for a training pattern from said first, positive set, the target value corresponding to its associated class is substantially equal to afirst predetermined value, and the other target values of said set of target values are all substantially equal to a secondpredetermined value that is substantially different from said first predetermined value, and;

for a training pattern from said second set, negative set, all of said target values are substantially equal to said secondpredetermined value; and

providing said training pattern and said set of target values to a statistical classifier and training said classifier in accordancetherewith.

7,269,556 Pattern recognition Nokia CorporationKiss; Imre | Vasilache; Marcel

704 G10L 20030326 9 94%

Abstract: Pattern recognition, wherein a sequence of feature vectors is formed from a digitized incoming signal, the featurevectors comprising feature vector components, and at least one feature vector is compared with templates of candidate patternsby computing a distortion measure. A control signal based on at least one time-dependent variable of the recognition process is formulated, and the distortion measure is computed using only a subset of the vector components of the feature vector, thesubset being chosen in accordance with said control signal. This reduces the computational complexity of the computation, asthe dimensionality of the vectors involved in the computation is effectively reduced. Although such a dimension reductiondecreases the computational need, it has been found not to significantly impair the classification performance. MainClaim: A method for pattern recognition, comprising: forming a sequence of feature vectors from a digitized incomingsignal, said feature vectors comprising feature vector components, comparing at least one feature vector with templates ofcandidate patterns by computing a distortion measure including distortion measure contributions, formulating a control signalbased on at least one time-dependent variable of the recognition process, and for said at least one feature vector, computingonly a subset of said distortion measure contributions using the vector components of said at least one feature vector, saidsubset being chosen in accordance with said control signal.

2004/0039572 Pattern recognition Nokia Corporation Kiss, Imre | Vasilache, Marcel

704 G10L 20030326 11 94%

Abstract: Pattern recognition, wherein a sequence of feature vectors is formed from a digitized incoming signal, the featurevectors comprising feature vector components, and at least one feature vector is compared with templates of candidate patternsby computing a distortion measure. According to the invention, a control signal based on at least one time-dependent variable of the recognition process is formulated, and the distortion measure is computed using only a subset of the vector components ofthe feature vector, the subset being chosen in accordance with said control signal. This reduces the computational complexity ofthe computation, as the dimensionality of the vectors involved in the computation is effectively reduced. Although such adimension reduction decreases the computational need, it has been found not to significantly impair the classificationperformance. MainClaim: A method for pattern recognition, comprising: forming a sequence of feature vectors from a digitized incomingsignal, said feature vectors comprising feature vector components, comparing at least one feature vector with templates ofcandidate patterns by computing a distortion measure including distortion measure contributions, formulating a control signalbased on at least one time-dependent variable of the recognition process, and for said at least one feature vector, computingonly a subset of said distortion measure contributions using the vector components of said at least one feature vector, saidsubset being chosen in accordance with said control signal.



www.patentics.com


5,805,730

Method for training an adaptive statistical classifier with improved learning of difficult samples

Apple Computer, Inc.Yaeger; Larry S. | Lyon; Richard F. 382 G06K 19950808 0 100%

Abstract: A statistical classifier that can be used for pattern recognition is trained to recognize negative, or improper patternsas well as proper patterns that are positively associated with desired output classes. A set of training samples includes both thenegative and positive patterns, and target output values for the negative patterns are set so that no recognized class isindicated. The negative patterns are selected for training with less frequency than the positive patterns, and their effect ontraining is also modified, so that training is focused more heavily on improper patterns. MainClaim: A method for training a statistical classifier to estimate the probability that an input pattern is associated with apredetermined class, comprising the steps of:

defining a set of training patterns, each of which is labeled as belonging to a respective one of a plurality of predeterminedclasses;

assigning a probability of usage factor to said training patterns from said set for input to the classifier;

selecting individual training patterns;

selectively processing the selected training patterns in the classifier, or skipping the selected patterns, in accordance with saidprobability of usage factor which is based upon whether the samples have been properly classified previously;

detecting whether the classifier produces an output value which correctly identifies the class to which a processed patternbelongs; and

modifying the probability of usage factor for correctly identified patterns to be different from a probability of usage factorassigned to incorrectly identified patterns.

7,269,556 Pattern recognition Nokia CorporationKiss; Imre | Vasilache; Marcel 704 G10L 20030326 9 94%



704 G10L 20030326 11 94%




5,805,731 Adaptive statistical classifier which provides reliable estimates or

Apple Computer, Inc.Yaeger; Larry S. |

382 G06K 19950808 0 100%

www.patentics.com


output classes having low probabilities

Lyon; Richard F.

Abstract: A statistical classifier for pattern recognition, such as a neural network, produces a plurality of output signalscorresponding to the probabilities that a given input pattern belongs in respective classes. The classifier is trained in a mannersuch that low probabilities which pertain to classes of interest are not suppressed too greatly. This is achieved by modifying theamount by which error signals, corresponding to classes which are incorrectly identified, are employed in the training process,relative to error signals corresponding to the correct class. As a result, output probabilities for incorrect classes are not forced toa low value as much as probabilities for correct classes are raised. MainClaim: A method for training a statistical classifier, comprising the following steps:

selecting a training sample from a collection of training samples, each such training sample being associated with a label classfrom a predetermined set of distinct classes;

providing data pertaining to said training sample as an input signal to the classifier;

processing said data within the classifier in accordance with weight values to produce a plurality of output signals whichrespectively correspond to different classes in said predetermined set of distinct classes,

providing a plurality of target signals which respectively correspond to different classes in said predetermined set of distinctclasses, wherein the target signal corresponding to said label class is assigned a first predetermined signal value, and the othersof said target signals are assigned a second predetermined signal value;

determining error signals corresponding to each of said distinct classes, based on differences between said output signals andsaid target signals;

multiplying said error signal which corresponds to said label class by a factor β, where β>1; and

adjusting said weight values in accordance with said modified error signals.

7,269,556 Pattern recognition Nokia Corporation Kiss; Imre | Vasilache; Marcel

704 G10L 20030326 9 94%


2004/0039572 Pattern recognition Nokia CorporationKiss, Imre | Vasilache, Marcel 704 G10L 20030326 11 94%




Merging of language models from two or

Pallakoff; Matthew G. | Rodarmer;

www.patentics.com


5,651,096 more application programs for a speech recognition system

Apple Computer, Inc.Kurt W. | Reeves; Arthur Arlo 704 G10L 19950314 0 100%

Abstract: A speech recognition system operating on a computer system, which uses a single speech recognizer for all of thecurrently running application programs and provides a way of efficiently determining the proper destination application programfor recognized speech. The speech recognizer uses a language model formed from the merging of the language models from twoor more application programs. The merged language model includes data values indicating which application program's languagemodel was the source of the language model elements so that when those elements are recognized, recognition results can bedirected to that application program. MainClaim: A method of speech recognition for a speech recognition system operating on a computer system, comprising thesteps of:

the speech recognition system generating a merged language model from first and second language models corresponding tofirst and second application programs, and including a data value for an element of the merged language model indicating thatthe element came from one of the first and second language models;

the speech recognition system using the merged language model to identify elements which match a speech signal received atthe speech recognition system;

the speech recognition system, for each identified element, using the included data value to determine from which of the firstand second language models the identified element came; and

the speech recognition system directing a recognition result to the application program corresponding to that language model.









5,796,863

Method for training an adaptive statistical classifier to balance unigram prior factors

Apple Computer, Inc. Lyon; Richard F. 382 G06T 19950808 0 100%

Abstract: A statistical classifier is trained in a manner to remove biasing due to unequal frequencies of unigram priors. Therelative frequencies of all classes in a training set of sample patterns is determined. Training patterns are then selected from theset and skipped or repeated in dependence upon the relative frequency of the class to which they belong. In this manner, thepresentation of samples is balanced across the classes. MainClaim: A method for training a statistical classifier to produce a set of probability estimates more nearly proportional to P

www.patentics.com


(x|ci) than to P(ci |x), for any hypothetical input pattern x for each class ci of a set of predetermined classes, using a set of

training patterns in which the frequencies of occurrence of said classes are substantially unequal, comprising the steps of:

determining an original relative frequency of occurrence for each class with respect to all of the classes, on the basis of thetraining patterns in said set;

selecting training patterns sequentially from said set of training patterns in a manner determined in accordance with saidoriginal relative frequencies, to thereby reduce disparities between relative frequencies of classes in the sequence of saidsequentially selected training patterns, compared to said original relative frequencies; and

supplying said selected training patterns with reduced frequency disparities sequentially to a statistical classifier to train theclassifier to estimate the probability P(ci |x).


704 G10L 20030326 9 94%






5,878,396 Method and apparatus for synthetic speech in facial animation

Apple Computer, Inc.Henton; Caroline G.

704 G10L 19980205 0 100%

Abstract: The present invention utilizes a novel approach to facial imaging synchronized with synthetic speech. Mapping visemeimages to a diphone requires the same `transitioning` in that the imaging associated with a diphone is not a static image, butrather, a series of images which dynamically depict, with lip, teeth and tongue positioning, the sound transition occurring in therelevant diphone. Each series of lip, teeth, and tongue positioning transitions is referred to herein as a `diseme.` A diseme (likea diphone) thus begins somewhere during one viseme (phone) and ends somewhere during a following viseme (phone). Due tolip, teeth and tongue position imaging commonality, phones are grouped into archiphonic families. A single diseme, whichdepicts the transition from a phone in one archiphonic family to another phone in a different archiphonic family, can be used fordisplaying the transition between any phone in the first archiphonic family to any phone in the second archiphonic family. In thisway, the approximately 1800 diphones in General American English can be visually depicted by a relatively small number ofdisemes, again, due to their similarity in lip, teeth, and tongue image positioning. This results in a mapping between syntheticspeech and facial imaging which more accurately reflects the speech transitional movements of a realistic speaker image. MainClaim: A method for synchronizing facial images to synthetic speech comprising:

a) storing a sequence of facial images from a viseme in a first archiphonic group to a viseme in a second archiphonic group;

www.patentics.com


b) displaying the sequence of facial images from the viseme in the first archiphonic group to the viseme in the secondarchiphonic group if a phone from the first archiphonic group is followed by a phone from the second archiphonic group in thesynthetic speech.

6,546,369


Nokia CorporationButh; Peter | Dufhues; Frank 704 G10L 20000505 3 93%

Abstract: The invention specifies a simple reproduction method with improved pronunciation for voice-controlled systems with text-based speech synthesis even when the stored train of characters to be synthesized does not follow the general rules ofspeech reproduction. According to the invention, the method of "copying" the original spoken input text into the otherwisesynthesized reproduction text, which is the current state of the art, is avoided, which will significantly increase the acceptance of the user of the voice-controlled system due to the process invented. More specifically, when there is actual spoken speech inputthat corresponds to a stored train of characters, the converted train of characters is compared to the speech input beforereproduction of the train of characters described phonetically according to general rules and converted to a purely syntheticform. When the converted train of characters is found to deviate from the speech input by a value above a threshold value, atleast one variation of the converted train of characters is created. This variation is then output instead of the converted train ofcharacters as long as this variation deviates from the speech input by a value below the threshold value. MainClaim: A reproduction method for voice-controlled systems with text-based speech synthesis, comprising the steps of:






2007/0016421



704 G10L 20050712 4 92%


5,903,884

Method for training a statistical classifier with reduced tendency for overfitting

Apple Computer, Inc.Lyon; Richard F. | Stafford; William 706 G06F 19950808 0 100%

Abstract: To prevent overfitting a neural network to a finite set of training samples, random distortions are dynamically appliedto the samples each time they are applied to the network during a training session. A plurality of different types of distortionscan be applied, which are randomly selected each time a sample is applied to the network. Alternatively, a combination of two ormore types of distortion can be applied each time, with the amount of distortion being randomly varied for each type. MainClaim: A method for training a statistical classifier to recognize input patterns that belong to respective predeterminedclasses, utilizing a set of training samples which are respectively associated with said classes, comprising the following stepswhich are repeated over a large number of iterations:

selecting a training sample from said set of training samples;

producing a set of distortion parameters;

selectively distorting said training sample in accordance with said distortion parameters to compute a classifier input pattern;and

training the classifier using said classifier input pattern.


Abstract: Pattern recognition, wherein a sequence of feature vectors is formed from a digitized incoming signal, the featurevectors comprising feature vector components, and at least one feature vector is compared with templates of candidate patternsby computing a distortion measure. A control signal based on at least one time-dependent variable of the recognition process is formulated, and the distortion measure is computed using only a subset of the vector components of the feature vector, the

www.patentics.com


subset being chosen in accordance with said control signal. This reduces the computational complexity of the computation, asthe dimensionality of the vectors involved in the computation is effectively reduced. Although such a dimension reductiondecreases the computational need, it has been found not to significantly impair the classification performance. MainClaim: A method for pattern recognition, comprising: forming a sequence of feature vectors from a digitized incomingsignal, said feature vectors comprising feature vector components, comparing at least one feature vector with templates ofcandidate patterns by computing a distortion measure including distortion measure contributions, formulating a control signalbased on at least one time-dependent variable of the recognition process, and for said at least one feature vector, computingonly a subset of said distortion measure contributions using the vector components of said at least one feature vector, saidsubset being chosen in accordance with said control signal.





6,178,397

System and method for using a correspondence table to compress a pronunciation guide

Apple Computer, Inc. Fredenburg; Timothy

704 G06F 19981008 0 100%

Abstract: Parsing routines extract from a conventional pronunciation dictionary an entry, which includes a dictionary word anddictionary phonemes representing the pronunciation of the dictionary word. A correspondence table is used to compress thepronunciation dictionary. The correspondence table includes correspondence sets for a particular language, each set having acorrespondence text entry, a correspondence phoneme entry representing the pronunciation of the correspondence text entryand a unique correspondence set identifying symbol. A matching system compares a dictionary entry with the correspondencesets, and replaces the dictionary entry with the symbols representing the best matches. In the absence of a match, symbolsrepresenting silent text or unmatched phonemes can be used. The correspondence symbols representing the best matchesprovide compressed pronunciation dictionary entries. The matching system also generates decoder code sets for subsequentlytranslating the symbol sets. A decoder system uses the decoder code sets for translating symbol sets in the compressedpronunciation dictionary to generate phonemes corresponding to selected text. MainClaim: A computer data storage medium storing a correspondence table which enables compression of a pronunciationdictionary, the correspondence table comprising:

a plurality of correspondence sets each including

a correspondence text entry that is part of a dictionary word;

a correspondence phoneme entry representing the pronunciation of the correspondence text entry; and

a correspondence symbol for identifying the correspondence set,

wherein at least one said correspondence symbol forms a symbol set for use as a compressed data entry in generating saidcompressed pronunciation dictionary.



Abstract: The invention relates to pre-processing of a pronunciation dictionary for compression in a data processing device, the pronunciation dictionary comprising at least one entry, the entry comprising a sequence of character units and a sequence ofphoneme units. According to one aspect of the invention the sequence of character units and the sequence of phoneme units arealigned using a statistical algorithm. The aligned sequence of character units and aligned sequence of phoneme units areinterleaved by inserting each phoneme unit at a predetermined location relative to the corresponding character unit. MainClaim: An electronic device comprising a processing unit and a memory for storing a pre-processed pronunciation dictionary including a first set of units having character units and a second set of units having phoneme units, the units of thefirst set and the units of the second set being aligned and interleaved by having each phoneme unit at a predetermined location

www.patentics.com


relative to the corresponding character unit, wherein the electronic device is configured to find a matching entry for a text stringinput from the pre-processed pronunciation dictionary using said first set of units of the entry from the predetermined locations; the electronic device is configured to select from said matching entry phoneme units of said second set of units frompredetermined locations; and the electronic device is configured to concatenate the selected phoneme units into a sequence ofphoneme units.

7,181,388 Method for compressing dictionary data






6,480,621 Statistical classifier with reduced weight memory requirements

Apple Computer, Inc. Lyon; Richard F. 382 G06K 19950808 0 100%

Abstract: A neural network has reduced requirements for storing intermodal weight values, as a result of a dual-precision training process. In the forward propagation of training samples, low-resolution weight values are employed. During back-propagation of errors to train the network, higher-resolution values are used. After training, only the lower resolution values need to be stored for further run-time operation, thereby reducing memory requirements. MainClaim: A method for training and operating a neural network of the type having plural layers of nodes where the nodes ofone layer are connected to the nodes of a succeeding layer, and each connection has a weight value associated with it,comprising the steps of:

storing a first set of digital weight values that are respectively associated with said connections, each of the weight values insaid first set having a first predetermined number of bits;

storing a second set of digital weight values that are respectively associated with said connections, each of the weight values insaid second set having a second predetermined number of bits;

supplying a sample training pattern to the neural network and generating a set of node activation values including output valuesin accordance with said first set of digital weight values;

determining a set of error values based on the difference between the output values and a set of target values;

computing a set of weight changes dependent on the error values, the node activation values, and the current values of at leastsaid first set of weight values, said weight changes having a greater number of bits of precision than said first number of bits;

adding said weight changes to a set of digital values formed by concatenating said first set of weight values as high-order parts and said second set of weight values as corresponding low-order fraction parts, to produce a set of high-precision updated weights;

substituting said first number of bits of the high-order bits of said high-precision updated weights for said first set of digital weight values; and

substituting said second number of bits of the subsequent bits of said high-precision updated weights for said second set of digital weight values.


704 G10L 20030326 9 94%

Abstract: Pattern recognition, wherein a sequence of feature vectors is formed from a digitized incoming signal, the featurevectors comprising feature vector components, and at least one feature vector is compared with templates of candidate patternsby computing a distortion measure. A control signal based on at least one time-dependent variable of the recognition process is formulated, and the distortion measure is computed using only a subset of the vector components of the feature vector, thesubset being chosen in accordance with said control signal. This reduces the computational complexity of the computation, as

www.patentics.com


the dimensionality of the vectors involved in the computation is effectively reduced. Although such a dimension reductiondecreases the computational need, it has been found not to significantly impair the classification performance. MainClaim: A method for pattern recognition, comprising: forming a sequence of feature vectors from a digitized incomingsignal, said feature vectors comprising feature vector components, comparing at least one feature vector with templates ofcandidate patterns by computing a distortion measure including distortion measure contributions, formulating a control signalbased on at least one time-dependent variable of the recognition process, and for said at least one feature vector, computingonly a subset of said distortion measure contributions using the vector components of said at least one feature vector, saidsubset being chosen in accordance with said control signal.


704 G10L 20030326 11 93%




RE40,458


Apple Inc. Fredenburg; Timothy

704 G06F 20030113 0 100%

Abstract: Parsing routines extract from a conventional pronunciation dictionary an entry, which includes a dictionary word anddictionary phonemes representing the pronunciation of the dictionary word. A correspondence table is used to compress thepronunciation dictionary. The correspondence table includes correspondence sets for a particular language, each set having acorrespondence text entry, a correspondence phoneme entry representing the pronunciation of the correspondence text entryand a unique correspondence set identifying symbol. A matching system compares a dictionary entry with the correspondencesets, and replaces the dictionary entry with the symbols representing the best matches. In the absence of a match, symbolsrepresenting silent text or unmatched phonemes can be used. The correspondence symbols representing the best matchesprovide compressed pronunciation dictionary entries. The matching system also generates decoder code sets for subsequentlytranslating the symbol sets. A decoder system uses the decoder code sets for translating symbol sets in the compressedpronunciation dictionary to generate phonemes corresponding to selected text. MainClaim: A computer .[.data storage medium storing a correspondence table which enables compression of.]. .Iadd.programproduct for compressing .Iaddend.a pronunciation dictionary, the .Iadd.computer program product comprising a computer-readable medium containing computer program code for: generating a .Iaddend.correspondence table comprising: a plurality ofcorrespondence sets each including a correspondence text entry that is part of a dictionary word; a correspondence phonemeentry representing the pronunciation of the correspondence text entry; and a correspondence symbol for identifying thecorrespondence set, wherein at least one said correspondence symbol forms a symbol set for use as a compressed data entry ingenerating said compressed pronunciation dictionary.






Abstract: Systems and methods are provided for compressing data models, for example, N-gram language models used in

www.patentics.com


speech recognition applications. Words in the vocabulary of the language model are assigned to classes of words, for example,by syntactic criteria, semantic criteria, or statistical analysis of an existing language model. After word classes are defined, thefollower lists for words in the vocabulary may be stored as hierarchical sets of class indexes and word indexes within each class.Hierarchical word indexes may reduce the storage requirements for the N-gram language model by more efficiently representing multiple words in a single list in the same follower list. MainClaim: A method for storing an N-gram model in a memory of a device, comprising:identifying a plurality of wordclasses;receiving a vocabulary of words, wherein each word in the vocabulary is associated with at least one of the plurality ofclasses;associating a follower list with each word in the vocabulary;storing in the memory information associated with a firstword in the vocabulary, the information comprising:(1) a first class index corresponding to a class in which at least a subset ofthe follower list is a member, and(2) a first plurality of word indexes corresponding to at least a subset of the follower list for thefirst word, wherein said word indexes are indexed based on the first class index.



6,697,779

Combined dual spectral and temporal alignment method for user authentication by voice


Bellegarda; Jerome | Naik; Devang | Neeracher; Matthias | Silverman; Kim

704 G10L 20000929 0 100%

Abstract: A method and system for training a user authentication by voice signal are described. In one embodiment, duringtraining, a set of all spectral feature vectors for a given speaker is globally decomposed into speaker-specific decomposition units and a speaker-specific recognition unit. During recognition, spectral feature vectors are locally decomposed into speaker-specific characteristic units. The speaker-specific recognition unit is used together with selected speaker-specific characteristic units to compute a speaker-specific comparison unit. If the speaker-specific comparison unit is within a threshold limit, then the voice signal is authenticated. In addition, a speaker-specific content unit is time-aligned with selected speaker-specific characteristic units. If the alignment is within a threshold limit, then the voice signal is authenticated. In one embodiment, ifboth thresholds are satisfied, then the user is authenticated. MainClaim: A method of training a user authentication by voice signal, the user authentication based on measuring diagonalitydeviations, the method comprising:

globally decomposing a set of a plurality of feature vectors into at least one speaker-specific decomposition unit; and

computing a speaker-specific recognition unit from the at least one speaker-specific decomposition unit for subsequent derivation of the diagonality deviations.

2003/0204398

On-line parametric histogram normalization for noise robust speech recognition

Nokia Corporation Haverinen, Hemmo | Kiss, Imre

704 G10L 20020430 3 95%

Abstract: A method for improving noise robustness in speech recognition, wherein a front-end is used for extracting speech feature from an input speech and for providing a plurality of scaled spectral coefficients. The histogram of the scaled spectralcoefficients is normalized to the histogram of a training set using Gaussian approximations. The normalized spectral coefficientsare then converted into a set of cepstrum coefficients by a decorrelation module and further subjected to ceptral domainfeature-vector normalization. MainClaim: A method of improving noise robustness in a speech recognition system, the system including a front-end for extracting speech features from an input speech and a back-end for speech recognition based on the extracted features, wherein the front-end comprises: means, responsive to the input speech, for providing data indicative of the input speech at aplurality of time instants; means, responsive to the data segments, for spectrally converting the data segments into a pluralityof spectral coefficients having a related probability distribution of values for providing spectral data indicative of the spectralcoefficients; and means, responsive to the spectral data, for performing decorrelation conversion on the spectral coefficients forproviding the extracted features, characterized by obtaining a parametric representation of the probability distribution of valuesof the spectral coefficients; modifying the parametric representation based on one or more reference values; and adjusting atleast one of the spectral coefficients based on the modified parametric representation for changing the spectral data prior to thedecorrelation conversion.

7,197,456


Nokia CorporationHaverinen; Hemmo | Kiss; Imre 704 G10L 20020430 2 95%

Abstract: A method for improving noise robustness in speech recognition, wherein a front-end is used for extracting speech feature from an input speech and for providing a plurality of scaled spectral coefficients. The histogram of the scaled spectralcoefficients is normalized to the histogram of a training set using Gaussian approximations. The normalized spectral coefficientsare then converted into a set of cepstrum coefficients by a decorrelation module and further subjected to ceptral domainfeature-vector normalization. MainClaim: A method, comprising: providing in a speech recognition system speech data indicative of an input speech at a

www.patentics.com


plurality of time instants based on the input speech, the speech data comprising a plurality of data segments; spectrallyconverting the data segments into a plurality of spectral coefficients having a probability distribution of values in spectral domainfor providing spectral data indicative of the spectral coefficients based on the data segments; obtaining a parametricrepresentation of the probability distribution of values of the spectral coefficients based on the spectral data; modifying theparametric representation based on one or more reference values for providing a modified parametric representation; adjustingat least one of the spectral coefficients in the spectral domain based on the modified parametric representation for changing thespectral data; and performing decorrelation conversion on the changed spectral data for providing extracted features of theinput speech.




5,845,238


Apple Computer, Inc. Fredenburg; Timothy

704 G06F 19960618 0 100%

Abstract: Parsing routines extract from a conventional pronunciation dictionary an entry, which includes a dictionary word anddictionary phonemes representing the pronunciation of the dictionary word. A correspondence table is used to compress thepronunciation dictionary. The correspondence table includes correspondence sets for a particular language, each set having acorrespondence text entry, a correspondence phoneme entry representing the pronunciation of the correspondence text entryand a unique correspondence set identifying symbol. A matching system compares a dictionary entry with the correspondencesets, and replaces the dictionary entry with the symbols representing the best matches. In the absence of a match, symbolsrepresenting silent text or unmatched phonemes can be used. The correspondence symbols representing the best matchesprovide compressed pronunciation dictionary entries. The matching system also generates decoder code sets for subsequentlytranslating the symbol sets. A decoder system uses the decoder code sets for translating symbol sets in the compressedpronunciation dictionary to generate phonemes corresponding to selected text. MainClaim: A system for compressing a pronunciation guide which includes a plurality of guide entries, each entry having aguide word and at least one associated phoneme representing the pronunciation of the word, the system comprising:

memory storing

(1) a correspondence table which includes a plurality of correspondence sets, each set having

(i) a text entry,

(ii) a phoneme entry representing a pronunciation of the text entry, and

(iii) a symbol identifying the correspondence set; and

(2) a matching system for comparing a selected guide word and the associated phonemes with correspondence sets, and storingcorrespondence symbols which represent matching correspondence sets as a compressed pronunciation guide entry in thememory; and

a processing unit coupled to the memory for controlling the operations of the matching system.




www.patentics.com





7,181,388 Method for compressing dictionary data Nokia Corporation Tian; Jilei 704 G06F 20021111 3 95%


5,617,486 Continuous reference adaptation in a pattern recognition system


Chow; Yen-Lu | deSouza; Peter V. | Fineberg; Adam B. | Hon; Hsiao-Wuen

382 G06K 19951127 0 100%

Abstract: A pattern recognition system which continuously adapts reference patterns to more effectively recognize input datafrom a given source. The input data is converted to a set or series of observed vectors and is compared to a set of MarkovModels. The closest matching Model is determined and is recognized as being the input data. Reference vectors which areassociated with the selected Model are compared to the observed vectors and updated ("adapted") to better represent or matchthe observed vectors. This updating method retains the value of these observed vectors in a set of accumulation vectors in orderto base future adaptations on a broader data set. When updating, the system also may factor in the values corresponding toneighboring reference vectors that are acoustically similar if the data set from the single reference vector is insufficient for anaccurate calculation. Every reference vector is updated after every input; thus reference vectors neighboring an updatedreference vector may also be updated. The updated reference vectors are then stored by the computer system for use inrecognizing subsequent inputs. MainClaim: An apparatus for pattern recognition of data input comprising:

means for representing said data input as a set of observed vectors, wherein individual observed vectors of said set of observedvectors represent said data input at a different point in time;

means for comparing a first subset of said set of observed vectors to a set of models by comparing a set of reference vectorsassociated with said set of models to said set of observed vectors and identifying a resultant model which most closely matchessaid first subset, wherein said resultant model is one of said set of models;

means for creating a set of accumulation vectors wherein individual accumulation vectors of said set of accumulation vectorscorrespond to individual reference vectors of said set of reference vectors, and wherein a first accumulation vector of said set ofaccumulation vectors stores a first observed vector, and wherein said first observed vector was previously associated with a firstreference vector of said set of reference vectors;

means for updating said set of reference vectors to create an updated set of reference vectors associated with said set of modelsto more accurately represent said data input, wherein said means for updating combines said first accumulation vector with saidfirst reference vector; and

means for utilizing said updated set of reference vectors in comparing subsequent data input streams to said set of models.


Abstract: A method for determining a set of distortion measures in a pattern recognition process, where a sequence of featurevectors is formed from a digitized incoming signal to be recognized, said pattern recognition being based upon said set ofdistortion measures. The method comprises comparing (S10) a first feature vector in said sequence with a first number (M1) oftemplates from a set of templates representing candidate patterns, based on said comparison, selecting (S12) a second number(M2) of templates from said template set, the second number being smaller than the first number, and comparing (S14) asecond feature vector only with said selected templates. The method can be implemented in a device for pattern recognition. MainClaim: A method for determining a set of distortion measures in a pattern recognition process where a sequence of feature vectors is formed from a digitized incoming signal to be recognized, said pattern recognition being based upon said set ofdistortion measures, comprising: comparing a first feature vector in said sequence with a first number of templates from a set oftemplates representing candidate patterns, based on said comparison, selecting a second number of templates from saidtemplate set, the second number being smaller than the first number, and comparing a second feature vector only with saidselected templates.

www.patentics.com


5,692,104 Method and apparatus for detecting end points of speech activity

Apple Computer, Inc.Chow; Yen-Lu | Staats; Erik P. 704 G10L 19940927 0 100%

Abstract: A method and apparatus for detecting end points of speech activity in an input signal using spectral representationvectors performs beginning point detection using spectral representation vectors for the spectrum of each sample of the inputsignal and a spectral representation vector for the steady state portion of the input signal. The beginning point of speech isdetected when the spectrum diverges from the steady state portion of the input signal. Once the beginning point has beendetected, the spectral representation vectors of the input signal are used to determine the ending point of the sound in thesignal. The ending point of speech is detected when the spectrum converges towards the steady state portion of the inputsignal. After both the beginning and ending of the sound are detected, vector quantization distortion can be used to classify thesound as speech or noise. MainClaim: A method of detecting speech activity in a data input stream comprising the steps of:

(a) generating a set of spectral representation vectors to represent the data input stream, wherein each spectral representationvector of the set of spectral representation vectors represents a predetermined portion of the data input stream;

(b) generating a steady state spectral representation vector indicative of the state of the data input stream at a firstpredetermined portion of the data input stream;

(c) comparing a spectral representation vector corresponding to the first predetermined portion of the data input stream to thesteady state spectral representation vector;

(d) determining a first end point of speech activity when the set of spectral representation vectors diverges from the steadystate spectral representation vector; and

(e) determining a second end point of speech activity when a predetermined number of spectral representation vectors of theset of spectral representation vectors are within a predetermined distance of the steady state spectral representation vector fora continuous predetermined period of time.

6,772,117 Method and a device for recognizing speech


Laurila; Kari | Viikki; Olli

704 G10L 19980409 2 96%

Abstract: In a speech recognition method and apparatus, according to the present invention, feature vectors produced by ananalysing unit of a speech recognition device are modified for compensating the effects of noise. According to the invention,feature vectors are normalized using a sliding normalization buffer (31). By means of the method according to the invention, theperformance of the speech recognition device improves in situations, wherein the speech recognition device's training phase hasbeen carried out in a noise environment that differs from the noise environment of the actual speech recognition phase. MainClaim: A method for recognising speech, wherein a recognisable speech signal is divided in time into successive frames ofspecific length, each speech frame is analysed for producing at least one parameter per frame, illustrating the speech signal,said parameters, relating to each frame, are stored in a sliding buffer for minimizing the delay due to the normalization processfor calculation of normalisation coefficients for each frame, said parameters are modified utilising said normalisation coefficientsand speech recognition is carried out utilising the modified parameters, wherein only part of the successive parameters arestored periodically and at least one parameter is modified on the basis of the parameters stored periodically in order to producesaid modified parameter, and for said modification, a standard deviation of said periodically stored parameters is defined,wherein only part of the stored parameters are used at the beginning of the speech recognition.

2008/0082320

APPARATUS, METHOD AND COMPUTER PROGRAM PRODUCT FOR ADVANCED VOICE CONVERSION

Nokia CorporationPopa; Victor | Nurminen; Jani K. | Tian; Jilei

704 G10L 20060929 2 96%

Abstract: An apparatus is provided that includes a converter for training a voice conversion model for converting sourceencoding parameters characterizing a source speech signal associated with a source voice into corresponding target encodingparameters characterizing a target speech signal associated with a target voice. To reduce the affect of noise on the voiceconversion model, the converter may be configured for receiving sequences of source and target encoding parameters, and trainthe model without one or more frames of the source and target speech signals that have energies less than a threshold energy.After conversion of the respective parameters, then, the converter, a decoder or another component may be configured forreducing the energy of one or more frames of the target speech signal that have an energy less than the threshold energy,where the threshold value may be adaptable based upon models of speech frames and non-speech frames. MainClaim: An apparatus comprising:a converter for training a voice conversion model for converting at least some informationcharacterizing a source speech signal into corresponding information characterizing a target speech signal, wherein the sourcespeech signal is associated with a source voice, and the target speech signal is a representation of the source speech signalassociated with a target voice, and wherein the converter is configured for training each voice conversion model by:receivinginformation characterizing each frame in a sequence of frames of a source speech signal and information characterizing eachframe in a sequence of frames of a target speech signal, each frame of the source and target speech signals having anassociated energy;comparing the energies of the frames of the source and target speech signals to a threshold energy value,and identifying one or more frames of the source and target speech signals that have energies less than the threshold energyvalue; andtraining the voice conversion model based upon the information characterizing at least some of the frames in thesequences of frames of the source and target speech signals, the conversion model being trained without the informationcharacterizing at least some of the identified frames.

2003/0204398


Nokia CorporationHaverinen, Hemmo | Kiss, Imre 704 G10L 20020430 3 95%

Abstract: A method for improving noise robustness in speech recognition, wherein a front-end is used for extracting speech feature from an input speech and for providing a plurality of scaled spectral coefficients. The histogram of the scaled spectralcoefficients is normalized to the histogram of a training set using Gaussian approximations. The normalized spectral coefficientsare then converted into a set of cepstrum coefficients by a decorrelation module and further subjected to ceptral domainfeature-vector normalization.

www.patentics.com


MainClaim: A method of improving noise robustness in a speech recognition system, the system including a front-end for extracting speech features from an input speech and a back-end for speech recognition based on the extracted features, wherein the front-end comprises: means, responsive to the input speech, for providing data indicative of the input speech at aplurality of time instants; means, responsive to the data segments, for spectrally converting the data segments into a pluralityof spectral coefficients having a related probability distribution of values for providing spectral data indicative of the spectralcoefficients; and means, responsive to the spectral data, for performing decorrelation conversion on the spectral coefficients forproviding the extracted features, characterized by obtaining a parametric representation of the probability distribution of valuesof the spectral coefficients; modifying the parametric representation based on one or more reference values; and adjusting atleast one of the spectral coefficients based on the modified parametric representation for changing the spectral data prior to thedecorrelation conversion.

5,535,305

Sub-partitioned vector quantization of probability density functions

Apple Computer, Inc.Acero; Alejandro | Chow; Yen-Lu | Lee; Kai-Fu

704 G10L 19921231 0 100%

Abstract: A speech recognition memory compression method and apparatus subpartitions probability density function (pdf)space along the hidden Markov model (HMM) index into packets of typically 4 to 8 log-pdf values. Vector quantization techniques are applied using a logarithmic distance metric and a probability weighted logarithmic probability space for the splitting ofclusters. Experimental results indicate a significant reduction in memory can be obtained with little increase in overall speechrecognition error. MainClaim: A method for creating a subpartitioned vector quantized memory for the storage of hidden Markov model (HMM)log-probability density functions (log-pdfs) corresponding to a phoneme model having at least one code-book and one state, comprising the following steps:

a) organizing the HMM log-pdfs of each code-book by column and grouped by state so that corresponding log-pdf values of each of the HMM log-pdfs form a set of log-pdf value columns;

b) subpartitioning the log-pdf value columns into an integer number of equal length packets each packet identified by anassociated packet index;

c) vector quantizing the subpartitioned packets, creating a set of subpartitioned vector quantization (SVQ) encoding vectors andassociated SVQ encoding vector indices;

d) constructing an address translation table that is addressable by the packet indices, listing the SVQ encoding vector indicesassociated with each packet index, for generating, at output, an encoding index corresponding to the packet index used toaddress the address translation table; and

e) constructing a SVQ vector table for storing the set of SVQ encoding vectors in accordance with the associated SVQ encodingvector indices.


704 G10L 20030326 11 94%


7,269,556 Pattern recognition Nokia CorporationKiss; Imre | Vasilache; Marcel

704 G10L 20030326 9 94%


2007/0256189



800 C12N 20060426 6 94%

Abstract: Systems and methods are provided for performing soft alignment in Gaussian mixture model (GMM) based and othervector transformations. Soft alignment may assign alignment probabilities to source and target feature vector pairs. The vectorpairs and associated probabilities may then be used calculate a conversion function, for example, by computing GMM training

www.patentics.com


parameters from the joint vectors and alignment probabilities to create a voice conversion function for converting speech soundsfrom a source speaker to a target speaker. MainClaim: A method for time aligning a first sequence of feature vectors with a second sequence of feature vectors comprisingthe steps of: receiving a first sequence of feature vectors associated with a source; receiving a second sequence of featurevectors associated with a target; and generating a third sequence of joint feature vectors, wherein the generation of each jointfeature vector is based on: a first vector from the first sequence; a first vector from the second sequence; and a first probabilityvalue representing the probability that the first vector from the first sequence and the first vector from the second sequence arealigned to the same feature in their respective sequences.

5,577,135 Handwriting signal processing front-end for handwriting recognizers

Apple Computer, Inc.Grajski; Kamil A. | Chow; Yen-Lu | Lee; Kai-Fu

382 G06K 19940301 0 100%

Abstract: A handwriting signal processing front-end method and apparatus for a handwriting training and recognition systemwhich includes non-uniform segmentation and feature extraction in combination with multiple vector quantization. In a trainingphase, digitized handwriting samples are partitioned into segments of unequal length. Features are extracted from the segmentsand are grouped to form feature vectors for each segment. Groups of adjacent from feature vectors are then combined to forminput frames. Feature-specific vectors are formed by grouping features of the same type from each of the feature vectors withina frame. Multiple vector quantization is then performed on each feature-specific vector to statistically model the distributions of the vectors for each feature by identifying clusters of the vectors and determining the mean locations of the vectors in theclusters. Each mean location is represented by a codebook symbol and this information is stored in a codebook for each feature.These codebooks are then used to train a recognition system. In the testing phase, where the recognition system is to identifyhandwriting, digitized test handwriting is first processed as in the training phase to generate feature-specific vectors from input frames. Multiple vector quantization is then performed on each feature-specific vector to represent the feature-specific vector using the codebook symbols that were generated for that feature during training. The resulting series of codebook symbolseffects a reduced representation of the sampled handwriting data and is used for subsequent handwriting recognition. MainClaim: A front-end processing method for a handwriting recognition system, said method for processing strokes ofhandwriting training samples comprising a time series of (x,y) coordinates, said method comprising the steps of:

segmenting said strokes based on interrelationships of said (x,y) coordinates into an ordered set of training stroke segmentsthat are non-uniform in length for each of said handwriting training samples;

extracting a first plurality of feature values from each of said training stroke segments, wherein each of said feature valuesextracted therefrom forms entries of a word-independent training feature vector;

creating a series of feature-specific vectors by grouping said entries corresponding to one of said feature values from contiguousgroups of said word-independent training feature vectors;

performing multiple vector quantization by vector quantizing each of said feature-specific vectors to statistically characterize said feature-specific vectors, wherein said vector quantizing includes:

partitioning said feature-specific vectors into a plurality of clusters, wherein each of said clusters includes a mean value and adistribution about said mean value for proximate ones of said feature-specific vectors, and

labelling each of said mean values in each of said clusters with a symbol; and

storing in a plurality of codebooks said mean values and said symbols for each of said clusters to effect a reduced representationof said handwriting training samples.




704 G10L 20030326 11 92%


www.patentics.com



704 G10L 20030326 9 92%


5,596,680

Method and apparatus for detecting speech activity using cepstrum vectors

Apple Computer, Inc.Chow; Yen-Lu | Staats; Erik P. 704 G10L 19921231 0 100%

Abstract: A method and apparatus for detecting speech activity in an input signal. The present invention includes performingbegin point detection using power/zero crossing. Once the begin point has been detected, the present invention uses thecepstrum of the input signal to determine the endpoint of the sound in the signal. After both the beginning and ending of thesound are detected, the present invention uses vector quantization distortion to classify the sound as speech or noise. MainClaim: A method for detecting an endpoint of speech in an input signal, wherein the input signal is sampled, said methodcomprising the steps of:

generating cepstrum vectors representing each spectrum of individual samples of the input signal;

generating a cepstrum vector for a steady state portion of the input signal; and

comparing the cepstrum vectors of individual samples with the cepstrum vector for the steady state portion of the input signal toidentify the endpoint of speech as that portion of the input signal having a spectrum that converges to the steady state portionof the input signal.

6,772,117 Method and a device for recognizing speech


Laurila; Kari | Viikki; Olli

704 G10L 19980409 2 97%

Abstract: In a speech recognition method and apparatus, according to the present invention, feature vectors produced by ananalysing unit of a speech recognition device are modified for compensating the effects of noise. According to the invention,feature vectors are normalized using a sliding normalization buffer (31). By means of the method according to the invention, theperformance of the speech recognition device improves in situations, wherein the speech recognition device's training phase hasbeen carried out in a noise environment that differs from the noise environment of the actual speech recognition phase. MainClaim: A method for recognising speech, wherein a recognisable speech signal is divided in time into successive frames ofspecific length, each speech frame is analysed for producing at least one parameter per frame, illustrating the speech signal,said parameters, relating to each frame, are stored in a sliding buffer for minimizing the delay due to the normalization processfor calculation of normalisation coefficients for each frame, said parameters are modified utilising said normalisation coefficientsand speech recognition is carried out utilising the modified parameters, wherein only part of the successive parameters arestored periodically and at least one parameter is modified on the basis of the parameters stored periodically in order to producesaid modified parameter, and for said modification, a standard deviation of said periodically stored parameters is defined,wherein only part of the stored parameters are used at the beginning of the speech recognition.

2008/0082320

APPARATUS, METHOD AND COMPUTER PROGRAM PRODUCT FOR ADVANCED VOICE CONVERSION

Nokia CorporationPopa; Victor | Nurminen; Jani K. | Tian; Jilei

704 G10L 20060929 2 96%

Abstract: An apparatus is provided that includes a converter for training a voice conversion model for converting sourceencoding parameters characterizing a source speech signal associated with a source voice into corresponding target encodingparameters characterizing a target speech signal associated with a target voice. To reduce the affect of noise on the voiceconversion model, the converter may be configured for receiving sequences of source and target encoding parameters, and trainthe model without one or more frames of the source and target speech signals that have energies less than a threshold energy.After conversion of the respective parameters, then, the converter, a decoder or another component may be configured forreducing the energy of one or more frames of the target speech signal that have an energy less than the threshold energy,where the threshold value may be adaptable based upon models of speech frames and non-speech frames. MainClaim: An apparatus comprising:a converter for training a voice conversion model for converting at least some informationcharacterizing a source speech signal into corresponding information characterizing a target speech signal, wherein the sourcespeech signal is associated with a source voice, and the target speech signal is a representation of the source speech signalassociated with a target voice, and wherein the converter is configured for training each voice conversion model by:receivinginformation characterizing each frame in a sequence of frames of a source speech signal and information characterizing eachframe in a sequence of frames of a target speech signal, each frame of the source and target speech signals having anassociated energy;comparing the energies of the frames of the source and target speech signals to a threshold energy value,and identifying one or more frames of the source and target speech signals that have energies less than the threshold energyvalue; andtraining the voice conversion model based upon the information characterizing at least some of the frames in thesequences of frames of the source and target speech signals, the conversion model being trained without the informationcharacterizing at least some of the identified frames.

6,915,257

Method and apparatus for speech coding with voiced/unvoiced determination


Heikkinen; Ari | Pietila; Samuli | Ruoppila; Vesa

704 G10L 20001221 2 96%

www.patentics.com


Abstract: This invention presents a voicing determination algorithm for classification of a speech signal segment as voiced orunvoiced. The algorithm is based on a normalized autocorrelation where the length of the window is proportional to the pitchperiod. The speech segment to be classified is further divided into a number of sub-segments, and the normalized autocorrelation is calculated for each sub-segment if a certain number of the normalized autocorrelation values is above apredetermined threshold, the speech segment is classified as voiced. To improve the performance of the voicing determinationalgorithm in unvoiced to voiced transients, the normalized autocorrelations of the last sub-segments are emphasized. The performance of the voicing decision algorithm can be enhanced by utilizing also the possible lookahead information. MainClaim: A method for determining the voicing of a speech signal segment, comprising the steps of: dividing a speech signalsegment into sub-segments, determining a value relating to the voicing of respective speech signal sub-segments, comparing said values with a predetermined threshold, and making a decision on the voicing of the speech segment based on the numberof the values on one side of the threshold and with emphasis on at least one last sub-segment of the segment.

5,860,064

Method and apparatus for automatic generation of vocal emotion in a synthetic text-to-speech system

Apple Computer, Inc. Henton; Caroline G.

704 G10L 19970224 0 100%

Abstract: A method and apparatus for the automatic application of vocal emotion parameters to text in a text-to-speech system. Predefining vocal parameters for various vocal emotions allows simple selection and application of vocal emotions totext to be output from a text-to-speech system. Further, the present invention is capable of generating vocal emotion with thelimited prosodic controls available in a concatenative synthesizer. MainClaim: A method for automatic application of vocal emotion to previously entered text to be outputted by a synthetic text-to-speech system, said method comprising:

selecting a portion of said previously entered text;

manipulating a visual appearance of the selected text to selectively choose a vocal emotion to be applied to said selected text;

obtaining vocal emotion parameters associated with said selected vocal emotion; and

applying said obtained vocal emotion parameters to said selected text to be outputted by said synthetic text-to-speech system.

2007/0016421



704 G10L 20050712 4 92%


5,734,791 Rapid tree-based method for vector quantization

Apple Computer, Inc.Acero; Alejandro | Lee; Kai-Fu | Chow; Yen-Lu

704 G10L 19921231 0 100%

Abstract: The branching decision for each node in a vector quantization (VQ) binary tree is made by a simple comparison of apre-selected element of the candidate vector with a stored threshold resulting in a binary decision for reaching the next lowerlevel. Each node has a preassigned element and threshold value. Conventional centroid distance training techniques (such asLBG and k-means) are used to establish code-book indices corresponding to a set of VQ centroids. The set of training vectorsare used a second time to select a vector element and threshold value at each node that approximately splits the data evenly.After processing the training vectors through the binary tree using threshold decisions, a histogram is generated for each code-book index that represents the number of times a training vector belonging to a given index set appeared at each index. Thefinal quantization is accomplished by processing and then selecting the nearest centroid belonging to that histogram. Accuracycomparable to that achieved by conventional binary tree VQ is realized but with almost a full magnitude increase in processingspeed. MainClaim: A method for converting a candidate vector signal into a vector quantization (VQ) signal, the candidate vectorsignal identifying a candidate vector having a plurality of elements, the method comprising the steps of:

(a) applying the candidate vector signal to circuitry which performs a binary search of a binary tree stored in a memory, whereinthe candidate vector signal is a digitized representation, wherein the binary tree has intermediate nodes and leaf nodes, andwherein the applying step (a) comprises the steps of:

(i) selecting one of the elements of the candidate vector and comparing the selected element with a corresponding thresholdvalue for each intermediate node traversed in performing the binary search of the binary tree, and

(ii) identifying one of the leaf nodes encountered in the binary search of the binary tree;

(b) identifying, based on the identified leaf node, a set of VQ vectors stored in a memory;

(c) selecting one of the VQ vectors from the identified set of VQ vectors; and

www.patentics.com


(d) generating the VQ signal identifying the selected VQ vector.


704 G10L 20030326 11 95%




2007/0256189



800 C12N 20060426 6 94%


5,717,827

Text-to-speech system using vector quantization based speech enconding/decoding

Apple Computer, Inc. Narayan; Shankar 704 G10L 19960415 0 100%

Abstract: A text-to-speech system includes a memory storing a set of quantization vectors. A first processing module isresponsive to the sound segment codes generated in response to text in the sequence to identify strings of noise compensatedquantization vectors for respective sound segment codes in the sequence. A decoder generates a speech data sequence inresponse to the strings of quantization vectors. An audio transducer is coupled to the processing modules, and generates soundin response to the speech data sequence. The quantization vectors represent a quantization of a sound segment data having apre-emphasis to de-correlate the sound samples used for quantization and the quantization noise. In decompressing the soundsegment data, an inverse linear prediction filter is applied to the identified strings of quantization vectors to reverse the pre-emphasis. Also, the quantization vectors represent quantization of results of pitch filtering of sound segment data. Thus, aninverse pitch filter is applied to the identified strings of quantization vectors in the module of generating the speech datasequence. MainClaim: An apparatus for converting text to speech, comprising:

means for translating the text to a sequence of sound segment codes representing speech;

means for generating a set of noise compensated quantization vectors by encoding the sound segment codes representingspeech using a first set of quantization vectors and then performing a noise shaping filter operation on the first set ofquantization vectors;

memory storing the set of noise compensated quantization vectors;

means, responsive to sound segment codes in the sequence, for identifying strings of noise compensated quantization vectors inthe set of noise compensated quantization vectors for respective sound segment codes in the sequence;

means, coupled to the means for identifying and the memory, for generating a speech data sequence in response to the strings

www.patentics.com


of noise compensated quantization vectors; and

an audio transducer, coupled to the means for generating, to generate sound in response to the speech data sequence.

2006/0235685 Framework for voice conversion

Nokia CorporationNurminen; Jani | Tian; Jilei | Kiss; Imre

704 G10L 20050415 2 96%

Abstract: This invention relates to a framework for converting a source speech signal associated with a source voice into atarget speech signal that is a representation of the source speech signal associated with a target voice. The source speech signalis encoded into samples of encoding parameters, wherein the encoding comprises the step of segmenting the source speechsignal into segments based on characteristics of the source speech signal. The samples of the encoding parameters, or aconverted representation of the samples of the encoding parameters are then decoded to obtain the target speech signal.Therein, in the encoding, the decoding or in a separate step, samples of parameters related to the source speech signal areconverted into samples of parameters related to the target speech signal. Therein, at least one of the encoding and theconverting depends on the segments of the source speech signal. MainClaim: A method for converting a source speech signal associated with a source voice into a target speech signal that is arepresentation of said source speech signal associated with a target voice, said method comprising: encoding said source speechsignal into samples of encoding parameters, wherein said encoding comprises the step of segmenting said source speech signalinto segments based on characteristics of said source speech signal, decoding one of said samples of said encoding parametersand a converted representation of said samples of said encoding parameters to obtain said target speech signal, and converting,in one of said encoding, said decoding and a separate step, samples of parameters related to said source speech signal intosamples of parameters related to said target speech signal; wherein at least one of said encoding and said converting dependson said segments of said source speech signal.

2005/0091041 Method and system for speech coding

Nokia Corporation

Ramo, Anssi | Nurminen, Jani | Himanen, Sakari | Heikkinen, Ari

704 G10L 20031023 3 95%

Abstract: A method and device for use in conjunction with an encoder for encoding an audio signal into a plurality ofparameters. Based on the behavior of the parameters, such as pitch, voicing, energy and spectral amplitude information of theaudio signal, the audio signal can be segmented, so that the parameter update rate can be optimized. The parameters of thesegmented audio signal are recorded in a storage medium or transmitted to a decoder so as to allow the decoder to reconstructthe audio signal based on the parameters indicative of the segment audio signals. For example, based on the pitchcharacteristic, the pitch contour can be approximated by a plurality of contour segments. An adaptive downsampling method isused to update the parameters based on the contour segments so as to reduce the update rate. At the decoder, the parametersare updated at the original rate. MainClaim: A method of encoding an audio signal having audio characteristics, said method comprising the steps of:segmenting the audio signal into a plurality of segments based on the audio characteristics of the audio signal; and encoding thesegments with different encoding settings.

6,055,496 Vector quantization in celp speech coder


Heidari; Alireza Ryan | Liu; Fenghua

704 G10L 19980227 1 94%

Abstract: A process for generation of codevectors in the production of synthetic speech in a communication system employingcode-excited linear prediction (CELP) is implemented by dividing frames of sampled speech into sub-frames for which are generated codevectors suitable for excitation of synthesizer filters in the low-bit mode of signal transmission. Vector quantization (VQ) is employed with an algebraic representation of the CELP. A reduction of a sub-frame of 6.7 milliseconds to a vector representation of only 8 pulses results in an insufficiency of candidate codevectors, which insufficiency is overcome by acircular shifting of the codevectors at a cyclical rate equal to the pitch of the original voice signal. MainClaim: A method of characterizing the excitation vector in a processor of speech operating in accordance with code-excited linear prediction (CELP), the method comprising the steps of:

establishing a set of sub-vectors, each of which comprises several samples of speech;

identifying sub-vectors carrying speech information important for perception of speech by a person listening to the speech;

encoding perceptually important sub-vectors;

setting other ones of the sub-vectors to zero, and constructing the excitation vector of the set of sub-vectors wherein the excitation vector is quantized by the sub-vectors which have been set to zero; and

wherein the total number of the sub-vectors is equal to the integer part of pitch divided by 9 and bounded by 3 and 6 wherein 9 samples of speech are grouped together to form one of said sub-vectors.

5,481,739 Vector quantization using thresholds Apple Computer, Inc. Staats; Erik 712 G06F 19930623 0 100%

Abstract: Methods and apparatus for vector quantization. A threshold generator generates an i threshold (Thresholdi) to be

associated with each i quantized vector of n quantized vectors in a vector quantization codebook. The vector quantizationcodebook and the thresholds are used by a vector quantizer to encode a set of input vectors (V1 -VTOT). The determination that

a distance between a vector to be encoded and a quantized vector in a codebook is less than the associated threshold causes asearch for the closest vector to terminate for a nearest neighbor vector quantizer. In some embodiments, the vectors comprisesamples of continuous signals for sound containing speech, or display signals. In other embodiments, codebook vectors arearranged from most frequently encoded vectors to least frequently encoded vectors. MainClaim: In a computer system, a method of vector quantization, comprising the following steps:

a. from a training set of vectors, creating a vector quantization codebook representative of a set of training vectors, saidcodebook comprising a representative set of n quantized vectors from said training vectors;

www.patentics.com


b. for each i quantized vector (VQi) of said n quantized vectors, determining an i threshold (Thresholdi) to be associated with

said i quantized vector, wherein said i threshold comprises half a distance between said i quantized vector and a k quantizedvector (VQk) of said n quantized vectors, wherein i<k≤n, and said k quantized vector is the closest quantized vector to said i

quantized vectors of a set of quantized vectors having an index k wherein i<k≤n;

c. for each i quantized vector of said n quantized vectors, associating in said vector quantization codebook said i threshold withsaid i quantized vector; and

d. using said vector quantization codebook to encode a set of input vectors (V1 -VTOT).

7,587,314

Single-codebook vector quantization for multiple-rate applications

Nokia CorporationVasilache; Adriana | Ramo; Anssi

704 G10L 20050829 2 92%

Abstract: This invention relates to a method, a device and a software application product for N-level quantization of vectors, wherein N is selectable prior to said quantization from a set of at least two pre-defined values that are smaller than or equal to a pre-defined maximum number of levels M. A reproduction vector for each vector is selected from an N-level codebook of N reproduction vectors that are, for each N in said set of at least two pre-defined values, represented by the first N reproduction vectors of the same joint codebook of M reproduction vectors. The invention further relates to a method, a device and asoftware application product for retrieving reproduction vectors for vectors that have been N-level quantized, to a system for transferring representations of vectors, to a method, a device and a software application product for determining a jointcodebook, and to such a joint codebook itself. MainClaim: A method comprising: selecting, in an N-level quantization of a vector, wherein N is selectable prior to saidquantization from a set of at least two pre-defined values that are smaller than or equal to a pre-defined maximum number of levels M, a reproduction vector for said vector from an N-level codebook of N reproduction vectors that are, for each N in saidset of at least two pre-defined values, represented by the first N reproduction vectors of the same joint codebook of Mreproduction vectors, and providing an identifier signal that identifies said selected reproduction vector, said method furthercomprising processing said identifier signal for storage in a storage medium or for transmission on a transmission channel of acommunication system.

2007/0055509


Nokia CorporationVasilache; Adriana | Ramo; Anssi 704 G10L 20050829 2 92%

Abstract: This invention relates to a method, a device and a software application product for N-level quantization of vectors, wherein N is selectable prior to said quantization from a set of at least two pre-defined values that are smaller than or equal to a pre-defined maximum number of levels M. A reproduction vector for each vector is selected from an N-level codebook of N reproduction vectors that are, for each N in said set of at least two pre-defined values, represented by the first N reproduction vectors of the same joint codebook of M reproduction vectors. The invention further relates to a method, a device and asoftware application product for retrieving reproduction vectors for vectors that have been N-level quantized, to a system for transferring representations of vectors, to a method, a device and a software application product for determining a jointcodebook, and to such a joint codebook itself. MainClaim: A method for N-level quantization of vectors, wherein N is selectable prior to said quantization from a set of at leasttwo pre-defined values that are smaller than or equal to a pre-defined maximum number of levels M, said method comprising: selecting a reproduction vector for each vector from an N-level codebook of N reproduction vectors that are, for each N in saidset of at least two pre-defined values, represented by the first N reproduction vectors of the same joint codebook of Mreproduction vectors.

5,490,234 Waveform blending technique for text-to-speech system

Apple Computer, Inc. Narayan; Shankar 704 G10L 19930121 0 100%

Abstract: A concatenator for a first digital frame with a second digital frame, such as the ending and beginning of adjacentdiphone strings being concatenated to form speech is based on determining an optimum blend point for the first and seconddigital frames in response to the magnitudes of samples in the first and second digital frames. The frames are then blended togenerate a digital sequence representing a concatenation of the first and second frames with reference to the optimum blendpoint. The system operates by first computing an extended frame in response to the first digital frame, and then finding a subsetof the extended frame with matches the second digital frame using a minimum average magnitude difference function over thesamples in the subset. The blend point is the first sample of the matching subset. To generate the concatenated waveform, thesubset of the extended frame is combined with the second digital frame and concatenated with the beginning segments of theextended frame to produce the concatenate waveform. MainClaim: An apparatus for concatenating a first digital frame of N samples having respective magnitudes representing a firstquasi-periodic waveform and a second digital frame of M samples having respective magnitudes representing a second quasi-periodic waveform, comprising:

a buffer store to store the samples of first and second digital frames;

means, coupled to the buffer store, for determining a blend point for the first and second digital frames in response tomagnitudes of samples in the first and second digital frames;

blending means, coupled with the buffer store and the means for determining, for computing a digital sequence representing aconcatenation of the first and second quasi-periodic waveforms in response to the first frame, the second frame and the blendpoint.

2005/0091041 Method and system for speech coding Nokia Corporation


704 G10L 20031023 3 95%

Abstract: A method and device for use in conjunction with an encoder for encoding an audio signal into a plurality ofparameters. Based on the behavior of the parameters, such as pitch, voicing, energy and spectral amplitude information of the

www.patentics.com


audio signal, the audio signal can be segmented, so that the parameter update rate can be optimized. The parameters of thesegmented audio signal are recorded in a storage medium or transmitted to a decoder so as to allow the decoder to reconstructthe audio signal based on the parameters indicative of the segment audio signals. For example, based on the pitchcharacteristic, the pitch contour can be approximated by a plurality of contour segments. An adaptive downsampling method isused to update the parameters based on the contour segments so as to reduce the update rate. At the decoder, the parametersare updated at the original rate. MainClaim: A method of encoding an audio signal having audio characteristics, said method comprising the steps of:segmenting the audio signal into a plurality of segments based on the audio characteristics of the audio signal; and encoding thesegments with different encoding settings.

2006/0235685 Framework for voice conversion

Nokia CorporationNurminen; Jani | Tian; Jilei | Kiss; Imre

704 G10L 20050415 2 94%

Abstract: This invention relates to a framework for converting a source speech signal associated with a source voice into atarget speech signal that is a representation of the source speech signal associated with a target voice. The source speech signalis encoded into samples of encoding parameters, wherein the encoding comprises the step of segmenting the source speechsignal into segments based on characteristics of the source speech signal. The samples of the encoding parameters, or aconverted representation of the samples of the encoding parameters are then decoded to obtain the target speech signal.Therein, in the encoding, the decoding or in a separate step, samples of parameters related to the source speech signal areconverted into samples of parameters related to the target speech signal. Therein, at least one of the encoding and theconverting depends on the segments of the source speech signal. MainClaim: A method for converting a source speech signal associated with a source voice into a target speech signal that is arepresentation of said source speech signal associated with a target voice, said method comprising: encoding said source speechsignal into samples of encoding parameters, wherein said encoding comprises the step of segmenting said source speech signalinto segments based on characteristics of said source speech signal, decoding one of said samples of said encoding parametersand a converted representation of said samples of said encoding parameters to obtain said target speech signal, and converting,in one of said encoding, said decoding and a separate step, samples of parameters related to said source speech signal intosamples of parameters related to said target speech signal; wherein at least one of said encoding and said converting dependson said segments of said source speech signal.

2005/0091044

Method and system for pitch contour quantization in audio coding

Nokia Corporation


704 G10L 20031023 2 94%

Abstract: A method and device for improving coding efficiency in audio coding. From the pitch values of a pitch contour of anaudio signal, a plurality of simplified pitch contour segments are generated to approximate the pitch contour, based on one ormore pre-selected criteria. The contour segments can be linear or non-linear with each contour segment represented by a first end point and a second end point. If the contour segments are linear, then only the information regarding the end points,instead of the pitch values, are provided to a decoder for reconstructing the audio signal. The contour segment can have a fixedmaximum length or a variable length, but the deviation between a contour segment and the pitch values in that segment islimited by a maximum value. MainClaim: A method for improving coding efficiency in audio coding, wherein an audio signal is encoded for providingparameters indicative of the audio signal, the parameters including pitch contour data containing a plurality of pitch valuesrepresentative of an audio segment in time, said method comprising the steps of: creating, based on the pitch contour data, aplurality of simplified pitch contour segment candidates, each candidate corresponding to a sub-segment of the audio signal; measuring deviation between each of the simplified pitch contour segment candidates and said pitch values in the correspondingsub-segment; selecting one of said candidates based on the measured deviations and one or more pre-selected criteria; and coding the pitch contour data in the sub-segment of the audio signal corresponding to the selected candidate with characteristicsof the selected candidate.

5,642,466 Intonation adjustment in text-to-speech systems Apple Computer, Inc. Narayan; Shankar 704 G10L 19930121 0 100%

Abstract: A software-only real time text-to-speech system includes intonation control which does not introduce discontinuitiesinto output speech stream. The text-to-speech system includes a module for translating text to a sequence of sound segmentcodes and intonation control signals. A decoder is coupled to the translator to produce sets of digital frames of speech data,which represent sounds for the respective sound segment codes in the sequence. An intonation control system is responsive tointonation control signals for modifying a block of one or more frames in the sets of frames of speech data to generate amodified block. The modified block substantially preserves the continuity of the beginning and ending segments of the block withadjacent frames in the sequence. Thus, when the modified block is inserted in the sequence, no discontinuities are introducedand smooth intonation control is accomplished. The intonation control system provides for both pitch and duration control. MainClaim: An apparatus for adjusting an intonation of a sound wherein the sound is specified by a sequence of frames eachcomprising a set of digital samples, the apparatus comprising:

means for receiving a set of intonation control signals that indicate a pitch adjustment and a duration adjustment to the sound;

buffer that stores the sequence of frames;

intonation control means that generates an intonation adjusted sequence of frames by accessing a block of one or more framesof the sequence of frames from the buffer and by generating a modified block in response to the intonation control signals andby inserting the modified block into the sequence of frames wherein the intonation control means minimizes discontinuitybetween a beginning segment and an ending segment of the block and a pair of adjacent frames in the intonation adjustedsequence of frames, wherein the intonation control signals indicate a change in a nominal length of a specified frame of thesequence of frames to indicate the pitch adjustment and indicate a change in a number of frames in the sequence of frames toindicate the duration adjustment, and wherein the intonation control means includes

pitch lowering means for increasing a length N of the specified frame by an amount equal to Δ samples wherein the block of one or more frames consists of the specified frame, the pitch lowering means including means for applying a first weighting functionto the block emphasizing the beginning segment to generate a first vector and means for applying a second weighting functionto the block emphasizing the ending segment to generate a second vector and means for combining the first vector with thesecond vector shifted by Δ samples to generate the modified block having a length N+Δ,

www.patentics.com


pitch raising means for decreasing the length N of the specified frame by an amount equal to Δ samples wherein the block of one or more frames consists of the specified frame and a next frame having a length NR in the sequence of frames, the pitchraising means including means for applying the first weighting function to the block emphasizing the beginning segment togenerate the first vector and means for applying the second weighting function to the block emphasizing the ending segment togenerate the second vector and means for combining the first vector with the second vector shifted by Δ samples to generate a shortened frame with the next frame to generate the modified block having a length N-Δ+NR,

duration shortening means for modifying the block to reduce the number of frames in the sequence of frames wherein the blockconsists of a pair of sequential frames having lengths NL and NR respectively, the duration shortening means including meansfor applying the first weighting function to the block emphasizing the beginning segment to generate the first vector and meansfor applying the second weighting function to the block emphasizing the ending segment to generate the second vector andmeans for combining the first vector with the second vector to generate the modified block having the length NL or the lengthNR, and

duration lengthening means for modifying the block to increase the number of frames in the sequence of frames wherein theblock consists of a pair of left and right sequential frames having the lengths NL and NR respectively, the duration lengtheningmeans including means for applying the first weighting function to the block emphasizing the beginning segment to generate thefirst vector and means for applying the second weighting function to the block emphasizing the ending segment to generate thesecond vector and means for combining the first vector with the second vector to generate a new frame and means forconcatenating the left frame, the new frame, and the right frame to generate the modified block.

2005/0091041 Method and system for speech coding

Nokia Corporation


704 G10L 20031023 3 95%

Abstract: A method and device for use in conjunction with an encoder for encoding an audio signal into a plurality ofparameters. Based on the behavior of the parameters, such as pitch, voicing, energy and spectral amplitude information of theaudio signal, the audio signal can be segmented, so that the parameter update rate can be optimized. The parameters of thesegmented audio signal are recorded in a storage medium or transmitted to a decoder so as to allow the decoder to reconstructthe audio signal based on the parameters indicative of the segment audio signals. For example, based on the pitchcharacteristic, the pitch contour can be approximated by a plurality of contour segments. An adaptive downsampling method isused to update the parameters based on the contour segments so as to reduce the update rate. At the decoder, the parametersare updated at the original rate. MainClaim: A method of encoding an audio signal having audio characteristics, said method comprising the steps of:segmenting the audio signal into a plurality of segments based on the audio characteristics of the audio signal; and encoding thesegments with different encoding settings.

2008/0275695


Nokia Corporation

Ramo; Anssi | Nurminen; Jani | Himanen; Sakari | Heikkinen; Ari

704 G10L 20080425 1 94%

Abstract: A method and device for improving coding efficiency in audio coding. From the pitch values of a pitch contour of anaudio signal, a plurality of simplified pitch contour segments are generated to approximate the pitch contour, based on one ormore pre-selected criteria. The contour segments can be linear or non-linear with each contour segment represented by a first end point and a second end point. If the contour segments are linear, then only the information regarding the end points,instead of the pitch values, are provided to a decoder for reconstructing the audio signal. The contour segment can have a fixedmaximum length or a variable length, but the deviation between a contour segment and the pitch values in that segment islimited by a maximum value. MainClaim: A method for coding an audio signal for providing parameters indicative of an audio signal, the parameterscomprising timewise unaltered pitch contour data containing a plurality of pitch values representative of an audio segment intime, said method comprising:creating, based on the timewise unaltered pitch contour data, a plurality of simplified pitchcontour segment candidates, each candidate corresponding to a sub-segment of the audio signal, wherein each sub-segment has a start-point pitch value and an end-point pitch value and each candidate has a start segment point and an end segmentpoint;measuring deviation between each of the simplified pitch contour segment candidates and said pitch values in thecorresponding sub-segment;selecting, among said candidates, a plurality of consecutive segment candidates to represent theaudio segment based on the measured deviations and one or more pre-selected criteria, wherein the start segment points of at least some selected segment candidates are different from the start-point pitch values of the corresponding sub-segments and the end segment points of at least some selected segment candidates are different from the end-point pitch values of the corresponding sub-segments; andcoding the sub-segment of the audio signal corresponding to the selected segment candidatewith characteristics of the selected segment candidate.

2005/0091044


Nokia Corporation


704 G10L 20031023 2 94%

Abstract: A method and device for improving coding efficiency in audio coding. From the pitch values of a pitch contour of anaudio signal, a plurality of simplified pitch contour segments are generated to approximate the pitch contour, based on one ormore pre-selected criteria. The contour segments can be linear or non-linear with each contour segment represented by a first end point and a second end point. If the contour segments are linear, then only the information regarding the end points,instead of the pitch values, are provided to a decoder for reconstructing the audio signal. The contour segment can have a fixedmaximum length or a variable length, but the deviation between a contour segment and the pitch values in that segment islimited by a maximum value. MainClaim: A method for improving coding efficiency in audio coding, wherein an audio signal is encoded for providingparameters indicative of the audio signal, the parameters including pitch contour data containing a plurality of pitch valuesrepresentative of an audio segment in time, said method comprising the steps of: creating, based on the pitch contour data, aplurality of simplified pitch contour segment candidates, each candidate corresponding to a sub-segment of the audio signal; measuring deviation between each of the simplified pitch contour segment candidates and said pitch values in the correspondingsub-segment; selecting one of said candidates based on the measured deviations and one or more pre-selected criteria; and coding the pitch contour data in the sub-segment of the audio signal corresponding to the selected candidate with characteristicsof the selected candidate.

www.patentics.com


5,598,505 Cepstral correction vector quantizer for speech recognition

Apple Computer, Inc.Austin; Stephen C. | Fineberg; Adam B.

704 G10L 19940930 0 100%

Abstract: A method for correcting cepstral vectors representative of speech generated in a test environment by use of a vectorquantization (VQ) system with a codebook of vectors that was generated using speech and acoustic data from a different(training) environment. The method uses a two-step correction to produce test environment cepstral vectors with reduced non-speech acoustic content. The first correction step subtracts, from the test vector, a coarse correction vector that is computedfrom an average of test environment cepstral vectors. The second step involves a VQ of the coarsely corrected test vector ateach node of the VQ tree. The third step is the addition of a fine correction vector to the coarsely corrected test vector that isgenerated by subtracting a running (moving) average of the coarsely corrected test vectors associated with the deepest VQ treenode from the VQ vector closest to the coarsely corrected test vector. The method is independent of the means used to generatethe cepstral vectors and the corrected output cepstra vectors may be used in various speech processing and classifying systems.The method is adaptable to non-stationary environments. MainClaim: A method for correcting a cepstral test vector representation of speech from an acoustical test environment using avector quantizer (VQ) encoder having a VQ encoder codebook based on training data from a different acoustical trainingenvironment, the method comprising:

(a) applying a coarse correction vector from the cepstral test vector, the coarse correction vector being representative of theacoustical training environment without the presence of speech, for producing a coarsely corrected cepstral test vector; and

(b) applying a fine correction vector to the coarsely corrected cepstral vector for producing a fine corrected cepstral test vector,the fine correction vector representative of a difference between acoustical test environment with the presence of speech onlyand the acoustical training environment cepstral training vectors with the presence of speech only.

7,197,456


Nokia Corporation Haverinen; Hemmo | Kiss; Imre

704 G10L 20020430 2 95%

Abstract: A method for improving noise robustness in speech recognition, wherein a front-end is used for extracting speech feature from an input speech and for providing a plurality of scaled spectral coefficients. The histogram of the scaled spectralcoefficients is normalized to the histogram of a training set using Gaussian approximations. The normalized spectral coefficientsare then converted into a set of cepstrum coefficients by a decorrelation module and further subjected to ceptral domainfeature-vector normalization. MainClaim: A method, comprising: providing in a speech recognition system speech data indicative of an input speech at aplurality of time instants based on the input speech, the speech data comprising a plurality of data segments; spectrallyconverting the data segments into a plurality of spectral coefficients having a probability distribution of values in spectral domainfor providing spectral data indicative of the spectral coefficients based on the data segments; obtaining a parametricrepresentation of the probability distribution of values of the spectral coefficients based on the spectral data; modifying theparametric representation based on one or more reference values for providing a modified parametric representation; adjustingat least one of the spectral coefficients in the spectral domain based on the modified parametric representation for changing thespectral data; and performing decorrelation conversion on the changed spectral data for providing extracted features of theinput speech.

2003/0204398


Nokia CorporationHaverinen, Hemmo | Kiss, Imre 704 G10L 20020430 3 95%

Abstract: A method for improving noise robustness in speech recognition, wherein a front-end is used for extracting speech feature from an input speech and for providing a plurality of scaled spectral coefficients. The histogram of the scaled spectralcoefficients is normalized to the histogram of a training set using Gaussian approximations. The normalized spectral coefficientsare then converted into a set of cepstrum coefficients by a decorrelation module and further subjected to ceptral domainfeature-vector normalization. MainClaim: A method of improving noise robustness in a speech recognition system, the system including a front-end for extracting speech features from an input speech and a back-end for speech recognition based on the extracted features, wherein the front-end comprises: means, responsive to the input speech, for providing data indicative of the input speech at aplurality of time instants; means, responsive to the data segments, for spectrally converting the data segments into a pluralityof spectral coefficients having a related probability distribution of values for providing spectral data indicative of the spectralcoefficients; and means, responsive to the spectral data, for performing decorrelation conversion on the spectral coefficients forproviding the extracted features, characterized by obtaining a parametric representation of the probability distribution of valuesof the spectral coefficients; modifying the parametric representation based on one or more reference values; and adjusting atleast one of the spectral coefficients based on the modified parametric representation for changing the spectral data prior to thedecorrelation conversion.


704 G10L 20030326 11 94%


Utilization of multiple

www.patentics.com


5,704,007 voice sources in a speech synthesizer

Apple Computer, Inc. Cecys; Mark L. 704 G10L 19961004 0 100%

Abstract: Utilization of one or more voice sources in a speech synthesizer to provide improved synthetic speech. Having aspeech synthesizer with the capability to select among and between a multiplicity of voice sources provides a higher quality andgreater variety of possible synthetic speech sounds. This is particularly true when the multiplicity of voice sources arepredetermined to have particular speech qualities and spectral content such as may be desired to convey emotional vocalcontent in synthetic speech. MainClaim: A synthetic text-to-speech generating method comprising:

generating a set of speech synthesizer control parameters representative of text to be spoken; and

converting the speech synthesizer control parameters into output wave forms representative of the synthetic speech to bespoken by selecting and combining at least two voice sources from a multiplicity of voice sources in a speech synthesizer togenerate a combined voice source and by passing the combined voice sottree through an acoustic model of a human vocal tract.

6,928,410 Method and apparatus for musical modification of speech signal


Marila; Juha | Ronkainen; Sami | Röykkee; Mika | Ichikawa; Fumiko

704 G10L 20001106 2 92%

Abstract: A method and apparatus for modification of a speech signal indicative of a stream of speech data having a plurality ofsyllables. The method comprises the steps of mapping the stream of speech data from the speech signal into a stream of tonedata according to a linguistic rule regarding the syllables for providing a tone signal indicative of the stream of tone data;forming a string of musical notes responsive to the tone signal for providing a carrier signal indicative of the string of musicalnotes; modulating the carrier signal with the speech signal for providing a modified signal; and providing an audible signalrepresentative of the speech signal, musically modified according to the linguistic rule. The linguistic rule includes an assignmentof a tone to a syllable of the speech data based on a vowel of the syllable, a consonant of the syllable, the intonation of thesyllable for a monosyllabic language. The musically modified speech signal can be used to indicate an incoming telephone call, amessage left on a telephone, a scheduled event, or the like. MainClaim: A method for modification of a speech signal indicative of a stream of speech data having a plurality of syllables,comprising:

mapping the stream of speech data from the speech signal into a stream of tone data according to a predetermined ruleregarding the syllables for providing a tone signal indicative of the stream of tone data, wherein the predetermined rule is basedon at least one linguistic characteristic of the syllables;

forming a string of musical notes responsive to the tone signal for providing a carrier signal indicative of the string of musicalnotes, such that said at least one linguistic characteristic is associated with a musical note;

modulating the carrier signal with the speech signal for providing a modified signal; and

providing an audible signal representative of the speech signal, according to the modified signal, musically modified according tothe predetermined rule.

5,930,755

Utilization of a recorded sound sample as a voice source in a speech synthesizer

Apple Computer, Inc. Cecys; Mark L. 704 G10L 19970107 0 100%

Abstract: One or more prerecorded sounds are used as a voice source in a speech synthesizer to provide unique syntheticspeech sounds. Recording one or more sound samples and then utilizing a speech synthesizer with the capability to selectamong and between the sound samples as the voice source to the speech synthesizer provides a higher quality and greatervariety of possible synthetic speech sounds. This is particularly true when the multiplicity of voice sources are predetermined tohave certain desired sound qualities and spectral content such as may be desired to provide synthetic speech of inanimateobjects and animals or atypical speech qualities to human synthetic speech. MainClaim: A parametric synthetic text-to-speech generating method comprising the steps of:

generating a set of speech synthesizer control parameters representative of text to be spoken;

selecting a voice source from a finite set of recorded sound samples of non-human origin; and

converting the speech synthesizer control parameters, based on the voice source, into output wave forms representative of thesynthetic speech to be spoken.

6,928,410 Method and apparatus for musical modification of speech signal


Marila; Juha | Ronkainen; Sami | Röykkee; Mika | Ichikawa; Fumiko

704 G10L 20001106 2 92%

Abstract: A method and apparatus for modification of a speech signal indicative of a stream of speech data having a plurality ofsyllables. The method comprises the steps of mapping the stream of speech data from the speech signal into a stream of tonedata according to a linguistic rule regarding the syllables for providing a tone signal indicative of the stream of tone data;forming a string of musical notes responsive to the tone signal for providing a carrier signal indicative of the string of musicalnotes; modulating the carrier signal with the speech signal for providing a modified signal; and providing an audible signalrepresentative of the speech signal, musically modified according to the linguistic rule. The linguistic rule includes an assignmentof a tone to a syllable of the speech data based on a vowel of the syllable, a consonant of the syllable, the intonation of thesyllable for a monosyllabic language. The musically modified speech signal can be used to indicate an incoming telephone call, amessage left on a telephone, a scheduled event, or the like. MainClaim: A method for modification of a speech signal indicative of a stream of speech data having a plurality of syllables,comprising:

www.patentics.com


mapping the stream of speech data from the speech signal into a stream of tone data according to a predetermined ruleregarding the syllables for providing a tone signal indicative of the stream of tone data, wherein the predetermined rule is basedon at least one linguistic characteristic of the syllables;

forming a string of musical notes responsive to the tone signal for providing a carrier signal indicative of the string of musicalnotes, such that said at least one linguistic characteristic is associated with a musical note;

modulating the carrier signal with the speech signal for providing a modified signal; and

providing an audible signal representative of the speech signal, according to the modified signal, musically modified according tothe predetermined rule.

5,619,717 Vector quantization using thresholds Apple Computer, Inc. Staats; Erik 712 G06F 19950607 0 100%

Abstract: Methods and apparatus for vector quantization. A threshold generator generates an i threshold (Thresholdi) to be

associated with each i quantized vector of n quantized vectors in a vector quantization codebook. The vector quantizationcodebook and the thresholds are used by a vector quantizer to encode a set of input vectors (V1 -VTOT). The determination that

a distance between a vector to be encoded and a quantized vector in a codebook is less than the associated threshold causes asearch for the closest vector to terminate for a nearest neighbor vector quantizer. In some embodiments, the vectors comprisesamples of continuous signals for sound containing speech, or display signals. In other embodiments, codebook vectors arearranged from most frequently encoded vectors to least frequently encoded vectors. MainClaim: In a computer system, a method of vector quantization, comprising the following steps:

a) creating a vector quantization codebook comprising n quantized vectors;

b) for each i quantized vector (VQi) of said n quantized vectors, determining an i threshold (Thresholdi) to be associated with

said i quantized vector;

c) for each i quantized vector of said n quantized vectors, associating said i threshold with said i quantized vector in said vectorquantization codebook; and

d) using said vector quantization codebook to encode a set of input vectors (V1 -VTOT), wherein for each input vector being

coded, sequencing using an index j through said vector quantization codebook and determining for each j quantized vector insaid vector quantization codebook if the distance between said input vector being coded and said j quantized vector is less thansaid j threshold associated with said j quantized vector then encoding said input vector and terminating sequencing through saidvector quantization codebook.

7,587,314


Nokia CorporationVasilache; Adriana | Ramo; Anssi 704 G10L 20050829 2 93%

Abstract: This invention relates to a method, a device and a software application product for N-level quantization of vectors, wherein N is selectable prior to said quantization from a set of at least two pre-defined values that are smaller than or equal to a pre-defined maximum number of levels M. A reproduction vector for each vector is selected from an N-level codebook of N reproduction vectors that are, for each N in said set of at least two pre-defined values, represented by the first N reproduction vectors of the same joint codebook of M reproduction vectors. The invention further relates to a method, a device and asoftware application product for retrieving reproduction vectors for vectors that have been N-level quantized, to a system for transferring representations of vectors, to a method, a device and a software application product for determining a jointcodebook, and to such a joint codebook itself. MainClaim: A method comprising: selecting, in an N-level quantization of a vector, wherein N is selectable prior to saidquantization from a set of at least two pre-defined values that are smaller than or equal to a pre-defined maximum number of levels M, a reproduction vector for said vector from an N-level codebook of N reproduction vectors that are, for each N in saidset of at least two pre-defined values, represented by the first N reproduction vectors of the same joint codebook of Mreproduction vectors, and providing an identifier signal that identifies said selected reproduction vector, said method furthercomprising processing said identifier signal for storage in a storage medium or for transmission on a transmission channel of acommunication system.

2007/0055509


Nokia Corporation Vasilache; Adriana | Ramo; Anssi

704 G10L 20050829 2 93%

Abstract: This invention relates to a method, a device and a software application product for N-level quantization of vectors, wherein N is selectable prior to said quantization from a set of at least two pre-defined values that are smaller than or equal to a pre-defined maximum number of levels M. A reproduction vector for each vector is selected from an N-level codebook of N reproduction vectors that are, for each N in said set of at least two pre-defined values, represented by the first N reproduction vectors of the same joint codebook of M reproduction vectors. The invention further relates to a method, a device and asoftware application product for retrieving reproduction vectors for vectors that have been N-level quantized, to a system for transferring representations of vectors, to a method, a device and a software application product for determining a jointcodebook, and to such a joint codebook itself. MainClaim: A method for N-level quantization of vectors, wherein N is selectable prior to said quantization from a set of at leasttwo pre-defined values that are smaller than or equal to a pre-defined maximum number of levels M, said method comprising: selecting a reproduction vector for each vector from an N-level codebook of N reproduction vectors that are, for each N in saidset of at least two pre-defined values, represented by the first N reproduction vectors of the same joint codebook of Mreproduction vectors.

2008/0097757 Audio coding Nokia Corporation Vasilache; Adriana 704 G10L 20061024 1 92%

Abstract: Quantized audio data may be represented by a codevector that is associated to a point of an outer shell of a

www.patentics.com


rectangular truncated lattice. For indexing this codevector, number and positions of non-zero components of the codevector are determined. Moreover, signs of the non-zero components are determined. An index is then calculated by combining at least a term representing determined number and positions of non-zero components and a term representing determined signs of non-zero components. For converting the index into a codevector again, separate information on number and positions of non-zero components of a codevector and on signs of components of this codevector are extracted from the index again. The codevectoris then assembled such that it complies with the extracted information on number and positions of the non-zero components and on signs of the non-zero components. MainClaim: A method comprising:determining number and positions of non-zero components of a codevector, said codevector being associated to a point of an outer shell of a rectangular truncated lattice and representing quantized audiodata;determining signs of said non-zero components of said codevector; andcalculating an index for said codevector bycombining at least a term representing said determined number of non-zero components, a term representing determined positions of non-zero components and a term representing determined signs of non-zero components.

5,812,967

Recursive pitch predictor employing an adaptively determined search window


Ponceleon; Dulce | Manduchi; Roberto | Chu; Ke-Chiang | Wu; Hsi-Jung

704 G10L 19960930 0 100%

Abstract: A method for improved recursive pitch prediction includes providing a search window for pitch estimates based upona previously computed pitch, computing pitch estimates for the search window, and determining an optimal pitch from the pitchestimates within the search window for a first predetermined number of frames. The method further includes expanding thesearch window to a full pitch window after the first predetermined number of frames, and calculating pitch estimates for the fullpitch window for a second predetermined number of frames. A system for improved recursive pitch prediction includes a speechgenerator of speech signals, and a central processing unit coupled to the speech generator. The central processing unit further iscapable of coordinating pitch estimation of the speech signals, including providing a search window for pitch estimates basedupon a previously computed pitch, calculating pitch estimates for the search window, and determining an optimal pitch from thepitch estimates within the search window for a first predetermined number of frames. MainClaim: A method for improved recursive pitch prediction in digital speech signal processing, the method comprising thesteps of:

a) utilizing a search window that falls within a full pitch window for pitch estimates based upon a location of a previouslycomputed pitch within the search window;

b) determining pitch estimates for the search window; and

c) determining an optimal pitch from the pitch estimates within the search window for a first predetermined number of frames,wherein inter-frame correlation of pitch in speech signals is better estimated.

6,915,257

Method and apparatus for speech coding with voiced/unvoiced determination


Heikkinen; Ari | Pietila; Samuli | Ruoppila; Vesa

704 G10L 20001221 2 95%

Abstract: This invention presents a voicing determination algorithm for classification of a speech signal segment as voiced orunvoiced. The algorithm is based on a normalized autocorrelation where the length of the window is proportional to the pitchperiod. The speech segment to be classified is further divided into a number of sub-segments, and the normalized autocorrelation is calculated for each sub-segment if a certain number of the normalized autocorrelation values is above apredetermined threshold, the speech segment is classified as voiced. To improve the performance of the voicing determinationalgorithm in unvoiced to voiced transients, the normalized autocorrelations of the last sub-segments are emphasized. The performance of the voicing decision algorithm can be enhanced by utilizing also the possible lookahead information. MainClaim: A method for determining the voicing of a speech signal segment, comprising the steps of: dividing a speech signalsegment into sub-segments, determining a value relating to the voicing of respective speech signal sub-segments, comparing said values with a predetermined threshold, and making a decision on the voicing of the speech segment based on the numberof the values on one side of the threshold and with emphasis on at least one last sub-segment of the segment.

7,680,651 Signal modification method for efficient coding of speech signals

Nokia Corporation

Tammi; Mikko | Jelinek; Milan | LaFlamme; Claude | Ruoppila; Vesa

704 G10L 20021213 1 94%

Abstract: In accordance with the exemplary embodiments of the invention there is disclosed at least a method and apparatusfor determining a long-term-prediction delay parameter characterizing a long term prediction in a technique using signalmodification for digitally encoding a sound signal, the sound signal is divided into a series of successive frames, a feature of thesound signal is located in a previous frame, a corresponding feature of the sound signal is located in a current frame, and thelong-term-prediction delay parameter is determined for the current frame while mapping, with the long term prediction, thesignal feature of the previous frame with the corresponding signal feature of the current frame. Each divided frame of the soundsignal is partitioned into a plurality of signal segments, and at least a part of the signal segments of the frame are warped whileconstraining the warped signal segments inside the frame. MainClaim: A method, comprising: storing a sound signal in a storage medium; dividing the sound signal into a series ofsuccessive frames; locating, by a device, a pitch pulse in a previous frame of the successive frames; locating a correspondingpitch pulse in a current frame of the successive frames; and forming a delay contour comprising determining a long termprediction delay parameter for the current frame by iterating a function, where the function is of a temporary time variable andlocations of the pitch pulses in the previous and current frames, where the delay contour maps, with the long term predictiondelay parameter, the pitch pulse of the previous frame to the corresponding pitch pulse of the current frame, and where thefunction is iterated backwards from the pitch pulse in the current frame towards the pitch pulse in the previous frame to equal aposition of the pitch pulse in the previous frame.

2009/0063139 Signal modification method for efficient coding of speech signals

Nokia Corporation

Tammi; Mikko | Jelinek; Milan | LaFlamme; Claude | Ruoppila; Vesa

704 G10L 20081021 1 94%

Abstract: For determining a long-term-prediction delay parameter characterizing a long term prediction in a technique using signal modification for digitally encoding a sound signal, the sound signal is divided into a series of successive frames, a featureof the sound signal is located in a previous frame, a corresponding feature of the sound signal is located in a current frame, and

www.patentics.com


the long-term-prediction delay parameter is determined for the current frame while mapping, with the long term prediction, thesignal feature of the previous frame with the corresponding signal feature of the current frame. In a signal modification methodfor implementation into a technique for digitally encoding a sound signal, the sound signal is divided into a series of successiveframes, each frame of the sound signal is partitioned into a plurality of signal segments, and at least a part of the signalsegments of the frame are warped while constraining the warped signal segments inside the frame. For searching pitch pulses ina sound signal, a residual signal is produced by filtering the sound signal through a linear prediction analysis filter, a weightedsound signal is produced by processing the sound signal through a weighting filter, the weighted sound signal being indicative ofsignal periodicity, a synthesized weighted sound signal is produced by filtering a synthesized speech signal produced during alast subframe of a previous frame of the sound signal through the weighting filter, a last pitch pulse of the sound signal of theprevious frame is located from the residual signal, a pitch pulse prototype of given length is extracted around the position of thelast pitch pulse of the sound signal of the previous frame using the synthesized weighted sound signal, and the pitch pulses arelocated in a current frame using the pitch pulse prototype. MainClaim: A method, comprising:dividing a sound signal into a series of successive frames;dividing each frame into a numberof subframes;producing a residual signal by filtering the sound signal through a linear prediction analysis filter;locating a lastpitch pulse of the sound signal of a previous frame from the residual signal;extracting a pitch pulse prototype of given lengtharound the position of the last pitch pulse of the previous frame using the residual signal; andlocating pitch pulses in a currentframe using the pitch pulse prototype.

6,212,494

Method for extracting knowledge from online documentation and creating a glossary, index, help database or the like

Apple Computer, Inc. Boguraev; Branimir K.

704 G06F 19980720 0 100%

Abstract: A method involving computer-mediated linguistic analysis of online technical documentation to extract and catalogfrom the documentation knowledge essential to, for example, creating a online help database useful in providing onlineassistance to users in performing a task. The method comprises stripping markup tags from the documentation, linguisticallyanalyzing and annotating the text, including the steps of morphologically and lexically analyzing the text, disambiguatingbetween possible parts-of-speech for each word, and syntactically analyzing and labeling each word. The method furthercomprises the steps of combining the linguistically analyzed, annotated, and labeled text and previously stripped markupinformation into a merged file, mining the merged file for domain knowledge, including the steps of identifying and creating a listof technical terminology, mining the merged file for manifestations of domain primitives and maintaining a list of manifestationsof such domain primitives in an observations file, analyzing the discourse context of each sentence or phrase in the merged file,analyzing the frequency of manifestations of domain primitives in the observations file to determine those that are important,expanding the list of key terms by searching for terms sanctioned by a domain primitive deemed important in the previous step,and searching the merged file for larger relations by searching for particular lexico-syntactic patterns involving key terms and manifestations of domain primitives previously identified. The method further comprises the steps of structuring the knowledgethus mined and building a domain catalog. MainClaim: A machine-readable medium having stored thereon sequences of instructions, which when executed by a processor cause the processor to:

a) linguistically analyze and annotate text of online documentation to create a linguistically analyzed and annotated text;

b) mine said linguistically analyzed and annotated text for text representative of said online documentation, including:

i) searching for syntactic patterns indicative of key terms and maintaining a list of said key terms,

ii) searching for syntactic patterns indicative of manifestations of a domain primitive involving one of said key terms andmaintaining a list of said manifestations, and

iii) analyzing said list of said manifestations to determine said manifestations that are representative of said onlinedocumentation on the basis of frequency of their occurrence; and

c) combining said list of said key terms and said list of said manifestations that are representative of said online documentationin a domain catalog.



6,192,336 Method and system for searching for an optimal codevector


Manduchi; Roberto | Ponceleon; Dulce | Chu; Ke-Chiang | Wu; Hsi-Jung

704 G10L 19960930 0 100%

Abstract: Method and system aspects for searching for an optimal codevector from a plurality of codevectors in a codebook, theoptimal codevector having a minimum distance to a given vector, are provided. The aspects determine a partial distance with acurrent vector component of a current codevector and of the given vector, compare the partial distance to a saved renormalized

www.patentics.com


minimum partial distance, and proceed to a next codevector when the saved renormalized minimum partial distance is smallerthan the partial distance. In addition, the present invention proceeds to a next vector component when the partial distance issmaller than the saved renormalized minimum partial distance. When the partial distance computed with each next vectorcomponent is smaller than the saved renormalized minimum partial distance, the present invention calculates a full weighteddistance value, compares it to a saved minimum full weighted distance, and updates chosen values. The operation thencontinues with a next codevector until all codevectors have been used. An optimal index to identify the optimal codevector isreturned when all codevectors have been used. MainClaim: A method for searching for an optimal codevector from a plurality of codevectors in a codebook for data modelingof input signals to a data processing system, including a system for processing speech signals, the optimal codevector having aminimum weighted distance to a given vector, the codevectors comprising a plurality of components, the method comprising:

determining, for an input signal to a processing system to convert the input signal from an analog representation to a digitalrepresentation, a partial distance between a current vector component of a current codevector and of a correspondingcomponent of the given vector;

comparing the partial distance to a saved renormalized minimum partial distance; and

proceeding to a next codevector when the saved renormalized minimum partial distance is smaller than the partial distance,whereby an optimal representation of the input signal as a digital signal in the processing system is efficiently achieved.



7,003,454

Method and system for line spectral frequency vector quantization in speech codec

Nokia Corporation Rämö; Anssi 704 G10L 20010516 2 92%

Abstract: A method and system for quantizing LSF vectors in a speech coder, wherein predicted LSF values based on previouslydecoded output values are used to estimate spectral distortion, along with the residual codebook vectors and the LSFcoefficients. The method comprises the steps of obtaining a plurality of quantized LSF coefficients from the respective predictedLSF values and the residual codebook vectors; rearranging the quantized LSF coefficients in the frequency domain in an orderlyfashion; obtaining the spectral distortion from the rearranged quantized LSF coefficients and the respective LSF coefficients; andan optimal code vector is selected based on the spectral distortion. MainClaim: A method of quantizing spectral parameter vectors in a speech coder, wherein a linear predictive filter is used tocompute a plurality of spectral parameter coefficients in a frequency domain, and wherein a pluraltiy of predicted spectralparameter values based on previously decoded output values, and a plurality of residual codebook vectors, along with saidplurality of spectral parameter coefficients, are used to estimate spectral distortion for selecting an optimal code vector based onthe spectral distortion, said method comprising the steps of:

obtaining a plurality of quantized spectral parameter coefficients from the respective predicted spectral parameter values andthe residual codebook vectors for forming a quantized spectral representation, the representation having a plurality of elementsindicative of said plurality of the quantized spectral parameter coefficients;

rearranging the quantized spectral parameter coefficients in the frequency domain in an orderly fashion such that the elementsin the representation are distributed in an ascending order; and

obtaining the spectral distortion from the rearranged quantized spectral parameter coefficients and the respective spectralparameter coefficients.

2003/0014249


Nokia Corporation Ramo, Anssi 704 G10L 20010516 2 92%

Abstract: A method and system for quantizing LSF vectors in a speech coder, wherein predicted LSF values based on previouslydecoded output values are used to estimate spectral distortion, along with the residual codebook vectors and the LSFcoefficients. The method comprises the steps of obtaining a plurality of quantized LSF coefficients from the respective predictedLSF values and the residual codebook vectors; rearranging the quantized LSF coefficients in the frequency domain in an orderlyfashion; obtaining the spectral distortion from the rearranged quantized LSF coefficients and the respective LSF coefficients; andan optimal code vector is selected based on the spectral distortion. MainClaim: A method of quantizing spectral parameter vectors in a speech coder, wherein a linear predictive filter is used tocompute a plurality of spectral parameter coefficients in a frequency domain, and wherein a pluraltiy of predicted spectralparameter values based on previously decoded output values, and a plurality of residual codebook vectors, along with saidplurality of spectral parameter coefficients, are used to estimate spectral distortion for selecting an optimal code vector based onthe spectral distortion, said method comprising the steps of: obtaining a plurality of quantized spectral parameter coefficientsfrom the respective predicted spectral parameter values and the residual codebook vectors; rearranging the quantized spectral

www.patentics.com


parameter coefficients in the frequency domain in an orderly fashion; and obtaining the spectral distortion from the rearrangedquantized spectral parameter coefficients and the respective spectral parameter coefficients.

5,799,268

Method for extracting knowledge from online documentation and creating a glossary, index, help database or the like

Apple Computer, Inc. Boguraev; Branimir K.

704 G06F 19940928 0 100%

Abstract: A method involving computer-mediated linguistic analysis of online technical documentation to extract and catalogfrom the documentation knowledge essential to, for example, creating a online help database useful in providing onlineassistance to users in performing a task. The method comprises stripping markup tags from the documentation, linguisticallyanalyzing and annotating the text, including the steps of morphologically and lexically analyzing the text, disambiguatingbetween possible parts-of-speech for each word, and syntactically analyzing and labeling each word. The method furthercomprises the steps of combining the linguistically analyzed, annotated, and labeled text and previously stripped markupinformation into a merged file, mining the merged file for domain knowledge, including the steps of identifying and creating a listof technical terminology, mining the merged file for manifestations of domain primitives and maintaining a list of manifestationsof such domain primitives in an observations file, analyzing the discourse context of each sentence or phrase in the merged file,analyzing the frequency of manifestations of domain primitives in the observations file to determine those that are important,expanding the list of key terms by searching for terms sanctioned by a domain primitive deemed important in the previous step,and searching the merged file for larger relations by searching for particular lexico-syntactic patterns involving key terms and manifestations of domain primitives previously identified. The method further comprises the steps of structuring the knowledgethus mined and building a domain catalog. MainClaim: In a computer system having access to online documentation, a method of extracting knowledge from said onlinedocumentation, comprising the steps of:

a) linguistically analyzing and annotating text of said online documentation to create a linguistically analyzed and annotatedtext;

b) mining said linguistically analyzed and annotated text for text representative of said online documentation, including thesteps of:

i) searching for syntactic patterns indicative of key terms and maintaining a list of said key terms;

ii) searching for syntactic patterns indicative of manifestations of a domain primitive involving one of said key terms andmaintaining a list of said manifestations; and

iii) analyzing said list of said manifestations to determine said manifestations that are representative of said onlinedocumentation on the basis of frequency of their occurrence; and

c) combining said list of said key terms and said list of said manifestations that are representative of said online documentationin a domain catalog.




7,369,987 Multi-language document search and retrieval system

Apple Inc.Loofbourrow; Wayne | Casseres; David

704 G06F 20061229 0 100%

Abstract: A multi-lingual indexing and search system is presented that performs tokenization and stemming in a manner whichis independent of whether index entries and search terms appear as words in a dictionary. The system includes a tokenizer thatseparates a string of text into individual word tokens, and eliminates predetermined types of tokens from further processing.The system also includes a stemmer that reduces words to grammatical stems by removing known word-endings associated with the various languages to be supported. The stemmer removes known word endings from the word tokens without anyeffort to guarantee that the remaining stem is contained in a dictionary. In an embodiment, the stemmer only removes thoseword endings which are associated with nouns. The system further includes an indexer that stores the stems in an index. MainClaim: A system for indexing textual content in any of a plurality of languages for searching purposes, comprising: aprocessing device, comprising: a tokenizer which separates a string of text into individual word tokens, a stemmer whichreduces the word tokens to grammatical stems by removing word endings which are associated with any one or more of thelanguages, without regard to whether the remaining stem is a recognized word in any combination of the plurality of languages,and an indexer which creates an index from the stems; and a computer-readable medium which stores the created index.



Abstract: Embodiments are directed to efficient multilingual inverse text normalization (ITN) of text in spoken form to producenormalized text for display. Embodiments are directed to preprocessing the multilingual text into a language-independent

www.patentics.com


representation, tokenizing text in spoken form, segmenting the tokenized text into ITN items by grouping consecutive wordsusing an ITN lexicon, classifying the ITN items into ITN categories by using the ITN lexicon or tagged information from languagemodel, applying one or more ITN rules that are selected based on the ITN categories into which ITN items have been classifiedto rewrite the ITN items; and post processing the ITN item and outputting inversely normalized text in written form for display.The ITN lexicon may include ITN lexicon entries that are each located within an ITN category in the ITN lexicon. MainClaim: A method comprising:segmenting text in spoken form into inverse text normalization items by groupingconsecutive words using an inverse text normalization lexicon;classifying the inverse text normalization items into inverse textnormalization categories by using the inverse text normalization lexicon;applying one or more inverse text normalization rulesthat are selected based on the inverse text normalization categories into which inverse text normalization items have beenclassified to rewrite the inverse text normalization items; andpost processing the inverse text normalization item and outputtinginversely normalized text in written form for display.

7,136,803 Japanese virtual dictionary Apple Computer, Inc.

Kida; Yasuo | Hara; Keisuke 704 G06F 20010925 0 100%

Abstract: Methods for converting a source character string to a target character string are described herein. In one aspect ofthe invention, an exemplary method includes receiving a first character string having the source character string, dividing thefirst character string into a plurality of sub-strings, converting the plurality of the sub-strings to second character strings through a dictionary, creating third character strings corresponding to the plurality of the sub-strings, analyzing the second and third character strings, constructing fourth character strings from the second and third character strings based on the analysis,creating a candidate list based on the fourth character strings, selecting the target character string from the candidate list andoutputting the target character string. Other methods and apparatuses are also described. MainClaim: A machine implemented method of converting a source character string to a target character string, comprising:dividing a first character string into a plurality of sub-strings, the first character string having the source character string;converting the plurality of sub-strings to second character strings, through a dictionary; creating artificially created words as third character strings corresponding to the plurality of sub-strings; analyzing the second character strings and the third character strings; constructing fourth character strings from the second and third character strings based on the analysis;creating a candidate list based on the fourth character strings; selecting the target character string from the candidate list; andoutputting the target character string.

2006/0005129

Method and apparatus for inputting ideographic characters into handheld devices

Nokia Corporation

Wen; Yandong | Lu; Meng | Zou; Gekai | Luo; Donglai | Cui; Yanqing | Nan; Zhe | Gou; Yong | Guo; Wenjing

715 G06F 20050531 2 93%

Abstract: The present invention provides a method of inputting ideographic characters into a handheld device, comprising stepsof: predicting ideographic characters that correspond to symbols inputted by a user, for said user to select; predicting, based ona previous ideographic character that has been selected by said user, ideographic characters that most likely follow saidprevious ideographic character but cannot form a phrase with said previous ideographic character, for said user to select; andinputting ideographic characters that have been selected by said user into said handheld device. The present invention alsoprovides an apparatus for inputting ideographic characters and a handheld device. According to the invention, more ideographiccharacters and punctuation marks are automatically predicted, which speeds up the process of inputting ideographic charactersinto handheld devices. MainClaim: A method of inputting ideographic characters into a device, the method comprising: predicting ideographiccharacters that correspond to symbols inputted by a user, for said user to select; predicting, based on a previous ideographiccharacter that has been selected by said user, ideographic characters that most likely follow said previous ideographic characterbut cannot form a phrase with said previous ideographic character, for said user to select; and inputting ideographic charactersthat have been selected by said user into said device.

2006/0229864

Method, device, and computer program product for multi-lingual speech recognition

Nokia CorporationSuontausta; Janne | Tian; Jilei 704 G06F 20050407 3 92%

Abstract: A method of multi-lingual speech recognition can include determining whether characters in a word are in a sourcelist of a language-specific alphabet mapping table for a language, converting each character not in the source list according to ageneral alphabet mapping table, converting each converted character according to the language-specific alphabet mapping table, verifying that each character in the word is in a character set of the language, removing characters not in the characterset of the language, and identifying a pronunciation of the word. MainClaim: A method of multi-lingual speech recognition, the method comprising: determining whether characters in a wordare in a source list of a language-specific alphabet mapping table for a language; converting each character not in the source listaccording to a general alphabet mapping table and, where such conversion is performed, converting each converted characteraccording to the language-specific alphabet mapping table for the language; verifying that each character in the word is in acharacter set of the language; removing characters not in the character set of the language; and identifying a pronunciation ofthe word.

5,680,480 Method and apparatus for training a recognizer


Beernink; Ernest H. | Temkin; David T. | Auguste; Donna M.

382 G06K 19940729 0 100%

Abstract: A method and apparatus for training a recognizer includes displaying a practice word on a display screen of a pen-based computer system and entering a handwritten word that is similar to the practice word on the display screen. A recognizedcandidate list that includes candidate words and an associated confidence level for each candidate word is derived from thehandwritten word by a recognizer. The confidence level indicates how confidently the handwritten word has been matched to theassociated candidate word. The candidate list is displayed and a training database is updated with training data derived from thehandwritten word. The training data is used by the recognizer to recognize other handwritten words with greater accuracy. Apractice word that is either easily recognized by the recognizer or recognized with difficulty can be displayed, and the easilyrecognized practice words are randomly retrieved from a dictionary tree of characters to provide words of reasonable length anda variety of types and combinations of characters. MainClaim: A method for training a recognizer of a pen-based computer system, the method comprising the steps of:

www.patentics.com


having a pen-based computer system display a practice word on a display screen of said pen-based computer, said practice word being easily recognized accurately by said recognizer when entered as a handwritten word by a user, said easilyrecognized practice word being displayed when an indication from said user is received to display a practice word that is easilyrecognized;

having a user of said pen-based computer system enter a first handwritten word that said user desires to be recognized as saidpractice word into said pen-based computer system using a stylus;

obtaining a recognized candidate list from a recognizer, said candidate list being derived from said first handwritten word andincluding a plurality of candidate words and an associated confidence level for each of said plurality of candidate words, saidconfidence level indicating how confidently said first handwritten word has been matched to said associated candidate word,wherein each of said candidate words includes a sequence of a plurality of characters, wherein each of said candidate words hasa different recognized meaning from all other candidate words in said candidate list, and wherein each of said candidate wordsincludes a different number, sequence, or identity of characters from said other candidate words;

displaying said candidate list including said plurality of candidate words and said associated confidence levels on said displayscreen of said pen-based computer system, said candidate words being displayed in an order from the most confidentlyrecognized candidate word to the least confidently recognized candidate word; and

updating a training database with training data derived from said first handwritten word such that when a second handwrittenword is entered, said training data may be utilized to recognize said second handwritten word with greater accuracy.

2006/0005129

Method and apparatus for inputting ideographic characters into handheld devices

Nokia Corporation

Wen; Yandong | Lu; Meng | Zou; Gekai | Luo; Donglai | Cui; Yanqing | Nan; Zhe | Gou; Yong | Guo; Wenjing

715 G06F 20050531 2 93%

Abstract: The present invention provides a method of inputting ideographic characters into a handheld device, comprising stepsof: predicting ideographic characters that correspond to symbols inputted by a user, for said user to select; predicting, based ona previous ideographic character that has been selected by said user, ideographic characters that most likely follow saidprevious ideographic character but cannot form a phrase with said previous ideographic character, for said user to select; andinputting ideographic characters that have been selected by said user into said handheld device. The present invention alsoprovides an apparatus for inputting ideographic characters and a handheld device. According to the invention, more ideographiccharacters and punctuation marks are automatically predicted, which speeds up the process of inputting ideographic charactersinto handheld devices. MainClaim: A method of inputting ideographic characters into a device, the method comprising: predicting ideographiccharacters that correspond to symbols inputted by a user, for said user to select; predicting, based on a previous ideographiccharacter that has been selected by said user, ideographic characters that most likely follow said previous ideographic characterbut cannot form a phrase with said previous ideographic character, for said user to select; and inputting ideographic charactersthat have been selected by said user into said device.

6,822,585 Input of symbolsNokia Mobile Phones, Ltd.

Ni; Jian | Gou; Yong | Gao; Ninghui

341 G09G 20000915 1 92%

Abstract: A mobile phone has a display and a keypad which comprises a plurality of keys. Each key has associated with it aplurality of different symbols. The keypad is used to enter symbols in the form of Pinyin strings (25) into the display which arethen used to determine a candidate list (26) of Chinese characters which are presented in the display. Symbols are entered intothe display by pressing respective keys once or more than one times in rapid succession. Selection of a symbol is only permittedif it corresponds to a valid Pinyin string (25), either in isolation or in combination with one or more symbols entered in aprevious selection. Characters chosen from the candidate list are entered into a message (24) in the display. MainClaim: A method of inputting characters into a terminal the terminal having a display and at least a first symbol entry keyand a second symbol entry key the first symbol entry key representing a first set of different symbols and the second symbolentry key representing a second set of different symbols in which use of the first symbol entry key to make a previous selectionof a particular symbol from the first set of symbols is used to determine which of those symbols represented by the secondsymbol entry key is/are selectable in a subsequent selection wherein a character is input-able before a complete set of symbols corresponding to that character is selected.

7,725,838 Communication terminal having a predictive editor application

Nokia Corporation Williams; Stephen 715 G06F 20061130 2 92%

Abstract: A communication terminal having a display; a keypad having a plurality of keys associated with several letters each;processor means controlling the display means in accordance with the operation of the keypad; a selectable predictive editorprogram for generating an output containing words matching a received string of ambiguous key strokes, said predictive editorprogram has a number of associated vocabularies including at least one language dependent dictionary and at least onedictionary receiving user defined inputs. An editor application is controlled by the processor means communicates with saidpredictive editor programs for generating matching words based on an ambiguous string of key strokes. Second memory meansof the communication terminal for storing user inputted data. The processor means automatically searches said second memorymeans for words and copies these words into said at least one dictionary for receiving user defined inputs and associated withsaid predictive editor program. MainClaim: A communication terminal comprising: a keypad having a plurality of keys associated with several letters each; aprocessor for receiving a string of ambiguous key strokes from the keypad; a predictive editor program associated with theprocessor for generating words matching the received string of ambiguous key strokes, said predictive editor program having anumber of associated vocabularies including at least one language dependent dictionary and at least one dictionary for receivinguser defined inputs; a first editor application, controlled by the processor, operatively associated with said predictive editorprogram for generating matching words based on said at least one language dependent dictionary and/or said at least onedictionary for receiving user defined inputs; a second editor application controlled by said processor for entering key strokes inan unambiguous form; wherein said second editor is used to edit said matching words generated by said first editor application;and wherein said processor stores the edited words in said at least one dictionary for receiving user defined inputs; wherein said

www.patentics.com


processor associates a storing time for the edited words stored in said dictionary for receiving user defined inputs and saidprocessor resets the associated storing time with each use of the edited words; and wherein said processor maintains thedictionary containing the edited words dependent on the storing time.

5,408,655 User interface system and method for traversing a database


Oren; Timothy R. | Kreitman; Kristee M. | Salomon; Gitta B.

715 G06F 19920618 0 100%

Abstract: A user interface system and method for traversing a database. In one aspect the present invention includes providinga plurality of command options, each of the command options represented by a set of descriptive option index termscharacterizing that command option. The set of descriptive option index terms characterizing the command options selected by auser, are compared with sets of document index terms. Each set of document index terms being compared characterizes anelectronic document in a hypertext-type database which is selectively linked in that database with the user's present position.The comparisons result in a ranked list of the selectively linked electronic documents. The electronic documents are ranked inaccordance with the relevancy of each document with respect to the selected command option. In another aspect of theinvention, a plurality of command options are generated and displayed on a computer controlled display system (CCDS), eachcommand option being represented by a portrayed character or personality associable to the user as being biased toward aparticular type of information. Each of the command options represent a set of option index terms which characterize thatparticular command option. The set of option index terms characterizing the command option presently selected are comparedwith sets of document index terms. Each set of document index terms characterize an electronic document located within thedatabase. The comparisons result in a ranked list of electronic documents, the documents being ranked in accordance with theparticular bias of the portrayed character or personality. MainClaim: A method for a user of a computer system to traverse a database to retrieve an electronic document stored in saiddatabase, said method comprising the steps of:

a) providing a hypertext-type database, said hypertext-type database including a plurality of hypertext-type nodes, each of said hypertext nodes corresponding to an electronic document, wherein each of said hypertext-type nodes may be selectively linked to other of said hypertext-type nodes;

b) providing a set of descriptive index terms;

c) indexing said hypertext-type database by assigning a unique first subset of said descriptive index terms to each of saidelectronic documents;

d) providing a plurality of first command options on a computer control display system (CCDS), said CCDS coupled to saidhypertext-type database, each first command option representing a second subset of said descriptive index terms;

e) said user selecting a first command option on said CCDS;

f) comparing said first subset of descriptive index terms of said electronic documents with said second subset of said descriptiveindex terms of said selected first command option;

g) producing a ranked list of electronic documents based on said comparing step f), said ranked list of electronic documentshaving a highest ranked document, and remaining electronic documents selectively linked to said highest ranked document, saidhighest ranked document representing a user's position, within the hypertext-type database;

h) providing a plurality of second command options on said CCDS;

i) said user selecting one of said second command options on said CCDS, said one of said second command options representinga desired electronic document in said ranked list; and

j) changing said user's position to correspond with said desired electronic document corresponding to said one of said secondcommand options.

2005/0246324

System and associated device, method, and computer program product for performing metadata-based searches

Nokia Inc.

Paalasmaa, Joonas | Sorvari, Antti | Salmenkaita, Jukka-Pekka

707 G06F 20040430 8 92%

Abstract: Provided are improve data search and management systems, devices, methods, and computer program products forperforming metadata-based searches and displaying the initial results as clusters depending upon search criteria, search results,or physical limitations of a device such as a display. Using clusters provides an intuitive way of displaying results on a compactdevice with a small screen and limited user interface. MainClaim: A system for performing metadata-based searching, comprising: a memory capable of storing data files and associated metadata; and a processor interoperably coupled to said memory and capable of searching said metadata to produceresults with associated metadata, clustering said results based upon metadata of said results, and displaying said clusteredresults.

7,565,605 Reorganizing content of an electronic document

Nokia, Inc.

Schohn; Gregory C. | Berger; Adam L. | Romero; Richard D.

715 G06F 20010508 7 92%

Abstract: An electronic document is received that represents serial data that contains content of the document and defines anorder in which respective portions of the content are to be performed. The serial data of the electronic document is analyzed.Reorganization information is generated for use in delivering the portions of the content, the reorganization information enablingperformance in an order different from the order defined by the serial data.

www.patentics.com


MainClaim: A method comprising: receiving an electronic document represented by serial data that contains content of thedocument and defines an order in which respective portions of the content are to be presented on a display for viewing,analyzing the serial data of the electronic document by at least one transformation module to determine an order ofpresentation of the portions of the content different from the order defined by the serial data, the different order of presentationbeing adapted based upon a performance capability of a display of a target device, and generating, via a processor,reorganization information for use in delivering the portions of the content, the reorganization information enabling presentationof the portions in the different order, wherein generating the reorganization information includes adding a hyperlink to a firstsub-document of the portions in the different order, the adding of the hyperlink being performed in response to determining that a location of the hyperlink is separated by at least a predetermined distance from a destination location to which the hyperlinkpoints, the hyperlink being displayed near the beginning of the first sub-document of the portions in the different order, the destination location of the hyperlink being a particular portion of the content that is not at a beginning of the order defined bythe serial data, and the destination location being determined based on the content of the serial data and without regard to theordering of the portions.




707 G06F 19970501 0 100%

Abstract: A user interface system and method for traversing a database. In one aspect the present invention includes providinga plurality of command options, each of the command options represented by a set of descriptive option index termscharacterizing that command option. The set of descriptive option index terms characterizing the command options selected by auser are compared with sets of document index terms. Each set of document index terms being compared characterizes anelectronic document in a hypertext-type database which is selectively linked in that database with the user's present position.The comparisons result in a ranked list of the selectively linked electronic documents. The electronic documents are ranked inaccordance with the relevancy of each document with respect to the selected command option. In another aspect of theinvention, a plurality of command options are generated and displayed on a computer controlled display system (CCDS), eachcommand option being represented by a portrayed character or personality associable to the user as being biased toward aparticular type of information. Each of the command options represent a set of option index terms which characterize thatparticular command option. The set of option index terms characterizing the command option presently selected are comparedwith sets of document index terms. Each set of document index terms characterize an electronic document located within thedatabase. The comparisons result in a ranked list of electronic documents, the documents being ranked in accordance with theparticular bias of the portrayed character or personality. MainClaim: A method for a user of a computer system to use a database to retrieve an electronic document stored in saiddatabase, said method comprising:

a) providing a hypertext-type database, said hypertext-type database including a plurality of hypertext-type nodes, said plurality of hypertext-type nodes corresponding to a plurality of electronic documents, wherein each of said plurality of hypertext-type nodes may be selectively linked to others of said plurality of hypertext-type nodes, the user having a current position within said hypertext-type database;


c) indexing said hypertext-type database by assigning a first subset of said descriptive index terms to each electronic documentof said plurality of electronic documents;

d) receiving user input that specifies a second subset of said descriptive index terms;

e) comparing said first subset of descriptive index terms of said plurality of electronic documents with said second subset of saiddescriptive index terms;

f) presenting a representation of matching electronic documents based on said comparing step e);

g) receiving user input that selects a selected electronic document from said representation of matching electronic documents;and

h) changing said user's position within the hypertext-type database to correspond with said selected electronic document.

2005/0246324


Nokia Inc.


707 G06F 20040430 8 92%


7,565,605 Reorganizing content of an electronic document Nokia, Inc.


715 G06F 20010508 7 92%

Abstract: An electronic document is received that represents serial data that contains content of the document and defines anorder in which respective portions of the content are to be performed. The serial data of the electronic document is analyzed.

www.patentics.com


Reorganization information is generated for use in delivering the portions of the content, the reorganization information enablingperformance in an order different from the order defined by the serial data. MainClaim: A method comprising: receiving an electronic document represented by serial data that contains content of thedocument and defines an order in which respective portions of the content are to be presented on a display for viewing,analyzing the serial data of the electronic document by at least one transformation module to determine an order ofpresentation of the portions of the content different from the order defined by the serial data, the different order of presentationbeing adapted based upon a performance capability of a display of a target device, and generating, via a processor,reorganization information for use in delivering the portions of the content, the reorganization information enabling presentationof the portions in the different order, wherein generating the reorganization information includes adding a hyperlink to a firstsub-document of the portions in the different order, the adding of the hyperlink being performed in response to determining that a location of the hyperlink is separated by at least a predetermined distance from a destination location to which the hyperlinkpoints, the hyperlink being displayed near the beginning of the first sub-document of the portions in the different order, the destination location of the hyperlink being a particular portion of the content that is not at a beginning of the order defined bythe serial data, and the destination location being determined based on the content of the serial data and without regard to theordering of the portions.

5,794,182

Linear predictive speech encoding systems with efficient combination pitch coefficients computation


Manduchi; Roberto | Ponceleon; Dulce | Chu; Ke-Chiang | Wu; Hsi-Jung

704 G10L 19960930 0 100%

Abstract: Method and system aspects for linear predictive speech encoding are disclosed. These aspects comprise the definitionof an error function, the computation of an optimal vector of continuous pitch coefficients together with an optimal pitch, andthe weighted vector quantization of the continuous pitch coefficients. The techniques allows the faster computation of theoptimal combination pitch--continuous coefficient values without substantial loss of optimal results. MainClaim: A method for linear predictive speech encoding comprising the steps of:

a) defining an error function that includes a constant value, the constant value comprising a chosen offset within apredetermined pitch interval;

b) determining an optimal continuous vector;

c) determining an error from the optimal continuous vector;

d) determining if the error is less than a minimum error;

e) providing optimal combination pitch-continuous coefficient values based upon in the minimum error; and

f) providing a weighted vector quantization of an optimal continuous vector of continuous coefficient values.

7,003,454


Nokia Corporation Rämö; Anssi 704 G10L 20010516 2 97%

Abstract: A method and system for quantizing LSF vectors in a speech coder, wherein predicted LSF values based on previouslydecoded output values are used to estimate spectral distortion, along with the residual codebook vectors and the LSFcoefficients. The method comprises the steps of obtaining a plurality of quantized LSF coefficients from the respective predictedLSF values and the residual codebook vectors; rearranging the quantized LSF coefficients in the frequency domain in an orderlyfashion; obtaining the spectral distortion from the rearranged quantized LSF coefficients and the respective LSF coefficients; andan optimal code vector is selected based on the spectral distortion. MainClaim: A method of quantizing spectral parameter vectors in a speech coder, wherein a linear predictive filter is used tocompute a plurality of spectral parameter coefficients in a frequency domain, and wherein a pluraltiy of predicted spectralparameter values based on previously decoded output values, and a plurality of residual codebook vectors, along with saidplurality of spectral parameter coefficients, are used to estimate spectral distortion for selecting an optimal code vector based onthe spectral distortion, said method comprising the steps of:

obtaining a plurality of quantized spectral parameter coefficients from the respective predicted spectral parameter values andthe residual codebook vectors for forming a quantized spectral representation, the representation having a plurality of elementsindicative of said plurality of the quantized spectral parameter coefficients;

rearranging the quantized spectral parameter coefficients in the frequency domain in an orderly fashion such that the elementsin the representation are distributed in an ascending order; and

obtaining the spectral distortion from the rearranged quantized spectral parameter coefficients and the respective spectralparameter coefficients.

2003/0014249


Nokia Corporation Ramo, Anssi 704 G10L 20010516 2 97%

Abstract: A method and system for quantizing LSF vectors in a speech coder, wherein predicted LSF values based on previouslydecoded output values are used to estimate spectral distortion, along with the residual codebook vectors and the LSFcoefficients. The method comprises the steps of obtaining a plurality of quantized LSF coefficients from the respective predictedLSF values and the residual codebook vectors; rearranging the quantized LSF coefficients in the frequency domain in an orderlyfashion; obtaining the spectral distortion from the rearranged quantized LSF coefficients and the respective LSF coefficients; andan optimal code vector is selected based on the spectral distortion. MainClaim: A method of quantizing spectral parameter vectors in a speech coder, wherein a linear predictive filter is used tocompute a plurality of spectral parameter coefficients in a frequency domain, and wherein a pluraltiy of predicted spectral

www.patentics.com


parameter values based on previously decoded output values, and a plurality of residual codebook vectors, along with saidplurality of spectral parameter coefficients, are used to estimate spectral distortion for selecting an optimal code vector based onthe spectral distortion, said method comprising the steps of: obtaining a plurality of quantized spectral parameter coefficientsfrom the respective predicted spectral parameter values and the residual codebook vectors; rearranging the quantized spectralparameter coefficients in the frequency domain in an orderly fashion; and obtaining the spectral distortion from the rearrangedquantized spectral parameter coefficients and the respective spectral parameter coefficients.

5,893,061 Method of synthesizing a block of a speech signal in a celp-type coder

Nokia Mobile Phones, Ltd. Gortz; Udo 704 G10L 19961106 1 97%

Abstract: A new scheme to generate the stochastic excitation for a CELP-type speech codec based upon a hybrid stochastic codebook search technique including use of regular pulse excitation codebooks is described. From the ideal RPE sequence theposition of the first nonzero pulse and the position of the pulse with maximum amount as well as the overall sign of the RPEsequence are determined. The corresponding target vectors and pulse responses of the synthesis filter are stored in databasesbelonging to the positions of the maximum pulse, respectively. These databases are used to derive the stochastic codebook viathe so-called LBG-algorithm. Once the codebook has become available, the position of the maximum pulse serves as pre-selection measure to limit the search for the "best" candidate vector to a "small" subset of the stochastic codebook. MainClaim: A method of synthesizing a block of a speech signal in a CELP-type coder, the method comprising the steps of:

applying an excitation vector to a synthesizer filter of the coder, said excitation vector consisting of two gain normalizedcomponents derived from an adaptive codebook and from a stochastic codebook,

for limiting the computational effort of the stochastic codebook components search, computing an ideal Regular Pulse Excitation(RPE) sequence followed by

determining four parameters, namely

the position of the first nonzero pulse of the ideal RPE excitation sequence,

the position of the maximum pulse within said RPE excitation sequence,

the overall sign of the regular pulse excitation sequence defined as the respective sign of said maximum pulse, and

the position of the corresponding part of the pulse codebook, as the position of the maximum pulse,

wherein the method further comprises a step of transmitting said four parameters to a speech decoder.




707 G06F 19950313 0 100%

Abstract: A user interface system and method for traversing a database. In one aspect the present invention includes providinga plurality of command options, each of the command options represented by a set of descriptive option index termscharacterizing that command option. The set of descriptive option index terms characterizing the command options selected by auser are compared with sets of document index terms. Each set of document index terms being compared characterizes anelectronic document in a hypertext-type database which is selectively linked in that database with the user's present position.The comparisons result in a ranked list of the selectively linked electronic documents. The electronic documents are ranked inaccordance with the relevancy of each document with respect to the selected command option. In another aspect of theinvention, a plurality of command options are generated and displayed on a computer controlled display system (CCDS), eachcommand option being represented by a portrayed character or personality associable to the user as being biased toward aparticular type of information. Each of the command options represent a set of option index terms which characterize thatparticular command option. The set of option index terms characterizing the command option presently selected are comparedwith sets of document index terms. Each set of document index terms characterize an electronic document located within thedatabase. The comparisons result in a ranked list of electronic documents, the documents being ranked in accordance with theparticular bias of the portrayed character or personality. MainClaim: A method for a user of a computer system to traverse a database to retrieve an electronic document stored in saiddatabase, said method comprising the steps of:

a) providing a hypertext-type database, said hypertext-type database including a plurality of hypertext-type nodes, said plurality of hypertext-type nodes corresponding to a plurality of electronic documents, wherein each of said plurality of hypertext-type nodes may be selectively linked to others of said plurality of hypertext-type nodes;


c) indexing said hypertext-type database by assigning a unique first subset of said descriptive index terms to each electronicdocument of said plurality of electronic documents;

d) receiving user input that selects a second subset of said descriptive index terms;

e) comparing said first subset of descriptive index terms of said plurality of electronic documents with said second subset of saiddescriptive index terms;

f) producing a list of electronic documents based on said comparing step e), said list of electronic documents having a firstelectronic document that represents a user's position within the hypertext-type database;

www.patentics.com


g) receiving user input that selects a selected electronic document from said list of electronic documents; and

h) changing said user's position within the hypertext-type database to correspond with said selected electronic document.

2005/0246324


Nokia Inc.


707 G06F 20040430 8 93%


7,565,605 Reorganizing content of an electronic document

Nokia, Inc.


715 G06F 20010508 7 92%

Abstract: An electronic document is received that represents serial data that contains content of the document and defines anorder in which respective portions of the content are to be performed. The serial data of the electronic document is analyzed.Reorganization information is generated for use in delivering the portions of the content, the reorganization information enablingperformance in an order different from the order defined by the serial data. MainClaim: A method comprising: receiving an electronic document represented by serial data that contains content of thedocument and defines an order in which respective portions of the content are to be presented on a display for viewing,analyzing the serial data of the electronic document by at least one transformation module to determine an order ofpresentation of the portions of the content different from the order defined by the serial data, the different order of presentationbeing adapted based upon a performance capability of a display of a target device, and generating, via a processor,reorganization information for use in delivering the portions of the content, the reorganization information enabling presentationof the portions in the different order, wherein generating the reorganization information includes adding a hyperlink to a firstsub-document of the portions in the different order, the adding of the hyperlink being performed in response to determining that a location of the hyperlink is separated by at least a predetermined distance from a destination location to which the hyperlinkpoints, the hyperlink being displayed near the beginning of the first sub-document of the portions in the different order, the destination location of the hyperlink being a particular portion of the content that is not at a beginning of the order defined bythe serial data, and the destination location being determined based on the content of the serial data and without regard to theordering of the portions.

5,432,948 Object-oriented rule-based text input transliteration system

Taligent, Inc. Davis; Mark E. | Lin; Judy

704 G06F 19930426 0 100%

Abstract: A computer implemented system and method utilizing rules instantiated in objects of an object-oriented operating system to transliterate text as it is input into a computer is disclosed. A number of transliterator objects are created in thestorage of the computer, each one of the transliterator objects include transliteration rules arranged in the storage in a preferredorder. Each of the transliteration rules contain a first language character string, a second language character string, and logic forcomparing the first language character string in each of the transliteration rules to a text string that is entered into a computerto determine a subset of transliteration rules which match the entered text string. The entered text is displayed on a computerdisplay as it is input into a computer and a particular one of the plurality of transliterator objects' logic is utilized in response tothe preferred order for selecting one of the subset of transliteration rules and applying it to the first text string to display thesecond language character string of the selected transliteration rule on the display. MainClaim: A computer system for transliterating a first text string containing characters from a first language into a secondtext string containing characters from a second language as it is input to the computer, the system comprising;

(a) a storage;

(b) means for creating a plurality of transliterator objects, each of the plurality of transliterator objects having a plurality oftransliteration rules arranged in the storage in a preferred order, each of the plurality of transliteration rules having a firstlanguage character string and a second language character string, the transliterator object further having an object method forcomparing the first language character string in each of the transliteration rules to the first text string to determine a subset oftransliteration rules which exhibit a match;

(c) a display for displaying text as it is entered into a computer;

(d) means responsive to the first text string for selecting one of the plurality of transliterator objects;

(e) means responsive to the first language characters in the first text string for calling the object method in the selectedtransliterator object; and

(f) means responsive to the preferred order for selecting one of the subset of transliteration rules to the first text string anddisplaying the second language character string of the selected transliteration rule on the display;

wherein each of the plurality of transliterator objects comprises a method for displaying a transliterator icon representing thetransliterator object on the display and the means for selecting one of the plurality of transliterator objects comprises meansresponsive to a selection of a displayed transliterator icon for selecting a corresponding transliterator object.

Method, device, and

www.patentics.com


2006/0229864 computer program product for multi-lingual speech recognition

Nokia CorporationSuontausta; Janne | Tian; Jilei 704 G06F 20050407 3 92%


5,873,111

Method and system for collation in a processing system of a variety of distinct sets of information

Apple Computer, Inc. Edberg; Peter 715 G06F 19960510 0 100%

Abstract: According to the system and method disclosed herein, the present invention provides a system and method fororganizing information to perform accurate and efficient collation for information such as languages of various nationalities andregions. This invention provides a number of improvements over the existing string comparison routines: portability, improvedperformance, ability to handle Unicode, and improved linguistic capability. MainClaim: A method of organizing information for collating in a processing system which includes collation information, themethod comprising:

a) arranging the collation information based on a category, the category being divided into a plurality of subcategories, each ofthe plurality of subcategories including an attribute;

b) providing the information for selecting the category and

c) selecting a result based upon an intersection of any attribute with any other attribute.

2006/0229864

Method, device, and computer program product for multi-lingual speech recognition

Nokia CorporationSuontausta; Janne | Tian; Jilei

704 G06F 20050407 3 93%


5,873,107

System for automatically retrieving information relevant to text being authored


Borovoy; Richard D. | Graves; Michael J. | Machiraju; Nagabhushan Rao | Vemuri; Sunil

715 G06F 19960329 0 100%

Abstract: Text entry and information retrieval are combined in such a way as to automatically offer an author continuousretrieval of information potentially relevant to the text he is authoring. The author enters text in one portion of the userinterface. Keywords are extracted from the text as the author enters them and are used as query words for an informationretrieval mechanism to a document collection. Those queries return relevant information from the document collection in asecond portion of the user interface. The user can then read or ignore the returned information or he can select the returnedinformation to view the full context from which it came. MainClaim: A text authoring system comprising:

a data input client for authoring text;

a keyword extractor for extracting a keyword from the authored text;

an information source;

a search engine for querying the information source using the extracted keyword; and,

a return of the results of the search engine querying the information source.

2005/0246324 System and associated device, method, and computer program product for performing

Nokia Inc. Paalasmaa, Joonas | Sorvari, Antti | Salmenkaita,

707 G06F 20040430 8 92%

www.patentics.com


metadata-based searches

Jukka-Pekka


6,202,058

System for ranking the relevance of information objects accessed by computer users


Rose; Daniel E. | Bornstein; Jeremy J. | Tiene; Kevin | Ponceleon; Dulce B.

706 G06F 19940425 0 100%

Abstract: Information presented to a user via an information access system is ranked according to a prediction of the likelydegree of relevance to the user's interests. A profile of interests is stored for each user having access to the system. Items ofinformation to be presented to a user are ranked according to their likely degree of relevance to that user and displayed in orderof ranking. The prediction of relevance is carried out by combining data pertaining to the content of each item of informationwith other data regarding correlations of interests between users. A value indicative of the content of a document can be addedto another value which defines user correlation, to produce a ranking score for a document. Alternatively, multiple regressionanalysis or evolutionary programming can be carried out with respect to various factors pertaining to document content anduser correlation, to generate a prediction of relevance. The user correlation data is obtained from feedback information providedby users when they retrieve items of information. Preferably, the user provides an indication of interest in each document whichhe or she retrieves from the system. MainClaim: In a computerized information access system, a method for presenting items of information to users, comprisingthe steps of:

a) storing user profiles for users having access to the system, where each user profile is based, at least in part, on the attributesof information the user finds to be of interest;

b) determining an attribute-based relevance factor for an item of information which is indicative of the degree to which anattribute of that item of information matches the profile for a particular user;

c) determining a measure of correlation between the particular user's interests and those of other users who have accessed saiditem of information;

d) combining said relevance factor and said degree of correlation to produce a ranking score for said item of information;

e) repeating steps b, c and d for each item of information to be presented to said particular user; and

f) displaying the items of information to the user in accordance with their ranking scores.

2010/0114944 METHOD AND SYSTEM FOR PROVIDING A VOICE INTERFACE

NOKIA CORPORATION

Adler; Mark R. | Kiss; Imre | Polifroni; Joseph H. | Wu; Tao

707 G06F 20081031 2 92%

Abstract: Methods and systems for providing a voice interface are disclosed. A classifier voice interface of a user terminal mayreceive a query, may parse the query to identify an attribute, and may process the query to select a first domain-specific voice interface of a plurality of domain-specific voice interface based on the attribute, wherein each of the domain-specific voice interface comprises specialized information to process queries of different types. The classifier voice interface may furtherinstruct the first domain-specific voice interface to process the query. MainClaim: A method comprising:receiving a query;parsing the query to identify an attribute;processing the query to select afirst domain-specific voice interface of a plurality of domain-specific voice interfaces based on the attribute, wherein each of thedomain-specific voice interfaces comprises specialized information to process queries of different types; andinstructing the firstdomain-specific voice interface to process the query.

5,473,759 Sound analysis and resynthesis using correlograms

Apple Computer, Inc.Slaney; Malcolm | Lyon; Richard F. | Naar; Daniel

704 G10L 19930222 0 100%

Abstract: A system for reconstructing a signal waveform from a correlogram is based upon the recognition that the informationin each channel of the correlogram is equivalent to the magnitude of the Fourier transform of a signal. By estimating a signal onthe basis of its Short-Time Fourier Transform Magnitude, each channel of information from a cochlear model can be reconstructed. Once this information is retrieved, a signal waveform can be resynthesized through inversion of the cochlearmodel. The process for reconstructing the cochlear model data can be optimized with the use of techniques for improving theinitial estimate of the signal from the magnitude of its Fourier Transform, and by employing information that is known aprioriabout the signal during the estimation process, such as the characteristics of sound signals. MainClaim: A method for generating a waveform which is a modified representation of an original sound, comprising the stepsof:

filtering the original sound through a plurality of filters to produce a cochleagram containing multiple channels of data eachrepresentative of a portion of a frequency range of the original sound;

autocorrelating each channel of data in the cochleagram to produce a correlogram;

modifying the correlogram in accordance with a desired modification of the original sound; and

www.patentics.com


inverting at least one channel of the modified correlogram to generate a first waveform representative of a modified sound.

6,691,090

Speech recognition system including dimensionality reduction of baseband frequency signals


Laurila; Kari | Tian; Jilei

704 G10L 20001024 1 95%

Abstract: A method for use in a speech recognition system in which a speech waveform to be modelled is represented by a setof feature extracted parameters in the time domain, the method comprising dividing individual ones of one or more of saidfeature extracted parameters to provide for each divided feature extracted parameter a plurality of frequency channels, anddemodulating at least one of the plurality of frequency channels to provide at least one corresponding baseband frequencysignal. MainClaim: A method for use in a speech recognition system in which a speech waveform to be modelled is represented by aset of feature extracted parameters, said method comprising dividing individual ones of one or more of said feature extractedparameters to provide in respect to each divided feature extracted parameter a plurality of frequency channels, demodulatingone or more of the plurality of frequency channels to provide respective one or more corresponding baseband frequency signalsand applying dimensionality reduction to said at least one of said one or more baseband frequency signals.

2004/0138876

Method and apparatus for artificial bandwidth expansion in speech processing

Nokia Corporation

Kallio, Loura | Alku, Paavo | Kayhko, Kimmo | Kajala, Matti | Valve, Paivi

704 G10L 20030110 1 92%

Abstract: A method and device for improving the quality of speech signals transmitted using an audio bandwidth between 300Hz and 3.4 kHz. After the received speech signal is divided into frames, zeros are inserted between samples to double thesampling frequency. The level of these aliased frequency components is adjusted using an adaptive algorithm based on theclassification of the speech frame. Sound can be classified into sibilants and non-sibilants, and a non-sibilant sound can be further classified into a voiced sound and a stop consonant. The adjustment is based on parameters, such as the number ofzero-crossings and energy distribution, computed from the spectrum of the up-sampled speech signal between 300 Hz and 3.4 kHz. A new sound with a bandwidth between 300 Hz and 7.7 kHz is obtained by inverse Fourier transforming the spectrum ofthe adjusted, up-sampled sound. MainClaim: A method of improving speech in a plurality of signal segments having speech signals in a time domain, saidmethod characterized by upsampling the signal segments for providing upsampled segments in the time domain; converting theupsampled segments into a plurality of transformed segments having speech spectra in a frequency domain; classifying thespeech signals into a plurality of classes based on at least one signal characteristic of the speech signals; modifying the speechspectra in the frequency domain based on the classes for providing modified transformed segments; and converting the modifiedtransformed segments into speech data in the time domain.

6,804,643 Speech recognitionNokia Mobile Phones Ltd. Kiss; Imre 704 G10L 20001027 1 92%

Abstract: A speech recognition feature extractor for extracting speech features from a speech signal, comprising: a time-to-frequency domain transformer (FFT) for generating spectral magnitude values in the frequency domain from the speech signal;a frequency domain filtering block (Mel) for generating a sub-band value relating to spectral magnitude values of a certain frequency sub-band; a compression block (LOG) for compressing said sub-band values; a transformation block (DCT) for obtaining a set of de-correlated features from the compressed sub-band values; and normalising block (CN) for normalising de-correlated features. MainClaim: A speech recognition feature extractor for extracting speech features from a speech signal, comprising: a time-to-frequency domain transformer for generating spectral magnitude values in the frequency domain from the speech signal;

a frequency domain filtering block for generating a sub-band value relating to spectral magnitude values of a certain frequencysub-band, for each of a group of frequency sub-bands;

a compression block for compressing said sub-band values;

a transformat on block for obtaining a set of de-correlated features from the sub-band values; and

a normalising block for normalizing features;

said feature extractor comprising a mean emphasising block for emphasizing at least one of the sub-band values after frequency domain filtering, wherein the emphasising is accomplished by addition of a mean value of sub-band signals to said at least one of the sub-band values.

5,724,567

System for directing relevance-ranked data objects to computer users


Rose; Daniel E. | Bornstein; Jeremy J. | Tiene; Kevin | Ponceleon; Dulce B.

707 G06F 19940425 0 100%

Abstract: An information access system stores items of information in an unstructured global database. When a user requestsaccess to the system, the system delivers to that user an identification of only those items of information which are believed tobe relevant to the user's interest. The determination as to the items of information that are relevant to a user is carried out byranking each available item in accordance with any one or more techniques. In one approach, the content of each document ismatched with an adaptive profile of a user's interest. In another approach, a feedback mechanism is provided to allow users toindicate their degree of interest in each item of information. These indications are used to determine whether other users, whohave similar or dissimilar interests, will find a particular item to be relevant. MainClaim: An information access system for automatically presenting users with information items of interest, comprising:

a computer system containing a database of information items available to be presented to users of the system;

www.patentics.com


at least one access device for enabling users to communicate with the computer system and access any of the items of availableinformation;

means for storing a user profile for each user having access to the available items of information;

means for raking the likely degree of interest for each of the available items of information in accordance with a user profile;

means for presenting the items of information to an access device in order of ranking and enabling a user to retrieve each item;

means for enabling the user to indicate that user's interest in each retrieved item of information; and

means for updating the user's profile in response to indications of interest provided by the user.

2010/0114944 METHOD AND SYSTEM FOR PROVIDING A VOICE INTERFACE

NOKIA CORPORATION

Adler; Mark R. | Kiss; Imre | Polifroni; Joseph H. | Wu; Tao

707 G06F 20081031 2 92%

Abstract: Methods and systems for providing a voice interface are disclosed. A classifier voice interface of a user terminal mayreceive a query, may parse the query to identify an attribute, and may process the query to select a first domain-specific voice interface of a plurality of domain-specific voice interface based on the attribute, wherein each of the domain-specific voice interface comprises specialized information to process queries of different types. The classifier voice interface may furtherinstruct the first domain-specific voice interface to process the query. MainClaim: A method comprising:receiving a query;parsing the query to identify an attribute;processing the query to select afirst domain-specific voice interface of a plurality of domain-specific voice interfaces based on the attribute, wherein each of thedomain-specific voice interfaces comprises specialized information to process queries of different types; andinstructing the firstdomain-specific voice interface to process the query.

5,355,329

Digital filter having independent damping and frequency parameters

Apple Computer, Inc. Lyon; Richard F. 708 G06F 19921214 0 100%

Abstract: A filter capable of having its damping and frequency parameters independently varied. The filter can be representedin either a digital or an analog computation network. The network comprises four multipliers for multiplying by a frequency termtwice and a damping factor twice. In addition, the network comprises two unit delay blocks for temporarily storing previoussignal input values for zeros or output values for poles. These stored values are used in computing subsequent outputs. Themultipliers are configured with adders and subtractors to compute a next output value as a combination of a current input, aweight -2+2df+f2 --wd2 f2 times the most recent saved value and a weight 1-2df+wd2 f2 times the previous saved value. Moreover, unity gain at DC can be achieved. MainClaim: A recursive filter having independent damping and frequency parameters for generating a sequence of outputvalues in discrete time from a sequence of input values, comprising:

a first state storage means and a second state storage means for storing said sequence of output values, wherein two previousvalues of said sequence of output values are stored and used in calculating a subsequent value of said sequence of outputvalues;

a subtractor means coupled to said first state storage means and said second state storage means for generating a differencebetween said two previous values of said sequence of output values;

a first multiplier means coupled to said subtractor means for multiplying said difference by a damping parameter;

a second multiplier means coupled to an output of said first multiplier means for multiplying a signal obtained from the output ofsaid first multiplier means by said damping parameter;

a third multiplier means coupled to an output of said second multiplier means for multiplying a signal obtained from the outputof said second multiplier means by a frequency parameter;

a fourth multiplier means coupled to an output of said first multiplier means and to an output of said third multiplier means formultiplying a combination of signals obtained from outputs of said first and said third multipliers by said frequency parameter;

a summing means coupled to an output of said fourth multiplier means, said first state storage means, and said second statestorage means for generating said subsequent value of said sequence of output values of said recursive filter.

6,756,845

Method and system for compensating non-linearities and time-varying changes of a transfer function acting on an input signal

Nokia Corporation Mashhour; Ashkan 330 H03F 20020903 1 92%

Abstract: The described method and system are adapted to reduce the error between an ideally expected output signal and theactual output signal. The proposed adaptation algorithm is able to minimise, for instance in a system with a given transferfunction, the error y-x between y=g(f(x)) and x, where g is an unknown and/or time-varing function and f the adaptive function for which the characteristic is changed to track g. The proposed adaptation algorithm updates not only the transfer function f atthe current input value x, but also the transfer function f at other points corresponding to different input values. One of theapplications for such an algorithm is digital predistortion where a transmitter's non-linear characteristic needs to be linearised, in an adaptive manner, since the characteristic exhibits slow changes with temperature, bias, ageing or the like. MainClaim: Method for compensating deviations of an unknown transfer function from an expected transfer function, and/or for

www.patentics.com


compensating time-varying changes of a transfer function acting on an input signal, for minimising errors of an output signalgenerated in dependence on the input signal, which input signal is subjected to a first, adaptive transfer function and to asecond, unknown and/or varying transfer function to generate the output signal, the first transfer function being updated forcompensating deviations or changes of the second transfer function,

wherein, when updating one point of the first transfer function for a current input signal value, the first transfer function is alsoupdated for at least one other point corresponding to a different input signal value.

5,455,858 Method for automatically composing a telephone dialing string

Apple Computer, Inc. Lin; Lee M. 379 H04M 19931001 0 100%

Abstract: A method for automatically composing a telephone dialing string for a telecommunication device having a processor,storage, and a connection to an external telephone system, by storing configuration information for a current location of thetelecommunication device in fields for local country code and local area code; by storing configuration information for dialingprefixes for a current external telephone system connected to the telecommunication device in fields for a prefix for a local call,prefix for a long distance call, and prefix for an international call; and by storing a desired telephone number in fields for adesired country code, a desired area code, and a desired telephone number. Then, forming a telephone dialing string by theprocessor comparing like fields of the desired telephone number to the configuration information for a current location todetermine the need for international, long distance and local access prefixes followed by non-redundant country code, area code and telephone number information; and sending the telephone dialing string to the external telephone system. MainClaim: A method for automatically composing a telephone dialing string for a telecommunication device having aprocessor, storage, and a connection to an external telephone system, comprising:

storing configuration information for a current location of the telecommunication device in fields with at least a field for storing alocal area code;

storing configuration information for dialing prefixes for a current external telephone system connected to thetelecommunication device in fields with at least a field for a prefix for a local call, and a field for a prefix for a long distance call;

storing a telephone number desired to be called in fields with at least a field for a desired area code, and a field for a desiredtelephone number;

forming a telephone dialing string by the processor comparing the stored local area code field to the desired area code field, and

if they match forming the telephone dialing string including the prefix for a local call followed by the desired telephone number,and

if they do not match, forming the telephone dialing string including the prefix for a long distance call followed by the desiredarea code, followed by the desired telephone number, and

sending said telephone dialing string to said external telephone system.

6,233,450

Calling number identification for a radiotelephone operating within a public or autonomous system

Nokia Mobile Phones Ltd. Seppanen; Jorma 455 H04Q 19971202 1 93%

Abstract: A cellular radiotelephone (user terminal) (10) includes a keypad (22) having a plurality of keys (22a, 22b) and adisplay device (20) for displaying information, including messages, to a user. A method includes the steps of providing the userterminal with an access code for a destination receiving device, and specifying that the user terminal provide a communicationsignal through at least one communication network to the destination receiving device. The at least one communication networkis assumed to have a capability of forwarding received communication signals that include access codes having a predeterminedformat to destination receiving devices. In response to specifying step, another step is performed that includes determiningwhether a format of the access code provided to the user terminal differs from the predetermined format. If these formatsdiffer, another step includes modifying the format of the access code provided to the user terminal to produce a modified accesscode having the predetermined format. A further step includes providing the communication signal, including the modifiedaccess code, through the at least one network to the destination receiving device corresponding to the access code originallyprovided to the user terminal. MainClaim: An autonomous system, wherein said autonomous system is coupled to a public switched telephone network(PSTN) having a public cellular system, and said autonomous system is capable of operation with a mobile terminal operable inboth said autonomous system and in said public cellular system, said autonomous system comprising:

a receiver for receiving a call comprising a first call signal from the mobile terminal, said first call signal including a called number, said called number including an extra network dialing code and an extension portion;

a controller coupled to said receiver, said controller for receiving said first call signal from said receiver and generating a secondcall signal, wherein said controller compares said extension portion of said called number with a plurality of extension numbersof said autonomous system to determine whether or not said extension portion is within said plurality of extension numbers and,if said extension portion is not within said plurality of extension numbers generates said second call signal including said extranetwork dialing code and said extension portion, or, if said extension portion is within said plurality of extension numbers,generates said second call signal including said extension portion without including said extra network dialing code; and

an exchange coupled to said controller, said exchange for receiving said second call signal and, if said second call signal includessaid extra network dialing code, routing said call externally from said autonomous system to a destination determined by saidextra network dialing code and said extension portion, or, if said second call signal does not include said extra network dialingcode, said exchange further for routing said call internally within said autonomous system to a destination determined by saidextension portion.

www.patentics.com


6,314,287 Handset and method of operation thereof


Leickel; Torsten | Kraft; Christian

455 H04Q 19980202 1 92%

Abstract: A portable radiophone which is adapted to communicate via a cellular network and at least one cordless network, andwhich comprises a controller unit which controls the communication with said cellular network and said at least one cordlessnetwork, and which registers which networks are connected. When a call is to be established, a storage receives a phonenumber, and the controller unit checks whether the phone number in the storage contains a main number corresponding to themain number of said at least one cordless network. If so, the controller unit determines the extension number of the cordlessnetwork for use in the call on the basis of the stored phone number. MainClaim: A method of establishing a call to a phone using a radiophone which is adapted to communicate via a cellularnetwork and at least one cordless network, said radiophone including a controller and a memory, said method comprising stepsof:

registering in said memory the networks to which the phone is connected, said networks including a cellular network and acordless network;

storing telephone numbers in said memory;

by means of said controller, automatically checking with numbers stored in said memory prior to the establishment of a callwhether a phone number with which the call is to be established contains a main number corresponding to the main number ofsaid at least one cordless network;

determining whether communication is to be via the cellular network or the cordless network based on present location of theradio telephone;

extracting a sequence of digits from the stored numbers of said memory for initiating communication via one of said cellular andsaid cordless networks; and

in the case of communication via the cordless network, said extracting step comprises

determining the extension number of the cordless network if a main number is identified; and

using the extension number of the cordless network when establishing the call via the associated cordless network.

6,330,442

Call dialing for a mobile terminal operating within a public or autonomous system


Seppanen; Jorma 455 H04Q 20010412 1 92%

Abstract: A mobile terminal is provided with an access code for a destination receiving device. The access code specifies thatthe user terminal provide a communication signal through at least one communication network to the destination receivingdevice. The at least one communication network is assumed to have a capability of forwarding received communication signalsthat include access codes having a predetermined format to destination receiving devices. A determination as to whether aformat of the access code provided to the user terminal differs from the predetermined format is performed. If these formatsdiffer, another step includes modifying the format of the access code provided to the user terminal to produce a modified accesscode having the predetermined format in the communication signal. MainClaim: A method for operating a mobile terminal, the method comprising the steps of:

providing the mobile terminal with a first access code corresponding to a destination receiving device;

initiating a call to the destination receiving device;

determining, within the mobile terminal, whether the first access code must be modified to complete the call to the destinationreceiving device; and

if it is determined that the first access code must be modified, performing steps of:

modifying, within the mobile terminal, the first access code to produce a second access code; and

transmitting a communications signal including the second access code to complete the call to the destination receiving device.

5,550,967

Method and apparatus for generating and displaying visual cues on a graphic user interface

Apple Computer, Inc. Brewer; Gregory S. | Commons; Peter

345 G06F 19950918 0 100%

Abstract: A user interface includes an object oriented graphic user interface having overlapping windows and provides anaccess window having topics, index and look for button functions for selection by a user. Through the use of the topics, index orlook for functions, a help inquiry is defined. To assist the user, visual cues in the form of coach marks are generated foridentifying features on the display. The coach marks are rendered such that they appear animated as if drawn by hand andappear to approximate a geometric object, such as an arrow, a circle, an X, and the like. The coach marks encircle, point to,and/or underline objects, features, icons, folders and other display elements to assist the user in operating the computersystem. MainClaim: In a data processing display system having a display, a method for providing visual cues to a user comprising thesteps of:

(a) displaying on said display a user interface having a plurality of objects; and

www.patentics.com


(b) automatically drawing on said display a coach mark having at least one geometric shape to visually identify at least one ofsaid objects on said user interface to said user, wherein said coach mark is formed by a plurality of pen pictures, wherein eachof said plurality of pen pictures is a pixel map having at least two vertically aligned pixels and at least two horizontally alignedpixels, wherein the automatically drawing step (b) includes the steps of:

(i) drawing on said display an initial pen picture for said coach mark, and

(ii) iteratively drawing on said display additional pen pictures for said coach mark over time until said coach mark has been fullyrendered on said display.




2003/0169294

Method and device for providing a representation of applications for display on an electronic device

Nokia CorporationVatula, Veli-Pekka | Iivainen, Jyrki 345 G09G 20030307 30 92%

Abstract: In accordance with this invention, there is disclosed a method for providing a representation of a first application tobe executed in an electronic device that uses the representation to present information of at least one other application thatselects one of the applications for direct display and selects at least another of the applications for indirect display in accordancewith information representative of a state of at least one of the applications. Further, a user interface and an electronic deviceare disclosed having a display and being adapted to operate a plurality of applications having a component for providing arepresentation of one of the applications, a component for using the representation to present information of at least one otherof the applications, and a component for selecting one of the applications for direct display and selecting at least another of theapplications for indirect display in accordance with information representative of a state of at least one of the applications. MainClaim: A method for providing a representation of a first application to be executed in an electronic device, comprising:using said representation to present information of at least one other application; selecting one of said applications for directdisplay and selecting at least another of said applications for indirect display in accordance with information representative of astate of at least one of said applications.

2007/0157117




6,535,230

Graphical user interface providing consistent behavior for the dragging and dropping of content objects

Apple Computer, Inc. Celik; Tantek I. 345 G09G 19950807 0 100%

Abstract: A drag-and-drop operation in a graphical user interface is controlled dependence upon whether the destination for theoperation is a content object or a service object. If the destination of a drag-and-drop operation is a content object, the resulting action is to move the dragged object from its original location to the destination. If the destination is a service object,the resulting action is to perform the associated service on the dragged object without affecting the perceived location of thedata contained in the dragged object. If the user desires that an operation other than a move be made when dragging an objectto a content object, a specified key on a keyboard is pressed, to indicate that the drag-and-drop operation should make a copy, rather than merely move the object. If the source of the dragged object does not permit the user to move the object, the usercan be presented with an option to copy the object when the drag-and-drop operation is carried out. Alternatively, rather than requesting the user to indicate a choice each time such a situation occurs, the computer system can be set up to automaticallymake a copy if the source does not permit the object to be moved. MainClaim: A method for manipulating objects in a graphical user interfaces for a computer, of the type in whichrepresentations of objects stored in a memory are displayed to a user on a display, comprising the steps of:

selecting a first object whose representation is displayed on said display;

dragging the representation of the first object from a first location on the display to a second location associated with a secondobject;

www.patentics.com


determining whether said second object is either a service object or a container object;

performing a service with respect to said first object if said second object is a service object;

detecting whether access to said first object is limited;

moving the representation of the first object from said first location to a new location associated with said second object if saidsecond object is a container object, regardless of a source of the first object if access to said first object is not limited; and

prohibiting the representation of the first object to said new location if access to said first object is limited.

2008/0040668 Creating virtual targets in directory structures Nokia Corporation Ala-Rantala; Kati 715 G06F 20060810 8 95%


2003/0169294







5,825,355

Method and apparatus for providing a help based window system using multiple access methods


Palmer; James Edward | Coleman; Patricia J. | Herman; Jeffrey Alan | Cochran; Eli | Powers, III; John Richard

345 G06F 19930127 0 100%

Abstract: The system includes at least one central processing unit (CPU) which is coupled through appropriate input/output(I/O) circuitry to input devices, such as a keyboard, digital pad, mouse and/or track ball. The CPU is coupled to a hard disk drivefor the storage of programs and data, and may also be coupled to a network through which the CPU may communicate with avariety of other system resources and devices. The CPU is further coupled to a display device such as a CRT or liquid crystaldisplay, on which the present invention is displayed. The user interface of the present invention includes an object orientedgraphic user interface having overlapping windows. The present invention includes an access window having topics, index andlook for button functions for selection by a user. Through the use of the topics, index or look for functions, a help inquiry isdefined. The selection of one of the button functions results in the CPU generating and displaying entries in a predefined area ofthe access window. Upon the selection of one of the entries by a user, the CPU displays phrases related to the selected entry ina working area of the access window. The selection of one of the phrases results in the CPU displaying a presentation window onthe display, which includes help instruction data to guide the user in the particular help task specified by the entry and phraseselection. MainClaim: In a computer display system having a central processing unit (CPU) coupled to a display such that data isdisplayed on said display in windows, a method for instructing a user on how to perform operations using said CPU, the method

www.patentics.com


comprising the steps of:

A. generating and displaying an access window on said display;

B. generating and displaying within said access window a first access function, a second access function, and a third accessfunction;

C. performing the following steps upon selection of said first access function by a user

2005/0022130

Method and device for operating a user-input area on an electronic display device

Nokia Corporation Fabritius, Henna 715 G09G 20040625 11 93%

Abstract: There is disclosed a method and a device for inputting a character into an electronic device, said method comprisingdetecting an input, activating a temporary input area upon detection of said input, displaying said temporary input area on adisplay of said electronic device, and terminating the display and deactivating said temporary input area in case that a relevantevent is detected. The relevant event may be another user-input. MainClaim: Method for inputting a character into an electronic device, said method comprising: detecting an input, activating atemporary input area upon detection of said input, displaying said temporary input area on a display of said electronic device,and terminating the display and deactivating said temporary input area in case that a relevant event is detected.

7,584,429


Nokia Corporation Fabritius; Henna 715 G06F 20040625 10 93%

Abstract: There is disclosed a method and a device for inputting a character into an electronic device, said method comprisingdetecting an input, activating a temporary input area upon detection of said input, displaying said temporary input area on adisplay of said electronic device, and terminating the display and deactivating said temporary input area in case that a relevantevent is detected. The relevant event may be another user-input. MainClaim: A method, comprising: depicting a scroll bar and a button for a search option on a display of an electronic device inan area that is normally reserved for a scroll bar, detecting if a keyboard is connected to said device and suppressing the displayof said button for a search option, if the keyboard is connected, detecting an input on said button for activating a temporaryinput area, activating said temporary input area upon detection of said input, displaying said temporary input area on thedisplay of said electronic device, outputting an audio signal indicating said displaying of said temporary input area, andterminating the display of said temporary input area and deactivating said temporary input area in case that a relevant event isdetected, wherein said temporary input area is displayed in a semi-transparent manner superimposed on a standard display area on said display, and wherein input functions in said standard display area superimposed by said temporary input area aredeactivated when said temporary input area is displayed.

7,184,024

Method and apparatus for mapping an input location with a displayed functional representation

Nokia Corporation Eftekhari; Jamshid 345 G09G 20010119 6 92%

Abstract: A user interface is disclosed which may take a data stream, or file having hyperlinks or functional text embeddedtherein. The CPU of the user interface may select distinct colors for each hyperlink so that such links are distinguishable. Thecolor selection may be made so that each link has a button that that has a matching color for at least one hyperlink. The userinterface associates a button having a color with a hyperlink having the same color, such that when the button is actuated,programmed execution of the function associated with the hyperlink occurs. Thus a mapping of button, to color, to hyperlink, tofunction may be established. MainClaim: A method in a device having a plurality of character-entry pressure points for selecting a function in a markup language file comprising: a) reading the markup language file; b) detecting a reference in a handheld device to a characterencoding having a corresponding function, the corresponding function being displayed in a display of the handheld device; c)illuminating substantially only one character-entry pressure point corresponding to the character encoding, the substantially onlyone character-entry pressure point being disposed in an input area of the handheld device in proximity to the display of thehandheld device, wherein a color associated with a character-entry pressure point when illuminated corresponds to a color of the corresponding navigation function; d) detecting an entry by the character-entry pressure point; and e) triggering the navigation function.

5,600,779

Method and apparatus for providing visual cues in a graphic user interface


Palmer; James E. | Powers, III; John R. | Coleman; Patricia J. | Brewer; Gregory S. | Herman; Jeffrey A. | Cochran; Eli

345 G06F 19950607 0 100%

Abstract: A user interface includes an object oriented graphic user interface having overlapping windows and provides anaccess window having topics, index and look for button functions for selection by a user. Through the use of the topics, index orlook for functions, a help inquiry is defined. The selection of one of the button functions results in the generation and display ofentries in a predefined area of the access window. Upon the selection of one of the entries by a user, phrases related to theselected entry are displayed in a working area of the access window. The selection of one of the phrases results in the display ofa presentation window containing help instruction data to guide the user in the particular help task specified by the entry andphrase selection. To further assist the user, visual cues in the form of coach marks are generated for identifying features on thedisplay which relate to the information disposed within the presentation window, but may identify any feature on the display.The coach marks are displayed generally concurrently with the display of the presentation window. The coach marks aredisplayed such that they appear animated as if drawn by hand and appear to approximate a geometric object, such as an arrow,a circle, an X, and the like. The coach marks encircle, point to, and/or underline objects, features, icons, folders and otherdisplay elements to assist the user in operating the computer system. MainClaim: In a data processing display system having a display, a method for providing visual cues to a user comprising thesteps of:

www.patentics.com


(a) displaying on said display a user interface having a plurality of objects;

(b) automatically drawing on said display a coach mark having at least one geometric shape to visually identify at least one ofsaid objects on said user interface to said user, wherein the automatically drawing step (b) includes

rendering said coach mark over time to achieve the visual appearance of being animated and drawn freehand on said userinterface by a human being.

2005/0022130




7,584,429




7,184,024




5,488,685

Method and apparatus for providing visual cues in a graphic user interface


Palmer; James E. | Powers, III; John R. | Coleman; Patricia J. | Brewer; Gregory S. | Herman; Jeffrey A. | Cochran; Eli

345 G06F 19930127 0 100%

Abstract: A user interface includes an object oriented graphic user interface having overlapping windows and provides anaccess window having topics, index and look for button functions for selection by a user. Through the use of the topics, index orlook for functions, a help inquiry is defined. The selection of one of the button functions results in the generation and display ofentries in a predefined area of the access window. Upon the selection of one of the entries by a user, phrases related to theselected entry are displayed in a working area of the access window. The selection of one of the phrases results in the display ofa presentation window containing help instruction data to guide the user in the particular help task specified by the entry andphrase selection. To further assist the user, visual cues in the form of coach marks are generated for identifying features on thedisplay which relate to the information disposed within the presentation window, but may identify any feature on the display.The coach marks are displayed generally concurrently with the display of the presentation window. The coach marks aredisplayed such that they appear animated as if drawn by hand and appear to approximate a geometric object, such as an arrow,a circle, an X, and the like. The coach marks encircle, point to, and/or underline objects, features, icons, folders and otherdisplay elements to assist the user in operating the computer system. MainClaim: In a data processing display system having a display, a method for providing visual cues to a user comprising thesteps of:

(a) displaying on said display a user interface having a plurality of objects;

www.patentics.com


(b) displaying on said display, in response to said user providing a first signal by inputting a help inquiry, a coach mark havingat least one geometric shape to visually identify at least one of said objects on said user interface to said user,

wherein said coach mark is displayed on said user interface such that said coach mark is rendered over time to achieve thevisual appearance of being animated and drawn freehand on said user interface by a human being;

(c) displaying on said display an access window having a first working area and at least one access button function;

(d) selecting one of said at least one access button function;

(e) displaying a plurality of phrases in said first working area;

(f) selecting one of said displayed phrases; and

(g) displaying on said display a presentation window including instruction data related to said selected phrase.

2005/0022130




7,584,429




7,184,024




5,828,374

Method and apparatus for selecting characters along a scroll bar with a slider


Coleman; Patricia J. | Palmer; James Edward | Powers; Matthew Justin | Herman; Jeffrey Alan | Cochran; Eli | Powers, III; John Richard

345 G06F 19970314 0 100%

Abstract: An object oriented graphic user interface having overlapping windows and an access window having topics, index andlook for button functions may be selected by the user. Through the use of the topics, index, or look for functions, a help inquiryis defined. The access window includes an alpha scroll bar horizontally spanning a defined area of the access window. Charactersare displayed along the length of the alpha scroll bar and a slider is provided which may be selectively positioned over acharacter displayed on the alpha scroll bar. The placement of the slider over a character on the alpha scroll bar results in theCPU displaying help data entries corresponding to the selected character.

www.patentics.com


MainClaim: A computer display system having a central processing unit (CPU) coupled to a display for displaying data, saiddisplay system comprising:

user interface generation means coupled to said CPU for displaying data on said display in windows;

at least one of said windows including a working area for displaying data, said working area having a scroll bar including:

a plurality of characters displayed along said scroll bar;

a slider which may be selectively positioned over a portion of each of said characters using slider positioning means coupled tosaid CPU, the placement of said slider over a portion of a character resulting in said CPU displaying one or more data entriescorresponding to said character selected in said working area; and

a cursor control device coupled to said CPU for positioning a cursor on said display, said cursor control device being controlled bya user; and wherein

one of said one or more data entries may be selected using said cursor control device and said one or more data entries may bescrolled within said working area by moving said cursor within a predetermined area on said display wherein said predeterminedarea is distinct from said scroll bar;

said windows displayed by said user interface generation means may be selectively positioned at desired locations on saiddisplay by said cursor control device; and

said CPU generates a plurality of windows, said window having said scroll bar comprising said working area and a secondworking area which is distinct from said working area, and wherein one or more data entries in said second working area aredisplayed in response to a selection of a data entry in said working area.

2005/0022130




7,584,429




7,184,024




Stern; Mark Ludwig | Smith; David Canfield | Curbow;

www.patentics.com


5,835,919

Computer-human interface system which manipulates parts between a desktop and a document


David | Chaffee; Jennifer | Kreegar; Jeffrey | Thompson; Michael | Corrick; George | Jordan; Daniel | Piersol; Kurt

715 G06F 19960517 0 100%

Abstract: A document-centered user interface architecture for a computer system employs parts as the fundamental buildingblocks of all documents. All data is stored in the system as a part, which is comprised of contents and an associated editor. Thecontents and the functionality of the editor are available to the user wherever the part is located, whether in a document, on adesktop or in a folder. Parts function as containers for other parts, thereby facilitating the compilation and editing of multimediaor compound documents. MainClaim: In a computer system having a user interface that employs a desktop metaphor which includes a workspace withinwhich objects are presented to, and can be manipulated by, a user and in which the contents of documents are displayed to theuser for editing in an area of said workspace identified as a window, a method for creating documents, comprising the steps of:

storing data within the system in the form of parts, wherein each part has intrinsic contents and can contain other parts as aportion of its contents;

displaying the contents of a first part within a window on said desktop;

representing a second part as an icon on said desktop outside of said window;

selecting and dragging said icon from said desktop to a location within said window;

releasing said icon while it is located in said window; and

including the contents of said second part as a portion of the contents of said first part in response to the releasing of said iconwithin said window.



2003/0169294







Method and apparatus Powers, III; John

www.patentics.com


5,602,996

for determining window order when one of multiple displayed windows is selected


R. | Palmer; James E. | Coleman; Patricia J. | Herman; Jeffrey A. | Cochran; Eli

345 G06F 19950607 0 100%

Abstract: The display system includes at least one central processing unit (CPU) which is coupled through appropriateinput/output (I/O) circuitry to input devices, such as a keyboard, digital pad, mouse and/or trackball. The CPU is coupled to ahard disk drive for the storage of programs and data, and may also be coupled to a network through which the CPU maycommunicate with a variety of other system resources and devices. The CPU is further coupled to a display device such as a CRTor liquid crystal display, on which the present invention is displayed. The windows include defined areas having window featuressuch as menu bars, command options, text, icons and/or button functions to be executed by the CPU. The help system includesan access window having topics, index and look for button functions for selection by a user. Through the use of the topics, indexor look for functions, a help inquiry is defined which results in the CPU generating and displaying a presentation window on thedisplay. Both the access and presentation windows "float" above all other layered windows being displayed regardless of theapplication currently being executed by the user. Both the access and presentation windows remain active and may be operatedupon by the user, as does the top most window immediately below the access or presentation windows being displayed. Otherlayered windows under the top most application window are inactive, and must be brought to the "top" of the stack immediatelybelow the access or presentation window to be operated upon. MainClaim: In a computer display system having a central processing unit (CPU) coupled to a display such that data isdisplayed on said display in a plurality of windows, a method for displaying said windows and operating upon said windows andsaid data in said windows by a user, comprising the steps of:

generating and displaying each of said plurality of windows at a different window layer according to a window order, wherein anyportion of a window at a higher window layer that overlaps with any portion of a window at a lower window layer is displayedsuch that the portion of the window at the higher window layer covers the portion of the window at the lower window layer,wherein said step of generating and displaying each of said plurality of windows comprises the steps of

generating and displaying a first window at a first window layer, wherein said first window layer is a highest window layer;

generating and displaying a second window at a second window layer, wherein said first window has a portion that does notoverlap with said second window;

said user operating on both said first window and said second window without altering the window order of said plurality ofwindows;

wherein said step of generating and displaying each of said plurality of windows further includes the step of generating anddisplaying a third window at a third window layer;

wherein said second window layer is higher than said third window layer, said second window is active and said third window isinactive; and

in response to said user selecting said third window, performing the steps of

altering said window order to cause said third window to assume a higher window layer than said second window,

deactivating said second window, and

activating said third window.

2005/0022130




7,584,429



Abstract: There is disclosed a method and a device for inputting a character into an electronic device, said method comprisingdetecting an input, activating a temporary input area upon detection of said input, displaying said temporary input area on adisplay of said electronic device, and terminating the display and deactivating said temporary input area in case that a relevantevent is detected. The relevant event may be another user-input. MainClaim: A method, comprising: depicting a scroll bar and a button for a search option on a display of an electronic device inan area that is normally reserved for a scroll bar, detecting if a keyboard is connected to said device and suppressing the displayof said button for a search option, if the keyboard is connected, detecting an input on said button for activating a temporaryinput area, activating said temporary input area upon detection of said input, displaying said temporary input area on thedisplay of said electronic device, outputting an audio signal indicating said displaying of said temporary input area, andterminating the display of said temporary input area and deactivating said temporary input area in case that a relevant event isdetected, wherein said temporary input area is displayed in a semi-transparent manner superimposed on a standard display area on said display, and wherein input functions in said standard display area superimposed by said temporary input area are

www.patentics.com


deactivated when said temporary input area is displayed.

6,966,037

Method and apparatus for scrollable cross-point navigation in a calendar user interface

Nokia Corporation Fredriksson; Linus | Nyberg; Urban

715 G06F 20011119 3 92%

Abstract: Method and apparatus for displaying an electronic calendar in a scrollable cross-point navigation image having two bars, each containing panels corresponding to a separate folder or entry of the calendar's hierarchy of folders and entries. At theintersection of the bars is displayed the current lowest level and the next upper level, if any. In one embodiment, the nexthigher level is shown in an adjoining panel on a first bar, the next higher level in a next adjoining panel on that bar, until thereare no further higher levels to display, at which point the remaining upper-most level folders are displayed. The second bar displays sub-folders or calendar entries within the folder in the focus panel. Moving in the folder hierarchy causes the panels inthe first bar to shift to display all intervening levels through the top level. MainClaim: A method for displaying calendar information in a display associated with an electronic device, comprising:

organizing a plurality of calendar entries into a hierarchy comprising a plurality of calendar groups, at least one of whichcalendar groups having at least one sublevel of calendar subgroups; and

displaying panels on a display associated with an electronic device, the panels being arranged into two bars of panels with acommon focus panel at the intersection of the two bars of panels, each of the panels being linked to and identifying one of (a)one of the plurality of calendar entries, (b) one of the calendar groups, and (c) one of the calendar subgroups,

wherein the focus panel identifies (a) a currently selectable lowest level in the hierarchy and optionally (b) the next higher level,if any,

wherein levels, if any, in the hierarchy higher than that displayed in the focus panel are identified in one of (a) succeedingadjoining panels of a first of the two bars, other panels of the first bar identifying highest level groups in the hierarchy, and (b)other panels of the first bar identifying groups in the hierarchy in the next higher level identified in the focus panel; and

wherein panels of the second of the two bars each identify one of (a) calendar entries, if any, (b) calendar groups, if any, and(c) calendar subgroups, if any, of the same level in the hierarchy as the currently selectable lowest level in the hierarchyidentified in the focus panel.

5,812,862 Computer-human interface system for compound documents


Smith; David Canfield | Stern; Mark Ludwig | Curbow; David | Chaffee; Jennifer | Kreegar; Jeffrey | Thompson; Michael | Corrick; George | Jordan; Daniel | Piersol; Kurt

715 G06T 19930510 0 100%

Abstract: A document-centered user interface architecture for a computer system employs parts as the fundamental buildingblocks of all documents. All data is stored in the system as a part, which is comprised of contents and an associated editor. Thecontents and the functionality of the editor are available to the user wherever the part is located, whether in a document, on adesktop or in a folder. Parts function as containers for other parts, thereby facilitating the compilation and editing of multimediaor compound documents. MainClaim: In a computer system of the type having a display for displaying the contents of a document as it is created andedited and a pointing device for controlling the manipulation of elements of the document during editing, a computer-human interface for the creation and manipulation of compound documents, comprising:

means storing all of the component objects of a document as parts, wherein each part comprises intrinsic contents and anassociated manipulator for the contents;

means for displaying parts to a user;

means responsive to actuation of said device for enabling any displayed part to be selected by the user and moved within thedisplay, and to be placed within another part such that it becomes a portion of the contents of said other part and its contentsremain manipulatable by its associated manipulator; and

means for automatically determining a manipulator to be associated with a part within the computer and for launching thedetermined manipulator upon selection of the part so that its functionality becomes available to the user.




2008/0040668 Creating virtual targets Nokia Corporation Ala-Rantala; Kati 715 G06F 20060810 8 93%

www.patentics.com


in directory structures


2003/0169294


Nokia Corporation Vatula, Veli-Pekka | Iivainen, Jyrki

345 G09G 20030307 30 93%


5,469,540

Method and apparatus for generating and displaying multiple simultaneously-active windows


Powers, III; John R. | Palmer; James E. | Coleman; Patricia J. | Herman; Jeffrey A. | Cochran; Eli

715 G06F 19930127 0 100%

Abstract: The display system includes at least one central processing unit (CPU) which is coupled through appropriateinput/output (I/O) circuitry to input devices, such as a keyboard, digital pad, mouse and/or trackball. The CPU is coupled to ahard disk drive for the storage of programs and data, and may also be coupled to a network through which the CPU maycommunicate with a variety of other system resources and devices. The CPU is further coupled to a display device such as a CRTor liquid crystal display, on which the present invention is displayed. The windows include defined areas having window featuressuch as menu bars, command options, text, icons and/or button functions to be executed by the CPU. The help system includesan access window having topics, index and look for button functions for selection by a user. Through the use of the topics, indexor look for functions, a help inquiry is defined which results in the CPU generating and displaying a presentation window on thedisplay. Both the access and presentation windows "float" above all other layered windows being displayed regardless of theapplication currently being executed by the user. Both the access and presentation windows remain active and may be operatedupon by the user, as does the top most window immediately below the access or presentation windows being displayed. Otherlayered windows under the top most application window are inactive, and must be brought to the "top" of the stack immediatelybelow the access or presentation window to be operated upon. MainClaim: In a computer display system having a central processing unit (CPU) coupled to a display such that data isdisplayed on said display in a plurality of windows, a method for displaying said windows and operating upon said windows andsaid data in said windows by a user, comprising the steps of:

generating and displaying each of said plurality of windows at a different window layer according to a window order, wherein awindow at a higher window layer covers a window at a lower window layer to the extent that any of said windows overlap,wherein said step of generating and displaying each of said plurality of windows comprises the steps of

generating and displaying a first window at a first window layer, wherein said first window layer is a highest window layer;

generating and displaying a second window at a second window layer, wherein said first window has a portion that does notoverlap with said second window;

both of said windows being simultaneously active; and

said user operating on both said first window and said second window without altering the window order of said plurality ofwindows.

2005/0022130



Abstract: There is disclosed a method and a device for inputting a character into an electronic device, said method comprisingdetecting an input, activating a temporary input area upon detection of said input, displaying said temporary input area on adisplay of said electronic device, and terminating the display and deactivating said temporary input area in case that a relevantevent is detected. The relevant event may be another user-input.

www.patentics.com


MainClaim: Method for inputting a character into an electronic device, said method comprising: detecting an input, activating atemporary input area upon detection of said input, displaying said temporary input area on a display of said electronic device,and terminating the display and deactivating said temporary input area in case that a relevant event is detected.

7,584,429




6,966,037


Nokia CorporationFredriksson; Linus | Nyberg; Urban 715 G06F 20011119 3 92%







7,600,197 Graphical user interface having contextual menus Apple Inc.

Gourdol; Arno | Cooley; Daniel 715 G06F 20020712 0 100%

Abstract: A contextual pop-up menu of frequently used commands is displayed by an application whenever a user carries out aparticular action. The contextual menu appears at the location of a cursor, so that the displayed commands are spatially veryclose to an item on which an action is to be performed. The commands which are displayed in the contextual menu are notlimited to those provided by an application associated with the selected item. Other commands, such as system levelcommands, for help items or other types of user assistance features, can be added to the menu before it is displayed to theuser. In addition, plug-in modules can be employed to provide other commands associated with the selected item. MainClaim: A user interface, comprising: means for selecting an item of content within a window associated with an applicationprogram; means for detecting a designated action with respect to said selected item of content; means responsive to saiddesignated action for retrieving a list of commands provided by the application program and associated with said selected itemof content; means for receiving other commands, said other commands being selectively provided from at least one otherprogram, which has requested notification of said designated action, based on said selected item of content; means for addingsaid other commands to said list; and means for displaying said list with said added commands on a computer display.

2003/0169294



Abstract: In accordance with this invention, there is disclosed a method for providing a representation of a first application tobe executed in an electronic device that uses the representation to present information of at least one other application thatselects one of the applications for direct display and selects at least another of the applications for indirect display in accordancewith information representative of a state of at least one of the applications. Further, a user interface and an electronic deviceare disclosed having a display and being adapted to operate a plurality of applications having a component for providing arepresentation of one of the applications, a component for using the representation to present information of at least one otherof the applications, and a component for selecting one of the applications for direct display and selecting at least another of the

www.patentics.com


applications for indirect display in accordance with information representative of a state of at least one of the applications. MainClaim: A method for providing a representation of a first application to be executed in an electronic device, comprising:using said representation to present information of at least one other application; selecting one of said applications for directdisplay and selecting at least another of said applications for indirect display in accordance with information representative of astate of at least one of said applications.

7,539,795

Methods and apparatus for implementing dynamic shortcuts both for rapidly accessing web content and application program windows and for establishing context-based user environments

Nokia Corporation Vahtola; Miika 710 G06F 20060130 6 96%

Abstract: The invention disclosed herein concerns methods and apparatus for implementing dynamic shortcuts for use innavigating web content and application program windows. In particular, the methods and apparatus of the invention allow auser to associate one or more items selected from web content or application program windows with a dynamic shortcut. In oneaspect of the invention, a user assigns a keyboard shortcut to one or more web pages viewed during the browsing session. Onceassigned a keyboard shortcut, the one or more web pages can be rapidly accessed using the keyboard shortcut. In variations ofthe invention, the one or more web pages may be assigned an icon accessible from, for example, the desktop. In other aspectsof the invention the keyboard shortcut or icon is associated with content or resources derived from multiple sources; such as, forexample, web pages located using a browser and application program windows spawned using an application program. MainClaim: A memory medium storing a computer program executable by a digital processor of an electronic device, theelectronic device having a display for displaying a graphical user interface, wherein when the computer program is executed bythe digital processor operations are performed for creating a keyboard shortcut for navigating between resources capable ofbeing displayed in the graphical user interface, the operations comprising: receiving a command to associate at least a firstresource with the keyboard shortcut; associating the first resource with the keyboard shortcut; receiving a command toassociate at least a second resource with the keyboard shortcut; associating the second resource with the keyboard shortcutwhile maintaining the association of the first resource with the keyboard shortcut so that both the first and second resource canbe accessed with the keyboard shortcut, wherein when the second resource is associated with the keyboard shortcut both thefirst resource and the second resource are visible in the graphical user interface of the electronic device and are arranged withinthe graphical user interface in accordance with a user-specified arrangement; saving arrangement information describing theuser-specified arrangement of the first resource and the second resource within the graphical user interface at the time the second resource is associated with the keyboard shortcut; detecting entry of a key sequence corresponding to the keyboardshortcut associated with the first and second resource; and displaying both the first resource and the second resource in thegraphical user interface of the electronic device in response to the detection of the entry of the key sequence corresponding tothe keyboard shortcut, wherein the first resource and the second resource are displayed in accordance with the user-specified arrangement described in the arrangement information.

2006/0253788

Method, apparatus and computer program to provide a display screen button placement hint property

Nokia CorporationUotila; Aleksi | Lindfors; Tuija | Joki; Auli

715 G06F 20050509 8 94%

Abstract: Disclosed is a method to develop a graphical user interface that includes entering a data structure that specifies apreferred form of a Button to appear on a display screen, and in response to the data structure, defining at least one of adisplayable Button placement for a specific instance of a display screen, or the use of another user input mechanism, such as asoftkey, in place of a displayable Button for the specific instance of the display screen. Also disclosed is a graphical userinterface development system that includes means for receiving a data structure that specifies a preferred form of a Button toappear on a display screen and means, responsive to the data structure, for defining at least one of a displayable Buttonplacement for a specific instance of a display screen, or the use of another user input mechanism in place of a displayableButton for the specific instance of the display screen. Also disclosed is a mobile device that has a graphical user interface thatincludes a display screen, where the graphical user interface is defined at least in part by the use of a Button property stringthat is interpreted at least in part based on physical characteristics of at least one of the display screen and the mobile device. MainClaim: A method to develop a graphical user interface, comprising: entering a data structure that specifies a preferredform of a Button to appear on a display screen; and in response to the data structure, defining at least one of a displayableButton placement for a specific instance of a display screen, or the use of another user input mechanism in place of adisplayable Button for the specific instance of the display screen.

5,859,638

Method and apparatus for displaying and scrolling data in a window-based graphic user interface


Coleman; Patricia J. | Palmer; James Edward | Powers; Matthew Justin | Herman; Jeffrey Alan | Cochran; Eli | Powers, III; John Richard

345 G09G 19970204 0 100%

Abstract: A user interface includes an object oriented graphic user interface having overlapping windows and provides anaccess window having topics, index and look for button functions for selection by a user. Through the use of the topics, index orlook for functions, a help inquiry is defined. The access window includes an alpha scroll bar horizontally spanning a defined areaof the access window. A plurality of alpha-numeric, symbolic or other characters (collectively "characters") are displayed alongthe length of the alpha scroll bar. A slider is provided which may be selectively positioned over a character displayed on thealpha scroll bar. The slider may be positioned through user manipulation of a cursor control device. The placement of the sliderover a character on the alpha scroll bar results in a central processing unit (CPU) displaying data corresponding to the characterselected. Entries are displayed in the defined area beginning alphabetically with the letter over which the slider has been placed. MainClaim: A data processing display system comprising:

(a) a display for displaying data;

www.patentics.com


(b) a data processing system coupled to said display, said data processing system displaying data in windows on said display,one of said windows including a data display area for displaying data and including a scroll bar, said scroll bar including:

(i) a plurality of characters displayed along said scroll bar, and

(ii) a slider which may be selectively positioned over a portion of said characters on said display; and

(c) a cursor control device coupled to said data processing system for positioning a cursor in horizontal and vertical directions onsaid display, said cursor control device being controlled by a user, said cursor control device further operable to selectivelyposition said slider over a portion of said characters on said display;

said data processing system positioning said slider over the portion of said characters based on the positioning of said cursor onsaid display;

said data processing system displaying data in said data display area in accordance with the positioning of said slider, whereinsaid data display area is separate from the area in which said slider is displayed, and

wherein said data processing system positions said slider over one of said characters on said display in response to said userinputting a character corresponding to said one character using said cursor control device.

2005/0022130




7,584,429




7,184,024




6,493,006 Graphical user interface having contextual menus Apple Computer, Inc.

Gourdol; Arno | Cooley; Daniel 345 G09G 19960510 0 100%

Abstract: A contextual pop-up menu of frequently used commands is displayed by an application whenever a user carries out aparticular action. The contextual menu appears at the location of a cursor, so that the displayed commands are spatially veryclose to an item on which an action is to be performed. The commands which are displayed in the contextual menu are notlimited to those provided by an application associated with the selected item. Other commands, such as system levelcommands, for help items or other types of user assistance features, can be added to the menu before it is displayed to theuser. In addition, plug-in modules can be employed to provide other commands associated with the selected item. MainClaim: A method for enabling a computer user to invoke actions that are to be performed on objects appearing on acomputer display, comprising the steps of:

www.patentics.com


detecting a designated action by a user with respect to a selected object under the control of an application program executingon a computer;

determining a data type for the selected object;

retrieving a list of commands provided by the application program which are associated with the determined type of data;

providing a notification from the application program to an operating system executing on the computer, which identifies thedesignated action and the type of data for the selected object;

selecting, within the operating system, a set of commands based upon said type of data, in response to said notification;

providing said notification to plug-in modules which are registered with the operating system;

selecting, within said plug-in modules, additional commands based upon said type of data, in response to said notification;

providing said set of commands selected by the operating system and said additional commands selected by the plug-in modules to the application program; and

displaying a menu of commands appropriate to the selected type of data, which includes the list of commands retrieved by theapplication program and the commands selected by the operating system and the plug-in modules.

2003/0169294




7,539,795



Abstract: The invention disclosed herein concerns methods and apparatus for implementing dynamic shortcuts for use innavigating web content and application program windows. In particular, the methods and apparatus of the invention allow auser to associate one or more items selected from web content or application program windows with a dynamic shortcut. In oneaspect of the invention, a user assigns a keyboard shortcut to one or more web pages viewed during the browsing session. Onceassigned a keyboard shortcut, the one or more web pages can be rapidly accessed using the keyboard shortcut. In variations ofthe invention, the one or more web pages may be assigned an icon accessible from, for example, the desktop. In other aspectsof the invention the keyboard shortcut or icon is associated with content or resources derived from multiple sources; such as, forexample, web pages located using a browser and application program windows spawned using an application program. MainClaim: A memory medium storing a computer program executable by a digital processor of an electronic device, the electronic device having a display for displaying a graphical user interface, wherein when the computer program is executed bythe digital processor operations are performed for creating a keyboard shortcut for navigating between resources capable ofbeing displayed in the graphical user interface, the operations comprising: receiving a command to associate at least a firstresource with the keyboard shortcut; associating the first resource with the keyboard shortcut; receiving a command toassociate at least a second resource with the keyboard shortcut; associating the second resource with the keyboard shortcutwhile maintaining the association of the first resource with the keyboard shortcut so that both the first and second resource canbe accessed with the keyboard shortcut, wherein when the second resource is associated with the keyboard shortcut both thefirst resource and the second resource are visible in the graphical user interface of the electronic device and are arranged withinthe graphical user interface in accordance with a user-specified arrangement; saving arrangement information describing theuser-specified arrangement of the first resource and the second resource within the graphical user interface at the time the second resource is associated with the keyboard shortcut; detecting entry of a key sequence corresponding to the keyboardshortcut associated with the first and second resource; and displaying both the first resource and the second resource in thegraphical user interface of the electronic device in response to the detection of the entry of the key sequence corresponding tothe keyboard shortcut, wherein the first resource and the second resource are displayed in accordance with the user-specified arrangement described in the arrangement information.

2006/0253788 Method, apparatus and computer program to provide a display screen

Nokia Corporation Uotila; Aleksi | Lindfors; Tuija |

715 G06F 20050509 8 94%

www.patentics.com


button placement hint property

Joki; Auli


5,669,005

System for automatically embedding or incorporating contents added to a document


Curbow; David | Smith; David Canfield | Piersol; Kurt | Stern; Mark Ludwig

715 G06F 19951011 0 100%

Abstract: A document-centered user interface architecture for a computer system employs parts as the fundamental buildingblocks of all documents. All data is stored in the system as a part, which is comprised of contents and an associated editor. Thecontents and the functionality of the editor are available to the user wherever the part is located, whether in a document, on adesktop or in a folder. Parts function as containers for other parts, thereby facilitating the compilation and editing of multimediaor compound documents. When material from one part is inserted into another part, the computer system automaticallydetermines whether the added material is incorporated into the intrinsic contents of the receiving part or embedded as aseparately identifiable part. MainClaim: A system for controlling the addition of new material to a document having intrinsic contents that is stored inmemory of a computer having a display, said system comprising:

means for selecting new material to be added to contents of a document and displaying said new material on said display;

first means which identifies the new material as belonging to one of a plurality of categories of material;

second means for identifying the intrinsic contents of the document as belonging to one of said categories;

means for determining whether the category of the new material is the same as the category of the document's intrinsiccontents; and

means responsive to said determining means for (a) causing the new material to become incorporated as part of the intrinsiccontents of the document and displaying the new material as part of the document's intrinsic contents, when the new materialbelongs to the same category as the document's intrinsic contents, and for (b) establishing the new material as an object,embedding the object as a separate element in the document and displaying the document with the embedded object when thenew material's category is not the same as that of the document's intrinsic contents.







2006/0107205 Determining a main content area of a page Nokia Corporation Makela; Mikko 715 G06F 20041112 4 92%

www.patentics.com


Abstract: A method, a computer program, a computer program product, a device and a system for determining a main contentarea of a page, determines which area of the page contains a page element that is positioned substantially in the middle of thepage with respect to a first direction, and is offset by a pre-defined distance from a border of the page with respect to a seconddirection that is orthogonal to the first direction, and wherein the area that contains the page element is defined to be the maincontent area. MainClaim: A method for determining a main content area of a page, said method comprising: determining which area of saidpage contains a page element that is positioned substantially in the middle of said page with respect to a first direction, and isoffset by a pre-defined distance from a border of said page with respect to a second direction that is substantially orthogonal tosaid first direction, and defining said area that contains said page element to be said main content area.

5,625,377 Method for controlling a computerized organizer Apple Computer, Inc. Jenson; Scott A. 345 G09G 19950526 0 100%

Abstract: The method of the present invention includes the steps of executing a process to support a number of temporal-based functions and activating at least one of these temporal-based functions. Temporal-based functions of the present invention include a scheduler, to-do list, and a note function. Temporal-based entries can then be moved within and/or between the temporal-based functions. Further, temporal-based entries can be edited for each temporal-based function. Moving temporal-based entries involves the selection of an entry with a pointer mechanism, dragging the entry to a new location,releasing the entry at the new location, and updating a database to reflect the entry's change in position. Editing an entryinvolves direct editing of an entry, editing through an editing window, or editing of a duration bar associated with an entry. Dataentered into a scheduling field of the scheduler function is processed according to its placement within the scheduling field.Annotation entries are separated from appointment entries by an invisible margin in the scheduling field. MainClaim: A method for entering data into a scheduler comprising:

displaying a scheduling field on a screen of a pen-based computer system, said field having an appointment area and an annotation area, said appointment area and said annotation area being concurrently active;

entering data on said scheduling field with a pointer mechanism; and

processing said data according to its placement on said scheduling field.

2007/0288282

METHOD AND APPARATUS FOR PREVIEWING CHANGES IN COLOR PALETTE

INTELLISYNC CORPORATION C/O NOKIA CORPORATION

Frid-Nielsen; Martin | Schwartz; Richard Lee | Boye; Steven Ray

705 G06F 20070423 3 93%

Abstract: A system for processing multiple schedules, constructed in accordance with the principle of the present invention,includes an information processing system having a memory and a processor; an input device for entering user information; adisplay device for showing scheduling information; an interface for sending and/or receiving information from another source;and means for reconciling two schedules by building synchronized lists, from which the user may effect a reconciliation. MainClaim: A method of recoloring screen objects, the method including: selecting from a work surface a screen object towhich foreground and/or background colors apply; invoking a recolor palette dialog box that includes a sample box; from thedialog box, selecting new palette values for the foreground and/or the background colors; previewing in the sample box the newpalette values selected, before applying the new palette values to the screen object; and confirming the new palette valuesselected and modifying the screen object.

5,457,476 Method for controlling a computerized organizer

Apple Computer, Inc. Jenson; Scott A. 345 G09G 19930527 0 100%

Abstract: The method of the present invention includes the steps of executing a process to support a number of temporal-based functions and activating at least one of these temporal-based functions. Temporal-based functions of the present invention include a scheduler, to-do list, and a note function. Temporal-based entries can then be moved within and/or between the temporal-based functions. Further, temporal-based entries can be edited for each temporal-based function. Moving temporal-based entries involves the selection of an entry with a pointer mechanism, dragging the entry to a new location,releasing the entry at the new location, and updating a database to reflect the entry's change in position. Editing an entryinvolves direct editing of an entry, editing through an editing window, or editing of a duration bar associated with an entry. Dataentered into a scheduling field of the scheduler function is processed according to its placement within the scheduling field.Annotation entries are separated from appointment entries by an invisible margin in the scheduling field. MainClaim: A method for controlling a computerized organizer comprising the steps of:

executing a computer-implemented process which supports a plurality of non-model temporal-based functions including a scheduler, a to-do list and a note function, wherein said scheduler includes an appointment area and an annotation area, saidappointment area and said annotation area being separated by an invisible margin such that temporal-based entries corresponding to annotations in said annotation area that are moved across said invisible margin to said appointment area aretransformed into temporal-based entries corresponding to appointments and temporal-based entries corresponding to appointments that are moved across said invisible margins into said annotation area are transformed into temporal-based entries corresponding to annotations;

selecting a temporal-based entry within one said temporal-based functions;

moving said temporal-based entry at least within one of said temporal-based functions in response to a user-initiated move command; and

editing a temporal-based entry in response to a user-initiated edit command.

2007/0288282

METHOD AND APPARATUS FOR PREVIEWING CHANGES IN COLOR PALETTE


Frid-Nielsen; Martin | Schwartz; Richard Lee | Boye; Steven Ray

705 G06F 20070423 3 93%

Abstract: A system for processing multiple schedules, constructed in accordance with the principle of the present invention,includes an information processing system having a memory and a processor; an input device for entering user information; adisplay device for showing scheduling information; an interface for sending and/or receiving information from another source;

www.patentics.com


and means for reconciling two schedules by building synchronized lists, from which the user may effect a reconciliation. MainClaim: A method of recoloring screen objects, the method including: selecting from a work surface a screen object towhich foreground and/or background colors apply; invoking a recolor palette dialog box that includes a sample box; from thedialog box, selecting new palette values for the foreground and/or the background colors; previewing in the sample box the newpalette values selected, before applying the new palette values to the screen object; and confirming the new palette valuesselected and modifying the screen object.

5,287,448

Method and apparatus for providing help information to users of computers


Nicol; Anne | Kenyon; Lawrence A. | Wagner; Annette | Sulzen; James T.

715 G06F 19930324 0 100%

Abstract: A method for presenting help messages to a user in an interactive computer environment in which a help modeoperates concurrently with other programs operating in the computer system. The user receives information about an icon bypositioning a pointer on the computer's video display over the icon about which more information is desired. The computer thenretrieves an appropriate help message based upon user sophistication from a database of help messages stored in its memoryand displays it in a graphic bubble on the video display. The graphic bubble is placed so as to not overlap the object about whichmore help is requested. The graphic bubble is removed as soon as the pointer is moved away from the object. MainClaim: In a computer system having a video display and a graphic interface, a method of providing help information to auser of said computer system comprising the steps of:

associating a first help message and a second help message with a first pictorial icon having a first pointer sensitive area on avideo display of said computer system;

activating a concurrent help mode of said computer system in response to a first user input to said computer system, saidconcurrent help mode functioning without taking precedence over another program operating in said computer system, saidcomputer system remaining in the concurrent help mode until deactivated;

moving a pointer on said graphic interface over said first pointer sensitive area associated with said first pictorial icon;

selecting one of the first help message and the second help message associated with said first pictorial icon from a help messagedatabase stored in said computer's memory based upon a context of the computer system, the context being determined basedupon factors including sophistication of the user and a current status of the computer system;

calculating the size of a graphic bubble to contain the selected help message;

locating a selected portion of said graphic interface having a size sufficient to accommodate said graphic bubble;

displaying said selected help message to said user in said graphic bubble on said video display while said pointer is over saidfirst pointer sensitive area, display of said selected help message not preempting operation of another program operating withinsaid computer system, said graphic bubble being positioned within said selected portion; and

removing said selected help message and said graphic bubble from said video display when said pointer is no longer over saidfirst pointer sensitive area.

2003/0169294


Nokia CorporationVatula, Veli-Pekka | Iivainen, Jyrki

345 G09G 20030307 30 95%


2006/0290661 Re-configuring the standby screen of an electronic device

Nokia Corporation

Innanen; Piia | Kangas; Tita | With; Mikko | Fowlie; Andrew | Junkkonen; Laura

345 G09G 20060607 5 94%

Abstract: An electronic device including a user interface having a display for displaying a standby screen when the device is inan idle state and a user input device, wherein the user interface provides a menu system, for re-configuring the standby screen, that is navigated using the user input device. MainClaim: An electronic device comprising: a user interface having a display for displaying a standby screen when the deviceis in an idle state and a user input device, wherein the user interface provides a menu system, for re-configuring the standby screen, that is navigated using the user input device.

2005/0022130



www.patentics.com



5,588,105 Status bar for application windows

Apple Computer, Inc. Foster; Gregg S. | Capps; Stephen P.

345 G06F 19950224 0 100%

Abstract: A status bar characterized by a template generated independently of an application program and displayed on acomputer screen in contact with an application window. The template carries at least one active area that can include an icon forcontrolling the application program or an area which displays information generated by the application program. Alternatively, oradditionally, the active area can include "global functions" of the computer system. A method for providing a status bar ischaracterized by the steps of creating a status bar template having at least one area to be activated, activating at least one areato create a status bar, and displaying the status bar on a computer screen in contact with an associated application windowdisplayed on the computer screen. The step of creating a status bar template can include the steps of creating a plurality ofstatus bar templates, one of which is chosen to be attached to a particular application window. MainClaim: A computer system for displaying a status bar for a window of an application program comprising:

a central processing unit (CPU);

read/write memory coupled to said CPU;

a computer screen coupled to said CPU;

means for selecting a status bar template from a plurality of predefined status bar templates, said selected status bar templateto be associated with an application program, each of said plurality of status bar templates being able to provide a status bar fordifferent application programs usable on said computer system and each template including a different number or type of activearea;

means for providing a status bar from said selected status bar template independently of said application program andindependently of an application window of said application program;

means for displaying said status bar on said computer screen such that said status bar is displayed external to said window andis visibly associated with a window of said application program which is also displayed on said computer screen, wherein saidstatus bar is associated only with said application program and is always displayed when said window of said associatedapplication program is displayed; and

means for displaying an active area within said status bar, said active area always being displayed within said status bar andbeing unable to be removed from said status bar while said status bar is displayed, said active area including an icon or a label.

2003/0169294



345 G09G 20030307 30 93%


7,623,119 Graphical functions by gestures Nokia Corporation

Autio; Markku Tapio | Jarvio; Jami Jarkko Juhani

345 G09G 20040421 7 92%

Abstract: A method for operating a computer through a touch sensitive display interface includes displaying a computergenerated graphical image on a touch sensitive display using display software. The display software includes programs used todisplay the graphical image (e.g., display driver and web browser), and is responsive to inputs at a first, active portion (e.g.,coinciding with toolbars, hyperlinks) of the touch sensitive display when the graphic image is displayed, and is non-responsive to a second, inactive portion. In the method, an input character is received at the second, inactive portion of the touch sensitivedisplay, and is compared to a stored command character that is associated with a separate corresponding computer command.The separate corresponding computer command is executed if the input character matches the command character. In oneembodiment, one particular input character results in emulating a right mouse button by displaying a submenu of shortcut icons,and the method is implemented by operation of a computer program in a mobile station. MainClaim: A computer readable medium having computer instructions for performing actions comprising: displaying acomputer generated graphical image and at least one active area comprising an attribute on a touch sensitive display using adisplaying software program, the attribute comprising at least one of a scrolling operator, a toolbar icon and a hyperlink, saiddisplaying software program being responsive to inputs at only a first active portion of the touch sensitive display when saidgraphical image is displayed, and non-responsive to a second inactive portion of the display; receiving an input character at thesecond inactive portion of said touch sensitive display; comparing said input character to a stored command character that isassociated with a separate corresponding computer command; and executing the separate corresponding computer command if

www.patentics.com


said input character matches said command character, wherein said separate corresponding computer command is to display asubmenu at the touch sensitive display, said submenu comprising a plurality of shortcut links each to a different executablecommand.

5,625,763

Method and apparatus for automatically generating focus ordering in a dialog on a computer system

Apple Computer, Inc. Cirne; Lewis K. 345 G06F 19950505 0 100%

Abstract: A method and apparatus provides for automatic generation of an intuitive, logical focusing order for items in a dialogwindow in a computer system. The focus ordering can be generated dynamically at runtime or statically. In particular, thefocusing order is based on the locations and types of the items in the dialog box and is generated as follows. A customizablespatial comparison function, called herein "comparison function", is generated such that two items can be compared and anordering of the items determined. The spatial comparison function extrapolates or imposes on each item being compared aregion which is defined by the extent of the item's bounds. The regions are then compared to determine the focus ordering ofthe item. The items in the dialog box are sorted using the comparison function. The items are then grouped based on theirlocations and their types. Items that are of a similar type and in the same horizontal or vertical line are grouped together. Anyitems not yet assigned to a group and whose bounding regions intersect with any existing group's bounding region are added tothat existing group. The item groups are then sorted using the comparison function. A focus order list is formed by iteratingthrough the groups in order and iterating through the items in each group in order to form a list that contains an intuitive focusordering for the items in the dialog. MainClaim: A method for automatically generating a focus order for items in a dialog on a computer system, the computersystem having a processor, storage and a display device having a display screen, said method comprising the steps of:

sorting said items of said dialog by means of a spatial comparison function;

grouping said items of said dialog into one or more groups, an item being assigned to a group according to the item's locationon the display screen, each item being in a single group, each group containing one or more items;

sorting said groups by said comparison function; and

listing said focus ordering of said items to form a focus order list by iterating through said groups in sorted order, for each groupiterating through the items of the group in sorted order.




2007/0157117




5,745,910

Frame structure which provides an interface between parts of a compound document


Piersol; Kurt W. | Susser; Joshua B. | Rodseth; Richard C.

715 G06T 19960417 0 100%

Abstract: A document-centered user interface architecture for a computer system employs parts as the fundamental buildingblocks of all documents. All data is stored in the system as a part, which is comprised of contents and an associated editor. Thecontents and the functionality of the editor are available to the user wherever the part is located, whether in a document, on adesktop or in a folder. Parts function as containers for other parts, thereby facilitating the compilation and editing of multimediaor compound documents. A data structure, labelled a frame, functions as an interface between a container part and anembedded part, and allows the two parts to negotiate with respect to graphic structure without requiring extensive knowledge ofone another's internal constraints. MainClaim: In a computer system for the creation and/or manipulation of compound documents, wherein a first component ofa document is embedded in a second, containing component of the document and each component includes associated contentsand a manipulator for those contents, an interface arrangement for defining the relationship between said first and secondcomponents, said arrangement comprising:

means storing a first data structure containing information that is shared between said first and second components, said stored

www.patentics.com


information including a first shape that is determined by said second component and which defines an area within said secondcomponent that is available for the placement of the contents of said first component, and a second shape that is determined bysaid first component and which defines the portion of said area in which the contents of said first component are actuallylocated; and

means storing a second data structure associated with the first data structure and containing information regarding thegeometric relationship between said first and second components, said information stored in the second data structure includinga third shape that is determined by said second component and which defines a portion of said area in which the contents ofsaid first component can be displayed.




2003/0169294






5,570,109 Schedule and to-do list for a pen-based computer system

Apple Computer, Inc. Jenson; Scott A. 345 G09G 19950227 0 100%

Abstract: A method and apparatus for controlling a schedule and a to-do list on a computer display. A computer implemented method of the present invention includes the steps of displaying a calendar controller on a computer display, selecting at leastone date on the calendar controller, determining a display mode, and displaying a content area on the computer display. Thecontent are preferably includes either a schedule or a to-do list for the selected date or dates, and both the content area and thecalendar controller are concurrently active. A scheduling and to-do list apparatus includes a digital processor, a display coupled to the digital processor, a mechanism for determining a display mode, a mechanism for displaying a calendar controller on thedisplay, a mechanism for selecting at least one date on the calendar controller, and a mechanism for displaying a content areaor on the display. The apparatus is preferably implemented as a pen-based computer system, where a primary form of user input comprises strokes made by a stylus upon a tablet overlying the display. MainClaim: A method for controlling a schedule and a to-do list on a computer display comprising;

displaying a calendar controller on said computer display;

selecting a plurality of dates on said calendar controller;

determining a display mode; and,

displaying a content area on said computer display, said content area comprising at least one of a schedule and a to-do list for said plurality of dates, wherein information is entered into and viewed from said content area while said calendar controllerremains visible and active, wherein information corresponding to said plurality of dates is displayed as a part of said schedule.

2007/0288282 METHOD AND APPARATUS FOR PREVIEWING CHANGES


Frid-Nielsen; Martin | Schwartz; Richard Lee |

705 G06F 20070423 3 92%

www.patentics.com


IN COLOR PALETTE Boye; Steven Ray

Abstract: A system for processing multiple schedules, constructed in accordance with the principle of the present invention,includes an information processing system having a memory and a processor; an input device for entering user information; adisplay device for showing scheduling information; an interface for sending and/or receiving information from another source;and means for reconciling two schedules by building synchronized lists, from which the user may effect a reconciliation. MainClaim: A method of recoloring screen objects, the method including: selecting from a work surface a screen object towhich foreground and/or background colors apply; invoking a recolor palette dialog box that includes a sample box; from thedialog box, selecting new palette values for the foreground and/or the background colors; previewing in the sample box the newpalette values selected, before applying the new palette values to the screen object; and confirming the new palette valuesselected and modifying the screen object.

6,686,938 Method and system for providing an embedded application toolbar

Apple Computer, Inc.Jobs; Steven P. | Lindsay; Donald J. | Wasko; Tim

345 G09G 20000105 0 100%

Abstract: A method and system for providing menu tools directly from an operating system includes a computer system havinga user interface including a display, a cursor, and a cursor control device, and an operating system. Menu tools are provided toone or more application windows. A menu item associated with a menu tool represents an available operating system functionand an interactive icon associated with the menu item may be placed in a toolbar region in one of the application windows foraccess to the function. A special operating mode is activated for selecting menu items for use in the toolbar and making thefunction associated with the menu item available to the application by moving the menu item to the toolbar region. The menuitem is represented as an interactive icon once the special operating mode is activated. The operating system functionassociated with the menu item is made available to the application window directly from the operating system by interactionwith the icon. The menu item is further represented as an icon in regions of additional application windows which may either beactive or subsequently instantiated through inheritance. The special operating mode is activated from a special key on an inputdevice. Menu items are displayed along with menu tools corresponding to available operating system functions. MainClaim: A method in a computer system having a user interface including a display, a cursor, and a cursor control device,and an operating system, the method for providing one or more menu tools from an operating system to one or moreapplications having one or more application windows, the method comprising the steps of:

representing a menu item associated with the one or more menu tools of the operating system as an interactive icon in a regionin one of the one or more application windows, the region associated with a special operating mode; and

making an operating system function associated with the menu item available to the one of the one or more application windowsdirectly from the operating system by interaction with the interactive icon, wherein the operating system function is adapted tooperate on a file within the one or more application windows and is customizable for each of the one or more applications.

2003/0169294



345 G09G 20030307 30 96%


2006/0253788



715 G06F 20050509 8 94%


2006/0059436 Handling and scrolling of content on screen Nokia Corporation Nurmi; Mikko 715 G06F 20050805 10 92%

Abstract: The invention relates to a software application adapted for scrolling content on a screen in an application window. Thesoftware application includes at least two logically distinct scroll bars in one application window, each of the scroll bars providingscrolling functionality relative to the same orientation of the content and each of the logically distinct scroll bars controllingdifferent part of the content. MainClaim: A device for handling content comprising a memory, a processing unit controlling operation of said device according

www.patentics.com


to software stored in said memory, a screen for viewing content, said memory comprising a software application adapted forscrolling content on the screen in an application window, wherein the software application comprises: at least two logicallydistinct scroll bars in one application window, each of the scroll bars providing scrolling functionality relative to the sameorientation of the content and each of the logically distinct scroll bars controlling different part of the content.

5,664,128

Object storage apparatus for use with data sets in computer applications

Apple Computer, Inc. Bauer; German Wolfgang

345 G06F 19950223 0 100%

Abstract: A drawer-like apparatus for storing objects for use with a data set in an application window on a digital computer. Thedrawer is advantageously associated with a user data set instead of with an application program or an application window. Thedrawer further includes a visible drawer handle displayed in the application window and a drawer storage area coupled to thevisible drawer handle. Unless accessed via the visible drawer handle, at least a majority of the drawer storage area is visuallyhidden. The drawer storage area is capable of storing a plurality of objects, at least one of the plurality of objects stored withinthe drawer storage area is represented upon access by a symbolic representation within the drawer storage area. There are twotypes of drawers, default and customizable. Default drawers are read-only storage devices and store an unalterable number of default objects. On the other hand, customizable drawers have contents that may be changed and are generally used to storeuser-deposited objects. To control user access to the drawer, the association between the drawer and the data set is inhibitable based on a predetermined availability criteria. Further, each drawer may include a write-enable criteria, which determines whether that drawer is default or customizable to a particular user. MainClaim: An apparatus for storing objects for use with a data set in an application window on a digital computer, comprising:

a drawer uniquely associated with said data set in said application window, said drawer capable of being displayed within saidapplication window, comprising,

a visible drawer handle having a first height and a first width, said visible drawer handle being configured for display in saidapplication window, and

a drawer storage area coupled to said visable drawer handle, wherein at least a portion of said drawer storage area is displayedwith said application window when opened via said visible drawer handle by a user, said drawer storage area being visuallycoupled to said drawer handle when opened, and wherein said drawer storage area is capable of storing a plurality of objects, atleast one of said plurality of objects being visually represented by a symbolic representation displayed within said drawerstorage area when opened.




2003/0169294




5,748,927 Graphical user interface with icons having expandable descriptors

Apple Computer, Inc.Stein; Michael Victor | Wenker; Paul Richard

345 G06F 19960510 0 100%

Abstract: A graphical user interface for a computer includes an arrangement of icons that provides for a large number of iconsto be present on screen while maintaining a large amount of useable screen space. An icon text description setting out the icon'sfunction is provided adjacent to each icon. The icon text description is presented in truncated form when the icon is notdesignated by a cursor. When the icon is designated by a cursor, the icon text description is expanded to a full length therebymore fully describing the icon's function. When an icon is designated by a cursor, the text descriptions for undesignated iconsare blanked, thereby focusing attention on the designated icon. This arrangement has the desirable effect of providing a userwith a ready means of identifying or reaffirming icon function while avoiding the consumption of useful screen space. MainClaim: A graphical user interface which provides for user selection of a plurality of functions that can be performed via acomputer, comprising:

a plurality of icons displayed on a display device and respectively associated with said plurality of user-selectable functions;

www.patentics.com


a plurality of associated icon descriptors displayed adjacent said icons, each descriptor containing at least a portion of adescription of the function represented by an associated icon in a space that is aligned with the respective icon to which thedescription pertains;

a cursor that can be positioned by a user on said display device to designate one of said icons; and

a display controller responsive to the positioning of said cursor on one of said icons for blanking the display of the descriptionsfor all the other icons and displaying the entire description of said one icon.

2003/0169294



345 G09G 20030307 30 95%


2004/0261031 Context dependent auxiliary menu elements

Nokia Corporation

Tuomainen, Kimmo | Suomalainen, Sanna M. | Konkka, Katja

715 G09G 20030623 2 92%

Abstract: The invention relates to a method of displaying a menu on a display of an electronic device. The method comprisesthe steps of displaying one or more selection elements, defining an auxiliary element for at least one selection element,activating one selection element and displaying an auxiliary element only in an active selection element. MainClaim: A method of displaying a menu on a display of an electronic device, the method comprising the steps of displayingone or more selection elements, defining an auxiliary element for at least one selection element, activating one selectionelement, and displaying an auxiliary element only in an active selection element.

6,966,037


Nokia Corporation Fredriksson; Linus | Nyberg; Urban

715 G06F 20011119 3 92%







7,434,177 User interface for providing consolidation and access

Apple Inc.Ording; Bas | Jobs; Steven P. | Lindsay; Donald J.

715 G06F 19991220 0 100%

Abstract: Methods and systems for providing graphical user interfaces are described. To provide greater access andconsolidation to frequently used items in the graphical user interface, a userbar is established which includes a plurality of itemrepresentations. To permit a greater number of items to reside in the userbar, a magnification function can be provided whichmagnifies items within the userbar when they are proximate the cursor associated with the graphical user interface. MainClaim: A computer system comprising: a display; a cursor for pointing to a position within said display; a bar rendered onsaid display and having a plurality of tiles associated therewith; and a processor for varying a size of at least one of saidplurality of tiles on said display when said cursor is proximate said bar on said display and for repositioning others of said

www.patentics.com


plurality of tiles along said bar to accommodate the varied size of said one tile.

2003/0169294




2005/0229111 Presentation of large pages on small displays Nokia Corporation Makela, Mikko 715 G06F 20040407 4 93%

Abstract: This invention relates to method for presenting at least a part of a page, comprising at least partially dividing at leastone page into a plurality of areas, presenting said plurality of areas in a first representation, making at least one area of saidplurality of areas an active area, and in response to a user operation on said at least one active area, presenting at least one ofsaid at least one active areas in a second representation. Said at least one page may be a Hypertext Markup Language HTMLpage, or a page of a text document, and said display may be integrated in a portable electronic device. The invention furtherrelates to a device, a system, a computer program and a computer program product. MainClaim: A method for presenting at least a part of a page, comprising: at least partially dividing at least one page into aplurality of areas; presenting said plurality of areas in a first representation, making at least one area of said plurality of areasan active area; and in response to a user operation on said at least one active area, presenting at least one of said at least oneactive areas in a second representation.



5,898,434 User interface system having programmable user interface elements


Small; Ian S. | Chen; Michael | Zarakov; Eric L. | Mander; Richard L. | Vertelney; Laurie J. | Mander; Amanda R. | Arent; Michael A. | Faris; James P. | Tycz; Jeffrey E. | Knapp; Lewis C.

345 G06F 19940822 0 100%

Abstract: A user interface having a plurality of user interface elements for marking, finding, organizing, and processing datastored in a computer system. Each element typically has an appearance which is related to the data or function the element isdesigned to represent or perform. The elements may simply mark data within the document, or may be programmed to causethe computer to perform some function in association with the marked data. Methods of marking data and searching thememory for marked data by use of switches or buttons is disclosed. Further, useful elements for systems such as computerizedcamera systems, portable multimedia systems, and remote controls are also described. Some of the user interface elements ofthe present invention may have an appearance and/or functionality dependent upon the context in which the element is used,and/or dependent upon the user's identity. Methods for arranging the elements in stacks, and for providing for automaticapplication of elements to captured image data are also disclosed. MainClaim: A user interface system for use in a computerized system having a processor, a memory, and an input/outputsystem in communication with said processor and said memory for operating said user interface system, comprising:

a plurality of types of user interface elements including means for associating data with one of said user interface elements andmeans for identifying said user interface elements to said computerized system;

means for storing said identifying means for said user interface elements in said memory;

means for finding said data associated with said one of said plurality of types of user interface elements in said memory bysearching for said identifying means in said memory,

wherein said input/output system comprises a first switch, wherein said means for associating data is operative to associate saiddata with one of said plurality of user interface elements in response to a first signal generated by said first switch,

wherein said display device has means for displaying one or more of said types of said user interface elements, wherein a first

www.patentics.com


set comprising more than one of said types of user interface elements is associated with an area on said display device, whereinsaid input/output system comprises means for selecting one of said more than one type of said user interface elements to bedisplayed in said area, said one of said types of said user interface elements displayed in said area being operative to beassociated with said data.




7,184,024




2007/0022367 Multidimensional tabbing for electronic devices

Nokia Corporation

Ingrassia; Michael | Capin; Tolga | Chitturi; Suresh | Haro; Antonio

715 G06F 20050630 1 92%

Abstract: The invention relates to a method for displaying and manipulating a data object on a display of a mobile electronicdevice utilizing multi-dimensional tabbing. The invention relates also to a means for creating the data object. The methodutilizes information arranged in a tree like hierarchy in the memory of the electronic device. The user of the cellular terminal canmove back and forth from one level in the tree hierarchy to other level or inside one level by tabbing. MainClaim: A method for displaying content comprising of multidimensional display object set, the method comprising the stepsof: parsing and interpreting markup language syntax which has tags defining multi-dimensional display object sets; and displaying the content on display according to the markup language definition.

5,666,552

Method and apparatus for the manipulation of text on a computer display screen


Greyson; Ann M. | Hokit; Jeffrey D. | Kaptanoglu; Marjory | Wagner; Annette M. | Capps; Stephen P.

715 G06F 19950601 0 100%

Abstract: A means and method for directly manipulating text on a computer display screen. A selected block of text is firstidentified for manipulation. After being identified, the selected block of text is highlighted on the display screen using contrastingcolors or a reverse video. A text manipulation handle associated with the selected text block is displayed. The user may thendirectly manipulate the selected text block by positioning a cursor within the text manipulation handle and activating a signalgeneration device. When this occurs, the selected text block may be moved around the display screen while remaining visibleusing the cursor control device as long as the signal generation device remains active. A shadow image and insertion markerassociated with the selected text block is displayed while the selected text block is moveable. A cutting or copying operationmay be selected when the signal generation device is activated. The cutting operation removes the selected text block from theavailable text leaving a blank area at its original position. The copying operation retains the original selected text block in itsprevious position in the available text. When the signal generation device is deactivated, the selected text block is inserted orpasted into the available text at the position indicated by the insertion marker. The available text is then reformatted to achievecontinuity in the lines of available text. MainClaim: In an interactive computer-controlled display system having a processor, a memory means, a display devicecoupled to said processor for visibly displaying text, a cursor control device coupled to said processor for interactively positioninga cursor on said display device, and a signal generation device for signaling an active and an inactive control state, a process fordirectly manipulating a portion of text available for display on said display device, said process comprising the steps of:

selecting a block of text from a set of available text, at least a portion of the available text displayed on said display device;

dragging said selected block of text from a previous position to a new position relative to said available text, at least a portion ofsaid selected block of text being visible as said selected block of text is dragged, said movement of said selected block of textbeing responsive to movement of said cursor control device;

displaying an insertion marker on said display device, said insertion marker specifying the new position in said available textwhere said selected block of text is inserted in an inserting step; and

www.patentics.com


said step of inserting, inserting said selected block of text into said available text, said selected block of text being inserted atsaid new position pointed to by the insertion marker and reformatting at least a part of said available text such that the at leastone part of the available text is unobscured by the insertion of the selected block of text and to provide continuity between saidavailable text and said selected block of text.

2008/0002888




5,341,293 User interface system having programmable user interface elements


Vertelney; Laurie J. | Erickson; Thomas D. | Mountford; S. Joy | Thompson-Rohrlich; John A. | Salomon; Gitta B. | Wong; Yin Y. | Venolia; Daniel S. | Gomoll; Kathleen M. | Hulteen; Eric A.

715 G06F 19920903 0 100%

Abstract: A user interface element having a plurality of user interface elements for marking, finding, organizing, and processingdata within documents stored in an associated computer system are described. Each element typically has an appearance whichis uniquely related to the data or the function the element is designed to represent or perform, respectively. In their simplestform, these elements are only used to mark data within a document. Each element, however, can also be programmed to causethe computer to perform some function in association with the marked data, such as printing the data or mailing the data tosomeone. A user can select particular data within a document using an element and have that data associated with the elementin memory. Data marked with common elements can be found by searching for a particular representative element in memory.Users can create their own elements, program elements with their own desired functionality, and modify existing elements.Elements can also be compounded together so as to cause a combination of tasks to be performed by simply activating oneelement. MainClaim: A user interface system for use in a computerized system having a processor, a memory, a display and aninteractive input/output system in communication with the processor, the memory and the display for operating the userinterface system, comprising:

a user interface element including first means for identifying said user interface element to a user, means for marking datadisplayed within one or more documents on said display with said first identifying means, and second means for identifying saiduser interface element to said computerized system such that said marked data can subsequently be found by saidcomputerized system through utilization of said second identifying means;

means for storing one or more of said second identifying means for one or more of said user interface elements in said memoryas a proxy to said marked data;

means for finding said marked data in said memory by searching for said proxy in said memory; and

means for displaying said marked data on said display after finding said marked data.




5,714,971

Split bar and input/output window control icons for interactive user interface

Apple Computer, Inc.Shalit; Andrew | Jones; Jeremy 345 G09G 19941130 0 100%

Abstract: An interactive user interface for a computer controlled system to simplify browsing and navigating throughinformation structures. The interface uses a split-pane icon on a window scroll bar, or input and output icons on a window titlebar. When activating the split-pane icon by dragging a selected object to it, a new pane opens up displaying the contents of the

www.patentics.com


object. Where a first or second pane exists, dragging a selected object to the first or second panels input icon, or dragging theoutput icon of the first pane to the second panels input icon, will display the contents of a selected object in the first or secondpane respectively. Other ways of controlling the displays in the same or different windows or panes are also described. MainClaim: An interactive user interface of a computer including a monitor for displaying objects of said computer on a screen,said interface comprising:

a window of the screen, said window configured for apportionment into a plurality of panes, a first pane having a content regionfor displaying said objects;

control means located within a first control region of said first pane and within a second control region of a second pane of saidwindow for linking a selected object of said first pane to said second pane; and

means for dragging said selected object from said content region of said first pane to one of said first and second control regionsand dropping said object onto said control means, such that said control means, in response to said dropped object, links saidselected object to said second pane to thereby enable automatic viewing of contents of said selected object on said secondpane.

2003/0169294



345 G09G 20030307 30 93%






Abstract: The invention relates to a software application adapted for scrolling content on a screen in an application window. Thesoftware application includes at least two logically distinct scroll bars in one application window, each of the scroll bars providingscrolling functionality relative to the same orientation of the content and each of the logically distinct scroll bars controllingdifferent part of the content. MainClaim: A device for handling content comprising a memory, a processing unit controlling operation of said device accordingto software stored in said memory, a screen for viewing content, said memory comprising a software application adapted forscrolling content on the screen in an application window, wherein the software application comprises: at least two logicallydistinct scroll bars in one application window, each of the scroll bars providing scrolling functionality relative to the sameorientation of the content and each of the logically distinct scroll bars controlling different part of the content.

5,404,442 Visible clipboard for graphical computer environments


Foster; Gregg S. | Capps; Stephen P. | Sharpe; Benjamin W.

345 G06F 19921130 0 100%

Abstract: Text, graphics, or other selected objects of a computer screen are selected and converted into a "visual clipboard"which is attached to a convenient boundary of the screen. The visible clipboard is preferably implemented on a pen-based computer system where the object is selected by a stylus, is dragged to a boundary, and is converted to a clipboard icon at theboundary. Multiple clipboard icons may be produced by the user, and can be moved from one boundary location to another. Thecontents of the clipboard can be inserted or "pasted" into an application program by dragging the clipboard icon with the stylusto the desired insertion location. Preferably, each clipboard is provided with indicia representative of the contents of theclipboard. MainClaim: A method for moving a clipboard icon comprising the steps of:

selecting a clipboard icon on a computer screen having a boundary;

dragging said clipboard icon on said computer screen with a pointing device; and

www.patentics.com


depositing said clipboard icon, wherein when the clipboard icon is deposited at a location that impinges the boundary on saidcomputer screen, the clipboard icon is displayed in its deposited location, and wherein when said clipboard icon is deposited at alocation that does not impinge the boundary on said computer screen, the clipboard icon is converted to an image of applicationdata that is stored within a clipboard memory and the image of said application data is displayed on said computer screen at thedeposit location and the application data is inserted in an application program file at a position that corresponds to the depositlocation.

7,554,530

Touch screen user interface featuring stroke-based object selection and functional object activation

Nokia Corporation Mizobuchi; Sachi | Mori; Eigo

345 G09G 20021223 13 93%

Abstract: A method is disclosed to operate a touch screen user interface. The method includes forming a stroke that enclosesan area that contains at least a portion of at least one displayed object; and selecting the at least one displayed object. Formingthe stroke may further include extending the stroke to a functional object, and activating the functional object with the at leastone selected displayed object. If the stroke does not define an area that is totally enclosed by the stroke, the method mayfurther include automatically continuing the stroke such that the area is totally enclosed by the stroke. In this case the strokemay be automatically continued by drawing a line that connects a stroke starting point to a stroke ending point, and by addingtouch screen coordinates covered by the line to a list of touch screen coordinates that describe the stroke. If the stroke enclosesan area that contains at least a portion of a plurality of displayed objects, each of the displayed objects is simultaneouslyselected. MainClaim: A method to operate a touch screen user interface, comprising: forming a stroke that encloses an area thatcontains at least a portion of at least one displayed object that represents data; and selecting the at least one displayed object,where forming the stroke further comprises extending the stroke to a functional object, and activating the functional object withthe at least one selected displayed object.



345 G09G 20040421 7 92%

Abstract: A method for operating a computer through a touch sensitive display interface includes displaying a computergenerated graphical image on a touch sensitive display using display software. The display software includes programs used todisplay the graphical image (e.g., display driver and web browser), and is responsive to inputs at a first, active portion (e.g.,coinciding with toolbars, hyperlinks) of the touch sensitive display when the graphic image is displayed, and is non-responsive to a second, inactive portion. In the method, an input character is received at the second, inactive portion of the touch sensitivedisplay, and is compared to a stored command character that is associated with a separate corresponding computer command.The separate corresponding computer command is executed if the input character matches the command character. In oneembodiment, one particular input character results in emulating a right mouse button by displaying a submenu of shortcut icons,and the method is implemented by operation of a computer program in a mobile station. MainClaim: A computer readable medium having computer instructions for performing actions comprising: displaying acomputer generated graphical image and at least one active area comprising an attribute on a touch sensitive display using adisplaying software program, the attribute comprising at least one of a scrolling operator, a toolbar icon and a hyperlink, saiddisplaying software program being responsive to inputs at only a first active portion of the touch sensitive display when saidgraphical image is displayed, and non-responsive to a second inactive portion of the display; receiving an input character at thesecond inactive portion of said touch sensitive display; comparing said input character to a stored command character that isassociated with a separate corresponding computer command; and executing the separate corresponding computer command ifsaid input character matches said command character, wherein said separate corresponding computer command is to display asubmenu at the touch sensitive display, said submenu comprising a plurality of shortcut links each to a different executablecommand.

2004/0119763


Nokia Corporation Mizobuchi, Sachi | Mori, Eigo

345 G09G 20021223 12 92%

Abstract: A method is disclosed to operate a touch screen user interface. The method includes forming a stroke that enclosesan area that contains at least a portion of at least one displayed object; and selecting the at least one displayed object. Formingthe stroke may further include extending the stroke to a functional object, and activating the functional object with the at leastone selected displayed object. If the stroke does not define an area that is totally enclosed by the stroke, the method may further include automatically continuing the stroke such that the area is totally enclosed by the stroke. In this case the strokemay be automatically continued by drawing a line that connects a stroke starting point to a stroke ending point, and by addingtouch screen coordinates covered by the line to a list of touch screen coordinates that describe the stroke. If the stroke enclosesan area that contains at least a portion of a plurality of displayed objects, each of the displayed objects is simultaneouslyselected. MainClaim: A method to operate a touch screen user interface, comprising: forming a stroke that encloses an area thatcontains at least a portion of at least one displayed object; and selecting the at least one displayed object.

5,442,742

Method and apparatus for the manipulation of text on a computer display screen


Greyson; Ann M. | Hokit; Jeffrey D. | Kaptanoglu; Marjory | Wagner; Annette M. | Capps; Stephen P.

715 G06F 19931014 0 100%

Abstract: A means and method for directly manipulating text on a computer display screen. A selected block of text is firstidentified for manipulation. After being identified, the selected block of text is highlighted on the display screen using contrastingcolors or a reverse video. A text manipulation handle associated with the selected text block is displayed. The user may thendirectly manipulate the selected text block by positioning a cursor within the text manipulation handle and activating a signalgeneration device. When this occurs, the selected text block may be moved around the display screen while remaining visibleusing the cursor control device as long as the signal generation device remains active. A shadow image and insertion markerassociated with the selected text block is displayed while the selected text block is moveable. A cutting or copying operationmay be selected when the signal generation device is activated. The cutting operation removes the selected text block from theavailable text leaving a blank area at its original position. The copying operation retains the original selected text block in its

www.patentics.com


previous position in the available text. When the signal generation device is deactivated, the selected text block is inserted orpasted into the available text at the position indicated by the insertion marker. The available text is then reformatted to achievecontinuity in the lines of available text. MainClaim: In an interactive computer-controlled display system having a processor, a memory means, a display devicecoupled to said processor a cursor control device coupled to said processor for interactively positioning a cursor on said displaydevice, and a signal generation device for signaling an active and an inactive control state, a process for directly manipulating aportion of text displayed on said display device, said process comprising the steps of:

selecting a block of text from a set of available text, at least a portion of said available text displayed on said display device;

dragging said selected block of text from a previous position to a new position relative to said available text, at least a portion ofsaid selected block of text being visible as said selected block of text is dragged, said movement of said selected block of textbeing responsive to movement of said cursor control device, said dragging step comprising;

displaying a text manipulation handle on said display device, said text manipulation handle comprising a graphic elementvisually associated with said selected block of text,

determining whether said cursor is visually positioned within said text manipulation handle displayed on the display device,

receiving a signal from said signal generation device indicating that said signal generation device is in an active control state,and

upon determining that said cursor is positioned within the text manipulation handle and while the signal generation device is inan active state, dragging said selected block of text and said text manipulation handle from a previous position to a new positionrelative to said available text while said signal generation device is in an active control state, at least a portion of said selectedblock of text being visible as said selected block of text is dragged;

displaying an insertion marker on said display device, said insertion marker comprising a graphic element visually associatedwith said selected block of text, said insertion marker moving with said selected block of text and is indicative of a position inthe available text; and

inserting said selected block of text into said available text, said selected block of text being inserted at said new position,corresponding to the position of the insertion marker, at least a portion of said available text being reformatted to providecontinuity between said available text and said inserted block of text.

2008/0002888




6,243,071 Tool set for navigating through an electronic book

Apple Computer, Inc. Shwarts; Scott L. | Dunham; David R.

345 G09G 19931103 0 100%

Abstract: The present invention provides a method for controlling a screen display of an electronic book. The contents of thebook are displayed on a screen of the computer system as pages with which the user interacts by a pointer such as a pen orstylus. The navigational tool set performs various functions including one or more of the following: (1) creating page displays forcontent of the book, (2) providing a navigation interface for identifying material in the book and moving to desired locations, (3)finding character strings located within the book, and (4) accepting handwritten information on pages of the book. The electronicbook includes a "bookmark" button which when selected displays a bookmark icon and inserts a bookmark in the book at thepage that is currently displayed. Thereafter the user can close the book or move to another page and automatically return to themarked page by selecting the bookmark icon. The user can also move to other pages by scrolling with scroll keys or othernavigational devices such as tables of contents browsers and menu pages which are provided on the computer system. MainClaim: A method of controlling the display of an electronic book on a display screen of a hand-held stylus-based computer having a processor connected to the display screen, a memory connected to the processor, one or more buttons, and a stylus,the method comprising:

opening a book package which contains the electronic book and which resides, at least in part, in the memory of the computer;

displaying a view of a current page of the electronic book on the display screen, the view including at least one navigationbutton;

displaying a navigation dialog box on the display screen when the navigation button is selected by interaction of the stylus withthe display screen, the navigation dialog box having at least a bookmark button and a return to menu button;

www.patentics.com


placing a bookmark at a preselected page when the bookmark button is selected by interaction of the stylus with the displayscreen; and

displaying a menu page in the electronic book when the return to menu button is selected by interaction of the stylus with thedisplay screen, the menu page listing one or more destinations within the electronic book which can be reached by selecting acorresponding destination from the menu page.

7,716,580 Web page title shortening

Nokia Corporation

Roto; Virpi | Vartiainen; Elina | Popescu; Andrei | Grassel; Guido | Myllyia; Salla | Rautava; Mika

715 G06F 20050630 4 92%

Abstract: A method for shortening a web page title. The method includes determining if a title of a current web page fits in atitle display area of a display. If the title fits the title is displayed in the title area. If the title does not fit, it is determined if thetitle of the current web page starts with a same word as a title of a previous page. If the title of the current web page starts withthe same word, at least one word is removed from a beginning portion of the title of the current page that is in common withthe title of the previous page, until the title of the current page fits in the title display area, or there are no more common wordsin the beginning of the title. End words or letters or end words can be removed until the title fits. Missing words may beindicated by adding a predetermined indicator in the area of the missing or removed words. MainClaim: A method comprising: determining that a title of a current web page does not fit in a title display area of a display;removing at least one word from the title of the current page until the title of the current page fits in the title display areawherein removing the at least one word comprises: determining, by a processor, that the title of the current web page startswith at least one same word as a title of a previous page; and removing at least one word from a beginning portion of the titleof the current page that is in common with the title of the previous page; and determining that there is at least one commonword in between an end portion of the current title and an end portion of the previous title and removing the at least onecommon word.

5,524,201 Method of preparing an electronic book for a computer system


345 G06E 19931103 0 100%

Abstract: A method and system for preparing interactive references having pages which can be displayed on the screen of apointer-based computer system. Some of the reference's pages have "live" features or icons which the user can select to causevarious actions such as moving to other locations within the reference, displaying dialog boxes on the screen, etc. The presentinvention converts a document containing appropriate comments into a set of instructions for an interactive reference accordingto a defined sequence of steps. First, the document is separated into content blocks delineated by content commands. Each suchblock can be separately formatted for use in the interactive reference. Next, the system creates page descriptions in which thecontent blocks are arranged on pages whose boundaries are defined by the display screen of the computer system on which theinteractive references will be displayed. In addition, the system prepares instructions for treating pointer actions on buttons andother live screen features. Finally, commands describing the interactive reference, are output. The commands will be provided aformat, at least when compiled, that can be stored and processed in the computer on which the interactive reference isdisplayed. MainClaim: A method by which a first computer system automatically converts a document to an interactive reference that canbe interpreted by and displayed on a second computer system having a display screen sensitive to a pointer, a processor incommunication with the display screen, and a memory in communication with the processor such that at least portions of theinteractive reference residing in the memory can be retrieved by interaction of the pointer with the display screen, the methodcomprising the following steps:

separating the document into content blocks delineated by content commands within the document, some content blockscontaining templates for live interaction between the pointer and the display screen and other content blocks containing text ora picture;

creating page descriptions in which the content blocks are arranged on pages whose boundaries are defined by the displayscreen of the second computer;

preparing instructions for treating pointer actions on templates displayed on the display screen; and

outputting commands describing the interactive reference, the commands having a format, at least when compiled, that can bestored in the memory of the second computer system and interpreted by the processor of the second computer system.

7,716,580 Web page title shortening

Nokia Corporation


715 G06F 20050630 4 93%

Abstract: A method for shortening a web page title. The method includes determining if a title of a current web page fits in atitle display area of a display. If the title fits the title is displayed in the title area. If the title does not fit, it is determined if thetitle of the current web page starts with a same word as a title of a previous page. If the title of the current web page starts withthe same word, at least one word is removed from a beginning portion of the title of the current page that is in common withthe title of the previous page, until the title of the current page fits in the title display area, or there are no more common wordsin the beginning of the title. End words or letters or end words can be removed until the title fits. Missing words may beindicated by adding a predetermined indicator in the area of the missing or removed words. MainClaim: A method comprising: determining that a title of a current web page does not fit in a title display area of a display;removing at least one word from the title of the current page until the title of the current page fits in the title display areawherein removing the at least one word comprises: determining, by a processor, that the title of the current web page startswith at least one same word as a title of a previous page; and removing at least one word from a beginning portion of the titleof the current page that is in common with the title of the previous page; and determining that there is at least one commonword in between an end portion of the current title and an end portion of the previous title and removing the at least one

www.patentics.com


common word.

2005/0229119

Method for the presentation and selection of document links in small screen electronic devices

Nokia Corporation Torvinen, Marko 715 G06F 20040407 2 92%

Abstract: A method, an electronic device and a computer program, for document link presentation and selection in an electronicdevice. In the method a first hypertext page comprising at least one separate link area is opened in an electronic device. At leastpart of said first hypertext page is displayed in a view window movable in the area of said first hypertext page. A link areanearest to a first point on said view window is determined. A link list comprising links associated with said link area is formed. Asa user selects a first link in the link list and a second hypertext page indicated by the first link is opened in the electronic device. MainClaim: A method for document link presentation and selection in an electronic device, the method comprising: opening afirst hypertext page comprising at least one separate link area in said electronic device; displaying at least part of said firsthypertext page in a view window movable in the area of said first hypertext page; determining a link area nearest to a first pointon said view window; forming a link list comprising links associated with said link area; allowing a user to select a first link insaid link list; and opening a second hypertext page indicated by said first link in said electronic device.

7,478,322

Method and arrangement for displaying hypertext pages

Nokia Corporation Konttinen; Hannu 715 G06F 20011211 1 92%

Abstract: The invention relates to a method and arrangement for reading hypertext pages especially on mobile phone displayscreens. A device is provided with a program which "understands" some basic rules of written language such as punctuation,conjunctives connecting parts of sentences, and the direction of reading. A low-resolution display (300) is divided into a navigation pane (320) and read pane (330). The selected hypertext page is decoded, and an overall view thereof, preprocessedin a predetermined manner, is brought into the navigation pane. A length of text cut off according to the said rules is brought ata time into the read pane from the area indicated by a cursor (310). The text is so short that it is easily readable as far as thesize of the characters is concerned. The device has predefined key functions to move forward or backward in the text one stepat a time or by skipping text passages if desired. The words displayed at a time on the display constitute a factual entity or atleast belong to the same factual entity, whereby the reading of the text on the hypertext page is easy despite the limitations ofthe display. The invention may also be used for data searching in a relatively large mass of information. MainClaim: A method for reading text on hypertext pages, in which received pages are decoded and a certain reading portionof a page, indicated by a cursor, is enlarged onto a display used as an output device, wherein shift commands are defined inorder to use the method, the method comprising: preprocessing the pages in order to read the text portion in them, dividing thedisplay into a navigation pane and a read pane; placing an overall view of at least one decoded page to the navigation pane;storing language specific rules of syntax in a memory; sequentially processing the text, based on the stored language specificrules of syntax, to identify a start element and end element, selecting a first text portion between the start element and endelement as the reading portion and placing the selected portion on the read pane, and further processing connected portions ofthe selected text for a new start element and a new end element and selecting the text portion between the new start elementand new end element of a second text portion and placing the selected contiguous portion on the read pane, if a shift commandis received.

6,144,380

Method of entering and using handwriting to identify locations within an electronic book

Apple Computer Inc.Shwarts; Scott L. | Dunham; David R. 345 G06F 19970219 0 100%

Abstract: A method for controlling a screen display of an electronic book. The contents of the book are displayed on a screen ofthe computer system as pages with which the user interacts by a pointer such as a pen or stylus. The content engine performsvarious functions including one or more of the following: (1) creating page displays for content of the book, (2) providing anavigation interface for identifying material in the book and moving to desired locations, (3) finding character strings locatedwithin the book, and (4) accepting handwritten information on pages of the book. The electronic book includes a "bookmark"button which when selected displays a bookmark icon and inserts a bookmark in the book at the page that is currentlydisplayed. Thereafter the user can close the book or move to another page and automatically return to the marked page byselecting the bookmark icon. The user can also move to other pages by scrolling with scroll keys or other navigational devicessuch as tables of contents browsers and menu pages which are provided on the computer system. MainClaim: A method of processing handwriting written with a pointer on a screen display of a pointer-based computer having a processor connected to the screen display, a memory connected to the processor, a pointer, contents of an electronic book,and one or more buttons, the method comprising:

displaying a view of a current page of the book on the display screen;

recognizing handwriting as one or more character strings when said handwriting is written in handwriting recognition fieldsdisplayed on the screen display, the one or more character strings being used to identify at least one location within the book;

displaying handwriting written on the current page of the book after a mark-up button has been selected; and

hiding all handwriting and associated text written with said pointer on the current page when the mark-up button is re-selected.

7,716,580 Web page title shortening Nokia Corporation


715 G06F 20050630 4 92%

Abstract: A method for shortening a web page title. The method includes determining if a title of a current web page fits in atitle display area of a display. If the title fits the title is displayed in the title area. If the title does not fit, it is determined if thetitle of the current web page starts with a same word as a title of a previous page. If the title of the current web page starts withthe same word, at least one word is removed from a beginning portion of the title of the current page that is in common withthe title of the previous page, until the title of the current page fits in the title display area, or there are no more common words

www.patentics.com


in the beginning of the title. End words or letters or end words can be removed until the title fits. Missing words may beindicated by adding a predetermined indicator in the area of the missing or removed words. MainClaim: A method comprising: determining that a title of a current web page does not fit in a title display area of a display;removing at least one word from the title of the current page until the title of the current page fits in the title display areawherein removing the at least one word comprises: determining, by a processor, that the title of the current web page startswith at least one same word as a title of a previous page; and removing at least one word from a beginning portion of the titleof the current page that is in common with the title of the previous page; and determining that there is at least one commonword in between an end portion of the current title and an end portion of the previous title and removing the at least onecommon word.

5,802,516 Method of controlling an electronic book for a computer system


707 G06F 19950530 0 100%

Abstract: The present invention provides a method for controlling a screen display of an electronic book. The contents of thebook are displayed on a screen of the computer system as pages with which the user interacts by a pointer such as a pen orstylus. The content engine performs various functions including one or more of the following: (1) creating page displays forcontent of the book, (2) providing a navigation interface for identifying material in the book and moving to desired locations, (3)finding character strings located within the book, and (4) accepting handwritten information on pages of the book. The electronicbook includes a "bookmark" button which when selected displays a bookmark icon and inserts a bookmark in the book at thepage that is currently displayed. Thereafter the user can close the book or move to another page and automatically return to themarked page by selecting the bookmark icon. The user can also move to other pages by scrolling with scroll keys or othernavigational devices such as tables of contents browsers and menu pages which are provided on the computer system. MainClaim: A method of searching a character string in one or more documents provided in an electronic book with the aid of apointer-based computer having a processor, a memory connected to the processor, a display screen connected to the processor,a pointer, and one or more documents residing, at least in part, in the memory, each of the documents having one or morecontent records, the method comprising the following steps:

selecting a character string by interaction of the pointer with the display screen, the display screen including a field for acceptinghandwriting, wherein the computer is arranged to recognize handwriting written in the field as the character string;

encoding an NGRAM for each n successive characters in the character string, the NGRAM being grouped with other NGRAMsfrom the character string in an array of NGRAMs;

comparing the character string array of NGRAMs against NGRAMs for the content records of at least one document provided inthe electronic book;

searching the contents of those content records having NGRAMs containing each element of the character string NGRAM; and

indicating on the display screen the records containing the search string.

7,716,580 Web page title shortening Nokia Corporation


715 G06F 20050630 4 92%

Abstract: A method for shortening a web page title. The method includes determining if a title of a current web page fits in atitle display area of a display. If the title fits the title is displayed in the title area. If the title does not fit, it is determined if thetitle of the current web page starts with a same word as a title of a previous page. If the title of the current web page starts withthe same word, at least one word is removed from a beginning portion of the title of the current page that is in common withthe title of the previous page, until the title of the current page fits in the title display area, or there are no more common wordsin the beginning of the title. End words or letters or end words can be removed until the title fits. Missing words may beindicated by adding a predetermined indicator in the area of the missing or removed words. MainClaim: A method comprising: determining that a title of a current web page does not fit in a title display area of a display;removing at least one word from the title of the current page until the title of the current page fits in the title display areawherein removing the at least one word comprises: determining, by a processor, that the title of the current web page startswith at least one same word as a title of a previous page; and removing at least one word from a beginning portion of the titleof the current page that is in common with the title of the previous page; and determining that there is at least one commonword in between an end portion of the current title and an end portion of the previous title and removing the at least onecommon word.

6,307,574

Graphical user interface with hierarchical structure for customizable menus and control objects


Ashe; Dylan B. | Johnston, Jr.; Robert G. | Ruff; Joseph A. | Clifford; Daniel

345 G06F 19950508 0 100%

Abstract: The program code for control objects in a graphical user interface is organized in a multi-level hierarchial structure. At one level of the structure, each different type of control defines a class of objects. The definition of a class includes most, if notall, of the functionality associated with the objects of that class. In addition, the class definition includes the overall structure ofthe object, such as the relative positions of different elements which make up the object. The actual appearance of theseelements is defined by user selectable software that resides at a lower level of the hierarchy. Using this approach, only oneinstance of the program code which defines the functionality and overall structure of each object is required, resulting in smallerthe overall memory requirements of the program code. MainClaim: A graphical user interface for a computer, said interface including graphical objects that are displayed on a monitorof the computer and that are accessed by users to control the operation of the computer, said interface comprising a plurality ofdefinitions stored in a memory that are respectively associated with said graphical objects, each of said definitions stored in saidmemory comprising a hierarchical set of software code modules, including:

a first code module at one level of the hierarchy which defines the structural relationship of elements that constitute a displayed

www.patentics.com


image of the graphical object; and

a second code module at a lower level of the hierarchy which depends from said first code module, said second code moduledefming an appearance for each of the elements in the image of the graphical object to be displayed on the monitor.

2006/0253788



715 G06F 20050509 8 94%


2007/0157117




2003/0169294




5,515,496

Computer system with direct manipulation interface and method of operating same

Apple Computer, Inc.Kaehler; Edwin B. | Kay; Alan C. | Wallace; Scott G.

345 G06F 19921224 0 100%

Abstract: A computer system, including a display screen and a direct input device such as a mouse, with a direct manipulationinterface, through which the user can not only cause the computer to perform a predefined task by selectively indicating asymbol representing the task but also edit such symbols and their attributes by causing handle-like figures to appear on the screen near the symbol to be edited. The system is operable in two modes. One is a use mode for having a predefined taskcarried out and no handle-like figures are shown. The other is an edit-and-use mode wherein the user can cause the handle-like figures to appear or disappear but can also carry out every task that can be carried out in the use mode regardless of whetheror not these figures are being displayed. MainClaim: A computer system with direct manipulation interface, comprising:

a display screen;

a pointing means capable of indicating a position on said display screen;

image-producing means for displaying an image on said display screen, said image including one or more task-calling areas, each of said task-calling areas being individually selectable and each of said task-calling areas being associated with a predefined task to be performed by said computer system;

www.patentics.com


handle-generating means for generating one or more handle areas associated with and proximal to at least one said task-calling area on said display screen if a handle-generating signal associated with said task-calling area is generated, each of said handle areas corresponding to an interface-modifying operation to be performed by said computer system on said task-calling area, said handle areas being removable in response to a handle-removing signal;

editing means for causing said computer system to respond, if any one of said handle areas is selected, by effecting the task-calling area interface-modifying operation corresponding to said selected handle area; and

task-performing means for causing said computer system to respond, if any one of said task-calling areas is selected, by performing the predefined task associated with said selected task-calling area, when said handle areas are currently being displayed on said display screen.

2004/0261031 Context dependent auxiliary menu elements Nokia Corporation

Tuomainen, Kimmo | Suomalainen, Sanna M. | Konkka, Katja

715 G09G 20030623 2 93%

Abstract: The invention relates to a method of displaying a menu on a display of an electronic device. The method comprisesthe steps of displaying one or more selection elements, defining an auxiliary element for at least one selection element,activating one selection element and displaying an auxiliary element only in an active selection element. MainClaim: A method of displaying a menu on a display of an electronic device, the method comprising the steps of displayingone or more selection elements, defining an auxiliary element for at least one selection element, activating one selectionelement, and displaying an auxiliary element only in an active selection element.


Nokia Corporation


345 G09G 20060607 5 93%


2010/0011310

Method, Device, Computer Program and Graphical User Interface Used for the Selection, Movement and De-Selection of an Item

NOKIA CORPORATION Rainisto; Roope 715 G06F 20050930 4 92%

Abstract: A method of controlling an action performed as a result of a drag and drop operation, the method including displayinga menu of multiple actions during the drag and drop operation, each of the actions being associated with a different respectiveportion of a display; and performing an action associated with a portion of the display that coincides with a waypoint in the dragand drop operation. MainClaim: A method of controlling an action performed as a result of a drag and drop operation, the methodcomprising:displaying a menu of multiple actions during the drag and drop operation, an action being associated with arespective portion of a display; andperforming an action associated with a portion of the display that coincides with a waypointin the drag and drop operation.

RE39,610

Systems and methods for replacing open windows in a graphical user interface

Apple Computer Inc. McFarland; Max 715 G06F 20020606 0 100%

Abstract: Systems and methods for returning windows to an original location are described. When springing already openwindows to a new location on a display space, it is desired to return that window to its original location for certain situations. Alist is provided when the springing operation is initialized which captures information used to return the sprung window.According to exemplary embodiments, the relocation of various windows is tracked to ensure that each window is returned to anoriginal location. MainClaim: A method for returning a window to an original position among a plurality of cascaded windows which are renderedon a display space, comprising the steps of: generating a list which provides a front-to-back order of said plurality of cascaded windows and an indicator of whether each of said plurality of cascaded windows is currently in its respective original, cascadedposition; .Iadd.storing an initial location and position for a window;.Iaddend. removing said window from said original position;rendering said window at another location on said display space; receiving, at a graphical interface, an indication that saidwindow is to be removed from said another location on said display space; and returning said window to said original positionbased upon said list generated by said step of generating.

2003/0169294



Abstract: In accordance with this invention, there is disclosed a method for providing a representation of a first application tobe executed in an electronic device that uses the representation to present information of at least one other application thatselects one of the applications for direct display and selects at least another of the applications for indirect display in accordancewith information representative of a state of at least one of the applications. Further, a user interface and an electronic deviceare disclosed having a display and being adapted to operate a plurality of applications having a component for providing arepresentation of one of the applications, a component for using the representation to present information of at least one otherof the applications, and a component for selecting one of the applications for direct display and selecting at least another of theapplications for indirect display in accordance with information representative of a state of at least one of the applications. MainClaim: A method for providing a representation of a first application to be executed in an electronic device, comprising:

www.patentics.com


using said representation to present information of at least one other application; selecting one of said applications for directdisplay and selecting at least another of said applications for indirect display in accordance with information representative of astate of at least one of said applications.

6,072,488

Systems and methods for replacing open windows in a graphical user interface

Apple Computer, Inc. McFarland; Max 345 G06F 19950505 0 100%

Abstract: Systems and methods for returning windows to an original location are described. When springing already openwindows to a new location on a display space, it is desired to return that window to its original location for certain situations. Alist is provided when the springing operation is initialized which captures information used to return the sprung window.According to exemplary embodiments, the relocation of various windows is tracked to ensure that each window is returned to anoriginal location. MainClaim: A method for returning a window to an original position among a plurality of cascaded windows which are renderedon a display space, comprising the steps of:

generating a list which provides a front-to-back order of said plurality of cascaded windows and an indicator of whether each ofsaid plurality of cascaded windows is currently in its respective original, cascaded position;

removing said window from said original position;

rendering said window at another location on said display space;

receiving, at a graphical interface, an indication that said window is to be removed from said another location on said displayspace; and

returning said window to said original position based upon said list generated by said step of generating.

2003/0169294



345 G09G 20030307 30 93%


7,343,562

Graduated visual and manipulative translucency for windows

Apple Inc. Bonura; Thomas | Silverman; Kim

715 G06F 20031105 0 100%

Abstract: Methods and systems for providing graphical user interfaces are described. overlaid, Information-bearing windows whose contents remain unchanged for a predetermined period of time become translucent. The translucency can be graduatedso that, over time, if the window's contents remain unchanged, the window becomes more translucent. In addition to visualtranslucency, windows according to the present invention also have a manipulative translucent quality. Upon reaching a certainlevel of visual translucency, user input in the region of the window is interpreted as an operation on the underlying objectsrather than the contents of the overlaying window. MainClaim: A computer system comprising: display means for depicting a graphical user interface with a window havinginformation; and processor means for rendering said window in an opaque state in response to changing said information andrendering said window in a first translucent state in response to said information being unchanged for greater than apredetermined period of time.

2009/0033684 On-screen marker to assist usability while scrolling

Nokia Corporation Barrett; Robert Alan

345 G09G 20070803 10 92%

Abstract: In a non-limiting aspect thereof, the exemplary embodiments of this invention provide a method including placing amarker on a display, where the marker is placed automatically at a departure point on the display upon sensing a scrollingoperation, and moving the marker on the display, where the marker moves with the departure point during the scrollingoperation. MainClaim: A computer readable medium encoded with a computer program executable by a processor to perform actionscomprising:placing a marker on a display, where the marker is placed automatically at a departure point on the display uponsensing a scrolling operation; andmoving the marker on the display, where the marker moves with the departure point duringthe scrolling operation.

7,607,102

Dynamically changing appearances for user interface elements during drag-and-drop operations

Apple Inc.Ording; Bas | Jobs; Steven P. 715 G06F 20020319 0 100%

Abstract: A user interface includes elements whose appearance dynamically changes in dependence upon functions associatedwith the elements. In the case of an icon that is the destination for a drag-and-drop operation, the image displayed for the icon

www.patentics.com


changes in accordance with the object being dragged to it, to represent the task that will be performed as a result of the drag-and-drop operation. The appearance of other elements involved in drag-and-drop operations can also be varied, to reflect the task at hand. As a result, the user is provided with more intuitive feedback regarding the functions that will be performed by thecomputer as a result of a drag-and-drop operation. MainClaim: A method for representing actions to be performed on objects in a computer system as a result of drag-and-drop operations within a graphical user interface, comprising the steps of: classifying objects in said computer system into at least afirst type and a second type corresponding to respective first and second actions that can be performed on said objects;displaying at least one icon associated with a classified object; detecting that an icon associated with a classified object has beenselected, and determining which type of object is associated with the selected icon; providing a destination icon that isassociated with both of said first and second actions; assigning first and second images to said destination icon that respectivelycorrespond to said first and second actions; and displaying said destination icon with said first image or said second image inaccordance with the type of object determined to be associated with the selected icon.



2003/0169294




7,479,971 Intelligent scrolling Apple Inc.Meier; John R. | Sullivan; John | Mercer; Paul

345 G09G 20061228 0 100%

Abstract: A method and apparatus for intelligent scrolling. In a computer system that has a user interface which allows for themovement of items from a first open window to a second open window or to a second region, such as a desktop, the presentinvention allows a user to select one or more items in the first window, move the selected item(s) to within a predetermineddistance from an edge of the first window for a predetermined period of time and cause the viewable portion of the data and/ordocument within the first window to scroll in a corresponding direction. MainClaim: A machine-readable storage medium having stored instructions to cause a machine to perform a machine-implemented method for controlling a display, the method comprising: receiving a user selection of an object displayed within afirst region on said display; receiving an input indicating a user positioning of said selected object at a predetermined scrollingarea which is near an edge of the first region, wherein the predetermined scrolling area does not include selectable user inputsfor scrolling said display in a first direction; and scrolling in a first direction, in response to said input, displayed items within saidfirst region, wherein said first region is a directory, wherein the selected object is an item within the directory; and determiningthat said selected object is no longer in said predetermined scrolling area; and terminating said scrolling of said displayed itemswithin said first region.


Nokia CorporationBarrett; Robert Alan 345 G09G 20070803 10 92%


6,957,395 Computer interface having a single window mode of operation

Apple Computer, Inc.Jobs; Steven P. | Lindsay; Donald J.

715 G06F 20000104 0 100%

Abstract: A computer-human interface manages the available space of a computer display in a manner which reduces clutterand confusion caused by multiple open windows. The interface includes a user-selectable mode of operation in which only those

www.patentics.com


windows associated with the currently active task are displayed on the computer monitor. All other windows relating to non-active tasks are minimized by reducing them in size or replacing them with a representative symbol, such as an icon, so thatthey occupy a minimal amount of space on the monitor's screen. When a user switches from the current task to a new task, byselecting a minimized window, the windows associated with the current task are automatically minimized as the windowpertaining to the new task is displayed at its normal size. As a result, the user is only presented with the window that relates tothe current task of interest, and clutter provided by non-active tasks is removed. MainClaim: A user interface for a computer in which data pertaining to multiple different tasks is displayed in multiple differenttask windows, respectively, and including a user-selectable mode of operation in which only an active one of the multiple taskwindows is normally displayed at a time, and a minimized representation is provided for all non-active task windows.

2003/0169294



345 G09G 20030307 30 96%


2006/0059436 Handling and scrolling of content on screen

Nokia Corporation Nurmi; Mikko 715 G06F 20050805 10 93%


7,539,795




6,664,981

Graphical user interface with hierarchical structure for customizable menus and control objects


Ashe; Dylan B. | Johnston, Jr.; Robert G. | Ruff; Joseph A. | Clifford; Daniel

345 G06F 20010813 0 100%

Abstract: The program code for control objects in a graphical user interface is organized in a multi-level hierarchial structure. At one level of the structure, each different type of control defines a class of objects. The definition of a class includes most, if not

www.patentics.com


all, of the functionality associated with the objects of that class. In addition, the class definition includes the overall structure ofthe object, such as the relative positions of different elements which make up the object. The actual appearance of theseelements is defined by user selectable software that resides at a lower level of the hierarchy. Using this approach, only oneinstance of the program code which defines the functionality and overall structure of each object is required, resulting in smallerthe overall memory requirements of the program code. MainClaim: A graphical user interface for a computer, said interface including graphical objects that are displayed on a monitorof the computer and that are accessed by users to control the operation of the computer, said interface comprising a plurality ofdefinitions that are respectively associated with said graphical objects, each of said definitions comprising a hierarchical set ofsoftware code modules, including:

a first code module at one level of the hierarchy which defines the structural relationship of elements that constitute a displayedimage of the graphical object; and

a second code module at a lower level of the hierarchy which depends from said first code module, said second code moduledefining an appearance for each of the elements in the image of the graphical object to be displayed on the monitor.

2006/0253788



715 G06F 20050509 8 94%


2007/0157117




2003/0169294




7,456,850 Intelligent scrolling Apple Inc.Meier; John R. | Sullivan; John | Mercer; Paul

345 G09G 20031218 0 100%

Abstract: A method and apparatus for intelligent scrolling. In a computer system that has a user interface which allows for themovement of items from a first open window to a second open window or to a second region, such as a desktop, the presentinvention allows a user to select one or more items in the first window, move the selected item(s) to within a predetermineddistance from an edge of the first window for a predetermined period of time and cause the viewable portion of the data and/ordocument within the first window to scroll in a corresponding direction. MainClaim: A machine implemented method for controlling a display, said method comprising: receiving a user selection of anobject displayed within a first region on said display, wherein the user selection selects the object to be a selected object,wherein the object is not a dedicated selectable input for movement of said display; receiving an input indicating a user

www.patentics.com


positioning of said selected object at a predetermined scrolling area which is near an edge of the first region; and scrolling, inresponse to said input, displayed items within said first region, wherein said first region is a directory of said items, wherein theselected object is an item within the directory; and determining that said selected object is no longer in said predeterminedscrolling area; and terminating said scrolling of said displayed items within said first region.






345 G09G 20070803 10 92%


6,734,882 Combined menu-list control element in a graphical user interface

Apple Computer, Inc. Becker; Thomas W. 345 G06F 20000929 0 100%

Abstract: A control element for use in a graphical user interface, which combines the display features of the list box elementand the pop-up menu element into a single GUI control element. The combined menu list control element is capable of displaying data in multiple states thereby allowing to it to optimally use the available display space for presenting data to theuser. By allowing menu list control element to display data as either a list or a menu, it combines the advantages of lists andmenus while avoiding their disadvantages. MainClaim: In a graphical user interface, a method of presenting data using a control element, the method comprising thesteps of:

determining, by the graphical user interface, an amount of display space available to display said data; and

configuring, by the graphical user interface, the control element to display said data in one of a first display state and a seconddisplay state based on the amount of display space determined to be available, wherein said control element, in said first displaystate, presents said data as a list, and said control element in said second display state, presents a menu which can be accessedto present said data.

2003/0169294



345 G09G 20030307 30 93%



Nokia Corporation


345 G09G 20060607 5 93%




Abstract: In a non-limiting aspect thereof, the exemplary embodiments of this invention provide a method including placing a

www.patentics.com


marker on a display, where the marker is placed automatically at a departure point on the display upon sensing a scrollingoperation, and moving the marker on the display, where the marker moves with the departure point during the scrollingoperation. MainClaim: A computer readable medium encoded with a computer program executable by a processor to perform actionscomprising:placing a marker on a display, where the marker is placed automatically at a departure point on the display uponsensing a scrolling operation; andmoving the marker on the display, where the marker moves with the departure point duringthe scrolling operation.

6,670,970

Graduated visual and manipulative translucency for windows

Apple Computer, Inc. Bonura; Thomas | Silverman; Kim

345 G09G 19991220 0 100%

Abstract: Methods and systems for providing graphical user interfaces are described. overlaid, Information-bearing windows whose contents remain unchanged for a predetermined period of time become translucent. The translucency can be graduatedso that, over time, if the window's contents remain unchanged, the window becomes more translucent. In addition to visualtranslucency, windows according to the present invention also have a manipulative translucent quality. Upon reaching a certainlevel of visual translucency, user input in the region of the window is interpreted as an operation on the underlying objectsrather than the contents of the overlaying window. MainClaim: A computer system comprising:

a display;

a graphical user interface depicted on said display;

a window having information displayed therein; and

a processor for rendering said window in said graphical user interface in an opaque state in response to changing saidinformation and rendering said window in a first translucent state in response to said information being unchanged for greaterthan a predetermined period of time.

2003/0169294



345 G09G 20030307 30 94%


7,216,304 Graphical user interface for computers having variable size icons

Apple Inc.Gourdol; Arnaud | Lindsay; Donald J. 715 G06F 20000105 0 100%

Abstract: A computer user interface is provided which allows a user to adjust the size of icons based upon a user's preferenceor based upon a characteristic of the objects that the icons represent. When the icon sizing is performed according to a userpreference, a relative sizing scheme or an arbitrary icon sizing scheme can be employed to variably size icons. Providing theability to size icons in such a manner allows users to represent a user's categorization of object importance, for example. MainClaim: A method for varying the size of a plurality of icon images displayed in a display device based upon a userpreference value, comprising: storing icon data representative of a plurality of icon images; selecting individual icons to performvariable icon sizing; designating a user preference value for each of the selected icons; generating icon images of differentrespective sizes, wherein the different sizes of the icon images are based upon said user preference values; and displaying saiddifferent sized icon images; wherein the generating step includes sorting icon images into an order based upon said designatedpreference values, and includes calculating a size gap between said ordered icon images using the following equation: (max-min)/(N-1), where N is the number of applications given a preference, min is a minimum icon size and max is a maximum iconsize.




2005/0229111 Presentation of large pages on small displays Nokia Corporation Makela, Mikko 715 G06F 20040407 4 93%

Abstract: This invention relates to method for presenting at least a part of a page, comprising at least partially dividing at least

www.patentics.com


one page into a plurality of areas, presenting said plurality of areas in a first representation, making at least one area of saidplurality of areas an active area, and in response to a user operation on said at least one active area, presenting at least one ofsaid at least one active areas in a second representation. Said at least one page may be a Hypertext Markup Language HTMLpage, or a page of a text document, and said display may be integrated in a portable electronic device. The invention furtherrelates to a device, a system, a computer program and a computer program product. MainClaim: A method for presenting at least a part of a page, comprising: at least partially dividing at least one page into aplurality of areas; presenting said plurality of areas in a first representation, making at least one area of said plurality of areasan active area; and in response to a user operation on said at least one active area, presenting at least one of said at least oneactive areas in a second representation.



5,880,729 Graphical user interfaces having animated control elements


Johnston, Jr.; Robert G. | Moller; Elizabeth Robinson | Ulrich; Robert

345 G06F 19950505 0 100%

Abstract: Systems and methods for providing an enhanced visual appearance to a graphical user interface are described.Control elements portrayed by the graphical user interface on a display are associated with at least two states. Whentransitioning between states, an animated transition effect can be provided to provide further user or designer customization ofthe interface appearance. MainClaim: A method for providing an animated transition effect between a first display state associated with a first functionalstate of a control element drawn on a graphical user interface of a computer system and a second display state associated witha second functional state of said control element, the method comprising:

drawing said control element in said first display state at a first portion of a display space controlled by said graphical userinterface;

receiving, at said graphical user interface, a user input invoking said second functional state of said control element;

evaluating a state table associated with said control element having table entries, each of which is associated with a transitionbetween different combinations of states, to identify a table entry associated with a transition between said first display stateand said second display state;

retrieving a sequence of transition images of said control element stored in a memory device, based on the table entryidentified, wherein each of said transition images in said sequence provides a portion of a visual effect which creates a transitionbetween said first display state and said second display state;

repeatedly redrawing said control element at said first portion of said display space using said sequence of transition images;and

drawing, after a last of said transition images in said sequence, said control element in said second display state at said firstportion of said display space.

2003/0169294




5,652,714

Method and apparatus for capturing transient events in a multimedia product using an authoring tool on a computer system

Apple Computer, Inc.Peterson; Alan R. | Spohrer; James C.

702 G06F 19940930 0 100%

Abstract: According to the invention, a software tool such as an authoring tool provides a mechanism for manipulating transientevents within a multimedia product or other content having one or more state machines, each state machine having one or

www.patentics.com


more states and one or more transitions, each transition connecting a first state with a second state, the first and second statesbeing the same as or different from each other, each transition capable of being associated with one or more transient eventsand a trigger such that when said trigger occurs it initiates a transition from the transition's first state to the transition's secondstate, the transient events associated with the transition occurring on the computer system during the transition. The inventionprovides a mechanism for locating a transient event and displays a graphic reference for the located transient event so that thegraphic reference can be used to manipulate the transient event. MainClaim: An apparatus for locating and capturing a transient event in content using a software tool executing on a computersystem having a processor and memory, said apparatus comprising:

at least one state machine within the content, each state machine having one or more states and zero or more transitions, eachtransition having a first end and a second end, each first end and second end being coupled to a state within the state machine,each transition capable of being associated with one or more transient events and a trigger such that when said trigger occurs itinitiates a transition from a first state coupled to the first end of the transition to a second state coupled to the second end ofthe transition whereby the transient events associated with the transition are caused to occur on the computer system;

locating means for locating one of the transitions in a state machine in the content; and

means for capturing a transient event associated with the located transition, said capturing means providing a reference to thecaptured transient event; and

user interface means, said user interface arranged to graphically display the provided reference and allow a user to manipulatesaid graphic reference.




6,188,399 Multiple theme engine graphical user interface architecture

Apple Computer, Inc. Voas; Ed | Gourdol; Arnaud

345 G06F 19980508 0 100%

Abstract: Systems and methods for providing a user with increased flexibility and control over the appearance and behavior ofobjects on a user interface are described. Sets of objects can be grouped into themes to provide a user with a distinct overallimpression of the interface. These themes can be invoked by calling a corresponding theme engine. Theme engines can be hard-coded or data-driven. MainClaim: In a graphical user interface, a method for rendering objects and handling behavior of said objects comprising thesteps of:

providing a plurality of themes, each theme controlling an appearance and behavior of objects rendered on said graphical userinterface, wherein at least one of said appearance and said behavior is controlled differently for an object when said graphicaluser interface is operated in accordance with one theme than when said graphical user interface is operated in accordance withanother theme;

providing a plurality of theme engines, each theme engine associated with a different theme type, wherein at least one of saidtheme engines is hard-coded and at least one of said theme engines is a data-driven, parametric engine;

selecting a theme from among said plurality of themes;

identifying one of said plurality of theme engines associated with said selected theme; and

loading, by said identified theme engine, theme data for operating said graphical user interface in accordance with said selectedtheme.




2007/0157117 Apparatus, method and computer program product providing user interface configurable


www.patentics.com


command placement logic


2006/0158385 User interface for different displays Nokia Corporation Etelapera; Esa 345 G06F 20050118 2 92%

Abstract: This invention relates to a method for adjusting a graphical user interface for at least two displays, wherein due to anactivation of at least one of at least two displays the graphical user interface is informed about the characteristics of said at leastone activated display whereby the graphical user interface is refreshed according to said characteristics. This invention alsorelates to a display system, to a device, to a graphical user interface and to a computer program product. MainClaim: A method for adjusting a graphical user interface for at least two displays, wherein in response to an activation ofat least one of said at least two displays the graphical user interface is refreshed for said activated display according tocharacteristics of said activated display.

7,530,026 User interface element with auxiliary function

Apple Inc.

Chaudhri; Imran A. | Louch; John | Grignon; Andrew M. | Christie; Gregory N.

715 G06F 20060307 0 100%

Abstract: A user-activatable dashboard (also referred to as a unified interest layer) contains any number of user interfaceelements, referred to herein as "widgets," for quick access by a user. In response to a command from a user, the dashboard isinvoked and the widgets are shown on the screen. The user can activate the dashboard at any time, causing the dashboard totemporarily replace the existing user interface display on the user's screen. Once the dashboard has been activated, the usercan interact with any or all of the widgets, and can configure the dashboard by adding, deleting, moving, or configuringindividual widgets as desired. When the user wishes to return to the normal user interface he or she was working with, the userissues a command causing the dashboard to be dismissed. Once the dashboard has been dismissed, the previous user interfacestate is restored, allowing the user to resume normal interactions with the operating system. MainClaim: A method for displaying auxiliary controls for a user interface element on a display screen, the method comprising:displaying a first side of a user interface element wherein the first side consists of a software accessory with a functionality;responsive to receiving user input to display the auxiliary controls for the software accessory, displaying a second side of theuser interface element, the second side comprising the auxiliary controls; and receiving changes to the software accessory viathe auxiliary controls, wherein the changes are reflected in the appearance and functionality of the software accessory on thefirst side of the user interface element.

2009/0327953

UNIFIED NAVIGATION MODEL BETWEEN MULTIPLE APPLICATIONS

NOKIA CORPORATION

Honkala; Mikko | Kinnunen; Kimmo | Grassel; Guido | Cui; Yan Qing | Roto; Virpi | Rautava; Mika

715 G06F 20080630 5 93%

Abstract: Web style navigation methods are applied across applications and webpages, whether local or web-based, and hypertext navigation methods used in the web are extended to local applications. Local and web applications are mixedseamlessly so that the user does not perceive any difference between navigation within either one of, or between, those types ofapplications. The user navigates between different user interface states, in and out of different types of applications. All viewsand states of views are recorded and the user can switch to a previous view, in the state in which it was viewed, using a back,history or other suitable state recording and retrieval function. MainClaim: A method comprising:opening a first application view in a window of a user interface;detecting an activation a linkto a second application view while a state of the user interface is in the first application view;opening the second applicationview in the window of the user interface; anddetecting a selection of a function in a state of the user interface in the secondapplication view as a command to automatically return to the state of the user interface in the first application view in thewindow of the user interface; andreturning the state of the user interface to the first application view.

7,490,295 Layer for accessing user interface elements

Apple Inc.


715 G06F 20040625 0 100%

Abstract: A user-activatable dashboard contains any number of user interface elements, referred to herein as "widgets," forquick access by a user. In response to a command from a user, the dashboard is invoked and the widgets are shown on thescreen. The user can activate the dashboard at any time. Once the dashboard has been activated, the user can interact with anyor all of the widgets, and can configure the dashboard by adding, deleting, moving, or configuring individual widgets as desired.When the user wishes to return to the normal user interface he or she was working with, the user issues a command causing thedashboard to be dismissed. Once the dashboard has been dismissed, the previous user interface state is restored, allowing theuser to resume normal interactions with the operating system. MainClaim: In a computer system including an operating system comprising a runtime engine that is part of the operatingsystem and a display screen comprising an area displaying a user interface, a method for presenting a dashboard layer,comprising: responsive to a trigger event, activating the dashboard layer in the area displaying the user interface, thedashboard layer comprising a web view in a development environment and executed by the runtime engine, the activation of thedashboard layer thereby providing access to a group of widgets contained by the dashboard layer, wherein at least one of thewidgets in the group of widgets was not visible on the display screen prior to activation of the dashboard layer.

Methods and apparatus for implementing dynamic shortcuts both

www.patentics.com


7,539,795

for rapidly accessing web content and application program windows and for establishing context-based user environments



2009/0327953


NOKIA CORPORATION


715 G06F 20080630 5 93%


2006/0158385 User interface for different displays

Nokia Corporation Etelapera; Esa 345 G06F 20050118 2 93%

Abstract: This invention relates to a method for adjusting a graphical user interface for at least two displays, wherein due to anactivation of at least one of at least two displays the graphical user interface is informed about the characteristics of said at leastone activated display whereby the graphical user interface is refreshed according to said characteristics. This invention alsorelates to a display system, to a device, to a graphical user interface and to a computer program product. MainClaim: A method for adjusting a graphical user interface for at least two displays, wherein in response to an activation ofat least one of said at least two displays the graphical user interface is refreshed for said activated display according tocharacteristics of said activated display.

5,586,237

Method for generating and displaying content-based depictions of computer generated objects

Apple Computer, Inc.Baecker; Ronald M. | Small; Ian S. 345 G06T 19950607 0 100%

Abstract: A means and method for generating and displaying a content-based depiction of a standard icon on the display of a computer. The depiction is generated upon the occurrence of predetermined events, such as the closure of the document or fileassociated with the icon, and is displayed in either a static or animated form in place of the standard icon in response toselection signals from a selection device. A single content-based depiction of an icon is generated by creating a representation ofthe object (file or document) to be depicted, and translating this representation into a scaled-down replica of the representation. This representation may be in the form of a bit-map, a full-scale image, etc. The replica is created by partitioning the representation into a number of equal segments, measuring the percentages of different colors (black and white, gray scale, orcolor) within each segment, and assigning a single color value to each display element or pixel of the replica based upon thecolor percentage measured from each corresponding segment of the representation. Animated depictions are created by forminga number of different replicas for each representation to be depicted and then displaying those replicas in a serial sequence tocreate an animated depiction of the representation. Like the icons these depictions replace when selected, the depictions wouldbe movable to any position on the display through use of the mouse. MainClaim: A computer-readable storage device having stored thereon a plurality of computer-readable instructions for generating a reduced visual version of an object based on the content of the object and displaying the reduced visual version ona display screen of a computer, the reduced visual version being associated with the object, the computer having memory forstoring and displaying the object and further having a processor, the reduced visual version having the functionality of an icon,

www.patentics.com


the object having a variable visual format based upon information contained by the object, the plurality of computer-readable instructions including a sequence of instructions which, when executed by the computer, cause the computer to perform thesteps of:

generating the reduced visual version of the object based on the content of the object by transforming at least a portion of thevariable visual format of the object; and

displaying the reduced visual version of the object on the display screen,

wherein the step of generating the reduced visual version comprises producing a representation of the portion, therepresentation being a visual image of the variable format of the object, and generating the reduced visual version of the portionfrom the representation, the reduced visual version being a scaled-down visual image resembling the variable format of the object.

2005/0229111 Presentation of large pages on small displays

Nokia Corporation Makela, Mikko 715 G06F 20040407 4 94%


2007/0124669 Presentation of large objects on small displays NOKIA CORPORATION Makela; Mikko 715 G06F 20040921 1 93%

Abstract: A method for presenting at least a part of an object is shown, comprising at least partially dividing at least one objectinto a plurality of sub-objects, presenting the plurality of sub-objects in a first representation, making at least one sub-object of the plurality of sub-objects an active sub-object, and in response to a user operation on the at least one active sub-object, presenting at least one of the at least one active sub-objects in a second representation. The at least one object may be a 2Dobject, e.g. a Hypertext Markup Language HTML page or a page of a text document, or a 3D object, e.g. a Virtual RealityMarkup Language VRML object, and said display may be integrated in a portable electronic device. The invention further relatesto a device, a system, a computer program and a computer program product. MainClaim: A method for presenting at least a part of an object, comprising: at least partially dividing at least one object into aplurality of sub-objects; presenting said plurality of sub-objects in a first representation, determining at least one sub-object of said plurality of sub-objects to be made an active sub-object; and making said at least one sub-object of said plurality of sub-objects an active sub-object; and in response to a user operation on said at least one active sub-object, presenting at least one of said at least one active sub-objects in a second representation.

7,594,194 Portrayal of navigation objects

Nokia Corporation Makela; Mikko 715 G06F 20030924 2 93%

Abstract: The invention relates to a method, a device, a computer program product, a browser and a network element forimproved portrayal of navigation objects (1-1 . . . 1-6), wherein at least two navigation objects (1-1 . . . 1-6) are combined into one combined navigation object (4), wherein said combined navigation object (4) is presented, and wherein said at least twonavigation objects (1-1 . . . 1-6) are presented, if said combined navigation object (4) is selected. MainClaim: A method, comprising: scaling a web page that comprises an image map and further content to obtain a scaled webpage, wherein said image map contains at least two image hyperlinks, making the scaled version of said image map in saidscaled web page selectable as a whole; presenting said scaled web page on a display, and presenting only said image map withsaid at least two hyperlinks in unscaled format in response to a selection of said selectable scaled version of said image map.

7,546,543 Widget authoring and editing environment Apple Inc.

Louch; John O. | Grignon; Andrew M. | Bumgarner; Timothy Wayne | Peyton; Eric Steven | Drukman; Max

715 G06F 20050603 0 100%

Abstract: An authoring environment for creating and/or editing user interface elements such as widgets used in a unifiedinterest layer. The authoring environment facilitates creation of widgets that have a consistent appearance and mechanism, andallows third-party developers to easily create widgets that have a look and feel that is consistent with a predefined set ofwidgets. MainClaim: A computer-implemented method of creating a widget from a template, the widget to be used in a computersystem including an operating system comprising a runtime engine that is part of the operating system, the method executed bya computer and comprising: displaying one or more templates for the widget; receiving first author input selecting a templatefrom the one or more templates as a basis for the widget; displaying a set of predetermined attributes for the widget; receivingsecond author input selecting one or more predetermined attributes from the set of predetermined attributes; and displaying,within a unified interest layer, the widget incorporating the one or more predetermined attributes, wherein the unified interestlayer comprises a web view defined in a development environment and is executed by the runtime engine.

2009/0327953


NOKIA CORPORATION


715 G06F 20080630 5 94%

Abstract: Web style navigation methods are applied across applications and webpages, whether local or web-based, and hypertext navigation methods used in the web are extended to local applications. Local and web applications are mixedseamlessly so that the user does not perceive any difference between navigation within either one of, or between, those types of

www.patentics.com


applications. The user navigates between different user interface states, in and out of different types of applications. All viewsand states of views are recorded and the user can switch to a previous view, in the state in which it was viewed, using a back,history or other suitable state recording and retrieval function. MainClaim: A method comprising:opening a first application view in a window of a user interface;detecting an activation a linkto a second application view while a state of the user interface is in the first application view;opening the second applicationview in the window of the user interface; anddetecting a selection of a function in a state of the user interface in the secondapplication view as a command to automatically return to the state of the user interface in the first application view in thewindow of the user interface; andreturning the state of the user interface to the first application view.

7,539,795




2006/0064648

Display module, a device, a computer software product and a method for a user interface view


Abstract: This invention relates to browsing web pages with a mobile device and especially to a display module, whichcomprises a user interface view, which comprises at least one link to another user interface view as well as a pointer forselecting said link. The link is arranged to execute a pop-up view in said user interface view and that said same link is inaddition arranged to execute one other user interface view in the display module. According to the invention, instead ofexecuting said one other user interface view the link in question is transferred to the pop-up view being opened as a selectable function. Further, the invention relates to a device, a method and a computer software product. MainClaim: A display module, which comprises a user interface view, which comprises at least one link to another userinterface view as well as a pointer for selecting said link, which link is arranged to execute a pop-up view in said user interface view and that said same link is in addition arranged to execute said other user interface view in the display module, wherein saidpop-up view is arranged to be executed instead of executing said other user interface view, in which pop-up view the link in question is as a selectable function.

6,396,474

Method and apparatus for providing visual feedback during manipulation of text on a computer screen

Apple Computer, Inc.Johnson, Jr.; Robert G. | Jenson; Scott

345 G09G 19971126 0 100%

Abstract: A method and apparatus providing visual feedback to a computer user while dragging selected text is described. Asits first step, the processing logic creates a text object from the selected text once the computer user has initiated a drag.Simultaneously, the selected text is visually de-emphasized. Secondly, the processing logic snaps the text object to the cursorso that the text object follows the cursor without obscuring text at the insertion point. Finally, when the computer user selectsthe final insertion point, the selected text is visually zoomed from the source location to the final insertion point. MainClaim: An apparatus providing visual feedback while manipulating text, the apparatus comprising:

a) a computer system including:

2004/0119763


Nokia CorporationMizobuchi, Sachi | Mori, Eigo 345 G09G 20021223 12 92%

Abstract: A method is disclosed to operate a touch screen user interface. The method includes forming a stroke that encloses

www.patentics.com


an area that contains at least a portion of at least one displayed object; and selecting the at least one displayed object. Formingthe stroke may further include extending the stroke to a functional object, and activating the functional object with the at leastone selected displayed object. If the stroke does not define an area that is totally enclosed by the stroke, the method mayfurther include automatically continuing the stroke such that the area is totally enclosed by the stroke. In this case the strokemay be automatically continued by drawing a line that connects a stroke starting point to a stroke ending point, and by addingtouch screen coordinates covered by the line to a list of touch screen coordinates that describe the stroke. If the stroke enclosesan area that contains at least a portion of a plurality of displayed objects, each of the displayed objects is simultaneouslyselected. MainClaim: A method to operate a touch screen user interface, comprising: forming a stroke that encloses an area thatcontains at least a portion of at least one displayed object; and selecting the at least one displayed object.

7,554,530



345 G09G 20021223 13 92%


5,801,687

Authoring tool comprising nested state machines for use in a computer system

Apple Computer, Inc. Peterson; Alan R. | Spohrer; James C.

715 G06F 19960925 0 100%

Abstract: According to the invention, an authoring tool comprises at least one nestable graphic state and transition machine,hereinafter referred to as a "state machine", each state machine comprising one or more states and zero or more transitions,each transition interconnecting a first state, known as the "from-- state", with a second state, known as the "to-- state". The first

and second states can be the same state or different states. For each state in the plurality of states there can be any number oftransitions, including zero, emanating therefrom and directed thereto. Each state machine has a state designated as its "currentstate" which changes in response to users actions or other events. Each state machine also has an initial state which is the statethat is designated as the current state when the multimedia title is launched. The authoring tool allows an author to view a statemachine simultaneously in several different formats, providing a full view and a map view. State machines can be nested, i.e. astate machine can be contained by another state machine. Preferably, separate user and author views are provided so that anauthor can manipulate a multimedia product and simultaneously observe the effect such manipulation has on the multimediaproduct from the user's point of view. Preferably, a plurality of modes are provided, each mode being geared toward particularfunctionality within the invention and a mechanism is provided so that a user of the invention can selectively switch betweenmodes. MainClaim: An apparatus for authoring nested graphic state machines, wherein said apparatus has a processor and at least onestorage medium, said apparatus comprising:

a state machine module for creating a plurality of nested graphic state machines, each graphic state machine representing oneor more states of an arbitrary graphic object, wherein at least a portion of said state machine module is stored in said at leastone storage medium, and wherein each state machine has one or more arbitrarily arranged states and one or more transitionswith each transition interconnecting a first state to a second state, and wherein each state machine has a full view associated toit and each state has a full view associated to it thereby allowing said state machine module to create at least one sub-state machine within a first state machine by containing the full view of the second state machine within the full view of the first statemachine; and

a user interface module capable of interacting with said state machine module, wherein said user interface module displays a fullview of a state machine and receives user input, wherein said user input can activate a sub-state machine nested within the full view of the state machine being displayed, and wherein said activating causes a full view of the state within the activated sub-state machine to be displayed.




7,503,010 Remote access to layer and user interface elements

Apple Inc.


715 G06F 20060307 0 100%

www.patentics.com


Abstract: A user-activatable dashboard (also referred to as a unified interest layer) contains any number of user interfaceelements, referred to herein as "widgets," for quick access by a user. In response to a command from a user, the dashboard isinvoked and the widgets are shown on the screen. The user can activate the dashboard at any time, causing the dashboard totemporarily replace the existing user interface display on the user's screen. Once the dashboard has been activated, the usercan interact with any or all of the widgets, and can configure the dashboard by adding, deleting, moving, or configuringindividual widgets as desired. When the user wishes to return to the normal user interface he or she was working with, the userissues a command causing the dashboard to be dismissed. Once the dashboard has been dismissed, the previous user interfacestate is restored, allowing the user to resume normal interactions with the operating system. MainClaim: In a computer system including a display screen comprising an area displaying a user interface, a method forpresenting a layer, comprising: responsive to a trigger event by a user of the computer system, activating a layer configured forthe user in the area displaying the user interface on the display screen of the computer system, thereby providing access to agroup of widgets visually contained by the layer, wherein at least one widget in the group of widgets is capable of executingseparately from the layer and at least one of the widgets in the group of widgets was not visible on the display screen prior toactivation of the layer; and wherein the layer displayed on the display screen of the computer system may be accessed by theuser from a location remote from the computer system display screen.

2009/0327953


NOKIA CORPORATION


715 G06F 20080630 5 93%


5,825,349 Intelligent scrolling Apple Computer, Inc.Meier; John R. | Sullivan; John | Mercer; Paul

345 G09G 19950606 0 100%

Abstract: A method and apparatus for intelligent scrolling. In a computer system that has a user interface which allows for themovement of items from a first open window to a second open window or to a second region, such as a desktop, the presentinvention allows a user to select one or more items in the first window, move the selected item(s) to within a predetermineddistance from an edge of the first window for a predetermined period of time and cause the viewable portion of the data and/ordocument within the first window to scroll in a corresponding direction. MainClaim: A file management system for a computer system having a display, a processor and a memory for storing filesmanaged by said file management system, comprising:

a first region displayed on said display having a data display area;

a cursor displayed on said display; and

a first scroll area associated with said first region,

said file management system allowing scrolling of contents displayed in said data display area of said first region in a firstdirection when said cursor has selected an item which represents a file managed by said file management system and saidcursor has been moved with said item to said first scroll area and said cursor is disposed in said first scroll area and wherein saidfirst scroll area scrolls said contents along only said first direction when in a first context,

said file management system allowing said item to be dragged outside of said first region, and

said file management system determining whether to scroll said contents displayed in said first region or to allow said item to bedragged outside of said first region.





Abstract: In a non-limiting aspect thereof, the exemplary embodiments of this invention provide a method including placing amarker on a display, where the marker is placed automatically at a departure point on the display upon sensing a scrollingoperation, and moving the marker on the display, where the marker moves with the departure point during the scrolling

www.patentics.com


operation. MainClaim: A computer readable medium encoded with a computer program executable by a processor to perform actionscomprising:placing a marker on a display, where the marker is placed automatically at a departure point on the display uponsensing a scrolling operation; andmoving the marker on the display, where the marker moves with the departure point duringthe scrolling operation.


345 G09G 19981019 0 100%

Abstract: A method and apparatus for intelligent scrolling. In a computer system that has a user interface which allows for themovement of items from a first open window to a second open window or to a second region, such as a desktop, the presentinvention allows a user to select one or more items in the first window, move the selected item(s) to within a predetermineddistance from an edge of the first window for a predetermined period of time and cause the viewable portion of the data and/ordocument within the first window to scroll in a corresponding direction. MainClaim: A computer system having a program which comprises:

means for determining if a first item within a data display area of a first region of a display has been selected by a user bypositioning a cursor over said first item so that said first item is associated with said cursor for further operation ormanipulation;

means for determining if said cursor has been moved with said first item and positioned over a predetermined scrolling area ofsaid first region;

means for determining whether to scroll said contents of said first region or to allow said first item to be moved from said firstregion to a second region; and

means for scrolling the contents of said data display area of said first region while said cursor is positioned over saidpredetermined scrolling area and while said first item is associated with said cursor, to display a second item and wherein saidpredetermined scrolling area scrolls the contents along only a first direction when in a first context.






5,303,388

Method to display and rotate a three-dimensional icon with multiple faces

Apple Computer, Inc.Kreitman; Kristee | Mountford; Joy 345 G06F 19930423 0 100%

Abstract: A manipulable icon is displayed with multiple faces having particular application to computer displays and systems.The icon, which represents information about an object available within the computer, can be manipulated by the user to displaydifferent faces or views which provide additional information about the object represented by the icon. The user has the abilityto manipulate the icon to see additional views of the icon on the computer display device, either by a mouse stroke selectioncommand, keyboard command or menu selection. This selection causes the icon to move from one view or face of the icon toanother view or face of the icon. These additional views thus provide additional space in which the icon can supply additionalinformation to the user. Iconic movement from one face or view to another is also typically accompanied by some sound whichindicates execution of the movement. MainClaim: A method of manipulating a three-dimensional icon on a display screen of a computer system, wherein the three-dimensional icon includes a plurality of faces, each face containing at least one displayed item which is associated with an objectstored in the computer system, a first face containing a two-dimensional icon representing a folder or file stored in the computer system and other faces of the three-dimensional icon displaying attributes of said folder or said file, wherein the plurality offaces are joined together to form the three-dimensional icon, wherein the method comprises the steps of:

(A) marking a first button marker on the first face of the plurality of faces of the three-dimensional icon, wherein the first marker associated with a second face of the plurality of faces of the three-dimensional icon, wherein the first face is joined with the second face, when the first face is displayed front most on the display screen and the first button marker is activated byusing a cursor control device to position a movable cursor displayed on the display screen onto the first button marker, thethree-dimensional icon is rotated such that the second face is displayed front most on the display screen, wherein the movablecursor is controlled by the cursor control device of the computer system to move on the display screen;

www.patentics.com


(B) marking a second button marker on the second face that is associated with the first face, when the second face is displayedfront most and the second button marker is activated by using the cursor control device to position the movable cursor onto thesecond button marker, the three-dimensional icon is rotated such that the first face is displayed front most;

(C) rotating the three-dimensional icon by activating the first button marker with the movable cursor to display the second facefront most; and

(D) rotating the three-dimensional icon by activating the second button marker with the movable cursor to display the first facefront most.

7,554,530



345 G09G 20021223 13 93%


2004/0119763



Abstract: A method is disclosed to operate a touch screen user interface. The method includes forming a stroke that enclosesan area that contains at least a portion of at least one displayed object; and selecting the at least one displayed object. Formingthe stroke may further include extending the stroke to a functional object, and activating the functional object with the at leastone selected displayed object. If the stroke does not define an area that is totally enclosed by the stroke, the method mayfurther include automatically continuing the stroke such that the area is totally enclosed by the stroke. In this case the strokemay be automatically continued by drawing a line that connects a stroke starting point to a stroke ending point, and by addingtouch screen coordinates covered by the line to a list of touch screen coordinates that describe the stroke. If the stroke enclosesan area that contains at least a portion of a plurality of displayed objects, each of the displayed objects is simultaneouslyselected. MainClaim: A method to operate a touch screen user interface, comprising: forming a stroke that encloses an area thatcontains at least a portion of at least one displayed object; and selecting the at least one displayed object.

2010/0011310




5,566,248

Method and apparatus for a recognition editor and routine interface for a computer system

Apple Computer, Inc. Ulrich; Robert R. 382 G06K 19960124 0 100%

Abstract: A computer system including a CPU, a screen assembly coupled to the CPU, a pointer assembly coupled to the CPU,an application program running on the CPU, a recognizer routine running on the CPU, and a recognition editor and interface(REI) routine running on the CPU and providing an interface between the application program and the recognition routine. TheREI routine is operative to display an interface image on the screen of the CPU, receive ink inputs made on the interface imageby the pointer mechanism, send ink inputs to the recognition routine, receive recognized objects from the recognition routine,and to send recognized objects to the application program. Preferably, the REI routine also permits recognized objects to beedited on the interface image. By making the user interface of the REI routine separate from the operating system, theapplication program, and the recognition routine, a consistent user interface is developed for a multiplicity of applicationprograms and recognition routines. A method for interfacing between an application program and a recognizer routine includesthe steps of: 1) receiving user inputs from a pointing device into an interface routine; 2) sending the user inputs to a recognizerroutine; 3) receiving into the interface routine recognized objects from the recognizer routine; and 4) sending the recognizedobjects to an application program from the interface routine. The method also preferably includes the step of editing therecognized objects before sending them to the application program. MainClaim: A computer implemented method for interfacing between an application program and a recognizer routine, each ofwhich are implemented on a computer system, the method comprising the steps of:

www.patentics.com


displaying a recognition field in an interface area of a display screen of said computer system;

displaying a control field in said interface area;

receiving user inputs into an interface routine implemented on said computer system, said interface routine not integral to eithersaid recognizer routine or an operating system for said computer system, said user inputs comprising inputs made from apointing device interacting with said interface area;

analyzing said user inputs made from said pointing device interacting with said interface area;

editing said recognition field in said interface area, when appropriate, as determined by said analyzing step;

sending said user inputs to said recognizer routine, when appropriate, as determined by said analyzing step;

receiving a recognized object from said recognizer routine, said recognized object corresponding to at least one of said userinputs;

sending said recognized object to said application, when appropriate, as determined by said analyzing step.

2008/0002888





345 G09G 20011030 0 100%

Abstract: A method and apparatus for intelligent scrolling. In a computer system that has a user interface which allows for themovement of items from a first open window to a second open window or to a second region, such as a desktop, the presentinvention allows a user to select one or more items in the first window, move the selected item(s) to within a predetermineddistance from an edge of the first window for a predetermined period of time and cause the viewable portion of the data and/ordocument within the first window to scroll in a corresponding direction. MainClaim: A computer system having a program which comprises:

means for determining if a first item within a data display area of a first region of a display has been selected by a user bypositioning a cursor over said first item so that said first item is associated with said cursor for further operation ormanipulation;

means for determining if said cursor has been moved with said first item and positioned over a predetermined scrolling area of asecond region; and

means for determining whether to scroll contents of said second region or to allow said first item to be moved from said secondregion to a third region;

means for scrolling the contents of a data display area of said second region while said cursor is positioned over saidpredetermined scrolling area and while said first item is associated with said cursor, to display a second item and wherein saidpredetermined scrolling area scrolls the contents along only a first direction when in a first context.



345 G09G 20070803 10 92%



Abstract: The invention relates to a software application adapted for scrolling content on a screen in an application window. Thesoftware application includes at least two logically distinct scroll bars in one application window, each of the scroll bars providing

www.patentics.com


scrolling functionality relative to the same orientation of the content and each of the logically distinct scroll bars controllingdifferent part of the content. MainClaim: A device for handling content comprising a memory, a processing unit controlling operation of said device accordingto software stored in said memory, a screen for viewing content, said memory comprising a software application adapted forscrolling content on the screen in an application window, wherein the software application comprises: at least two logicallydistinct scroll bars in one application window, each of the scroll bars providing scrolling functionality relative to the sameorientation of the content and each of the logically distinct scroll bars controlling different part of the content.

5,196,838 Intelligent scrolling Apple Computer, Inc.Meier; John R. | Sullivan; John W. | Mercer; Paul

345 G09G 19901228 0 100%

Abstract: A method and apparatus for intelligent scrolling. In a computer system that has a user interface which allows for themovement of items from a first open window to a second open window or to a second region, such as a desktop, the presentinvention allows a user to select one or more items in the first window, move the selected item(s) to within a predetermineddistance from an edge of the first window for a predetermined period of time and cause the viewable portion of the data and/ordocument within the first window to scroll in a corresponding direction. MainClaim: In a computer controlled display system having a display wherein a plurality of regions may be displayed includingat least a first region, said first region having at least a first item within a visible display area of said first region and said firstregion having at least one item, including a second item, which is not within the visible display area of said first region, amethod for scrolling the contents of said first region to display said second item comprising:

selecting at least said first item within said first region by positioning a cursor over said first item and by placing a switch meansin a predetermined position so that said first item is associated with said cursor for further operation or manipulation;

positioning said cursor over a predetermined scrolling area;

determining that a predetermined period of time has elapsed while the cursor has been positioned in said predeterminedscrolling area; and

scrolling the contents of said first region in a direction corresponding to said predetermined scrolling area to display said seconditem while said first item remains selected and associated with said cursor.



5,561,444


Apple Computer, Inc.Johnston, Jr.; Robert G. | Jenson; Scott

345 G09G 19940822 0 100%

Abstract: A method and apparatus providing visual feedback to a computer user while dragging selected text is described. Asits first step, the processing logic creates a text object from the selected text once the computer user has initiated a drag.Simultaneously, the selected text is visually de-emphasized. Secondly, the processing logic snaps the text object to the cursorso that the text object follows the cursor without obscuring text at the insertion point. Finally, when the computer user selectsthe final insertion point, the selected text is visually zoomed from the source location to the final insertion point. MainClaim: A computer implemented method of providing visual feedback to a computer user during manipulation of selectedtext on a display device of a computer system, the computer system including a control device for interactively positioning avisible symbol and an insertion caret on the display device, the computer also having a signal generation device for signaling anactive state and an inactive state, the method comprising the computer implemented steps of:

a) in response to an active state of the signal generation device while the visible symbol is over the selected text at a sourcelocation on said display device:

7,554,530



345 G09G 20021223 13 92%


www.patentics.com


2004/0119763




5,694,151



345 G09G 19960401 0 100%

Abstract: A method and apparatus providing visual feedback to a computer user while dragging selected text is described. Asits first step, the processing logic creates a text object from the selected text once the computer user has initiated a drag.Simultaneously, the selected text is visually de-emphasized. Secondly, the processing logic snaps the text object to the cursorso that the text object follows the cursor without obscuring text at the insertion point. Finally, when the computer user selectsthe final insertion point, the selected text is visually zoomed from the source location to the final insertion point. MainClaim: A method for providing visual feedback to a computer user while manipulating selected text displayed on a displaydevice of a computer system, the computer system including a control device for interactively positioning a visible symbol, thecontrol device having a button having a first position and a second position, the method comprising the steps of:

a) in response to the button being in the second position while the visible symbol is over a selected text at a source location;

2004/0119763


Nokia Corporation Mizobuchi, Sachi | Mori, Eigo

345 G09G 20021223 12 92%


7,554,530


Nokia CorporationMizobuchi; Sachi | Mori; Eigo 345 G09G 20021223 13 92%


5,452,414 Method of rotating a three-dimensional icon to its original face


Rosendahl; Kristee | Mountford; S. Joy | Schmucker; Kurt J.

345 G06F 19940411 0 100%

Abstract: A manipulable icon is displayed with multiple faces having particular application to computer displays and systems.The icon, which represents information about an object available within the computer, can be manipulated by the user to displaydifferent faces or views which provide additional information about the object represented by the icon. The user has the abilityto manipulate the icon to see additional views of the icon on the computer display device, either by a mouse stroke selectioncommand, keyboard command or menu selection. This selection causes the icon to move from one view or face of the icon toanother view or face of the icon. These additional views thus provide additional space in which the icon can supply additionalinformation to the user. Iconic movement from one face or view to another is also typically accompanied by some sound whichindicates execution of the movement.

www.patentics.com


MainClaim: A method of manipulating a three-dimensional icon on a display of a computer system, wherein the three-dimensional icon includes a plurality of faces, each for containing at least one displaying item of information, wherein theplurality of faces are joined together to form the three-dimensional icon, wherein the method comprises the steps of:

(A) displaying a first face of the plurality of faces of the three-dimensional icon front most on the display, said first face containing a first button marker, wherein the first button marker is associated with a second face of the plurality of faces of thethree-dimensional icon;

(B) displaying the second face front most on the display by activating the first button marker with a signal generation device;

(C) displaying the three-dimensional icon by again displaying the first face front most on the display after the second face hasbeen displayed front most on the display.

7,554,530




2004/0119763




2010/0011310




5,550,563 Interaction framework system Taligent, Inc.

Matheny; John R. | White; Christopher 345 G09G 19921223 0 100%

Abstract: A method and apparatus for an innovative object oriented system. The sequence of events corresponding to a userpressing, moving, and releasing the mouse is called the input syntax. Certain sequences of events are used to indicate particularactions, called semantic operations. This invention discloses the method and apparatus for translating input syntax into semanticoperations for an object that supports Select, Peek, Move, AutoScroll, and Drag/Drop (Copy). MainClaim: In a computer system with a processor, a memory, an object-oriented operating system stored in the memory and a display, an apparatus for providing an object oriented application interface between a pointing device having a pointer graphicand a user-operable button, a keyboard having an option key and an object-oriented application program, the apparatus comprising:

(a) interactable class information stored in the memory as part of the object-oriented operating system, the interactable class information including graphic data representing a display icon and a plurality of methods for drawing and manipulating thedisplay icon on the display;

(b) an interactable object instantiated from the interactable class information and incorporated into the application program, the

www.patentics.com


object having a display icon visible on the display, and a plurality of methods for manipulating the display icon on the display;

(c) means responsive to a depression of the user-operable button for generating a device event signal;

(d) means responsive to a physical position of the pointer graphic on the display device for generating device position signals;

(e) means responsive to a depression of the option key for generating an option key signal; and

(f) an interactor object responsive to the device event signal, to the device position signals and to the option key signal forcalling a first predetermined one of the manipulating methods to move the display icon when the option key is depressed andthe user-operable button is depressed.

2007/0157117




7,024,626 System and method of producing user interface information messages

Apple Computer, Inc. Ko; Steve 715 G09G 20011130 0 100%

Abstract: A system and method for producing notification objects conveying computer warning or error notification informationto a computer user is provided. The notification objects point to a target to which the information contained therein relates andare persistent until dismissed by a user or an application. The notification objects are aware of the bounds of their target, andwhere possible do not obscure any part of their target. These objects are collapsible, allowing the user to minimize the objects,and are also non-modal, allowing a user to fully interact with any running application while the notification objects are visible. These notification objects are only visible when the window containing the target to which the information in the notificationobject relates is the active window. MainClaim: A method for notifying a computer user of a computer information message, comprising the steps of:

determining if a condition associated with a received action requires generation of an information message;

selecting an information message to be generated corresponding to said condition;

identifying a target object associated with the action performed by the user, to which the information contained within thenotification message relates;

displaying a notification object in a first state, which indicates the target object, contains said information messagecorresponding to said condition and maintains its position relative to the target object even if the target object is moved, in apersistent manner until dismissed by a user while enabling the user to continue interaction with an application programcorresponding to said target object; and

selectively displaying said notification object in a second, collapsed state having a reduced size relative to said first state.

2003/0169294




6,032,163

Method and apparatus for reformatting paragraphs on a computer screen

Apple Computer, Inc.Tou; Frederich N. | Auguste; Donna M. 715 G06F 19931008 0 100%

Abstract: A method for reformatting alphanumeric objects displayed on a screen of a pen computer system including the stepsof: (a) selecting a plurality of objects to be reformatted; (b) removing object breaks from between the objects; and (c)

www.patentics.com


reformatting the objects without the removed object breaks. The alphanumeric objects typically comprise a number of wordsseparated by object breaks such as carriage returns, tabs, and paragraph breaks. The process of the present invention removessuch object breaks and replaces them with spaces prior to reflowing the word objects between a left margin and a right margin.An apparatus for reformatting alphanumeric objects of the present invention includes a digital process (CPU), memory coupledto the CPU, a screen coupled to the CPU, and a plurality of alphanumeric objects stored in the memory and displayed on thescreens. The apparatus further includes a user input mechanism coupled to the CPU for selecting a plurality of alphanumericobjects, a mechanism for removing object breaks from between the selected objects, and a mechanism for reformatting theselected objects without the removed object breaks. MainClaim: A method for reformatting objects displayed on a screen of a computer system comprising the steps of:

selecting a plurality of objects on said screen to be reformatted, wherein sequentially adjacent objects of said plurality of objectsmay be separated by one or more object breaks, said selecting step resulting in the provision of a visually modified area on thescreen corresponding to said objects selected in said selecting step;

providing a border on said screen surrounding said objects selected in said selecting step, said border being buffered a distanceaway from said visually modified area on the screen;

at least momentarily engaging a pointing means at least approximately on said border on the screen to provide an indicationthat said plurality of objects are to be reformatted, and subsequently removing said object breaks from between said objects inresponse to said indication; and

reformatting said objects without said removed object breaks.

2008/0002888




5,434,965 Balloon help system Taligent, Inc.

Matheny; John R. | White; Christopher | Goldsmith; David B.

345 G06F 19921223 0 100%

Abstract: A method, system for providing help information to assist in using an object oriented operating system. The helptechnique is also oriented to the particular area on the screen that is indicated by a portion of the help information. When a userdrags an object on a display screen and drops the object in close proximity with another object, a help display is presented withan indicator pointing to the associated area on the display. The help display provides information on the viability of the dropaction and aids the user in navigating through the operation. In a preferred embodiment, the help display is presented in aballoon display pointing to the objects upon which the operation is transpiring. MainClaim: A display system, comprising:

(a) display means for displaying a plurality of icons;

(b) cursor positioning means for moving a first of said plurality of icons;

(c) means for detecting when said first of the plurality of icons is positioned proximal to a second icon of said plurality of icons;

(d) means for notifying said second of the plurality of icons when said first icon is proximal to said second icon;

(e) means for starting a timer when said first icon is proximal to said second icon;

(f) means for generating a help message indicative of valid actions that can be performed on said first icon and said second iconthrough communication between said first and second icons; and

(g) means for displaying said help message when said timer has expired.

2007/0157117



Abstract: In accordance with but one exemplary embodiment of this invention a computer program is embodied on a tangiblecomputer-readable medium. The execution of the computer program by a data processor of a device results in operations thatinclude operating a command placement manager to map an instance of a user interface (UI) command specification to at least

www.patentics.com


one control of a UI in accordance with information defining a device configuration, where the command specification iscomprised of a prioritized list of commands. MainClaim: A computer program embodied on a tangible computer-readable medium the execution of which by a data processor of a device results in operations comprising operating a command placement manager to map an instance of a userinterface (UI) command specification to at least one control of a UI in accordance with information defining a deviceconfiguration, where the command specification is comprised of a prioritized list of commands.

7,117,450 Method and apparatus for determining font attributes

Apple Computer, Inc. Chaudhri; Imran 715 G06F 20020318 0 100%

Abstract: A method to determine a font attribute includes: determining a first number and a second number; receiving inputresulting from repositioning of a thumb of a slider to a position; and determining a value for the font attribute from the positionrelative to the first and second numbers. A font attribute is one of: a) font size; b) boldness; c) italic angle; d) baseline offset;e) line spacing; and f) character spacing. In one example, when the thumb is pushed against one end of the slider, at least oneof the first number or the second number is adjusted. Another example shows at least one of the first number or the secondnumber is updated when an input such as selecting a value from a list or typing in a value or pushing a thumb against one endof a slider is received. MainClaim: A method to determine a font attribute, the method comprising: receiving input switching from a first mode to asecond mode; replacing, in response to the receiving of the input, a representation of a command which when activated causesthe display of a list which allows selection of a value, which specifies a font attribute, from the list, with a slider displaying athumb at a position along the slider; determining a first number and a second number in response to a user input; receivinginput resulting from a sliding of the thumb of the slider to a position along the slider; and determining, after the sliding, a valuefor the font attribute from the position relative to the slider and the first and second numbers, wherein the position of the thumbselects a font attribute from the list.


Nokia Corporation


345 G09G 20060607 5 92%


6,915,490

Method for dragging and dropping between multiple layered windows

Apple Computer Inc. Ewing; David 715 G06F 20000929 0 100%

Abstract: Methods for manipulating a plurality of layered windows on a display are described. Specifically, the manipulation oflayered windows includes moving a pointer to a visible portion of a partially hidden window and holding the pointer at the visibleportion for a predetermined period of time. Responsive to the holding for a predetermined period of time, the partially hiddenwindow is revealed. The manipulation of the layered windows can be used to drag and drop an icon from an active window to aninactive window. During the drag of an object, holding down a predetermined key on the keyboard can send the top-most-layered window to the back thereby disclosing other windows. If no drop occurs at the end of a drag operation, windows arereturned to their original layers. However, if a drop occurs, the window in which the object is dropped becomes the topmostlayer while other windows return to their original layers. MainClaim: A method for manipulating a plurality of windows on a display, comprising the steps of:

displaying a plurality of cascaded, open windows on a display to establish an original display layered order, wherein an activewindow is the window on a first display layer, windows on a display layer other than the first display layer are inactive windowsand at least one of said inactive window is partially hidden;

receiving an indication of an icon being selected;

receiving an indication of the icon being dragged;

monitoring the current location of the icon;

starting a timer, if the icon is found being within a visible portion of first one of said inactive windows; and

displaying said first inactive window on the first display layer, if the icon is found to be held within a visible portion of said firstinactive window until said timer is expired.

2003/0169294



345 G09G 20030307 30 93%

Abstract: In accordance with this invention, there is disclosed a method for providing a representation of a first application tobe executed in an electronic device that uses the representation to present information of at least one other application thatselects one of the applications for direct display and selects at least another of the applications for indirect display in accordancewith information representative of a state of at least one of the applications. Further, a user interface and an electronic deviceare disclosed having a display and being adapted to operate a plurality of applications having a component for providing arepresentation of one of the applications, a component for using the representation to present information of at least one otherof the applications, and a component for selecting one of the applications for direct display and selecting at least another of theapplications for indirect display in accordance with information representative of a state of at least one of the applications.

www.patentics.com


MainClaim: A method for providing a representation of a first application to be executed in an electronic device, comprising:using said representation to present information of at least one other application; selecting one of said applications for directdisplay and selecting at least another of said applications for indirect display in accordance with information representative of astate of at least one of said applications.




7,584,429




5,479,602 Content-based depictions of computer icons

Apple Computer, Inc.Baecker; Ronald M. | Small; Ian S. 345 G06T 19930611 0 100%

Abstract: A means and method for generating and displaying a contentbased depiction of a standard icon on the display of acomputer is described. The depiction is generated upon the occurrence of predetermined events, such as the closure of thedocument or file associated with the icon, and is displayed in either a static or animated form in place of the standard icon inresponse to selection signals from a selection device. A single content-based depiction of an icon is generated by creating a representation of the object (file or document) to be depicted, and translating this representation into a scaled-down replica of the representation. This representation may be in the form of a bit-map, a full-scale image, etc. The replica is created by partitioning the representation into a number of equal segments, measuring the percentages of different colors (black and white,gray scale, or color) within each segment, and assigning a single color value to each display element or pixel of the replicabased upon the color percentage measured from each corresponding segment of the representation. Animated depictions arecreated by forming a number of different replicas for each representation to be depicted and then displaying those replicas in aserial sequence to create an animated depiction of the representation. Like the icons these depictions replace when selected, thedepictions would be movable to any position on the display through use of the mouse. MainClaim: A process for generating a reduced visual version of an object based on the content of the object and displaying thereduced visual version on a display screen of a computer, the reduced visual version being associated with the object, thecomputer having memory for storing and displaying the object, the reduced visual version having functionality of an icon, theobject having a variable visual format based upon information contained by the object, comprising the steps of:

generating the reduced visual version of the object based on the content of the object by transforming at least a portion of thevariable visual format of the object; and,

displaying the reduced visual version of the object on the display screen.

7,594,194 Portrayal of navigation objects


Abstract: The invention relates to a method, a device, a computer program product, a browser and a network element forimproved portrayal of navigation objects (1-1 . . . 1-6), wherein at least two navigation objects (1-1 . . . 1-6) are combined into one combined navigation object (4), wherein said combined navigation object (4) is presented, and wherein said at least twonavigation objects (1-1 . . . 1-6) are presented, if said combined navigation object (4) is selected. MainClaim: A method, comprising: scaling a web page that comprises an image map and further content to obtain a scaled webpage, wherein said image map contains at least two image hyperlinks, making the scaled version of said image map in saidscaled web page selectable as a whole; presenting said scaled web page on a display, and presenting only said image map withsaid at least two hyperlinks in unscaled format in response to a selection of said selectable scaled version of said image map.

2005/0066286 Portrayal of navigation objects

Nokia Corporation Makela, Mikko 715 G06F 20030924 1 94%

Abstract: The invention relates to a method, a device, a computer program product, a browser and a network element forimproved portrayal of navigation objects (1-1 . . . 1-6), wherein at least two navigation objects (1-1 . . . 1-6) are combined into one combined navigation object (4), wherein said combined navigation object (4) is presented, and wherein said at least twonavigation objects (1-1 . . . 1-6) are presented, if said combined navigation object (4) is selected. MainClaim: A method for improved portrayal of navigation objects (1-1 . . . 1-6), comprising: combining at least two navigation objects (1-1 . . . 1-6) into one combined navigation object (4), presenting said combined navigation object (4), and presentingsaid at least two navigation objects (1-1 . . . 1-6), if said combined navigation object (4) is selected.

Presentation of large

www.patentics.com


2005/0229111 pages on small displays Nokia Corporation Makela, Mikko 715 G06F 20040407 4 94%


5,838,889

Method and apparatus for flipping a double-sided graphic image having different sized first and second sides

Apple Computer, Inc. Booker; Susan L. 345 G06T 19950518 0 100%

Abstract: Electronic paper which has two sides, reverse of one another, which can be flipped over in response to usergenerated flip commands is described. When a piece of electronic paper is flipped over, a number of transition views of thepaper are generated to give the user the impression that the paper is actually being turned over to reveal a reverse side.Different information can be stored on either side, and the composition of either side can be linked so that changes made to thegraphic information on one side affects the graphic information on the other side. In addition, when the amount of graphicinformation on the reverse side of the paper exceeds the amount of available space normally available on the reverse side whenthe paper is flipped over, approximately the same amount of space available on the top side, the reverse side is expanded to fitthe quantity of information to be displayed on the reverse side. If the reverse side has been expanded, and the user instructsthe page to flip back to the top side, the reverse side shrinks back to its original size and then flips back to the top side. MainClaim: A computer system for displaying and manipulating a double-sided graphic image comprising:

a processor;

a display device coupled to the processor for displaying the graphic image, wherein the graphic image includes a first side andan opposing second side, wherein the first side is not a same size as the second side; and

a first input device coupled to provide a flip command to the processor, wherein if the first side is displayed the graphic image isflipped such that the first side is hidden and the second side is displayed in response to the flip command, wherein if the secondside is displayed the graphic image is flipped such that the second side is hidden and the first side is displayed in response to theflip command.






345 G09G 20040421 7 92%

Abstract: A method for operating a computer through a touch sensitive display interface includes displaying a computergenerated graphical image on a touch sensitive display using display software. The display software includes programs used todisplay the graphical image (e.g., display driver and web browser), and is responsive to inputs at a first, active portion (e.g.,coinciding with toolbars, hyperlinks) of the touch sensitive display when the graphic image is displayed, and is non-responsive to a second, inactive portion. In the method, an input character is received at the second, inactive portion of the touch sensitivedisplay, and is compared to a stored command character that is associated with a separate corresponding computer command.The separate corresponding computer command is executed if the input character matches the command character. In oneembodiment, one particular input character results in emulating a right mouse button by displaying a submenu of shortcut icons,and the method is implemented by operation of a computer program in a mobile station. MainClaim: A computer readable medium having computer instructions for performing actions comprising: displaying acomputer generated graphical image and at least one active area comprising an attribute on a touch sensitive display using adisplaying software program, the attribute comprising at least one of a scrolling operator, a toolbar icon and a hyperlink, saiddisplaying software program being responsive to inputs at only a first active portion of the touch sensitive display when saidgraphical image is displayed, and non-responsive to a second inactive portion of the display; receiving an input character at thesecond inactive portion of said touch sensitive display; comparing said input character to a stored command character that isassociated with a separate corresponding computer command; and executing the separate corresponding computer command ifsaid input character matches said command character, wherein said separate corresponding computer command is to display asubmenu at the touch sensitive display, said submenu comprising a plurality of shortcut links each to a different executablecommand.

2003/0001899 Semi-transparent handwriting recognition UI

Nokia CorporationPartanen, Minna | Simila, Vesa 345 G09G 20010629 1 92%

Abstract: A user interface of a handwriting recognition system intended for use in small electronic devices, such as PDAs,mobile Telephones and laptop computers. The user interface is a semi-transparent window that opens in response to a user-initiated manuscript input to any point on a touch-activated screen of a display of the electronic device. The semi-transparent window may be resized or moved, as desired by the user, and may be automatically sizable in response to the placement of the

www.patentics.com


user's manuscript input on the touch-activated screen. MainClaim: A user interface for a handwriting recognition system used with a visual display having a screen, said interfacecomprising: means for opening a semi-transparent window in said display, said semi-transparent window permitting a user to view features of a portion of said display over which said semitransparent window is opened, said semi-transparent window having boundaries which define a contrasting area on said display.

5,664,208

Methods and apparatuses for seamless compound document processing


Pavley; John Franklin | Turner, II; John Benton | Hanson; Gary Stephen

715 G06F 19950516 0 100%

Abstract: A compound document in a computer, which includes a first object editor embedded in the compound document forrendering first data in a first data content area of the compound document. The compound document further includes a secondobject editor embedded in the compound document for rendering second data in a second data content area of the compounddocument, the first data content area and the second data content area being mutually exclusive. Further, there are embeddeda plurality of editing controllers in the compound document for selectively editing attributes of a selection of one of the first andsecond data. The compound document further includes a data switching system for communicating attribute data between theediting controllers and the first and second object editors, the attribute data representing the attributes of the selection, whereinthe data switching system determines which one of the plurality of editing controllers receives the attribute data based oninterest registered by each of the plurality of editing controllers with the data switching system. MainClaim: A compound document in a computer, comprising:

a first object editor embedded in said compound document for rendering first data in a first data content area of said compounddocument;

a second object editor embedded in said compound document for rendering second data in a second data content area of saidcompound document, said first data content area and said second data content area being mutually exclusive;

a plurality of editing controllers embedded in said compound document for selectively editing attributes of a selection of one ofsaid first and second data, said editing controllers being displayed in a UI container that does not substantially change inappearance when said first or said second object editor is a focus of user operation; and

a data switching system for communicating attribute data between said editing controllers and said first and second objecteditors, said attribute data representing said attributes of said selection, wherein said data switching system determines whichone of said plurality of editing controllers receives said attribute data based on interest registered by each of said plurality ofediting controllers with said data switching system.

2007/0288854 Reusable XForms processor Nokia Corporation Koskimies; Oskari 715 G06F 20060613 18 92%

Abstract: Systems and methods are provided for invoking user interface (UI) functionality by a client application. Data isreceived from a server, such as a web server, parsed and used to create a hierarchy of application UI objects. A correspondinghierarchy of XForms objects is created, such that each XForms object maps to an application UI object. The user interface isrendered at the client display by displaying objects in the application UI objects hierarchy and invoking the correspondingfunctionality from the XForms object hierarchy. MainClaim: A method for invoking user interface functionality on a computing device comprising:receiving a data filecomprising markup language data;creating based on the data file a first object hierarchy comprising a plurality of objects, eachcorresponding to a user interface component;identifying in the first object hierarchy a first object corresponding to a userinterface component;creating a second object hierarchy comprising a second object having user interface functionality, saidsecond object associated with said first object;displaying on the computing device a user interface comprising a graphicalrepresentation of the first object; andinvoking the user interface functionality of the second object in relation to the graphicalrepresentation of the first object on the displayed user interface.




5,838,315

Support for custom user-interaction elements in a graphical, event-driven computer system

Apple Computer, Inc.Craycroft; Timothy J. | Ulrich; Robert R.

345 G06F 19971124 0 100%

Abstract: Explicit support for custom gadgets is provided, at a system software level, in a manner that is essentiallyapplication-transparent. Specific support is provided for the addition of one custom gadget per window. The custom gadget isidentified by a specific numeric code in the same manner as the close and zoom boxes. An application simply tells the systemsoftware what the custom gadget for a particular window should look like. The code responsible for drawing that window's framethen knows where to find the image of the custom gadget and will render it appropriately. When a user clicks in the customgadget, the system software notifies the application of the event by means of the numeric code associated with the customgadget. More particularly, in accordance with one embodiment of the invention, a custom interactive user-interface element is provided in a title bar of a window of an application program in a graphical, event-driven computer system having a computer display. The custom interactive user-interface element is provided by storing information, referring to an icon stored as part ofsaid application program and used to visually represent the custom interactive user-interface element, in a location accessible to

www.patentics.com


a Window Manager. The Window Manager then draws on the computer display a frame of the window including the icon used tovisually represent the custom interactive user-interface element. MainClaim: For use in a graphical, event-driven computer system having a computer display and a graphical user interface, amethod of providing a customer interactive user-interface element in a frame of a window of an application program, in addition to system-defined elements provided in each window displayed by said computer system, said method comprising the steps of:

storing information referring to an icon, stored as part of said application program and used to visually represent the custominteractive user-interface element, in a location accessible to a window manager; and

the window manager drawing on the computer display a frame of the window including drawing, at a size and locationdetermined by the window manager, the icon used to visually represent the custom interactive user-interface element;

wherein clicking on the custom interface user-interface element causes the application to perform a function that is in addition to functions defined as part of the graphical user interface.

2003/0169294



345 G09G 20030307 30 94%


2006/0253788



715 G06F 20050509 8 93%


2007/0157117




6,005,566 Aspect and style elements of an improved graphical user interface


Jones; Jeremy A. | Mayle; Neil L. | Parsons; Paige K. | Shalit; Andrew L. M. | St. Clair, Jr.; William W. | Steele; Oliver W. | Strassmann; Steven H. | White; Derek R.

345 G06F 19970922 0 100%

Abstract: A graphical user interface comprises aspect and style elements for controlling the type of information associated withobjects displayed on a display screen of a computer system when browsing through the objects. The aspect element controls the

www.patentics.com


particular type of information displayed for an object on a portion of a window, called a pane, while the style element controlsthe types of information displayed for all objects within that pane. MainClaim: An improved graphical user interface for enhancing the ability of a user to browse objects accessible from acomputer system, said computer system including a memory for storing the objects, a display monitor for displaying a cursor ona display screen, and a device for manipulating said cursor by a user, said interface comprising:

a window of said screen, said window configured for apportionment into at least one pane for displaying said objects stored insaid memory; and

means for controlling information associated with said objects displayed on said pane in response to the user manipulating saidcursor when browsing said displayed objects, said controlling means comprising:

a first interface element displayed on the display screen for linking information types and/or object types so as to specify thetype of information displayed for each of said objects displayed on said pane, and

a second interface element displayed on the display screen for selecting linked information types and/or objects types so as tovary the types of information initially displayed for all of said objects on said pane.

2007/0157117




2006/0253788



715 G06F 20050509 8 93%


2003/0169294




7,428,709 Multiple-panel scrolling Apple Inc.

Forstall; Scott James | Christie; Gregory N. | Tiene; Kevin John | Melton; Donald Dale | Lemay; Stephen | Loofbourrow; Wayne Russell |

715 G06F 20050413 0 100%

www.patentics.com


Kahn; Jessica | Hyatt; David

Abstract: In a scrollable user interface window including two or more panels, a single scroll bar scrolls all of the panels. Panelsmove in lock-step with one another at certain times, but not at other times, depending on whether the lock-step scrolling would cause blank areas to be displayed. If the user's scroll commands would result in a blank area of a panel being displayed, thescroll command is not performed; rather, the panel remains frozen in its current position, even while other panel(s) do scroll.Thus, the present invention ensures that useful content is displayed at all times in all panels, and no screen real estate is wasteddue to scrolling operations. MainClaim: A method for scrolling a plurality of panels in a window, comprising: displaying at least a portion of underlyingcontent in each panel; receiving a scroll command having a scroll direction; scrolling a first panel having a greatest linearmeasure of underlying content among the panels in the window; and for a second panel: responsive to the linear measure ofany additional undisplayed underlying content for the second panel in the scroll direction being greater than or equal to thelinear measure of any additional undisplayed underlying content for the first panel in the scroll direction, scrolling the secondpanel in concert with the scrolling of the first panel; and responsive to the linear measure of any additional undisplayedunderlying content for the second panel in the scroll direction being less than the linear measure of any additional undisplayedunderlying content for the first panel in the scroll direction, maintaining the scroll position of the second panel.



345 G09G 20070803 10 94%





5,603,053

System for entering data into an active application currently running in the foreground by selecting an input icon in a palette representing input utility

Apple Computer, Inc.Gough; Michael L. | Holloway; Bruce V.

710 G06F 19960305 0 100%

Abstract: The present invention provides method and apparatus for inputting data to an active application of a computersystem. A method of the present invention comprises the steps of creating an input image on a screen of a computer system,detecting the engagement of the input image by a pointer, analyzing the engagement to determine input data, and sending theinput data to the active application program. Another method of the present invention comprises the steps of initializing acomputer implemented process for intercepting input request calls made by the active application program, creating an inputimage on the computer system's screen, detecting an engagement of a pointer with the input image, analyzing the engagementto determine potential input data, and sending the input data to the application program. The present invention preferablyincludes an organizational image including a palette and a number of icons representing input utilities. The icons can be draggedoff of the palette to activate a selected utility. MainClaim: A method for launching an input utility for use in entering data into an active application, said active applicationbeing a foreground application currently in use by a user, said method comprising:

displaying an organizing image on a screen of a computer system wherein said organizing image includes a palette having aplurality of icons representing an input utility displayed on said palette;

engaging one of said icons with a pointer means and moving said pointer means to a desired location on said screen;

activating said input utility and displaying an input image created for said input utility at about said desired location, said inputimage dedicating a portion of said screen for data input into said input utility; and

linking said input image to said active application such that data input into said input utility is communicated to said activeapplication.

7,623,119 Graphical functions by gestures

Nokia CorporationAutio; Markku Tapio | Jarvio; Jami Jarkko Juhani

345 G09G 20040421 7 94%

Abstract: A method for operating a computer through a touch sensitive display interface includes displaying a computergenerated graphical image on a touch sensitive display using display software. The display software includes programs used todisplay the graphical image (e.g., display driver and web browser), and is responsive to inputs at a first, active portion (e.g.,coinciding with toolbars, hyperlinks) of the touch sensitive display when the graphic image is displayed, and is non-responsive to a second, inactive portion. In the method, an input character is received at the second, inactive portion of the touch sensitivedisplay, and is compared to a stored command character that is associated with a separate corresponding computer command.The separate corresponding computer command is executed if the input character matches the command character. In one

www.patentics.com


embodiment, one particular input character results in emulating a right mouse button by displaying a submenu of shortcut icons,and the method is implemented by operation of a computer program in a mobile station. MainClaim: A computer readable medium having computer instructions for performing actions comprising: displaying acomputer generated graphical image and at least one active area comprising an attribute on a touch sensitive display using adisplaying software program, the attribute comprising at least one of a scrolling operator, a toolbar icon and a hyperlink, saiddisplaying software program being responsive to inputs at only a first active portion of the touch sensitive display when saidgraphical image is displayed, and non-responsive to a second inactive portion of the display; receiving an input character at thesecond inactive portion of said touch sensitive display; comparing said input character to a stored command character that isassociated with a separate corresponding computer command; and executing the separate corresponding computer command ifsaid input character matches said command character, wherein said separate corresponding computer command is to display asubmenu at the touch sensitive display, said submenu comprising a plurality of shortcut links each to a different executablecommand.

2008/0002888




2005/0237308 Graphical functions by gestures Nokia Corporation

Autio, Markku Tapio | Jarvio, Jami Jarkko Juhani

345 G09G 20040421 4 93%

Abstract: A method for operating a computer through a touch sensitive display interface includes displaying a computergenerated graphical image on a touch sensitive display using display software. The display software includes programs used todisplay the graphical image (e.g., display driver and web browser), and is responsive to inputs at a first, active portion (e.g.,coinciding with toolbars, hyperlinks) of the touch sensitive display when the graphic image is displayed, and is non-responsive to a second, inactive portion. In the method, an input character is received at the second, inactive portion of the touch sensitive display, and is compared to a stored command character that is associated with a separate corresponding computer command.The separate corresponding computer command is executed if the input character matches the command character. In oneembodiment, one particular input character results in emulating a right mouse button by displaying a submenu of shortcut icons,and the method is implemented by operation of a computer program in a mobile station. MainClaim: In an electronic device for displaying a graphical image at a touch sensitive user interface using a displayingsoftware program, and for storing a separate computer command apart from the displaying software program, the improvementcomprising a computer program embodied in a computer readable medium comprising instructions to cause a computer to:receive an input at a portion of the touch sensitive user interface that is not recognized as active by the display program;compare said received input to a stored command character that is associated with the separate computer command; andexecute the separate computer command only if the received input matches the stored command character.

6,690,356



345 G09G 20020429 0 100%

Abstract: A method and apparatus providing visual feedback to a computer user while dragging selected text is described. Asits first step, the processing logic creates a text object from the selected text once the computer user has initiated a drag.Simultaneously, the selected text is visually de-emphasized. Secondly, the processing logic snaps the text object to the cursorso that the text object follows the cursor without obscuring text at the insertion point. Finally, when the computer user selectsthe final insertion point, the selected text is visually zoomed from the source location to the final insertion point. MainClaim: A computer implemented method of providing visual feedback to a computer user during manipulation of selectedtext on a display device of a computer system, the computer system including a control device for interactively positioning avisible symbol on the display device, the computer also having a signal generation device for signaling an active state and aninactive state, the method comprising:

a) creating and displaying a text object of the selected text in response to an active state of the signal generation device whilethe visible symbol is over the selected text at a source location on the display device;

b) moving the text object on the display device along a line between the source location and the visible symbol until the textobject reaches the visible symbol;

c) in response to an inactive state of the signal generation device while the visible symbol is over a destination location:

7,554,530



Abstract: A method is disclosed to operate a touch screen user interface. The method includes forming a stroke that enclosesan area that contains at least a portion of at least one displayed object; and selecting the at least one displayed object. Formingthe stroke may further include extending the stroke to a functional object, and activating the functional object with the at least

www.patentics.com


one selected displayed object. If the stroke does not define an area that is totally enclosed by the stroke, the method mayfurther include automatically continuing the stroke such that the area is totally enclosed by the stroke. In this case the strokemay be automatically continued by drawing a line that connects a stroke starting point to a stroke ending point, and by addingtouch screen coordinates covered by the line to a list of touch screen coordinates that describe the stroke. If the stroke enclosesan area that contains at least a portion of a plurality of displayed objects, each of the displayed objects is simultaneouslyselected. MainClaim: A method to operate a touch screen user interface, comprising: forming a stroke that encloses an area thatcontains at least a portion of at least one displayed object that represents data; and selecting the at least one displayed object,where forming the stroke further comprises extending the stroke to a functional object, and activating the functional object withthe at least one selected displayed object.

5,740,455

Enhanced compound document processing architectures and methods therefor


Pavley; John Franklin | Turner, II; John Benton | Hanson; Gary Stephen

715 G06F 19950516 0 100%

Abstract: A computer program product, which includes a computer usable medium having computer readable code embodiedtherein for processing data in a compound document. The compound document includes a plurality of embedded object editorsfor respectively rendering data having different interest types in different compound document content areas. The compounddocument further includes a plurality of editing controllers embedded in the compound document. The inventive computerprogram product includes computer readable program code configured to cause a computer to detect whether a selection ismade in one of the data. Furthermore, there is included computer readable program code configured to cause the computer toeffect the filling out of an auditor data structure with attributes of the selection by the object editor that is associated with thedata in which the selection is made. The inventive computer program product also includes computer readable program codeconfigured to cause the computer to communicate the attributes embodied in data fields of the auditor data structure from theabove-mentioned object editor to selective interested ones of the editing controllers. In one embodiment, both the above-mentioned object editor and the interested editing controllers register with a data switching system to receive attribute datahaving an interest represented by the attributes of the aforementioned selection. MainClaim: A computer-implemented method for creating a compound document in a computer, comprising:

embedding a first object editor in said compound document for rendering first data in a first data content area of said compounddocument, said first object editor representing a container of said compound document;

embedding a second object editor in said compound document for rendering second data in a second data content area of saidcompound document, said first data content area and said second data content area being mutually exclusive;

embedding a plurality of editing controllers in said compound document for selectively editing attributes of a selection of one ofsaid first and second data;

providing a first auditor data structure including:

first data fields for representing said attributes, said first data fields implementing a first protocol decipherable by at least one ofsaid first object editor and said second object editor, and being further decipherable by said editing controllers; and

providing a data switching system for passing said first auditor data structure between said editing controllers and said first andsecond object editors, wherein said data switching system determines which one of said plurality of editing controllers receivessaid first auditor data structure based on interest registered by each of said plurality of editing controllers with said dataswitching system.

2007/0288854 Reusable XForms processor Nokia Corporation Koskimies; Oskari 715 G06F 20060613 18 92%

Abstract: Systems and methods are provided for invoking user interface (UI) functionality by a client application. Data isreceived from a server, such as a web server, parsed and used to create a hierarchy of application UI objects. A correspondinghierarchy of XForms objects is created, such that each XForms object maps to an application UI object. The user interface isrendered at the client display by displaying objects in the application UI objects hierarchy and invoking the correspondingfunctionality from the XForms object hierarchy. MainClaim: A method for invoking user interface functionality on a computing device comprising:receiving a data filecomprising markup language data;creating based on the data file a first object hierarchy comprising a plurality of objects, eachcorresponding to a user interface component;identifying in the first object hierarchy a first object corresponding to a userinterface component;creating a second object hierarchy comprising a second object having user interface functionality, saidsecond object associated with said first object;displaying on the computing device a user interface comprising a graphicalrepresentation of the first object; andinvoking the user interface functionality of the second object in relation to the graphicalrepresentation of the first object on the displayed user interface.

5,734,901

Electronic mail information associated with native application data


Sidhu; Gursharan S. | Fisher; Stephen | Holleran; Patrick A. | Cleron; Michael Andrew

712 G06F 19950926 0 100%

Abstract: A computer implemented method and apparatus for providing the functions of electronic mail in a computer systemwhich is integrated within a display or a window under control of a first application program which does not support electronicmail functionality. A set if mail routines displays a mailer on a first portion of the application program's display with applicationprogram data displayed in a second portion of the application program's display. The mail routines allow the user to modify thedata in the application program via functionality of the application program and modify the mailer via the functionality of themail routines. The mail routines further allow the user to perform electronic mail functions provided by the mail routines,wherein the electronic mail functions include using the application program data as content of mail messages processed by themail routines. The functionality of the mail routines can be provided via an event preprocessor inserted into an event processingloop in the application program, wherein the event preprocessor determines whether events are pertinent to the mail routines. If

www.patentics.com


so, the preprocessor processes the events to provide the electronic mail functionality and allows events which are pertinent tothe application program to be processed by the application program. MainClaim: A computer-implemented method of integrating electronic mail functionality into an application program which does not support said electronic mail functionality, said application program displayed on a computer display, comprising the followingsteps:

a. executing a set of mail routines wherein said set of mail routines associates a mailer object to said application program andassociates a mailer datum object to data native to said application program to thereby integrate said electronic mail functionalityinto said application program;

b. displaying said mailer on a first portion of said application program and displaying said mailer datum on a second portion ofsaid application program;

c. enabling said user, through said mail routines, to modify said data native to said application program via functionality of saidapplication program and modify said mailer via said functionality of said mail routines; and

d. enabling said user, through said mail routines, to perform electronic mail functions provided by said mail routines by enablingand detecting user modification of said mailer and performing said electronic mail functions responsive thereto; and

wherein said step of enabling said user to perform electronic mail functions provided by said mail routines includes saving saidapplication program data displayed in said second portion of said application program's display as content of mail messagesprocessed by said mail routines.

2005/0210401 Method and system for centralized copy/paste functionality

Nokia CorporationKetola, Pekka | Mantere, Jussi | Karttunen, Juha

715 G06F 20040318 3 94%

Abstract: This invention relates to a method for transferring data from a source application to a target application. From theapplication an operation is traced, from which operation at least one item is extracted. The item is saved in a trace log file, fromwhich it can be selected and transferred into said target application. The operation can be e.g. incoming or outgoing call, wherethe item is a phone number or a contact card. The invention relates also to a device, to a system and to computer programproduct. MainClaim: A method for transferring data from a source application to a target application, the method comprising steps fortracing an operation relating to the source application, extracting at least one item from said operation, recording said item intoa file, wherein said file is called by the target application for selecting and pasting the item to said target application.

5,983,245

Method and apparatus for implementing universal resource locator menus

Apple Computer, Inc. Newman; Steve | Schillace; Sam

715 G06F 19961227 0 100%

Abstract: Disclosed is a method for generating universal resource locator links in a graphical user interface based HTML file.The method includes the operations of selecting one of a picture object and text contained within the graphical user interfacebased HTML file. Once one of the picture object and text are selected, a short-cut universal resource locator icon is selected. Upon selecting the short-cut universal resource locator icon, a nested menu is displayed. Preferably, the nested menu contains alist of most recently used universal resource locators, and a list of open HTML files. Next, one of the universal resource locatorsis selected from the list of most recently used universal resource locators and the open HTML file from the list of open HTMLfiles. Once selected, a link is generated from the selected one of the picture object and text contained within the graphical userinterface based HTML file to one of the selected universal resource locators from the list of most recently used universal resourcelocators and the open HTML file. MainClaim: A method for generating universal resource locator links in a graphical user interface based HTML file, comprisingthe operations of:

selecting one of a picture object and text contained within the graphical user interface based HTML file;

selecting a short-cut universal resource locator icon;

displaying a nested menu in response to the selecting of the short-cut universal resource locator icon, the nested menu including a list of most recently used universal resource locators and a list of open HTML files, the list of most recently used universalresource locators including at least one universal resource locator, and the list of open HTML files including at least one HTMLfile, and the nested menu further including a sub-menu containing at least one anchor reference that is associated with at leastone open HTML file from the list of open HTML files;

selecting from the nested menu one of the universal resource locators from the list of most recently used universal resourcelocators and the open HTML file from the list of open HTML files; and

generating a link from the selected one of the picture object and text contained within the graphical user interface based HTMLfile to one of the selected universal resource locators from the list of most recently used universal resource locators and theopen HTML file from the list of open HTML files.

2005/0166161 User input system and method for selecting a file

Nokia Corporation Makela, Mikko K. 715 G06F 20040128 2 93%

Abstract: A present invention relates to methods, devices, systems, and a computer program products for selecting files from afile list. The methods, devices, systems and computer program products are configured to provide more efficient ways forselecting a file from a file list in various usage scenarios. MainClaim: A method for selecting a file from a file list, the method comprising the steps of: determining if there was a filepreviously selected from the file list; determining if there is a next file listed relative to the previously selected file in the file list;and displaying the file list with the next file highlighted.

www.patentics.com


Date post:	03-Feb-2022
Category:	Documents
Upload:	others
View:	2 times
Download:	0 times

Apple vs. Nokia Patent Infringed/Infringing Map

Documents