Semi-static code space division for multiple shared packet...

Multiplex communications – Communication over free space – Having a plurality of contiguous regions served by...

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S342000, C370S441000, C370S337000

Reexamination Certificate

active

06952410

ABSTRACT:
A method of providing an efficient channel structure for a communication system that uses codes to define its communication channels. Available codes form a code space that is equally divided into M tiers based on load conditions; M is an integer equal to 1 or greater. Information is scheduled to be transmitted during a particular time slot and is assigned to a particular tier. The information is transmitted during the scheduled time slot using all of the codes of the assigned tier.

REFERENCES:
patent: 5533013 (1996-07-01), Leppanen
patent: 5577024 (1996-11-01), Malkamaki et al.
patent: 6064662 (2000-05-01), Gitlin et al.
patent: 6275488 (2001-08-01), Cudak et al.
patent: 6490262 (2002-12-01), Hogger
patent: 6526036 (2003-02-01), Uchida et al.
patent: 6535503 (2003-03-01), Toskala et al.
patent: 6590878 (2003-07-01), Uchida et al.
patent: 6611509 (2003-08-01), Hayashi et al.
patent: 2002/0003782 (2002-01-01), Pan et al.
patent: 2002/0034171 (2002-03-01), Smith et al.
patent: 1 187 371 (2002-03-01), None

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

Semi-static code space division for multiple shared packet... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Semi-static code space division for multiple shared packet..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Semi-static code space division for multiple shared packet... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3455919

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