United States Patent: 8116741

[US Patent & Trademark Office, Patent Full Text and Image Database]

( 14 of 6848 )

United States Patent	8,116,741
Helferich	February 14, 2012

System and method for delivering information to a transmitting and receiving device

Abstract

Systems and methods for delivering information to a transmitting and receiving device. The device receives a notification alerting a user of the device that information is available to be obtained and, in some embodiments, providing a short description of the information. After receiving the notification at the device, the user can then use the device to obtain or otherwise act on the information at a time and at a place convenient to the user.

Inventors:	Helferich; Richard J. (Encinitas, CA)
Assignee:	Wireless Science, LLC (Chatsworth, CA)
Appl. No.:	12/167,971
Filed:	July 3, 2008

Related U.S. Patent Documents


Application Number	Filing Date	Patent Number	Issue Date
11399513	Apr., 2006	7499716
09688282	Feb., 2006	7039428
08933344	Jun., 2001	6253061

Current U.S. Class: 455/412.2 ; 455/412.1; 455/456.1

Current International Class: H04M 1/725 (20060101); H04M 1/663 (20060101)

Field of Search: 455/3.06,412.1,412.2,413,414.1,456.1,458,466

References Cited [Referenced By]

U.S. Patent Documents


2003576	June 1935	Buhren
3118145	January 1964	Nee
3794983	February 1974	Sahin
4039761	August 1977	Nicoud et al.
4042906	August 1977	Ezell
4124773	November 1978	Elkins
4371752	February 1983	Matthews et al.
4412217	October 1983	Willard et al.
4468813	August 1984	Burke et al.
4480253	October 1984	Anderson
4495647	January 1985	Burke et al.
4549047	October 1985	Brian et al.
4573140	February 1986	Szeto
4602129	July 1986	Matthews et al.
4640991	February 1987	Matthews et al.
4644352	February 1987	Fujii
4654713	March 1987	Boucharlat et al.
4710955	December 1987	Kauffman
4713837	December 1987	Gordon
4737979	April 1988	Hashimoto
4769641	September 1988	Yoshizawa et al.
4769642	September 1988	Davis et al.
4786902	November 1988	Davis et al.
4807155	February 1989	Cree et al.
4811376	March 1989	Davis et al.
4812843	March 1989	Champion, III et al.
4821308	April 1989	Hashimoto
4825456	April 1989	Rosenberg
4837798	June 1989	Cohen et al.
4837800	June 1989	Freeburg et al.
4839734	June 1989	Takemura
4845491	July 1989	Fascenda et al.
4853688	August 1989	Andros et al.
4858232	August 1989	Diaz et al.
4864301	September 1989	Helferich
4868560	September 1989	Oliwa et al.
4873520	October 1989	Fisch et al.
4885577	December 1989	Nelson
4897835	January 1990	Gaskill et al.
4905003	February 1990	Helferich
4916737	April 1990	Chomet et al.
4942598	July 1990	Davis
4949143	August 1990	Iesaka et al.
4961216	October 1990	Baehr et al.
4965569	October 1990	Bennett et al.
4975694	December 1990	McLaughlin et al.
5003576	March 1991	Helferich
5005013	April 1991	Tsukamoto et al.
5007105	April 1991	Kudoh et al.
5029199	July 1991	Jones et al.
5040204	August 1991	Sasaki et al.
5043721	August 1991	May
5047763	September 1991	Kuznicki et al.
5065423	November 1991	Gaskill
5070536	December 1991	Mahany et al.
5093659	March 1992	Yamada
5093901	March 1992	Cree et al.
5115233	May 1992	Zdunek et al.
5117449	May 1992	Metroka et al.
5128980	July 1992	Choi
5128981	July 1992	Tsukamoto et al.
5134724	July 1992	Gehring et al.
5138311	August 1992	Weinberg
5138312	August 1992	Tsukamoto et al.
5140419	August 1992	Galumbeck et al.
5146612	September 1992	Grosjean et al.
5153903	October 1992	Eastmond et al.
5159331	October 1992	Park et al.
5159592	October 1992	Perkins
5159713	October 1992	Gaskill et al.
5173688	December 1992	DeLuca et al.
5175758	December 1992	Levanto et al.
5177780	January 1993	Kasper et al.
5182553	January 1993	Kung
5185604	February 1993	Nepple et al.
5192947	March 1993	Neustein
5194857	March 1993	Gomez
5212636	May 1993	Nakazawa
5220366	June 1993	King
5227774	July 1993	Benoist
5239466	August 1993	Morgan et al.
5239679	August 1993	Murai
5241305	August 1993	Fascenda et al.
5247700	September 1993	Wohl et al.
5249230	September 1993	Mihm, Jr.
5255305	October 1993	Sattar
5257307	October 1993	Ise
5265033	November 1993	Vajk et al.
5283818	February 1994	Klausner et al.
5285426	February 1994	Teodoridis
5285496	February 1994	Frank et al.
5315635	May 1994	Kane et al.
5329501	July 1994	Meister et al.
5329550	July 1994	Rousseau et al.
5333266	July 1994	Boaz et al.
5375161	December 1994	Fuller et al.
5379031	January 1995	Mondrosch et al.
5390362	February 1995	Modjeska et al.
5396537	March 1995	Schwendeman
5396547	March 1995	Baals et al.
5398021	March 1995	Moore
5402466	March 1995	Delahanty
5406557	April 1995	Baudoin
5406616	April 1995	Bjorndahl
5410302	April 1995	Dulaney, III et al.
5418835	May 1995	Frohman et al.
5420922	May 1995	Lundblad et al.
RE34976	June 1995	Helferich et al.
5426422	June 1995	Vanden Heuvel et al.
5426594	June 1995	Wright et al.
5428663	June 1995	Grimes et al.
5428784	June 1995	Cahill, Jr.
5432839	July 1995	DeLuca
5436960	July 1995	Campana, Jr. et al.
5440559	August 1995	Gaskill
5442706	August 1995	Kung
5444438	August 1995	Goldberg
5444671	August 1995	Tschannen et al.
5448759	September 1995	Krebs et al.
5452356	September 1995	Albert
5455579	October 1995	Bennett et al.
5455823	October 1995	Noreen et al.
5457732	October 1995	Goldberg
5463382	October 1995	Nikas et al.
5463672	October 1995	Kage
5473143	December 1995	Vak et al.
5473320	December 1995	DeLuca et al.
5473667	December 1995	Neustein
5475653	December 1995	Yamada et al.
5475863	December 1995	Simpson et al.
5475866	December 1995	Ruthenberg
5479378	December 1995	Yamada et al.
5479408	December 1995	Will
5479472	December 1995	Campana, Jr. et al.
5481255	January 1996	Albert et al.
5483352	January 1996	Fukuyama et al.
5483595	January 1996	Owen
5485503	January 1996	Diem
5487100	January 1996	Kane
5487167	January 1996	Dinallo et al.
5489894	February 1996	Murray
5493692	February 1996	Theimer et al.
5497373	March 1996	Hulen et al.
5506886	April 1996	Maine et al.
5524009	June 1996	Tuutijarvi et al.
5530438	June 1996	Bickham et al.
5530930	June 1996	Hahn
5544321	August 1996	Theimer et al.
5550535	August 1996	Park
5555376	September 1996	Theimer et al.
5555446	September 1996	Jasinski
5557606	September 1996	Moon et al.
5557659	September 1996	Hyde-Thomson
5557749	September 1996	Norris
5559800	September 1996	Mousseau et al.
5559862	September 1996	Bhagat et al.
5561702	October 1996	Lipp et al.
5564018	October 1996	Flores et al.
5568540	October 1996	Greco et al.
5572196	November 1996	Sakumoto et al.
5572488	November 1996	Yamada et al.
5579372	November 1996	Astrom
5581366	December 1996	Merchant et al.
5581593	December 1996	Engelke et al.
5584070	December 1996	Harris et al.
5588009	December 1996	Will
5590092	December 1996	Fehnel
5592532	January 1997	Koizumi et al.
5600703	February 1997	Dang et al.
5600708	February 1997	Meche et al.
5603054	February 1997	Theimer et al.
5604788	February 1997	Tett
5608446	March 1997	Carr et al.
5608786	March 1997	Gordon
5611050	March 1997	Theimer et al.
5623242	April 1997	Dawson, Jr. et al.
5625870	April 1997	Moon
5627525	May 1997	Kudoh et al.
5627876	May 1997	Moon
5630060	May 1997	Tang et al.
5630207	May 1997	Gitlin et al.
5631635	May 1997	Robertson
5631948	May 1997	Bartholomew et al.
5633916	May 1997	Goldhagen et al.
5635918	June 1997	Tett
5636265	June 1997	O'Connell et al.
5638369	June 1997	Ayerst et al.
5644627	July 1997	Segal et al.
5649305	July 1997	Yoshida
5652789	July 1997	Miner et al.
5654942	August 1997	Akahane
5661782	August 1997	Bartholomew et al.
5663703	September 1997	Pearlman et al.
5668880	September 1997	Alajajian
5675507	October 1997	Bobo, II
5675627	October 1997	Yaker
5678176	October 1997	Moon
5678179	October 1997	Turcotte et al.
5680442	October 1997	Bartholomew et al.
5684859	November 1997	Chanroo et al.
5694120	December 1997	Indekeu et al.
5694454	December 1997	Hill et al.
5696500	December 1997	Diem
5699053	December 1997	Jonsson
5703934	December 1997	Zicker et al.
5706211	January 1998	Beletic et al.
5710816	January 1998	Stork et al.
5717742	February 1998	Hyde-Thomson
5722071	February 1998	Berg et al.
5724410	March 1998	Parvulescu et al.
5726643	March 1998	Tani
5737394	April 1998	Anderson et al.
5737395	April 1998	Irribarren
5737688	April 1998	Sakai et al.
5740230	April 1998	Vaudreuil
5742668	April 1998	Pepe et al.
5745689	April 1998	Yeager et al.
5751793	May 1998	Davies et al.
5751814	May 1998	Kafri
5752191	May 1998	Fuller et al.
5761622	June 1998	Priest
5768381	June 1998	Hawthorne
5774803	June 1998	Kariya
5778315	July 1998	Proietti
5781857	July 1998	Hwang et al.
5787345	July 1998	Moon
5796394	August 1998	Wicks et al.
5797091	August 1998	Clise et al.
5802165	September 1998	Kim
5802466	September 1998	Gallant et al.
5805886	September 1998	Skarbo et al.
5809115	September 1998	Inkinen
5809130	September 1998	Ayala
5809413	September 1998	Meche et al.
5809415	September 1998	Rossman
5809424	September 1998	Eizenhoefer
5812639	September 1998	Bartholomew et al.
5812671	September 1998	Ross, Jr.
5812795	September 1998	Horovitz et al.
5812865	September 1998	Theimer et al.
5815800	September 1998	Su et al.
5818824	October 1998	Lu et al.
5826191	October 1998	Krishnan
5828882	October 1998	Hinckley
5835089	November 1998	Skarbo et al.
5838252	November 1998	Kikinis
5841837	November 1998	Fuller et al.
5845211	December 1998	Roach, Jr.
5850594	December 1998	Cannon et al.
5857020	January 1999	Peterson, Jr.
5862325	January 1999	Reed et al.
5864606	January 1999	Hanson et al.
5870030	February 1999	DeLuca et al.
5870454	February 1999	Dahlen
5872779	February 1999	Vaudreuil
5872847	February 1999	Boyle et al.
5872926	February 1999	Levac et al.
5872930	February 1999	Masters et al.
5875436	February 1999	Kikinis
5878230	March 1999	Weber et al.
5878351	March 1999	Alanara et al.
5884159	March 1999	Thro et al.
5884160	March 1999	Kanazaki
5887249	March 1999	Schmid
5889852	March 1999	Rosecrans et al.
5892909	April 1999	Grasso et al.
5893032	April 1999	Maeda et al.
5893091	April 1999	Hunt et al.
5895471	April 1999	King et al.
5903723	May 1999	Beck et al.
5903845	May 1999	Buhrmann et al.
5905495	May 1999	Tanaka et al.
5905777	May 1999	Foladare et al.
5905865	May 1999	Palmer et al.
5907805	May 1999	Chotai
5909491	June 1999	Luo
5913032	June 1999	Schwartz et al.
5918158	June 1999	LaPorta et al.
5920826	July 1999	Metso et al.
5924016	July 1999	Fuller et al.
5928325	July 1999	Shaughnessy et al.
5930250	July 1999	Klok et al.
5930701	July 1999	Skog
5933478	August 1999	Ozaki et al.
5936547	August 1999	Lund
5938725	August 1999	Hara
5943397	August 1999	Gabin et al.
5948059	September 1999	Woo et al.
5951638	September 1999	Hoss et al.
5958006	September 1999	Eggleston et al.
5961590	October 1999	Mendez et al.
5961620	October 1999	Trent et al.
5963618	October 1999	Porter
5966652	October 1999	Coad et al.
5974447	October 1999	Cannon et al.
5974449	October 1999	Chang et al.
5978837	November 1999	Foladare et al.
5988857	November 1999	Ozawa et al.
5991615	November 1999	Coppinger et al.
5995597	November 1999	Woltz et al.
6009173	December 1999	Sumner
6014559	January 2000	Amin
6018654	January 2000	Valentine et al.
6018657	January 2000	Kennedy et al.
6018774	January 2000	Mayle et al.
6021114	February 2000	Shaffer et al.
6021190	February 2000	Fuller et al.
6021433	February 2000	Payne et al.
6026153	February 2000	Fuller et al.
6026292	February 2000	Coppinger et al.
6029065	February 2000	Shah
6029171	February 2000	Smiga et al.
6032039	February 2000	Kaplan
6035104	March 2000	Zahariev
6044247	March 2000	Taskett et al.
6047053	April 2000	Miner et al.
6047327	April 2000	Tso et al.
6052442	April 2000	Cooper et al.
6052595	April 2000	Schellinger et al.
6058304	May 2000	Callaghan et al.
6060997	May 2000	Taubenheim et al.
6061570	May 2000	Janow
6064342	May 2000	Sandhu et al.
6064879	May 2000	Fujiwara et al.
6070067	May 2000	Nguyen et al.
6081703	June 2000	Hallqvist
6087956	July 2000	Helferich
6088127	July 2000	Pieterse
6088717	July 2000	Reed et al.
6091957	July 2000	Larkins et al.
6094574	July 2000	Vance et al.
6097941	August 2000	Helferich
6101531	August 2000	Eggleston et al.
6115248	September 2000	Canova et al.
6119167	September 2000	Boyle et al.
6122484	September 2000	Fuller et al.
6125281	September 2000	Wells et al.
6128490	October 2000	Shaheen et al.
6134325	October 2000	Vanstone et al.
6134432	October 2000	Holmes et al.
6138158	October 2000	Boyle et al.
6144313	November 2000	Nakano
6144671	November 2000	Perinpanathan et al.
6145079	November 2000	Mitty
6147314	November 2000	Han et al.
6151443	November 2000	Gable et al.
6151491	November 2000	Farris et al.
6151507	November 2000	Laiho
6169883	January 2001	Vimpari et al.
6169911	January 2001	Wagner et al.
6175859	January 2001	Mohler
6178331	January 2001	Holmes et al.
6185423	February 2001	Brown et al.
6195564	February 2001	Rydbeck et al.
6205330	March 2001	Winbladh
6208839	March 2001	Davani
6212550	April 2001	Segur
6215858	April 2001	Bartholomew et al.
6216165	April 2001	Woltz et al.
6219694	April 2001	Lazaridis et al.
6222857	April 2001	Kammer et al.
6226495	May 2001	Neustein
6230133	May 2001	Bennett, III et al.
6230188	May 2001	Marcus
6233318	May 2001	Picard et al.
6233430	May 2001	Helferich
6236804	May 2001	Tozaki et al.
6246871	June 2001	Ala-Laurila
6252588	June 2001	Dawson
6253061	June 2001	Helferich
6259892	July 2001	Helferich
6272532	August 2001	Feinleib
6278862	August 2001	Henderson
6282435	August 2001	Wagner et al.
6285745	September 2001	Bartholomew et al.
6285777	September 2001	Kanevsky et al.
6288715	September 2001	Bain et al.
6292668	September 2001	Alanara et al.
6298231	October 2001	Heinz
6301471	October 2001	Dahm et al.
6301513	October 2001	Divon et al.
6317085	November 2001	Sandhu et al.
6317594	November 2001	Gossman et al.
6320957	November 2001	Draganoff
6321094	November 2001	Hayashi et al.
6321267	November 2001	Donaldson
6330244	December 2001	Swartz et al.
6330308	December 2001	Cheston et al.
6333919	December 2001	Gaffney
6333973	December 2001	Smith et al.
6343219	January 2002	Wada
6344848	February 2002	Rowe et al.
6351523	February 2002	Detlef
6356939	March 2002	Dahl
6361523	March 2002	Bierman
6363082	March 2002	Kammer et al.
RE37618	April 2002	Helferich
6370389	April 2002	Isomursu et al.
6373835	April 2002	Ng
6381650	April 2002	Peacock
6388877	May 2002	Canova et al.
6389457	May 2002	Lazaridis et al.
6389572	May 2002	Garrabrant et al.
6397059	May 2002	Vance et al.
6401113	June 2002	Lazaridis et al.
6411827	June 2002	Minata
6418305	July 2002	Neustein
6418307	July 2002	Amin
6421678	July 2002	Smiga et al.
6422147	July 2002	Shann
6424841	July 2002	Gustafsson
6425087	July 2002	Osborn et al.
6438585	August 2002	Mousseau et al.
6441824	August 2002	Hertzfeld et al.
6442243	August 2002	Valco et al.
6442637	August 2002	Hawkins et al.
6449344	September 2002	Goldfinger
6457134	September 2002	Lemke et al.
6459360	October 2002	Helferich
6462646	October 2002	Helferich
6463463	October 2002	Godfrey et al.
6463464	October 2002	Lazaridis et al.
6484027	November 2002	Mauney et al.
6501834	December 2002	Milewski et al.
6505237	January 2003	Beyda et al.
6510453	January 2003	Apfel et al.
6516202	February 2003	Hawkins et al.
6522879	February 2003	Myer et al.
6523124	February 2003	Lunsford et al.
6526127	February 2003	Piotrowski et al.
6539476	March 2003	Marianetti et al.
6546083	April 2003	Chaves et al.
6564249	May 2003	Shiigi
6567179	May 2003	Sato et al.
6580784	June 2003	Rodriguez et al.
6580787	June 2003	Akhteruzzaman et al.
6587681	July 2003	Sawai
6587693	July 2003	Lumme et al.
6590588	July 2003	Lincke et al.
6597688	July 2003	Narasimhan et al.
6597903	July 2003	Dahm et al.
6611254	August 2003	Griffin et al.
6625142	September 2003	Joffe et al.
6625642	September 2003	Naylor et al.
6636522	October 2003	Perinpanathan et al.
6636733	October 2003	Helferich
6658409	December 2003	Nomura et al.
6662195	December 2003	Langseth et al.
6665547	December 2003	Ehara
6665803	December 2003	Osborn et al.
6671715	December 2003	Langseth et al.
6687839	February 2004	Tate et al.
6694316	February 2004	Langseth et al.
6701378	March 2004	Gilhuly et al.
6728530	April 2004	Heinonen et al.
6741980	May 2004	Langseth et al.
6744528	June 2004	Picoult et al.
6744874	June 2004	Wu
6751453	June 2004	Schemers et al.
6760423	July 2004	Todd
6766490	July 2004	Garrabrant et al.
6771949	August 2004	Corliss
6775264	August 2004	Kurganov
6775689	August 2004	Raghunandan
6779019	August 2004	Mousseau et al.
6779022	August 2004	Horstmann et al.
6788767	September 2004	Lambke
6792112	September 2004	Campbell et al.
6792544	September 2004	Hashem et al.
6807277	October 2004	Doonan et al.
6813489	November 2004	Wu et al.
6823225	November 2004	Sass
6826407	November 2004	Helferich
6832130	December 2004	Pintsov et al.
6868498	March 2005	Katsikas
6869016	March 2005	Waxelbaum
6871214	March 2005	Parsons et al.
6880079	April 2005	Kefford et al.
6882709	April 2005	Sherlock et al.
6886096	April 2005	Appenseller et al.
6892074	May 2005	Tarkiainen et al.
6912285	June 2005	Jevans
6912400	June 2005	Olsson et al.
RE38787	August 2005	Sainton et al.
6938065	August 2005	Jain
6941349	September 2005	Godfrey et al.
6944283	September 2005	Klein
6950679	September 2005	Sugiyama et al.
6952599	October 2005	Noda et al.
6980792	December 2005	Iivonen et al.
6983138	January 2006	Helferich
6990587	January 2006	Willins et al.
7003308	February 2006	Fuoss et al.
7006459	February 2006	Kokot et al.
7007239	February 2006	Hawkins et al.
7013391	March 2006	Herle et al.
7017181	March 2006	Spies et al.
7020688	March 2006	Sykes, Jr.
7023967	April 2006	Andersson et al.
7031437	April 2006	Parsons et al.
7054905	May 2006	Hanna et al.
7058390	June 2006	Chikazawa
7062536	June 2006	Fellenstein et al.
7065189	June 2006	Wakabayashi
7068993	June 2006	Rai et al.
7072642	July 2006	Yabe et al.
7076528	July 2006	Premutico
7079006	July 2006	Abe
7082469	July 2006	Gold et al.
7082536	July 2006	Filipi-Martin
7088990	August 2006	Isomursu et al.
7092743	August 2006	Vegh
7100048	August 2006	Czajkowski et al.
7107246	September 2006	Wang
7113601	September 2006	Ananda
7113803	September 2006	Dehlin
7113979	September 2006	Smith et al.
7116762	October 2006	Bennett, III et al.
7116997	October 2006	Byers et al.
7133687	November 2006	El-Fishawy et al.
7146009	December 2006	Andivahis et al.
7149537	December 2006	Kupsh et al.
7149893	December 2006	Leonard et al.
7155241	December 2006	Helferich
7188186	March 2007	Meyer et al.
7218919	May 2007	Vaananen
7233655	June 2007	Gailey et al.
7239338	July 2007	Krisbergh et al.
7251314	July 2007	Huang
7254384	August 2007	Gailey et al.
7277692	October 2007	Jones et al.
7277716	October 2007	Helferich
7280838	October 2007	Helferich
7286817	October 2007	Provost et al.
7289797	October 2007	Kato
7299036	November 2007	Sanding et al.
7299046	November 2007	Ozugur et al.
7317929	January 2008	El-Fishawy et al.
7333817	February 2008	Tsuchiyama
7353018	April 2008	Mauney et al.
7403793	July 2008	Mauney et al.
7433461	October 2008	Bauer
2001/0005857	June 2001	Lazaridis et al.
2001/0005860	June 2001	Lazaridis et al.
2001/0005861	June 2001	Mousseau et al.
2001/0013071	August 2001	Lazaridis et al.
2001/0048737	December 2001	Goldberg et al.
2001/0054115	December 2001	Ferguson et al.
2002/0012323	January 2002	Petite
2002/0023131	February 2002	Wu et al.
2002/0029258	March 2002	Mousseau et al.
2002/0032658	March 2002	Oki et al.
2002/0035687	March 2002	Skantze
2002/0038298	March 2002	Kusakabe et al.
2002/0039419	April 2002	Akimoto et al.
2002/0049818	April 2002	Gilhuly et al.
2002/0052218	May 2002	Rhee
2002/0065887	May 2002	Paik et al.
2002/0065895	May 2002	Zhang et al.
2002/0087645	July 2002	Ertugrul et al.
2002/0091777	July 2002	Schwartz
2002/0091782	July 2002	Benninghoff
2002/0101998	August 2002	Wong et al.
2002/0107928	August 2002	Chalon
2002/0120696	August 2002	Mousseau et al.
2002/0120788	August 2002	Wang et al.
2002/0128036	September 2002	Yach et al.
2002/0138735	September 2002	Felt et al.
2002/0138759	September 2002	Dutta
2002/0156691	October 2002	Hughes et al.
2002/0178353	November 2002	Graham
2002/0181701	December 2002	Lee
2002/0194281	December 2002	McConnell et al.
2002/0194285	December 2002	Mousseau et al.
2003/0005066	January 2003	Lazaridis et al.
2003/0009698	January 2003	Lindeman et al.
2003/0037261	February 2003	Meffert et al.
2003/0048905	March 2003	Gehring et al.
2003/0050987	March 2003	Lazaridis et al.
2003/0055902	March 2003	Amir et al.
2003/0061511	March 2003	Fischer
2003/0078058	April 2003	Vatanen et al.
2003/0081621	May 2003	Godfrey et al.
2003/0088633	May 2003	Chiu et al.
2003/0097361	May 2003	Huang et al.
2003/0115448	June 2003	Bouchard
2003/0120733	June 2003	Forman
2003/0126216	July 2003	Avila et al.
2003/0126220	July 2003	Wanless
2003/0142364	July 2003	Goldstone
2003/0182575	September 2003	Korfanta
2003/0187938	October 2003	Mousseau et al.
2003/0191808	October 2003	Adler et al.
2003/0194990	October 2003	Helferich
2003/0204568	October 2003	Bhargava et al.
2003/0220979	November 2003	Hejl
2003/0222765	December 2003	Curbow et al.
2003/0235307	December 2003	Miyamoto
2003/0235308	December 2003	Boynton et al.
2003/0237082	December 2003	Thurlow
2004/0019780	January 2004	Waugh et al.
2004/0021889	February 2004	McAfee et al.
2004/0024824	February 2004	Ferguson et al.
2004/0030906	February 2004	Marmigere et al.
2004/0052340	March 2004	Joffe et al.
2004/0059598	March 2004	Wellons et al.
2004/0059914	March 2004	Karaoguz
2004/0060056	March 2004	Wellons et al.
2004/0073619	April 2004	Gilhuly et al.
2004/0078488	April 2004	Patrick
2004/0083271	April 2004	Tosey
2004/0083365	April 2004	Renier et al.
2004/0111478	June 2004	Gross et al.
2004/0111480	June 2004	Yue
2004/0116073	June 2004	Mauney et al.
2004/0116119	June 2004	Lewis et al.
2004/0122847	June 2004	Rodgers
2004/0122905	June 2004	Smith et al.
2004/0137884	July 2004	Engstrom et al.
2004/0137955	July 2004	Engstrom et al.
2004/0165727	August 2004	Moreh et al.
2004/0185877	September 2004	Asthana et al.
2004/0194116	September 2004	McKee et al.
2004/0196978	October 2004	Godfrey et al.
2004/0198348	October 2004	Gresham et al.
2004/0199669	October 2004	Riggs et al.
2004/0202327	October 2004	Little et al.
2004/0203642	October 2004	Zatloukal et al.
2004/0205106	October 2004	Adler et al.
2004/0205248	October 2004	Little et al.
2004/0205330	October 2004	Godfrey et al.
2004/0208296	October 2004	Aboujaoude et al.
2004/0212639	October 2004	Smoot et al.
2004/0221014	November 2004	Tomkow
2004/0221048	November 2004	Ogier
2004/0230657	November 2004	Tomkow
2004/0243677	December 2004	Curbow et al.
2004/0243844	December 2004	Adkins
2004/0243847	December 2004	Way
2004/0249768	December 2004	Kontio et al.
2004/0249895	December 2004	Way
2004/0249899	December 2004	Shiigi
2004/0252727	December 2004	Mousseau et al.
2004/0264121	December 2004	Orriss
2004/0266441	December 2004	Sinha et al.
2005/0003809	January 2005	Kato
2005/0009502	January 2005	Little et al.
2005/0015455	January 2005	Liu
2005/0019634	January 2005	Legg
2005/0025172	February 2005	Frankel
2005/0025291	February 2005	Peled et al.
2005/0025297	February 2005	Finnigan
2005/0038863	February 2005	Onyon et al.
2005/0044160	February 2005	McElligott
2005/0055413	March 2005	Keohane et al.
2005/0058124	March 2005	Helferich
2005/0058260	March 2005	Lasensky et al.
2005/0060720	March 2005	Mayer
2005/0076109	April 2005	Mathew et al.
2005/0091329	April 2005	Friskel
2005/0099654	May 2005	Chen
2005/0099998	May 2005	Semper
2005/0102381	May 2005	Jiang et al.
2005/0108336	May 2005	Naick et al.
2005/0108359	May 2005	Hyder et al.
2005/0114652	May 2005	Swedor et al.
2005/0130631	June 2005	Maguire et al.
2005/0132010	June 2005	Muller
2005/0135681	June 2005	Schirmer
2005/0137009	June 2005	Vetelainen
2005/0138353	June 2005	Spies
2005/0141718	June 2005	Yu et al.
2005/0148356	July 2005	Ferguson et al.
2005/0159107	July 2005	Mauney et al.
2005/0163320	July 2005	Brown et al.
2005/0165740	July 2005	Kerr et al.
2005/0176451	August 2005	Helferich
2005/0180576	August 2005	Jevans
2005/0188024	August 2005	Singer
2005/0188045	August 2005	Katsikas
2005/0198143	September 2005	Moody et al.
2005/0198170	September 2005	LeMay et al.
2005/0198506	September 2005	Qi et al.
2005/0210064	September 2005	Caldini et al.
2005/0210106	September 2005	Cunningham
2005/0210246	September 2005	Faure
2005/0210394	September 2005	Crandall et al.
2005/0216587	September 2005	John
2005/0216735	September 2005	Huang
2005/0229258	October 2005	Pigin
2005/0251558	November 2005	Zaki
2005/0257057	November 2005	Ivanov et al.
2005/0265551	December 2005	Hara
2005/0282525	December 2005	Adams et al.
2006/0013368	January 2006	LaBaw
2006/0019638	January 2006	Chiu et al.
2006/0019639	January 2006	Adams et al.
2006/0020667	January 2006	Wang et al.
2006/0021038	January 2006	Brown et al.
2006/0021066	January 2006	Clayton et al.
2006/0026246	February 2006	Fukuhara et al.
2006/0029191	February 2006	Miller et al.
2006/0041505	February 2006	Enyart
2006/0041625	February 2006	Chen et al.
2006/0046720	March 2006	Toropainen et al.
2006/0046757	March 2006	Hoover et al.
2006/0047766	March 2006	Spadea
2006/0053202	March 2006	Foo et al.
2006/0068768	March 2006	Sanding et al.
2006/0069737	March 2006	Gilhuly et al.
2006/0072761	April 2006	Johnson et al.
2006/0074706	April 2006	Gilham
2006/0075027	April 2006	Zager et al.
2006/0080384	April 2006	Robinson et al.
2006/0090065	April 2006	Bush et al.
2006/0095510	May 2006	Rouse et al.
2006/0101119	May 2006	Qureshi et al.
2006/0133585	June 2006	Daigle et al.
2006/0135128	June 2006	Skoog
2006/0155698	July 2006	Vayssiere
2006/0155812	July 2006	Looman
2006/0168065	July 2006	Martin
2006/0168072	July 2006	Park
2006/0177015	August 2006	Skakkebaek et al.
2006/0182124	August 2006	Cole et al.
2006/0187897	August 2006	Dabbs et al.
2006/0190533	August 2006	Shannon et al.
2006/0194572	August 2006	Fresonke et al.
2006/0200528	September 2006	Pathiyal
2006/0217112	September 2006	Mo
2006/0218224	September 2006	Agrawal et al.
2006/0218244	September 2006	Rasmussen et al.
2006/0221916	October 2006	Taylor et al.
2006/0224893	October 2006	Sales et al.
2006/0230266	October 2006	Maes
2006/0233370	October 2006	Jung et al.
2006/0234680	October 2006	Doulton
2006/0239424	October 2006	Walter
2006/0240868	October 2006	Kaplan et al.
2006/0247962	November 2006	Harvey et al.
2006/0248148	November 2006	Timmins et al.
2006/0259558	November 2006	Yen
2006/0265660	November 2006	Hullot et al.
2006/0270461	November 2006	Won et al.
2006/0285533	December 2006	Divine et al.
2006/0286990	December 2006	Juan et al.
2007/0042747	February 2007	Sun
2007/0117541	May 2007	Helferich
2007/0162454	July 2007	D'Albora et al.
2007/0265838	November 2007	Chopra et al.
2008/0037582	February 2008	Wang
2008/0039052	February 2008	Knowles
2009/0191848	July 2009	Helferich

