Overhead message and channel hashing method using the same

Multiplex communications – Communication over free space – Combining or distributing information via time channels

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S342000, C370S235000

Reexamination Certificate

active

10635783

ABSTRACT:
An overhead message and a method of performing channel hashing using the same are provided. The overhead message includes first and second fields of an extended CDMA channel list message (ECCLM). The first field contains information indicating whether the ECCLM includes at least one frequency assignment of list of frequency assignments that allows packet data support for a forward packet data channel or a 1×EV-DV system and the second field indicates whether each frequency assignment allows such support, thereby enabling channel hashing to be performed by a packet-data-supportable mobile station of a communication system.

REFERENCES:
patent: 5768267 (1998-06-01), Raith et al.
patent: 6381235 (2002-04-01), Kamel et al.
patent: 6952583 (2005-10-01), Park et al.
patent: 2002/0141371 (2002-10-01), Hsu
patent: 2003/0161283 (2003-08-01), Tiedemann et al.
patent: 2003/0174674 (2003-09-01), Lee et al.
patent: 2004/0266445 (2004-12-01), Burgess et al.
patent: 2006/0246885 (2006-11-01), Lee

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Overhead message and channel hashing method using the same does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Overhead message and channel hashing method using the same, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Overhead message and channel hashing method using the same will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3837488

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.