초록 ▼

The present invention is an intelligent assistant for use with a local computer and with the Internet. The invention's intelligent assistant process includes various menus and training options for training the intelligent assistant to respond to various text, voice, and mouse gesture commands. In it

The present invention is an intelligent assistant for use with a local computer and with the Internet. The invention's intelligent assistant process includes various menus and training options for training the intelligent assistant to respond to various text, voice, and mouse gesture commands. In its preferred embodiment, the invention's intelligent assistant is represented by an animated character. The character can communicate back to the user through text, voice, and its own animated gestures. The invention's intelligent assistant automatically and constantly communicates with Internet sites of interest to a user and collects information of interest from those Internet sites. The collected information and updates to the collected information, including information that may not be displayed by a browser, are then communicated to the user in a variety of ways, including changing the behavior and the knowledge base of the intelligent assistant. For example, the invention may communicate the collected information of interest or updates to such information by text, voice, or by simply changing the shape of the animated character. The variety of different ways of communicating the information and updates to the information of interest keeps the user alert and interested in the information. In one embodiment of the invention, only those Internet sites that are authorized can be accessed by the intelligent assistant to gather information or updated information of interest to the user.

대표청구항 ▼

The present invention is an intelligent assistant for use with a local computer and with the Internet. The invention's intelligent assistant process includes various menus and training options for training the intelligent assistant to respond to various text, voice, and mouse gesture commands. In it