Foreign Patent Documents


324650	Jul., 1989	EP
631419	Dec., 1994	EP
0 695 071	Jan., 1996	EP
777394	Jun., 1997	EP
831664	Sep., 1997	EP
0 505 489	Nov., 1997	EP
0 624 993	Dec., 2003	EP
56000096	Jan., 1981	JP
63-283058	Nov., 1988	JP
2-014571	Jan., 1990	JP
3-500955	Feb., 1991	JP
03232325	Oct., 1991	JP
6-70292	Mar., 1994	JP
6-261121	Sep., 1994	JP
6-276226	Sep., 1994	JP
06245254	Sep., 1994	JP
6-318899	Nov., 1994	JP
06-326656	Nov., 1994	JP
7-503826	Apr., 1995	JP
7-245773	Sep., 1995	JP
8-019025	Jan., 1996	JP
8-97854	Apr., 1996	JP
8-163637	Jun., 1996	JP
8-228368	Sep., 1996	JP
8-265245	Oct., 1996	JP
08336182	Dec., 1996	JP
9-146824	Jun., 1997	JP
9-200250	Jul., 1997	JP
2001-517891	Oct., 2001	JP
2000-513362	Sep., 2005	JP
00164369	Sep., 1998	KR
89/05009	Jun., 1989	WO
92/14330	Aug., 1992	WO
97/08906	Mar., 1997	WO
9731488	Aug., 1997	WO
97 / 32439	Sep., 1997	WO
9858476	Dec., 1998	WO
9965256	Dec., 1999	WO

Other References

Micheal M. Tao, et al., "Always on, Always Connected Mobile Computing," IEEE (1996). cited by other .
Anonymous, "Newton Solutions Guide," Apple Computer, Inc. (1995). cited by other .
Anonymous, "Newton Messaging Card Arrives," MacWeek (Sep. 1993). cited by other .
Anonymous, "Allpen's Nethopper Lets Apple Newton Owners Surf Internet, Intranets," Tribune Business News (Jun. 1996). cited by other .
Anonymous, .sctn. 3.2.9 ETSI GSM 3.40, "Digital Cellular Telecommunications System (Phase 2+) Technical Realisation of the Short Message Service Point-to-Point," v4.13.0, (May 1996). cited by other .
Anonymous, "Eudora Pro for Newton Users' Guide," Eudora (unavailable to Applicant and Date Unknown). cited by other .
"Notice of Grounds of Rejection," Japanese Patent App. No. 2010-001327, dated Aug. 17, 2010 (including English Translation). cited by other .
Freed, Borenstein, RFC 2045, MIME format standards, Nov. 1996. cited by other .
Anonymous, Wikipedia, "Personal Communications Service" (Date Unknown). cited by other .
Anonymous, Wikipedia, "SMS" (Date Unknown). cited by other .
"Claim Charts Applying 5,905,777 (Foladare et al.) to Selected Claims of Helferich U.S. Patent Nos. 7,499,716, 7,280,838, and 7,155,241" (Apr. 15, 2010). cited by other .
Compiled Plaintiff's Response to Defendant's Initial Invalidity Contentions and Defendant's Initial Invalidity Contentions exchanged in NDIL Case No. 1:10-cv-04387 (Dec. 2010). cited by other .
Fuhrt, Design issues for interactive television systems, Computer Magazine, May 1995. cited by other .
Henriksen, Mobile Data Network System Description, Norwegian Telecommunications Administration Research Dept, Apr. 1986. cited by other .
Crispin, Interactive Mail Access Protocol--Version 2, Request for Comments 1176, Network Working Group, Aug. 1990. cited by other .
Kaspersen, vol. 1 Network architecture addressing and routing, Mobile Data Network Description, Teledirektoratets forskningsavdeling, Mar. 1989. cited by other .
Kaspersen, vol. 2 Service and service elements, "Mobile Data Network Description", Teledirektoratets forskningsavdeling, Apr. 1989. cited by other .
Kaspersen, vol. 6 Requirements to the Base Station, "Mobile Data Network Description", Teledirektoratets forskningsavdeling, Jul. 1989. cited by other .
Kaspersen, vol. 7 Requirements to the Mobile Stations, "Mobile Data Network Description", Teledirektoratets forskningsavdeling, Sep. 1989. cited by other .
Kramer, Use of two-way wireless messaging for personal telephone management, University of Wisconsin Record, Jun. 1905. cited by other .
Anonymous, re Nokia 9000i Communicator, Owner's Manual Issue 1.1, Undated. cited by other .
Anonymous, Changes from Pine 3.96 to 4.00, Computing and Networking, University of Washington, Feb. 2001. cited by other .
Anonymous, Active Paper's Presto!Mail to be bundled with Envoy 150 Wireless Communicator from Motorola, Business Wire, Apr. 1996. cited by other .
Crispin, Internet Message Access Protocol Version 4, Request for Comments 2060, Network Working Group, Dec. 1996. cited by other .
Rodriquez, Motorola provides NetWare access to paging networks, InfoWorld, May 1995. cited by other .
Joseph, Rover: a toolkit for mobile information access, SIGOPS Dec. 1995, Jan. 1900. cited by other .
Hardy, SkyTel is set to launch two-way-paging--Mtel unit is poised for big gains in wireless business, Wall Street Journal, Sep. 1995. cited by other .
Anonymous, Motorola unveils next-generation Tango products at PCS '96; Tanto Lite guarantees message delivery and receipt, Business Wire, Sep. 1996. cited by other .
Kaspersen, vol. 3 Protocols and protocol hierarchy within the MDN, "Mobile Data Network Description", Teledirektoratets forskningsavdeling, May 1989. cited by other .
Kaspersen, vol. 4 Specification of DTL and DTP within the MDN, "Mobile Data Network Description", Teledirektoratets forskningsavdeling, Jun. 1989. cited by other .
Kaspersen, vol. 8 Specification of the MDN-MHS inter-working, "Mobile Data Network Description", Teledirektoratets forskningsavdeling, Aug. 1989. cited by other .
Anonymous, UP Browser Manual, Unwired Planet, Aug. 1996. cited by other .
Anonymous, UP HDML Language Reference, Jul. 1996. cited by other .
Anonymous, UP Up.Link Developer's Guide, Jul. 1996. cited by other .
Verjinkski, PHASE, a portable host access system environment, Unisys Defense Systems , Jan. 1900. cited by other .
Kylanpaa, Nomadic access to information services by a GSM phone, Computer & Graphics, Jun. 1905. cited by other .
Anonymous, Cost of Ownership Analysis Instructions, Unwired Planet, Jun. 2010. cited by other .
Anonymous, The Mobile Intranet--wireless internet access with UP Link by Unwired Planet, Jun. 1905. cited by other .
Butler, Post Office Protocol Version 2, Request for Comments 937, Network Working Group, Feb. 1985. cited by other .
Taylor, Internetwork Mobility--the CDPD Approach, Jun. 1996. cited by other .
Anonymous, Narrowband Sockets Specification Intel and Nokia, Sep. 1996. cited by other .
deLespinasse, Rover Mosaic: E-mail communication for a full-function web browser, Master's Thesis, MIT, Jun. 1995. cited by other .
"New Wyndmail version 1.5 features another first for wireless industry," Busines Wire (Author Unknown) (Aug. 19, 1996). cited by other .
"WyndMail wireless e-mail now provides "Message Header Preview" for Apple Powerbook and MessagePad," Business Wire (Author Unknown) (Jan. 9, 1997). cited by other .
Request for Ex Parte Reexamination of US Pat 7,835,757, claims 1-20, Control No. 90/009,882, Andrea G. Reister (Feb. 25, 2011). cited by other .
Request for Ex Parte Reexamination of US Pat 7,499,716, claims 1-18 and 21-69, Control No. 90/009,880, Andrea G. Reister (Feb. 25, 2011). cited by other .
Request for Ex Parte Reexamination of US Pat 7,280,838, claims 1-96, Control No. 90/009,883, Andrea G. Reister (Feb. 25, 2011). cited by other .
"Information Disclosure Statement by Applicant" filed in Reexam of US Pat 7,835,757, Andrea G. Reister (Feb. 25, 2011). cited by other .
"Information Disclosure Statement by Applicant" filed in Reexam of US Pat 7,499,716, Andrea G. Reister (Feb. 25, 2011). cited by other .
"Information Disclosure Statement by Applicant" filed in Reexam of US Pat 7,280,838, Andrea G. Reister (Feb. 25, 2011). cited by other .
Order Granting/Denying Request For Ex Parte Reexamination of US Pat 7,835,757, claims 1-20, Control No. 90/009,882, (Mar. 25, 2011). cited by other .
Order Granting/Denying Request for Ex Parte Reexamination of US Pat 7,499,716, claims 1-18 and 21-69, Control No. 90/009,880, (Mar. 25, 2011). cited by other .
Notice of Failure to Comply With Ex Parte Reexamination Request Requirements (37 CFR 1.510(c)), Control No. 90/009,883 (Mar. 29, 2011). cited by other .
Decision Vacating Notice of Failure to Comply (Form PTOL-2077), Control No. 90/009,883 (Apr. 6, 2011). cited by other .
Thesis of A.F. deLespinasse, "Rover Mosaic: E-mail Communication for a Full-Function Web Browser," Massachusetts Institute of Technology (archived Aug. 10, 1995, in MIT Library) (hereinafter "Rover Mosaic"). cited by other .
A.D. Joseph et al., "Rover: A Toolkit for Mobile Information Access," Proceedings of the Fifteenth ACM Symposium on Operating Systems and Principles, Copper Mountain Resort, Colorado, pp. 156-171 (Dec. 3-6, 1995) (hereinafter Rover Toolkit). cited by other .
M.M. Tso, et al. "Always On, Always Connected Mobile Computing," 1996 5th IEEE International Conference on Universal Personal Communications Record, vol. 1 of 2, Sessions 1-6, Cambridge Marriott Hotel, Cambridge, Massachusetts, pp. 918-924 (Sep. 29-Oct. 2, 1996) (hereinafter "Always On, Always Connected"). cited by other .
Vaudreuil, Internet Engineering Task Force Request for Comments 1911: "Voice Profile for Internet Mail," pp. 1-22 (Feb. 1996) (hereinafter "RFC 1911"); and. cited by other .
Yeong, et al., Internet Engineering Task Force Request for Comments 1487: "X.500 Lightweight Directory Access Protocol," pp. 1-21 (Jul. 1993) (hereinafter "RFC 1487"). cited by other .
Order Granting/Denying Request for Ex Parte Reexamination of US Pat 7,280,838, claims 1-96, Control No. 90/009,883, (Apr. 26, 2011). cited by other .
"Final Rejection," Japanese Patent App. No. 2008-302127, dated Apr. 13, 2010. cited by other .
"Final Rejection," Japanese Patent App. No. 2009-052858, dated Apr. 22, 2010. cited by other .
"Active Channel Server Frequently Asked Questions (FAQ)", Microsoft Corporation, Q181161, 2006, 2 pages. cited by other .
"Introduction to Active Channel Technology", Microsoft Corporation, 2006, 5 pages. cited by other .
Anonymous, PatentAtlas, "Patent Cluster Tree Encompassing the Subject in Question: SAMPLE" (date unknown). cited by other .
Anonymous, usamobility.com, "ReFLEX Wireless Data Technology" (date unknown). cited by other .
Engst, A.C., "The Real TidBITS Channel", TidBITS Electronic Publishing, 1998, 4 pages. cited by other .
Engst, A.C., "TidBITS#349/Oct. 14, 1996," TidBITS Electronic Publishing, 1996, 10 pages. cited by other .
Form 1449, filed in Patent No. 5,438,611, Campana, Jr. et al., Issued Aug. 1, 1995, 1 page. cited by other .
Gillay, C.Z., "Subscriptions, Channels, and Active Desktop", TechNotes, Franklin, Beedle & Associates, Inc., 1999, pp. 1-6. cited by other .
International Preliminary Examination Report dated Jul. 10, 2001 (7 pages) PCT/US00/08261 Jul. 1, 2001. cited by other .
Khare, R., et al., "Scenarios for an Internet-Scale Event Notification Service (ISENS)", Internet-Draft, Aug. 13, 1998, 18 pages. cited by other .
PLUS Patent Linguistics Utility Search Results for U.S. Appl. No. 10/445,257, Searched Mar. 16, 2005. cited by other .
Siewiorek, D.P., et al., "Computer Structures: Principles and Examples", McGraw-Hill Book Company, 1982, 21 pages. cited by other .
Statutory Invention Registration No. H610; Date: Mar. 7, 1989, Focarile et al. cited by other .
Winnick Cluts, N., et al., "A Preview of Active Channel and the Active Desktop for Internet Explorer 4.0", Microsoft Corporation, 1997, 13 pages. cited by other .
Anonymous, "Envoy Wireless Communicator User's Guide," Motorola, Inc. (1994). cited by other .
Anonymous, "General Magic OS Targets US, Japan," Reed Business Information (1996). cited by other .
Anonymous, "MessagePad 2000: New Newton Exceeds Expectation," TidBITS #379 (May 12, 1997). cited by other .
Anonymous, "NETCOM and RadioMail form Strategic Alliance Enabling NETCOM Customers to Exchange Email, Send Faxes and Access Web Sites Wireless," Business Wire (Dec. 11, 2006). cited by other .
Anonymous, "New Features of the Newton 2.0 Operating System," Apple Computer, Inc. (1995). cited by other .
Anonymous, "New RadioMail Package Brings Maximum Affordability and Simplicity to Wireless Communications," AllBusiness (Feb. 27, 1996). cited by other .
Anonymous, "Newton Apple MessagePad Handbook," Apple Computer, Inc. (1995). cited by other .
Anonymous, "Newton Internet Enabler," (1997). cited by other .
Anonymous, "Newton MessagePad (Original) Specs," EveryMac.com (1996). cited by other .
Anonymous, "RadioMail Corporation Releases Wireless Internet Access Solution for CDPD Carriers," Business Wire (Oct. 7, 1996). cited by other .
Anonymous, "Using E-Mail on Your Newton Device," Apple Computer, Inc. (1997). cited by other .
Anonymous, "Sony Electronics Introduces Magic Link PIC-2000," Business Wire (Oct. 30, 1995). cited by other .
Denise Shelton, "RadioMail can Find, Retrieve Web Pages," CNET News (Jun. 4, 1996). cited by other .
Ira Brodsky, "Instant Gratification," Telephone Online (Jan. 15, 1999). cited by other .
Mark Kellner, "Earthquake and RadioMail," The Washington Times (Jan. 24, 1994). cited by other .
Mike Fine, "The AllPoints Wireless PC Card and RadioMail Service," www.palmtoppaer.com (Date Unknown). cited by other .
Stuart Price, "Product Reviews: Eudora Pro for Newton 1.0," MacUser (Dec. 22, 1996). cited by other .
"Notice of Grounds of Rejection," Japanese Patent App. No. 2008-302127, dated Jun. 30, 2009. cited by other .
Anonymous, Compiled Redacted Correspondence regarding Tso '327 Reference, 2010. cited by other .
"Notice of Grounds of Rejection," Japanese Patent App. No. 2009-052859, dated Oct. 6, 2009. cited by other .
"Notice of Grounds of Rejection," Japanese Patent App. No. 2009-052858, dated Oct. 6, 2009. cited by other .
Anonymous, "Second Generation Personal Handy Phone System," pp. 117-119, dated Jun. 25, 1996. cited by other .
Non-Final Rejection in Ex Parte Reexamination of U.S. Pat 7,835,757, Control No. 90/009,882, (Jun. 17, 2011). cited by other .
Non-Final Rejection in Ex Parte Reexamination of U.S. Pat 7,499,716, Control No. 90/009,880, (Jun. 17, 2011). cited by other .
Patentee Response and Request for Reconsideration of Non-Final Rejection in Ex Parte Reexamination of U.S. Pat 7,835,757, Control No. 90/009,882 (Jun. 29, 2011). cited by other .
Patentee Response and Request for Reconsideration of Non-Final Rejection in Ex Parte Reexamination of U.S. Pat 7,499,716, Control No. 90/009,880 (Jun. 29, 2011). cited by other .
Order Denying Request for Inter Partes Reexamination of U.S. Patent No. 7,280,838 (assigned Control No. 95/001,740) (Oct. 28, 2010). cited by other .
Examiner Summary of Interview in 90/009,880 (Ex Parte Reexamination of 7,499,716) (Sep. 30, 2011). cited by other .
Patentee Supplemental Response After Final Office Action in 90/009,880 (Ex Parte Reexamination of 7,499,716) (Oct. 13, 2011). cited by other .
Notice of Intent to Issue Reexamination Certificate in 90/009,880 (Ex Parte Reexamination of 7,499,716) (Oct. 21, 2011). cited by other .
Patentee Supplemental Response After Final Office Action in 90/009,882 (Ex Parte Reexamination of 7,835,575) (Nov. 1, 2011). cited by other .
Request for Ex Parte Reexamination of US Pat 7,835,757, claims 2-20, Control No. 95/001,739, Andrea G. Reister (Sep. 6, 2011). cited by other .
Request for Ex Parte Reexamination of US Pat 7,499,716, claims 15, 17, 189, and 21-29, Control No. 95/001,738, Andrea G. Reister (Sep. 6, 2011). cited by other .
Request for Ex Parte Reexamination of US Pat 7,280,838, claims 9-20, Control No. 95/001,740, Andrea G. Reister (Sep. 6, 2011). cited by other .
"Information Disclosure Statement by Applicant" filed in 95/001,739 (Inter Partes Reexamination of 7,835,757) by Andrea G. Reister (Sep. 6, 2011). cited by other .
"Information Disclosure Statement by Applicant" filed in 95/001,738 (Inter Partes Reexamination of 7,499,716) by Andrea G. Reister (Sep. 6, 2011). cited by other .
"Information Disclosure Statement by Applicant" filed in 95/001,740 (Inter Partes Reexamination of 7,280,838) by Andrea G. Reister (Sep. 6, 2011. cited by other .
Non-Final Office Action in 90/009,883 (Ex Parte Reexamination of 7,280,838) (Sep. 28, 2011). cited by other .
Patentee Response After Final Office Action in 90/009,882 (Ex Parte Reexamination of 7,835,575) (Oct. 5, 2011). cited by other .
Patentee Response After Final Office Action in 90/009,880 (Ex Parte Reexamination of 7,499,716) (Oct. 5, 2011). cited by other .
Examiner Summary of Interview in 90/009,882 (Ex Parte Reexamination of 7,835,757) (Sep. 29, 2011). cited by other .
Advisory Action in 90/009,882 (Ex Parte Reexamination of 7,835,757) (Oct. 21, 2011). cited by other .
Transcript of Court Hearing in Helferich Patent Licensing, LLC v. The New York Times Company, Case No. 1:10-cv-04387 (N.D.III.), pp. 41-42 (Jan. 25, 2011). cited by other .
3GPP TS 23.140 V6, "Multimedia Messaging Service (MMS); Functional Description, Stage 2 (Release 6)" (Mar. 2009). cited by other .
Reilly, et al., "Enabling Mobile Network Manager," Computer Networks and ISDN Systems 29, 1417-1428 (1997). cited by other .
T. Berners-Lee, "RFC 1945: Hypertext Transfer Protocol--HTTP/1.0," May 1996. cited by other .
M. Crispin, "RFC 1730: Internet Message Access Protocol--Version 4," Dec. 1994. cited by other .
N. Freed, "RFC: 2046: Multipurpose Internet Mail Extensions (MIME) Part Two: Media Types," Nov. 1996. cited by other .
J. Meyers, "RFC 1939: Post Office Protocol--Version 3," May 1996. cited by other .
J. Postel, "RFC 793: Transmission Control Protocol," Sep. 1981. cited by other .
Nokia 9000 Communicator User's Manual, Issue 2 (1995). cited by other .
Order Denying Request for Inter Partes Reexamination of U.S. Patent No. 7,499,716 (assigned Control No. 95/001,738) (Nov. 4, 2011). cited by other .
Order Denying Request for Inter Partes Reexamination of U.S. Patent No. 7,835,757 (assigned Control No. 95/001,739) (Nov. 4, 2011). cited by other .
Notice of Intent to Issue Reexamination Certificate ("NIRC") in Ex Parte Reexamination of 7,835,757 (Control No. 90/009,882), (Dec. 9, 2011). cited by other .
Examiner's Interview summary in Ex Parte Reexamination of 7,280,838 (Control No. 90/009,883), (Dec. 13, 2011). cited by other .
Patentee's Response after Non-Final Office Action in Ex Parte Reexamination of 7,280,838 (Control No. 90/009,883), (Nov. 28, 2011). cited by other .
Kaashoek, M. Frans, et al., "Dynamic Documents: Mobile Wireless Access to the WWW", IEEE Computer Society (Chs. 1-3) (1995). cited by other .
Chau, Jonathan, "Internet Explorer 3.0," Microsoft (Nov. 1, 1996). cited by other .
Lemay, Laura, "Teach Yourself WEB Publishing with HTML in 14 days" (1996). cited by other .
Wolfe, David, "Designing and Implementing Microsoft Proxy Server, Chapter 11" (1997). cited by other .
McFedries, Paul, "Windows 95 Unleashed," SAMS Publishing (Ch. 32) (1996). cited by other .
"GSM Originating Call Flow," EventHelix (2008). cited by other .
"GSM Terminating Call Flow," EventHelix (2004). cited by other .
"Eudora Mail Pro, Version 3.0 User Manual," QUALCOMM (pp. 30, 32, 50, and 53) (Jun. 1997). cited by other.

Primary Examiner: Nguyen; Tuan H
Attorney, Agent or Firm: Law Offices of Steven G. Lisa, Ltd. Kappes, Esq.; Jon E. Busch, Esq.; James D.

Parent Case Text

This application is a divisional of U.S. patent application Ser. No. 11/399,513, filed Apr. 7, 2006, which is a continuation of U.S. patent application Ser. No. 09/688,282, filed on Oct. 13, 2000 (now U.S. Pat. No. 7,039,428), which is a divisional of U.S. patent application Ser. No. 08/933,344, filed on Sep. 19, 1997 (now U.S. Pat. No. 6,253,061). The contents of the above referenced applications are incorporated herein by this reference.

Claims

What is claimed is:

1. A method that sends dynamic content to a cell phone, wherein the content is stored at a content storage and retrieval system that is coupled to the internet and coupled to a notification system, comprising: (a) causing a notification system to send a notification to the cell phone, the notification comprising an information identifier describing the content and an indication of the location of a specific system from among a plurality of systems to be contacted to trigger retrieval of the content; (b) subsequent to causing the notification to be sent to the cell phone, and prior to the cell phone requesting the content, causing the content to change without causing the notification system to send to the cell phone another notification of the changed content; and (c) subsequent to causing the content to change, causing the changed content to be transmitted to the cell phone upon receipt of the cell phone's request, the request corresponding to the notification.

2. The method of claim 1 further comprising maintaining a subscriber database comprising identifiers of a plurality of cell phones to which notifications should be sent.

3. The method of claim 2 further comprising accessing the subscriber database with either the content storage and retrieval system or the notification system.

4. The method of claim 1 wherein the indication of the location of a system comprises a system address.

5. The method of claim 1 wherein the system to be contacted to trigger retrieval of the content comprises a system other than the content storage and retrieval system.

6. The method of claim 1 further comprising receiving from the cell phone via a cellular data network a user's response to the retrieved content.

7. The method of claim 6 further comprising storing the user's response in the content storage and retrieval system.

8. The method of claim 7 further comprising forwarding the user's response to at least one other recipient.

9. The method of claim 1 wherein the notification further includes an indication of a time that the content will be available.

10. The method of claim 1, further comprising (d) the notification including a product promotion; (e) receiving from a recipient of the notification: (i) a request to purchase the product, and (ii) payment for the product; and (f) authorizing the recipient of the notification to receive the product.

11. The method of claim 1, wherein the act of causing the changed content to be transmitted to the cell phone upon receipt of the cell phone's request, as recited in element (c), comprises: (i) causing status information to be transmitted to the cell phone from the system to be contacted to trigger retrieval of the content; and (ii) causing the content to be transmitted from the content storage and retrieval system to the cell phone following receipt from the cell phone of a request that is based on the status information.

12. The method of claim 11, wherein the status information comprises an indication of a wrong identification.

13. A system that sends dynamic content to a cell phone, comprising: (a) a content storage and retrieval system that is coupled to the internet and configured to store content; (b) a notification system configured to send a notification to the cell phone, the notification comprising an information identifier describing the content and an indication of the location of a specific system from among a plurality of systems to be contacted to trigger retrieval of the content; (c) the content storage and retrieval system configured to store updates to the content, subsequent to the notification being sent to the cell phone and prior to the cell phone requesting the content, without causing the notification system to send to the cell phone a notification of the updates to the content; and (d) the content storage and retrieval system configured to cause the updates to the content to be transmitted to the cell phone subsequent to storing the updates to the content and following receipt of the cell phone's request.

14. The system of claim 13, wherein the indication of the location of an identification system comprises a system address.

15. The system of claim 14, wherein the content storage and retrieval system is configured to store the user's response.

16. The system of claim 15, wherein the content storage and retrieval system is configured to forward the user's response to at least one other recipient.

17. The system of claim 13 wherein the content storage and retrieval system is configured to receive from the cell phone via a cellular data network a user's response to the retrieved content.

18. The system of claim 13 wherein the notification further includes an indication of a time the content will be available.

19. The system of claim 13, wherein: (e) the notification includes a product promotion; (f) the content storage and retrieval system is configured to receive from a recipient of the notification: (i) a request to purchase a product promoted in the notification, and (ii) payment for the product; and (g) the system further configured to authorize the recipient of the notification to receive the product.

20. The system of claim 13, wherein: (e) the identification system to be contacted to trigger retrieval of the content is further configured to cause status information to be transmitted to the cell phone; and (f) the content storage and retrieval system further configured to cause the content to be transmitted to the cell phone following receipt from the cell phone of a request that is based on the status information.

21. The system of claim 20, wherein the status information comprises an indication of a wrong identification.

22. A method that sends dynamic content to a cell phone, wherein the content is stored at a content storage and retrieval system that is coupled to the Internet and coupled to a notification system, comprising: (a) causing a notification system to send a notification to the cell phone, the notification comprising an information identifier describing the content and an indication of the location of a system to be contacted to trigger retrieval of the content; (b) subsequent to causing the notification to be sent to the cell phone, and prior to the cell phone requesting the content, causing the content to change without causing the notification system to send to the cell phone another notification of the changed content; (c) subsequent to causing the content to change, causing the changed content to be transmitted to the cell phone upon receipt of the cell phone's request, the request corresponding to the notification. (d) the notification including a product promotion; (e) receiving from a recipient of the notification: (i) a request to purchase the product, and (ii) payment for the product; and (f) authorizing the recipient of the notification to receive the product.

23. A method that sends dynamic content to a cell phone, wherein the content is stored at a content storage and retrieval system that is coupled to the internet and coupled to a notification system, comprising: (a) causing a notification system to send a notification to the cell phone, the notification comprising an information identifier describing the content and an indication of the location of a system to be contacted to trigger retrieval of the content; (b) subsequent to causing the notification to be sent to the cell phone, and prior to the cell phone requesting the content, causing the content to change without causing the notification system to send to the cell phone another notification of the changed content; and (c) subsequent to causing the content to change, (i) causing error status information to be transmitted to the cell phone from the system to be contacted to trigger retrieval of the content; and (ii) causing the content to be transmitted from the content storage and retrieval system to the cell phone following receipt from the cell phone of a request that is based on the error status information.

24. The method of claim 23, wherein the error status information comprises an indication of a wrong identification.

25. A system that sends dynamic content to a cell phone, comprising: (a) a content storage and retrieval system that is coupled to the internet and configured to store content; (b) a notification system configured to send a notification to the cell phone, the notification comprising an information identifier describing the content and an indication of the location of an identification system to be contacted to trigger retrieval of the content; (c) the content storage and retrieval system configured to store updates to the content, subsequent to the notification being sent to the cell phone and prior to the cell phone requesting the content, without causing the notification system to send to the cell phone a notification of the updates to the content; (d) the content storage and retrieval system configured to cause the updates to the content to be transmitted to the cell phone subsequent to storing the updates to the content and following receipt of the cell phone's request; (e) the notification includes a product promotion; (f) the content storage and retrieval system is configured to receive from a recipient of the notification: (i) a request to purchase a product promoted in the notification, and (ii) payment for the product; and (g) the system further configured to authorize the recipient of the notification to receive the product.

26. A system that sends dynamic content to a cell phone, comprising: (a) a content storage and retrieval system that is coupled to the internet and configured to store content; (b) a notification system configured to send a notification to the cell phone, the notification comprising an information identifier describing the content and an indication of the location of an identification system to be contacted to trigger retrieval of the content; (c) the content storage and retrieval system configured to store updates to the content, subsequent to the notification being sent to the cell phone and prior to the cell phone requesting the content, without causing the notification system to send to the cell phone a notification of the updates to the content; (d) the content storage and retrieval system configured to cause the updates to the content to be transmitted to the cell phone subsequent to storing the updates to the content and following receipt of the cell phone's request; (e) the identification system to be contacted to trigger retrieval of the content is further configured to cause error status information to be transmitted to the cell phone; and (f) the content storage and retrieval system further configured to cause the content to be transmitted to the cell phone following receipt from the cell phone of a request that is based on the error status information.

27. The system of claim 26, wherein the error status information comprises an indication of a wrong identification.

Description

RELATED APPLICATIONS

Reference is made to the following patented patent applications: (1) Ser. No. 08/934,337 (now U.S. Pat. No. 6,259,892); (2) Ser. No. 08/934,143 (now U.S. Pat. No. 6,233,430); (3) Ser. No. 08/934,132 (now U.S. Pat. No. 6,087,956); (4) Ser. No. 09/860,954 (now U.S. Pat. No. 6,462,646); (5) Ser. No. 10/236,932 (now U.S. Pat. No. 6,696,921); (6) Ser. No. 09/688,321 (now U.S. Pat. No. 7,003,304); (7) Ser. No. 09/613,345 (now U.S. Pat. No. 6,459,360); (8) Ser. No. 11/049,869 (now U.S. Pat. No. 7,277,716); (9) Ser. No. 11/050,775 (now U.S. Pat. No. 7,155,241); (10) Ser. No. 11/082,913 (now U.S. Pat. No. 7,280,838); (11) Ser. No. 11/081,611 (now U.S. Pat. No. 7,376,432); (12) Ser. No. 11/082,872 (now U.S. Pat. No. 7,242,951); (13) Ser. No. 11/083,897 (status: pending); and (14) Ser. No. 11/399,513 (status: pending).

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention relates generally to systems and methods for selective paging and, more particularly, to paging systems and methods for selectively paging in response to messages received at a plurality of sources.

2. Discussion of the Background

In general, a paging receiver can be classified into one of four categories: an alert or tone only paging receiver, a numeric paging receiver, an alphanumeric paging receiver, or a voice paging receiver. One common characteristic of all of these paging receivers is that they monitor the air waves and notify the user when their particular address has been detected. For the alert or tone only paging receiver, the paging receiver would generate a tone or beep when its address is detected. The other paging receivers, upon detecting their address, would additionally store a message associated with the address signal and display or play it to the user. The message for a numeric paging receiver would be a set of numbers, typically the calling person's telephone number, and the message for an alphanumeric paging receiver would be a set of numbers and/or letters. The user of an alphanumeric paging receiver could therefore receive a message in the form of a telephone number with some descriptive text. For the voice paging receiver, the message that is stored is a voice message that the user can later play to hear the message.

A paging receiver is typically a rather small electronic device and, accordingly, has a limited amount of memory for storing messages that have been received from a base station in a paging system. Because of the relatively small size of the memory, the paging receiver can store only a limited number of messages. A user can delete messages from memory but will oftentimes desire to save a message, such as temporarily until the user makes a note of the message or until he or she is able to respond to the page. The messages that are saved in memory, however, reduce the space in memory that is available to receive new messages. This demand on space in memory is increasing as the size of the messages continue to grow and as users receive a greater number of messages. Although more memory can be added to accommodate more messages, the added cost and space needed for extra memory runs counter to the desires to keep the paging receiver small and inexpensive. A need therefore exists for a paging receiver which can display and/or play messages while efficiently using memory.

In addition to the demand on paging receiver memory, paging systems will be challenged as greater numbers of pages are being transmitted and as the size of the transmitted messages increases. Initially, when paging systems were only concerned with transmitting address signals of the paging receivers, the size of each transmission by the paging systems was relatively small. Paging receivers and paging systems, however, have undergone tremendous advances with paging systems now transmitting messages which can be hundreds of kilobytes or greater in size in addition to the address signals. Additionally, many paging receivers are actually paging transceivers which transmit acknowledgment signals back through the paging system. The capacity of the paging systems are therefore being challenged not only by messages of increasing sizes but also by reply signals transmitted from the paging transceivers to the paging system. The future of paging systems is therefore tied to the ability of the paging systems to control the number and size of the data transmissions and to provide additional features without sacrificing the quality of service to the user.

As discussed above, many paging transceivers are able to issue a reply or acknowledgment back to the base station in response to a received message. If the base station does not receive this reply or acknowledgment, then the base station assumes that the message has not been received and will repeatedly transmit the message until the reply or acknowledgment is received. Due to the high power levels at which the base station transmits its paging signals, the signals are usually easily received by all paging transceivers located within the coverage area of the base station antenna. The paging transceivers, on the other hand, must operate at lower power levels and often cannot transmit signals at sufficiently high levels to reach the base station. For example, when a paging transceiver is located in a basement of a building, in a subway, or in an airplane, the paging transceiver may be unable to issue a reply that can reach the base station. As a result, the base station may continue to transmit a page to a paging transceiver and the paging transceiver will continue to receive the message but the base station cannot detect the reply being issued by the paging transceiver. This unnecessary transmission of duplicate messages and the ineffectual reply signals transmitted by the paging transceivers consume valuable resources of the paging system and of the paging transceiver.

For safety reasons, a user may at times have to turn off his or her paging transceiver. For instance, when the user is on an airplane, the transmissions from the paging transceiver can interfere with the instrumentation or communication within the cockpit of the plane. The paging transceiver therefore should not be operating within the plane or around other electronic equipment that are sensitive to interference from the signals transmitted by the paging transceiver. As another example, if the user is in an environment that contains electronic detonators for explosive materials, the signals transmitted by the paging transceiver could possibly trigger an explosion. The user therefore must turn his or her paging transceiver off to ensure that it does not transmit any reply or acknowledgment signals in response to a received page. Although it may be dangerous for the paging transceiver to issue a reply signal in these situations, the signals transmitted by the base station may at times be safely received by the paging transceiver. Since the paging transceiver automatically issues a reply in response to a received message, the paging transceiver must nonetheless be turned off so as to not pose a risk to the user. During these times that the paging transceiver must be turned off, the user unfortunately is unable to receive any page or message. A need therefore exists for a paging transceiver that can notify a user of a message without automatically generating a reply message or acknowledgment to the base station.

SUMMARY OF THE INVENTION

The present invention solves the problems described above with methods and systems for selective paging. A paging system notifies a paging transceiver that a message has been received but does not initially transmit the associated message. The user, upon being notified of the message, can then download the entire message at a time convenient to the user, which allows the user to download messages at less expensive off-peak hours and allows the user to place the paging transceiver at a location where it can easily receive the message and reply to the message. Since the messages are not initially transmitted to the paging transceiver, the paging transceiver can receive and store a greater number of pages with minimal increase in the size of memory. Further, because entire messages are not automatically transmitted and since the user can position the paging transceiver to issue a sufficiently strong reply, traffic in the paging system can be controlled and actually reduced.

The system may transmit some identifying information about the page to the user without sending the entire message. For instance, the base station may identify the type of message, such as email, voice, or text, and also indicate the caller or other descriptive material about the message. The user can then determine the priority of the message and whether he or she wants to retrieve the message, play the message, erase the message, store the message, forward, reply, or otherwise act on the message. The user is also given control over the messages stored remotely from the paging transceiver and can erase or store these messages from the paging transceiver. The paging transceiver may have a timer for allowing the user to program the paging transceiver to perform a desired function on a message at a particular time.

The information initially sent to the user may also indicate the location of the stored message. For instance, the system paging a particular paging transceiver to notify it that a page has been received need not be the system actually storing the content of the message. Instead, a plurality of systems may store the contents of messages with one or more of the systems paging the paging transceiver. The paging transceiver would be provided sufficient information on the system storing the message so that it can communicate with this system. The system paging the paging transceiver can therefore act as a clearinghouse for other messaging systems by notifying a user of all messages received regardless of their source or type.

Accordingly, it is an object of the present invention to provide systems and methods for paging that conserve memory in paging transceivers.

It is another object of the present invention to provide systems and methods for paging that conserve valuable air time.

It is a further object of the present invention to provide systems and methods for paging that provide users with remote control over their messages.

It is yet another object of the present invention to provide systems and methods for paging that allow users to select when and how action should be taken on their messages.

It is yet a further object of the present invention to provide messaging systems and methods for notifying users of received messages.

It is also an object of the present invention to provide messaging systems and methods for providing control to users over messages stored at remote locations.

It is still another object of the present invention to provide messaging systems and methods that notify users of messages received from multiple sources.

BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings, which are incorporated in and form a part of the specification, illustrate preferred embodiments of the present invention and, together with the description, serve to explain the principles of the invention. In the drawings:

FIG. 1 is a block diagram of a paging transceiver according to a preferred embodiment of the invention;

FIG. 2 is a more detailed block diagram of the transceiver in the paging transceiver of FIG. 1;

FIG. 3 is a block diagram of a communication system according to a preferred embodiment of the invention;

FIGS. 4A and 4B are flow charts depicting an exemplary set-up routine for establishing communications between the system of FIG. 3 and the transceiver of FIG. 1;

FIG. 5 is a flow chart depicting a paging process;

FIG. 6 a flow chart depicting of process of notifying a paging transceiver of an unread message;

FIG. 7 is a flow chart depicting a process of receiving a page at the paging transceiver of FIG. 1;

FIG. 8 is a flow chart depicting a process of selecting a function at the paging transceiver of FIG. 1;

FIG. 9 is a generic flow chart depicting a selective process performed at the paging transceiver of FIG. 1 for executing a desired function;

FIG. 10 is a block diagram of a paging system having multiple systems for storing messages; and

FIG. 11 is a diagram of a data transmission for the system in FIG. 10.

DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS

Reference will now be made in detail to preferred embodiments of the invention, non-limiting examples of which are illustrated in the accompanying drawings. With reference to FIG. 1, a paging transceiver 100 according to a preferred embodiment of the invention comprises an antenna 1, a transceiver 2, a user interface 3, a controller 4, and a memory 5. The single antenna 1 is preferably used for both receiving and transmitting signals, although the paging transceiver 100 may comprise a separate antenna for transmitting signals and a separate antenna for receiving signals.

The transceiver 2 is connected to the antenna I and is for transmitting signals from the paging transceiver 100 and for receiving signals directed to the paging transceiver 100. The signals that may be transmitted to, or received from, the paging transceiver 100 include, but are not limited to, such signals as selective call signals, command data signals, signals corresponding to a message, and information data signals. The transceiver 2 may comprise a transceiver found in two way pagers or mobile radios and preferably comprises a transceiver commonly used in a portable mobile radiotelephone.

The transceiver 2 is connected to the user interface 3, which contains all necessary input and output devices. The user interface 3 includes a microphone, speaker, alert transducer, LED or LCD display, keypad, and necessary switches. The user interface 3 may also contain other types of input/output devices depending on the messaging application, such as a video display, camera, scanner, a printer, or a voice recognition device. The user interface 3 is not limited to these examples of user input/output devices but may comprise any input or output device which allows or assists communication between the user and the paging transceiver 100.

The transceiver 2 is connected to, and communicates with, the controller 4, which preferably comprises a digital signal processor (DSP) 4. The memory 5 is connected to the DSP 4 and is for storing messages or other types of information. The memory 5 may comprise static RAM, Dynamic RAM, Flash RAM, or any type of memory suitable for storing messages and allowing the retrieval of the messages. The amount of the memory 5 is preferably at least 4 MB for voice or text applications, although it may consist of a greater or lesser amount depending upon the specific message type application.

The transceiver 2, as shown in more detail in FIG. 2, includes an antenna interface 20 connected to the antenna 1 The antenna interface 20 directs signals received from antenna 1 to a receiver section 21 of the paging transceiver 100 and directs signals transmitted from a transmit section 24 to the antenna 1. The antenna interface 20 is preferably a duplexer, however an antenna switch or other device may be utilized to provide signal isolation between the receiver and transmitter sections 21 and 24. Alternatively, if paging transceiver 100 includes two antennas 1 with one for transmitting signals and the other for receiving signals, the transceiver 2 would not require any type of antenna interface 20.

The receive section 21 includes a receiver 22 and a receiver frequency synthesizer 23. The receiver 22 is connected to the antenna 1 through antenna interface 20 and receives the signals directed to the paging transceiver 100. The receiver frequency synthesizer 23, based on an input from a processor 27, selects the frequency at which the receiver 22 receives signals. The received signals are passed from the receiver 22 to the processor 27.

The transmit section 24 includes a transmitter 25 for receiving signals from the processor 27. The transmit section 24 also includes a transmitter frequency synthesizer 26 connected to the transmitter 25 which, based upon an input from the processor 27, selects the transmit frequency for the transmitter 25. The signals output by the transmitter 25 are supplied to the antenna interface 20 and then to the antenna 1.

The processor 27 comprises a central processing unit (CPU) having internal memory and switching capabilities. The CPU 27, for instance, comprises all necessary RAM and ROM memory, signal and data switching circuitry, signal processing circuitry, I-O Ports, and all standard program instructions and stored options commonly utilized in portable cellular telephones. The standard cellular telephone program instructions and CPU 27 may be obtained from a variety of suppliers. For instance, the instructions may be obtained from Wireless Link Inc. of Sunnyvale, Calif. and the CPU 27 from GEC Plessey Semiconductor, Inc. of Scotts Valley, Calif.

The DSP 4 includes necessary I-O and program memory and are commonly utilized in cellular telephones. Any suitable DSP may be used in the paging transceiver 100. Alternatively, the controller 4 may comprise another type of electronic device, such as a codec or digital-to-analog/analog-to-digital conversion circuit or other type of modulator-demodulator including memory interface circuitry coupled to message memory 5 for reading and writing of messages.

The transceiver 2 also preferably includes a delay circuit 28. The delay circuit 28 may comprise a timer which informs the processor 27 of when a period of time has expired. The timer, for instance, may expire at a certain time of day, week, or month, or may expire a fixed period of time after a triggering event, such as one hour after the event. The time at which the timer 28 expires is preferably programmable through the user interface 3 and through processor 27. Additionally, the timer 28 preferably comprises a plurality of timers for notifying the processor 27 of when a plurality of different time periods have expired. Rather than a timer, the delay circuit 28 may alternatively operate to delay the occurrence of an event until a certain condition is satisfied. This condition, for instance, may be the strength of received signals or the receipt of a specified signal. The purpose of the timer 28 will become apparent from the description below.

With reference to FIG. 3, a system 30 according to a preferred embodiment of the invention is interconnected to a base station 34, both of which are connected to the Public Switched Telephone Network (PSTN) or to other telephone company equipment 35. The system 30 comprises a paging terminal controller 31 which may comprise a controller circuit and associated memory having a database of subscriber listings and corresponding selective call address fields. The paging terminal controller 31 communicates with storage and retrieval unit 32 and correlates messages with subscriber listings. The storage and retrieval unit 32 may comprise a CPU or control circuit, message information and program memory, memory interface circuitry and a DSP with appropriate operational code for storage and retrieval of the desired messages. The input/output controller 33 contains all necessary input and output circuitry such as encoders and decoders, modems and required routing and control circuitry for communicating with the paging terminal controller 31, the storage and retrieval unit 32, the PSTN 35, and the base station 34.

A call setup routine 40 for establishing communication between the system 30 and base station 34 will now be described with reference to FIGS. 4A and 4B. At step 41, a connection, such as a telephone connection, is routed through the PSTN 35 or in the case of paging transceiver 100 the switch 36, to the input/output controller 33. The input/output controller 33 determines at step 42 whether the connection is with an automated signaling device or with a person. If the connection is with a person, then at step 48 the storage and retrieval unit 32 is activated to produce one or more voice responses during the call in order to guide the person throughout the process.

If, at step 42, the input/output controller 33 determines that the call is from a device, such as a paging transceiver 100 or computer terminal, data is exchanged between the paging transceiver 100 and system 30 at step 43. The type of data that may be exchanged includes, but is not limited to, the following types of data: identification data, command data, and information data. The data supplied from the PSTN 35 may also be exchanged at step 43 with this data including data for identifying the caller and subscriber, such as, for example, Caller ID and DNIS (Dialed Number Identification Service). Additionally, the data may be extracted from the base station 34. For example, the location of the paging transceiver 100 may be determined from a home location registry (HLR) and the HLR data may be utilized by the system 30 in order to determine the location of the paging transceiver 100, as opposed to having the paging transceiver 100 supply the location information to system 30.

After data is exchanged at step 43, the system 30 determines at step 44 whether an error occurred during the transmission between the system 30 and paging transceiver 100. If an error did occur, then at step 47 the process ends and the paging transceiver 100 is informed of the error. The error is preferably presented to the user in the form of status information produced at the user interface 3, such as with an alert tone or visual display on the LED or LCD display. An error may include, but is not limited to, the following errors: "system busy," "wrong ID," or "bill over due." If no error is detected, as determined by the system 30 at step 44, a function is enabled and executed at step 45. The function, as will be described in greater detail below with reference to FIG. 8, may be selected by the user from a group of available functions. At step 46, housekeeping functions are performed both at the paging transceiver 100 and at the system 30 and the call is terminated at step 47.

If the call is from a person as determined at step 42, then the caller is provided with a voice response at step 48 and, with reference to FIG. 4B, the caller is then verbally prompted at step 49 to enter information. At step 50, the caller sends data to the system 30, such as by pressing the telephone keypad to generate DTMF tones. The data that may be sent by the caller includes, but is not limited to, ID code, pass code, mail box number, and subscriber number. The system 30 may respond to voice commands from a caller by utilizing a readily available voice recognition system, such as those presently in use by the telephone company to except collect calls. At 51, the system 30 determines whether an error has occurred. If an error is detected, the caller may be given an opportunity to correct the error or, as shown, the process may end at step 56. If no error was detected by the system 30 at step 51, a message, such as a voice message, is recorded and stored in the storage and retrieval unit 32 at step 52. At step 53, the system 30 determines whether a return receipt or a reply message is requested. If a return receipt or reply message is requested, the return address is entered by the caller or optionally issued by the system 30 and is stored by the system 30 in the storage and retrieval unit 32 at step 54. The system 30, for instance, may detect the address signal of the incoming call and, by default, store this number as the return address. After the return address is stored at step 54 or if a return address is not requested, the stored message is cross referenced to selective call data corresponding to the intended paging transceiver 100 at step 55. Also at step 55, a flag is set in a transmission stack file at the paging terminal controller 31 for subsequently transmitting selective call signals representative of the selective call data to the targeted paging transceiver 100. Housekeeping is performed by the system 30 and the call ends at step 56.

The base station 34, as shown in FIG. 3, comprises a switch 36, a transceiver antenna 37, and a transceiver base station 38. In response to a received message, the system 30 passes control information to switch 36 for setting up a page call. The switch 36, for instance, may be a mobile telephone switching office (MTSO) for interfacing to the transceiver base station 38. In the send page mode, selective call signals having an address associated with the paging transceiver 100 are transmitted. The address may be an address code for a paging transceiver, a mobile telephone number (MIN) for a mobile radiotelephone, or type of identifying information for a communication device.

Command data and information data may also be communicated from the system 30 to the paging transceiver 100 through the base station 34. The command data and information data shall hereinafter be referred to as CI data, examples of which include the following: paging transceiver location, forward message, retrieve message, reply to message, paging transceiver ID, message identifiers, retrieval instructions, save message, erase message, message type, message length, time/date message received, system 30 ID, system 30 location, message address, message location, battery life, message identifier, format code, compression type, message age, message priority, alert codes, energy saving commands, memory status, program data, provisioning data, acknowledgment data and requests, function codes, sender name, current time, number of messages, mailbox number, phone number, return address, alpha numeric short messages, general command requests, group calls, and signal strength.

The address and command data and information may be transmitted over any suitable communication system. For instance, the data may be communicated over a paging system, a cellular system having short message service capabilities, such as GSM-SMS, a Cellular Digital Packet Data (CDPD) system, Personal Communications Services, or any other type of mobile radiotelephone system or communication system. Furthermore, the paging transceiver 100 preferably is able to communicate over more than one system, such as with both a paging network and a mobile radiotelephone network.

With reference to FIG. 5, a flow diagram 60 for performing a page call is shown. At step 61, the system 30 locates the current message flag from its transmission stack within paging terminal controller 31 and communicates with base station 34 for setting up a page call. The base station 34 transmits selective call signals and CI data to the targeted paging transceiver 100. At step 62, the system 30 determines whether an acknowledgment (Ack) was received from the paging transceiver 100 indicating that the page call was received. If an acknowledgment was not received, then at step 70 the system 30 determines whether an acknowledgment is a system 30 option. If an acknowledgment is required, then at step 71 the system 30 assigns the page call a priority in the transmission stack and eventually returns to step 61 for re-transmission. If the acknowledgment is received at step 62, the system 30 sets an acknowledgment flag (Ack flag) corresponding to the stored message.

If an acknowledgment is not a system requirement, as determined at step 70, or after posting the acknowledgment flag at step 63, the system 30 sets a timer at step 64 and waits a period of time before proceeding to step 65. At step 65, the paging terminal controller 31 determines if the stored message has been read. If the message has been read, then at step 66 the system 30 posts a read flag in the subscriber data base to indicate that the message was delivered and read and at step 67 the process ends.

If, at step 65, the message had not been read, then at step 68 the system 30 determines the priority of the message and proceeds to step 69. If the priority is high, as determined at step 69, then at step 61 the page call is returned to the transmission stack at the designated priority level for re-transmission. If, on the other hand, the priority is not high as determined at step 69, then the message has a low priority and the process ends at step 67.

An alternate routine 80 for notifying a paging transceiver 100 that an unread message is waiting is shown in FIG. 6. At step 81, the paging terminal controller 31 sorts through subscriber listings which have a corresponding unread and unnotified message in the storage and retrieval unit 32 and sends a page request to base station 34. At step 82, the switch 36 checks a home location registry (HLR) to determine the registered location and status of the remote paging transceiver 100. A page call is processed by transmitting selective call signals from transceiver base station 37 at step 82. If a page acknowledgment is desired for verification that the paging transceiver 100 recipient received the selective call signals, an Ack signal is manually or automatically transmitted from the paging transceiver 100 to base station 34 for storage in the subscriber database of paging terminal controller 31 at step 82.

At step 83, if an acknowledgement signal was received, a notified flag is set in the subscriber data base corresponding to the unread message stored in the storage and retrieval unit 32 and the paging process for the current unread message ends at step 84. If at step 83 an acknowledgment signal was not received, the message is assigned a new priority and the process is subsequently repeated. Optionally, a plurality of priorities may be assigned to acknowledged and not acknowledged unread messages so that the paging transceiver 100 is sent a number of calls until the message is read by the subscriber.

In the preferred embodiment, the base station 34 is part of a mobile radiotelephone network and the paging transceiver 100 is paged over the designated paging channel or the control channels of the network. In addition to paging the paging transceiver 100, the short messages or other data transmitted to the paging transceiver 100 are also preferably transmitted over the paging channel or control channels. Although the paging is preferably performed through a mobile radiotelephone network, the selective call signals may alternatively be routed to a paging system for transmitting an address code and CI data over an independent paging transmitter. In such a configuration, the paging transceiver 100 may be configured to have a separate paging receiver or transceiver compatible with the paging transmitter or paging transceiver. Since radio pager devices require much less energy than portable cellular telephones, a paging transceiver 100 configured with a low energy paging receiver would reduce energy required for receiving selective call signals and allow high energy circuitry of the paging transceiver 100 to be turned off until the user needs to retrieve or transmit messages. Other variations and modifications will be apparent to those skilled in the art.

A process 90 for receiving messages at a paging transceiver 100 is shown in FIG. 7. A selective call signal including an address is received by receive section 21 of the transceiver 100 at step 91. At step 92, the demodulated signal is processed by the CPU 27 to compare the received address with an address code stored in the CPU 27 memory. If the received address code does not match the stored address, flow returns to step 91 and the transceiver 100 continues to monitor transmissions for its address. When the address corresponds to the pre-stored address code, as determined at step 92, the CPU 27 stores and processes any corresponding received CI data at step 93.

Next, at step 94, the CPU 27 determines if an acknowledgment transmission is required by the paging transceiver 100. The CPU 27 may always enable an acknowledgment in order to confirm at the system 30 or base station 34 that the selective call signals were received by the targeted paging transceiver 100. Alternatively, the CPU 27 may never enable an acknowledgment from the transceiver 100, which is useful in explosive environments where transmissions are dangerous and in environments where a reply from the paging transceiver 100 may cause harmful interference to other electronic equipment. The CPU 27 may, as another option, enable an acknowledgment only when acknowledgment data is contained within the received CI data, such as with a remote request. Finally, the CPU 27 may enable an acknowledgment in response to a user-enabled command.

Returning to step 94, if the paging transceiver 100 allows for an acknowledgment then at step 95 the CPU 27 determines whether the acknowledgment is required or if the acknowledgment is a user option. If the acknowledgment is required to be automatic, then an acknowledgment flag is set at step 97. If, on the other hand, the acknowledgment is not automatic but rather optional, then at step 96 the CPU 27 determines whether an acknowledgment has been enabled. If the acknowledgment has been enabled, then the acknowledgment flag is set in step 97.

At step 98, the CPU 27 determines whether short messages may be transmitted. Short messages may include CI data or any type of short coded message which was pre-stored by the user in the paging transceiver 100. If short messages are enabled, at step 99 the CPU 27 sets the short message flag. At step 100, the paging transceiver 100 transmits all flagged data, including CI data, to the base station 34 for processing by the system 30. The CPU 27 generates status information corresponding to received CI data and passes any necessary user status information to the user interface 3 for visual and/or audible reception by the user. For example the user may hear an alert beep, feel an alert vibration, view an LCD indicating the number of unread messages, view an animated graphic display, hear a synthesized voice indicating that an urgent message is waiting, or receive other types of indications. At step 101, the CPU 27 performs house keeping functions and the routine ends.

FIG. 8 depicts a user function flow diagram 110 for user selectable function requests at the paging transceiver 100. At step 111, the user selects a function to be performed from available functions 112 to 117. These functions are exemplary functions that may be available and additional functions may exist. One or more of these functions are preferably selected through the user interface 3. One or more messages may be selected by the user to be forwarded to one or a plurality of addresses or recipients at step 112. Items such as messages and send message lists may be selected by scrolling through the message number or name. The selected messages for forwarding may reside at the paging transceiver 100 or at the system 30. The user may also select the function of saving a selected message at step 113. At step 114, selected messages are retrieved for reproduction and/or storage. At step 115, messages may be sent to one or a plurality of recipients, such as to another paging transceiver 100. At step 116, the selected message may be erased and at step 117, a reply may be sent to the originator of a selected message. With any of the functions selected at steps 112 to 117, the system 30 may act upon the entire information or, alternatively, may instead operate on only the message identifier. For instance, if the user selected the desired action of forwarding a message, the system 30 may send the entire message to a designated recipient or may instead send just the message identifier.

FIG. 9 depicts processing performed by the paging transceiver 100 in response to the selection of any one of the functions 112 to 117 shown in FIG. 8. At step 131, the function is identified by the CPU 27 and other processing occurs prior to step 132 where the CPU 27 determines whether a call is required. If a call is not required to perform the function, then at step 133 the CPU 27 performs the requested function and the process ends at step 140.

If, on the other hand, a call is required, then at step 134 the CPU 27 next determines whether a call is already in progress. If a call is in progress, the CPU 27 exchanges data with the system 30 and base station 34 at step 135 and the function is performed or executed at step 136. The data that is exchanged at step 135 includes a request signal that is sent from the paging transceiver 100 to the system 30 specifying the desired action and the particular information or message. If a call is not in progress, then at step 137 the CPU 27 preferably asks the user if a call should be made and receives the user's feedback at step 138. If the user elects not to call, then a delay occurs at step 141 with delay circuit 28.

As discussed above, the delay circuit 28 may be a timer which expires at a set time, such as at 1:00 a.m., when traffic and costs are low or may expire after a period of time, such as 1 hour. The set time or the period of time may be programmed by the user or may be determined by default values. Additionally, the delay circuit 28 may operate to delay operation until the signal strength is above a certain threshold. The delay circuit 28, in this example, may therefore comprise a level detector and a comparator circuit for comparing the signal strength to the threshold level. The delay circuit 28 would therefore advantageously delay the paging transceiver 100 from initiating communication until signal strength is sufficiently high. Moreover, the delay circuit 28 may alternatively comprise a communication monitor circuit for determining when the paging transceiver 100 is communicating before performing a function. Also, the delay circuit 28 may detect transmissions and trigger a certain event in response to a received communication. As an example, if the paging transceiver 100 receives a certain type of message or a message from a particular source or individual, the paging transceiver 100 may automatically perform a programmed action. The paging transceiver 100 would therefore be able, for instance, to automatically forward all messages received from one recipient to a designated person.

After the timer 28 is triggered or if the user decides to call now, then at step 139 the CPU 27 sets up a call to the base station 34. Once a call is established, then processing proceeds to step 135 for the exchange of data and then to step 136 for the performance or execution of the function. At step 140, the process ends. The process shown in FIG. 9 is not limited to the performance of a single function but also represents the processing if the user selects a number of functions. For example, the user may select the functions of retrieving a message at step 114 and forwarding a message at step 112 and these functions may be performed in unison with each other or sequentially one after the other.

The paging transceiver 100 and system 30 may exchange status information during messaging calls initiated by the paging transceiver 100 or by selective call, such as page calls, initiated by the system 30. The status information may contain information corresponding to messages stored within the paging transceiver 100 or within the system 30. For example, if the system 30 erases a message that has resided in its memory for too long a period of time, such as an unsaved, read message, the system 30 may inform the paging transceiver 100 that the message no longer exists. If the message identifier stored in the paging transceiver 100 no longer corresponds to a message stored in the system 30 or in the paging transceiver 100, the CPU 27 removes the identifier for the no-longer existing message.

When the forward message function 112 is selected, flow proceeds to step 131 where the CPU 27 reads information pertaining to the message or plurality of messages selected by the user to be forwarded. The information may include a message identifier, location data, message length, message type, destination addresses, or other CI type data as previously described. At step 132, the CPU 27 determines whether the message cannot be forwarded without communicating with the system 30. At step 134, the CPU 27 determines if a call is in progress. If a call is in progress, CI data is exchanged at step 135 with the system 30 for forwarding messages. If the messages to be forwarded are located at the system 30, the messages are simply flagged for forwarding to the appropriate addresses. At step 136, the messages are forwarded and confirmation is communicated to the paging transceiver 100. If the message is not located at system 30, the message is transmitted from the paging transceiver 100 to system 30 at step 136 and the process ends at step 140. If at step 134, it is determined that a call is not in progress, the user is asked if the message should be forwarded now at step 137. If at step 138 the user selects yes, a call is established with system 30 at step 139 and flow continues as previously described. If at step 138 the user responds that a call should not be made, the CPU 27 keeps the forwarding information in memory for forwarding the message during a subsequent call with system 30 and a delay occurs at step 141 with delay circuit 28, as described above. After the delay, a call is established with system 30 at step 139 and flow continues as previously described. The process ends at step 140.

In operation, the user selects a message or messages to be forwarded and also selects a recipient for receiving the message. If the message resides at the system 30, the message is simply forwarded to the addressed recipient. If the message is located in the paging transceiver 100, the message is first transmitted to the system 30 at step 135 before it can be forwarded to the intended recipient. In order to conserve time, the system 30 will not accept receipt of a message from the paging transceiver 100 if the same message already exists at the system 30. The system 30 will simply perform the required function with the already present duplicate message.

If the function selected is the save message function 113, then at step 131 the message identifier to be saved is read by CPU 27. At step 132, the CPU 27 determines if the message identifier selected corresponds to a message already stored in message memory 5 and if the selected function can be processed off-line. If yes, at step 133 the CPU 27 sets a save message flag in order to protect the message stored in message memory 5 from being over-written and the process ends at step 140.

If at step 132 the CPU 27 determines that the message is not stored at the paging transceiver 100, then at step 134 the CPU 27 determines whether a call is in progress. If a messaging call is in progress, CI data instructing the system 30 to save the message is sent. The system 30 flags the stored message and sends a message saved acknowledgment to the paging transceiver 100 at step 136. The CPU 27 converts the acknowledgment to status information and informs the user that the message is saved at the system 30 and the process ends at step 140. If at step 134, it is determined that the paging transceiver 100 is not currently in communication with the system 30, the CPU 27 flags the message identifier for saving and the user is asked if the call should be made now at step 137. If no, at step 138 the flag is kept for transmission to system 30 at a later time. A delay occurs at step 141 with delay circuit 28 as described above. After the delay, a call is established with system 30 at step 139 and flow continues as previously described. Transmission to system 30 may also take place at a later time, such as during a selective call to the paging transceiver 100 or during a messaging call to system 30. If yes, then the CPU 27 sets up a call at step 139 for transmitting the save flag and CI data as previously described.

When the retrieve message function is selected at 114, then at step 131 the message identifiers corresponding to messages to be returned are read from the CPU 27 memory for retrieving the message. Additionally, the CPU 27 may read message location information, system ID information, address information, message length information, and/or message type information as previously described. At step 132, the CPU 27 determines the location of the message and determines if a call to system 30 is required. If the message is stored in message memory 5, then at step 133 the CPU 27 retrieves the message. The message, for instance, may be an audio message, visual message, text message, or electronic signal intended to be transferred to another device.

At step 132, if the message does not reside in message memory 5, the CPU 27 determines that a call is required to retrieve the message and, at step 134, determines if a call is in progress. If a call is in progress, CI data, such as which messages to retrieve, message length, message type, and message identifier, is exchanged at step 135. At step 136, the message is retrieved and simultaneously stored in message memory 5 by the DSP 4. The appropriate status information corresponding to the message is stored by the CPU 27 in its memory and the process ends at step 140. If at step 134 a call is not in progress, the user is asked if the call should be made now or if during another call at step 137. At step 138, if the user chooses to place the call, the call is set up at 139. If the user chooses to delay the call at step 141 until another session or some later time, the message is left flagged for retrieval at the next session or some later time and the process ends at step 140. With the timer 28, the message may be retrieved at a chosen time or a retrieval instruction may be sent from system 30 to paging transceiver 100 for causing the paging transceiver 100 to automatically retrieve a message or plurality of messages at a time designated by system 30. For example it may be desirable to have emergency weather information automatically retrieved during night-time hours when telephone line charges and air time charges are less expensive. The above described options may also be utilized for forwarding messages, erasing messages, saving messages, sending messages, and replying to messages as will be shown in more detail hereinafter.

With the send message function 115, in order to send a message, the message must first be stored at the paging transceiver 100 or at the system 30. The process of storing or recording messages is well know to those of ordinary skill in the art and accordingly will not be described in further detail. Examples of these devices are described in U.S. Pat. No. 4,602,129 to Matthew, et al., titled "Electronic Audio Communications System With Versatile Message Delivery," and in U.S. Reissued Pat. No. Re. 34,976 to Helferich et al, titled "Analog/Digital Voice Storage Cellular Telephone," both of which are incorporated herein by reference. The system 30 and paging transceiver 100 can record, store and retrieve a plurality of different types of messages as previously described depending on the application required.

If the send message function 115 is selected, the CPU 27 identifies the message to be sent and cross references it to the selected recipient address information. At step 132, the CPU 27 determines whether a call is required. The subsequent processing of sending a message should be apparent from the description above for forwarding a message and accordingly will not be duplicated in order to simplify description of the invention. The message to be sent may reside in the paging transceiver 100 or in the system 30. If the message resides in the system 30 and in the paging transceiver 100, the message in the system 30 corresponding to the CPU 27 message identifier will be sent in order to conserve air time. If the message does not reside in system 30, the message will be sent from the paging transceiver 100 to the system 30. If the message is to be sent from the paging transceiver 100, the message may be a pre-stored message or alternatively, the message may be transmitted to system 30 by paging transceiver 100 in real time during a call session between system 30 and paging transceiver 100.

If the erase message function is selected at step 116, the erase message function allows a user to erase messages stored at the system 30 or at the paging transceiver 100 depending on the mode of operation. A message may be erased at a paging transceiver 100 without erasing the message identifier. If a message is erased at the paging transceiver 100 and the identifier still exists in message memory 5, the message can be retrieved from the system 30. In order to remove a message identifier at the paging transceiver 100, the message must be erased at the system 30. This feature causes the user to manage the messages at the platform, thereby conserving memory space at the storage and retrieval unit 32. At step 131, the selected message to be erased is identified and the user is asked if the selected message in the paging transceiver is to be erased or if both copies of the message are to be erased. If the local message only is selected to be erased, the message identification information is kept and at step 133 the CPU 27 flags the message stored in memory 5 for erasure or overwriting. In other words, the message still exists but may be over-written by another message when memory space is required and, until then, may be retrieved from message memory 5. If at step 132 a decision was made to erase both copies of the message, then at step 134 the CPU 27 determines if a call is in progress. If yes, at step 135 the CI data is exchanged instructing system 30 to erase the message. At step 131, the system 30 transmits an acknowledgment that the message was erased, the CPU 27 flags the local message for erasure, the identifier is removed and both copies of the message and the identifiers are erased.

If at step 134 the CPU 27 determines that a call is not in progress, the CPU 27 at step 137 erases the local message and the user is asked if the system 30 copy of the message needs to be erased now. If the user responds yes, the call is established at step 139 and the process continues as previously described. If the user responds, the necessary flags are set for erasing the remote message during the next communication with system 30 after the delay of step 141 and the timer 28 is activated. The timer 28 may be utilized for a timed erase of the message stored at system 30.

The message reply function 117 is for sending a reply to an already received message. A reply message utilizes the same process as the send message function except that a return address is already correlated to the message targeted for a reply. During the send message function 115, the user is required to select an address or destination for the message to be sent In other words, the user must know the destination or address in advance. The message reply function 117 does not require that the user know the address of the recipient because the message being replied to has a corresponding return address. As with the send message function 115, a reply message may be sent in real time or it may be pre-recorded and stored in the paging transceiver 100 for transmission to system 30. Additionally, the reply transmission may be delayed for a set period of time as previously described with timer 28.

In summary, as discussed above with reference to FIGS. 5 and 6, the system 30 does not transmit the entire message to the paging transceiver 100 but rather notifies the user that a message is waiting. The paging transceiver 100, as discussed above with reference to FIG. 7, stores data associated with the page and possibly a short message. The user can then select a desired one of plurality of available functions, such as those shown in FIG. 8, and the paging transceiver 100 will process the request in accordance with FIG. 9.

With the system 30 and paging transceiver 100, the paging transceiver 100 can notify a user of a message without receiving the entire message. The user can then decide to act upon the message at a time convenient to the user. Rather than receiving the message with the alert, as occurs with conventional paging receivers, the user can control the time when he or she wants to receive a message and may even decide not to retrieve the message. After the user has been notified, the user can then control the paging transceiver 100 to retrieve the message from the system 30, to save the message at either the system 30 or paging transceiver 100, to forward the message to an indicated recipient, to reply to the message, or to erase the message from the paging transceiver 100 or from the system 30.

With paging transceiver 100, the user can position the paging transceiver in a desired location before initiating communication with the system 30. Thus, if the user is paged by system 30 while the user is in a subway, basement, or on an airplane, the user can postpone the delivery of the message until the paging transceiver 100 is in a better location to receive and reply to the message. Similarly, the user may be in an explosive environment or near sensitive electronic equipment and may postpone delivery of the message and a reply from the paging transceiver 100 until the user is out of the explosive environment or far enough away from the sensitive electronic equipment. The paging transceiver 100 and system 30 therefore give the user control over the messages stored in the system 30.

The paging transceiver 100 and system 30 conserve both valuable air time and also paging transceiver message memory 5. The system 30 does not automatically deliver each message to the intended paging transceiver 100 but instead allows the user to exercise control over the message. Since a message may be many bytes in length, perhaps kilobytes, megabytes, or even greater, the benefit to the system 30 and to the base station 34 in not having to transmit each message can be quite substantial. Also, since each message is not automatically delivered to the paging transceiver 100, the paging transceiver 100 does not become overloaded with messages and instead the user can choose to act on selective messages, such as by retrieving only certain messages. The user, additionally, may decide not to act on any of the messages through base station 34 and may call the system 30 through the PSTN 35, thereby bypassing the base station 34 and its associated charges and expenses.

The paging transceiver 100 and system 30 are not limited to voice messages in a paging system. Rather, the paging transceiver 100 and system 30 may operate with any type of message or information, including, but not limited to numeric messages, alphanumeric messages, voice or other audio messages, video messages, graphics or even data. The paging transceiver 100 may be a separate paging transceiver, may be integral with a mobile radiotelephone, or may be incorporated into other devices.

For instance, the paging transceiver 100 may be integrated into a portable radio, CD, or tape player. The paging transceiver 100 could receive messages from system 30 which indicate portions of songs that may be sampled by the user. The user may browse through a listing of available music and select a desired song. The paging transceiver 100 then communicates with the system 30 to retrieve the selected song and the user can then play the song at the paging transceiver 100.

As another example, the messages may be video messages which the user can browse through and select only desired messages. The paging transceiver 100 may be integral with a television set and the video messages may be promotions for new movies or shows. Alternatively, the paging transceiver 100 may be integral with a game console and the video messages may be clips of new games that are available with that game console. Other applications for the paging transceiver 100 and system 30 will be apparent to those skilled in the art.

The information or message available to a paging transceiver 100 need not be static but instead may be dynamic. In other words, when a paging transceiver 100 is alerted that information is available, the information may be updated or otherwise change from the time that the user was alerted. As an example, the user may receive a weather alert and by the time the user decides to receive the information the information would be updated to reflect current weather conditions. The identifier for the information therefore does not limit the content that may be stored as the information available to the user.

The system 30 is not limited to transmitting only one alert at a time to one paging transceiver 100. Instead, the system 30 may send a plurality of alerts to a single paging transceiver 100 and each of those alerts may be broadcast to a plurality of paging transceivers 100. For instance, the system 30 may broadcast information to a plurality of transceivers 100 that share a common set of numbers within their mobile identification numbers. If the system 30 sends a plurality of alerts to a paging transceiver 100, these alerts may be displayed by the user interface 3 and the user can scroll through and act upon the messages as desired.

As discussed above, the system 30 and paging transceiver 100 allows information to be remotely acted upon by the paging transceiver 100. The system 30, however, also allows users access to their information via conventional ways, such as the PSTN 35. Therefore, a user may receive the alert with a paging transceiver 100 and decide to call in through the PSTN 35 to listen or otherwise act upon the message. The system 30 preferably is connected to the Internet whereby users can also gain access and act upon their information via the Internet.

The paging transceiver 100 preferably alerts the user both when a message identifier signal has been received and when complete messages have been received. The alerts may comprise any suitable indication to inform the user that the paging transceiver 100 has received a communication, such as a tone, vibration, or visual display. The alerts for a received identifier and for a received message are preferably different so as to allow a user to easily differentiate between the two communications.

The example provided in FIG. 3 was a single system 30 for storing messages on behalf of a plurality of paging transceivers 100. The invention, however, may include any number of systems 30 for storing messages with each system 30 storing information for a transceiver 100 being considered a content provider. For instance, as shown in FIG. 10, a messaging system 200 may comprise a plurality of systems 30 connected to the PSTN 35 with system 30A being associated with base station 34A and transceiver antenna 37A and system 30B being associated with base station 34B and transceiver antenna 37B. Although three systems 30 are shown, the system 200 may include any number of systems 30 and, although two base stations 34 are shown, each system 30 may be associated with a base station 34 and transceiver antenna 37 or only one of the systems 30 may be associated with a base station 34 and transceiver antenna 37. Furthermore, each system 30 need not include a paging terminal controller 31 or a storage unit 32. System 30C, for instance, may include a storage and retrieval unit 32 and input/output controller 33 but not a paging terminal controller 31 and may page the paging transceiver 100 through the paging terminal controller 31 in system 30A. Conversely, a system 30, such as system 30A, may include a paging terminal controller 31 and an input/output controller 33 but not a storage and retrieval unit 32. Further, the input/output controller 33 need not be a separate unit but may be incorporated into the paging terminal controller 31 if the system 30 does not include a storage and retrieval unit 32, or into the storage and retrieval unit 32, if the system 30 does not include a paging terminal controller 31. The systems 30 and base stations 34 may communicate with each other through the PSTN 35 or through links or lines other than or in addition to the PSTN 35, such as through an SS7 backbone of a wireless network or through the Internet.

Additionally, each of the base stations 34A and 34B may be part of a paging network but are preferably part of a cellular network. Either one or both of base stations 34A or 34B may page the paging transceiver and either one or both of the base stations 34A or 34B may deliver the contents of messages to the paging transceiver. Each of the systems 30A, 30B, and 30C may store messages on behalf of a user with the messages being of the same or different types. Furthermore, the messages stored within a single system 30 may be all the same type or may differ from each other.

As an example, system 30A may store voice mail messages and email messages directed to the user's office, system 30B may store voice mail messages directed to the user's home, and system 30C may store audio messages. The base station 34A acts as a clearinghouse for all messages delivered to the user to any of the systems 30 and pages the paging transceiver 100 whenever a message is received. Thus, when a voice mail message or email message is received at system 30A, the system 30A delivers a page to base station 34A which is then delivered to paging transceiver 100. When a voice message is received at system 30B, the system 30B sends information about the message to system 30A and system 30A then delivers a page to base station 34A for delivering the page to the paging transceiver 100. Similarly, when system 30C has an audio message it notifies system 30A and system 30A acts to have the page delivered to the paging transceiver 100.

An example of the data transmission 201 sent from system 30B or 30C to system 30A is shown in FIG. 11. The data transmission 201 includes system ID information for identifying the system 30 from a potential plurality of systems 30. The system ID information may be an address code or may comprise the telephone number of the system 30 and may be automatically captured by system 30A, such as from Caller ID or from DNIS information. The data message 201 also identifies the paging transceiver(s) 100, such as with an address code or MIN. For many systems 30, the message or information stored will often be for a single user whereby the transceiver ID would be the address code or MIN for that single paging transceiver 100. For other systems 30, however, the system 30 may want to broadcast a single message to a plurality of paging transceivers 100 whereby the transceiver ID may be a code that identifies a predefined group of paging transceivers 100.

The data transmission 201 also includes message information. The message information includes information identifying the message and preferably also includes information specifying the type of the message, the length of the message, and the message priority. The message identification may identify the message with a unique code, such as a number, or may specify the address in system 30 for the message. The message type advantageously indicates whether the message is a voice message, email message, audio message, video message, or text message. The message length indicates the size of the message and the message priority indicates the priority level of the message. For instance, the user can designate priorities based upon the telephone number of the caller leaving the message or the priority may be set by the caller. Although the data transmission 201 preferably includes this information, the data transmission 201 may include additional or fewer fields than the example provided in FIG. 11.

The data transmission 201 also includes additional information that may be relayed and presented to the user. For instance, for many systems 30 that receive and store messages on behalf of the user, the additional descriptive information preferably comprises a return address for identifying the caller's telephone number to inform the user as to who left the message. For other systems 30 which may generate their own information, the additional information preferably describes the information available to the user. For instance, for a system 30 that allows users to sample songs, the additional information would indicate the title and the artist of the song and may also specify the cost to retrieve and play the song. Other uses of the additional information will be apparent to those skilled in the art.

The page sent to the paging transceiver 100 includes most, if not all, of the data transmission 201. The information transmitted to the paging transceiver 100, with reference to FIG. 7, may be inserted into a short message transmitted to the user at step 98. From the system ID information, the paging transceiver 100 can determine which system 30 it needs to respond to in order to act upon a message. For instance, system 30A may page the paging transceiver 100 and indicate that system 30B has a stored message. If the user selects the retrieve message function, then the paging transceiver 100 can contact system 30B through base station 34B to retrieve the desired message. The paging transceiver 100 as discussed above may instead respond to base station 34A to retrieve the message and base station 34A would communicate with system 30B to retrieve or otherwise act upon the message.

The message information is used by the paging transceiver 100 to inform the user of the message or information stored at the system 30. The message type, length, priority, and additional descriptive material may be displayed or otherwise indicated to the user at the paging transceiver 100. From this information, the user can decide what type of action to take upon the message or information at the system 30.

As described with reference to FIG. 9, a call to the system 30 may be required in order for the paging transceiver 100 to perform a desired function. If a call is required, the paging transceiver 100 relays information in the data transmission 201 to the system 30. If the paging transceiver 100 responds to a system 30 other than the one storing the message or information, the paging transceiver 100 identifies the system 30 storing the message or information and also identifies the message. As discussed above, the message may be identified in a number of ways, such as with a message code or by specifying the location in memory where the message is stored. The call to the system 30 would automatically provide the transceiver identification information to the system 30, although the paging transceiver 100 could provide this information with the other information provided to the system 30.

Upon receiving a call from the paging transceiver 100, the system 30 reads the transceiver identification and message information to find the information requested by the paging transceiver 100. The information obtained from the paging transceiver 100 at the system 30 and the transfer of the requested information to the paging transceiver occurs at step 135 in FIG. 9.

The system 200 can present substantial cost savings to conventional paging systems. With a conventional paging system, the entire message is transmitted to the location of the paging transceiver 100. For instance, if the user's home base is in Chapel Hill, N.C., and the message originates in Chicago, Ill., then the message is typically sent over the PSTN 35 to the home base. With nationwide paging, the user may have traveled to San Diego, Calif. whereby the home base would then send the entire message from Chapel Hill to San Diego. With system 200, on the other hand, only the data transmission 201 is transmitted from Chicago to Chapel Hill and from Chapel Hill to San Diego. The actual message, in contrast, is sent directly from the storage facility in Chicago to San Diego, thereby reducing charges associated with the transfer between Chicago and Chapel Hill. Moreover, the data transmissions 201 between systems 30 may occur over the Internet. These transmissions, for instance, may be formatted according to the Voice Profile for Internet Mail (VPIM) and the addresses of the transceivers 100 may be determined from an open directory service, such as the Lightweight Directory Access Protocol (LDAP) or X.500.

The systems 30 and 200 allow a user to easily manage the multitude of messages that are commonly received every day. Conventionally, a user would have to call in to the office voice mail to retrieve voice messages, call home to retrieve voice messages sent to the house, and connect with the computer network at the office to retrieve email messages. Although paging systems have been used to notify a user that a voice mail message or other message has been received, the user would still have to call in to a separate system to actually retrieve the message. The system 200, on the other hand, enables a user to be notified of all messages, regardless of their type and regardless of their location and furthermore allows the user to selectively retrieve, save, erase or perform other functions on the messages. The systems 30 and 200 and paging transceiver 100, moreover, allow the user to exercise control over the remotely stored messages; the user can selectively store, save, retrieve, erase, forward, send or otherwise perform operations on messages stored at a remote location.

The forgoing description of the preferred embodiments of the invention has been presented only for the purpose of illustration and description and is not intended to be exhaustive or to limit the invention to the precise forms disclosed. Many modifications and variations are possible in light of the above teaching.

The embodiments were chosen and described in order to explain the principles of the invention and their practical application so as to enable others skilled in the art to utilize the invention and various embodiments and with various modifications as are suited to the particular use contemplated.

* * * * *

Current U.S. Class:	455/412.2 ; 455/412.1; 455/456.1
Current International Class:	H04M 1/725 (20060101); H04M 1/663 (20060101)
Field of Search:	455/3.06,412.1,412.2,413,414.1,456.1,458,466