The present invention is an intelligent assistant for use with a local computer and with the Internet. The invention's intelligent assistant process includes various menus and training options for training the intelligent assistant to respond to various text, voice, and mouse gesture commands. In its preferred embodiment, the invention's intelligent assistant is represented by an animated character. The character can communicate back to the user through text, voice, and its own animated gestures. The invention's intelligent assistant automatically and constantly communicates with Internet sites of interest to a user and collects information of interest from those Internet sites. The collected information and updates to the collected information, including information that may not be displayed by a browser, are then communicated to the user in a variety of ways, including changing the behavior and the knowledge base of the intelligent assistant. For example, the invention may communicate the collected information of interest or updates to such information by text, voice, or by simply changing the shape of the animated character. The variety of different ways of communicating the information and updates to the information of interest keeps the user alert and interested in the information. In one embodiment of the invention, only those Internet sites that are authorized can be accessed by the intelligent assistant to gather information or updated information of interest to the user. the LFSR state corresponding to the closest offset to the target PN position in a lookup-table containing LFSR states corresponding to various offsets. 3. A method of performing fast slewing PN generation in a device characterized by plural LFSRs comprising: receiving a target PN position; calculating an index counter value based on the target PN position; calculating a plurality of LFSR states corresponding to the index counter state; loading the index counter value into an index counter; loading the plurality of LFSR states in a plurality of LFSRs; and producing one or more PN sequences based on the states of the plurality of LFSRs. 4. A method of performing fast slewing PN generation in a device characterized by plural LFSRs comprising: receiving a target PN position: receiving a PN code offset; calculating an index counter value based on the target PN position; calculating a plurality of LFSR states corresponding to the index counter state and the PN code offset; loading the index counter value into an index counter; loading the plurality of LFSR states in a plurality of LFSRs; and producing one or more PN sequences based on the states of the plurality of LFSRs, wherein the calculation of each of the plurality of LFSR states comprises: calculating a target advance value by adding the PN code offset to the target PN position; andadvancing a base state corresponding to each of the plurality of LFSR states by the target advance value to produce the plurality of the LFSR states.5. A method of performing fast slewing PN generation in a device characterized by plural LFSRs comprising: receiving a target PN position; receiving a PN code offset; calculating an index counter value closest to the target PN position from a subset of the possible target PN positions; calculating a target advance value by adding the PN code offset to the index counter value; calculating a plurality of LFSR states by advancing a base state corresponding to each of the plurality of LFSR states by the target advance value; loading the index counter value into an index counter; loading the plurality of LFSR states in a plurality of LFSRs; performing residual slew to reach LFSR and counter states given by target PN position; and producing one or more PN sequences based on the states of the plurality of LFSRs. 6. The method of claim 5, wherein each of the plurality of LFSR states is calculated by multiplying a base LFSR state by a matrix M, where matrix M is determined to advance the base LFSR state by the target PN position.7. The method of claim 5, wherein the calculation of each of the plurality of LFSR states comprises: accessing a mask corresponding to the target PN position from a table of masks; loading an M-bit LFSR with a base state; for each i incrementing from 0 to M−1: applying the mask to the M-bit LFSR state, summing the resultant masked value using GF(2) addition to produce ADVANCED_LFSR_STATE(i);advancing the M-bit LFSR one state; anddelivering ADVANCED_LFSR_STATE(M−1:0) as the LFSR state.8. The method of claim 5, wherein each of the plurality of LFSR states is calculated by accessing the LFSR state corresponding to the closest offset to the target advance value in a lookup-table containing LFSR states corresponding to various offsets.9. A method of performing fast slewing PN generation in a device characterized by plural LFSRs comprising: receiving a target PN position; receiving a PN code offset; calculating an index counter value closest to the target PN position from a subset of the possible target PN positions; calculating a target advance value according to the index counter value; calculating a plurality of LFSR states by advancing a base state corresponding to each of the plurality of LFSR states by the target advance value; loading the index counter value into an index counter; loading the plurality of LFSR states in a plura lity of LFSRs; performing residual slew to reach LFSR and counter states given by target PN position; calculating a sets of masks for delaying one or more truncated LFSR sequences according to the PN code offset; and producing one or more PN sequences based on the one or more delayed truncated LFSR sequences. 10. The method of claim 9, wherein each of the plurality of LFSR states is calculated by multiplying a base LFSR state by a matrix M, where matrix M is determined to advance the base LFSR state by the target PN position.11. The method of claim 9, wherein the calculation of each of the plurality of LFSR states comprises: accessing a mask corresponding to the target PN position from a table of masks; loading an M-bit LFSR with a base state; for each i incrementing from 0 to M−1: applying the mask to the M-bit LFSR state, summing the resultant masked value using GF(2) addition to produce ADVANCED_LFSR_STATE(i);advancing the M-bit LFSR one state; anddelivering ADVANCED_LFSR STATE(M−1:0) as the LFSR state.12. The method of claim 9, wherein each of the plurality of LFSR states is calculated by accessing the LFSR state corresponding to the closest offset to the target advance value in a lookup-table containing LFSR states corresponding to various offsets.13. A method of calculating an LFSR state for performing fast slewing PN generation in a device characterized by plural LFSRs comprising: receiving a target advance value; accessing a matrix M with an advance value k from a table of pre-computed matrices, wherein k*r corresponds to the target advance value; loading the matrix M into a programmable matrix multiplier; repeating a matrix multiply for r iterations using the programmable matrix multiplier to produce an LFSR state advanced by k*r, wherein the initial iteration uses a base LFSR state as the input to the programmable matrix multiplier and subsequent iterations use the result of the previous iteration as the input to the programmable matrix multiplier; and delivering the r thiteration as the LFSR state.14. A method for calculating an LFSR state comprising: receiving a target advance value; calculating N advance values k 1-kNand calculating N repeat values r1-rNcorresponding to the N advance values such that the sum of r1k1through rNkNequal the target advance value; for each i of N advance values k 1-kN, given by ki, with corresponding repeat values r1-rN, given by r1:(a) accessing a matrix M with an advance value kifrom a table of pre-computed matrices;(b) loading the matrix M into a programmable matrix multiplier;(c) repeating a matrix multiply for riiterations using the programmable matrix multiplier to produce an LFSR state advanced by ki*ri, wherein:the initial iteration of step (C) when i=1 uses a base LFSR state as the input to the programmable matrix multiplier;the initial iteration of step (c) when i>1 uses the result of the steps (a) through (c) for i−1; andsubsequent iterations for riuse the result of the previous iteration as the input to the programmable matrix multiplier; and delivering the r Nthiteration as the LFSR state.15. A method for calculating an LFSR state comprising: receiving a target advance value; accessing a mask corresponding to the target advance value from a table of masks; loading an M-bit LFSR with a base state; for each i incrementing from 0 to M−1: applying the mask to the M-bit LFSR state, summing the resultant masked value using GF(2) addition to produce ADVANCED_LFSR_STATE(i);advancing the M-bit LFSR one state; anddelivering ADVANCED_LFSR_STATE(M−1:0) as the LFSR state.16. A method for calculating an LFSR state comprising: receiving a target advance value; accessing a mask corresponding to the target advance value from a table of masks; loading an M-bit variable LFSR_STATE with a base state; for each i incrementing from 0 to M−1: applying the mask to LFSR_STATE, summing the resultant