Slot assignment algorithm

Multiplex communications – Diagnostic testing – Determination of communication parameters

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S329000, C370S468000, C455S452200

Reexamination Certificate

active

06940824

ABSTRACT:
The present invention provides scheduling algorithms that guarantee minimum data transport service for even ATs with poor channel conditions. Data-requesting ATs are divided into a number (Ng1) of AT groups according to their channel conditions. Also, a recurring sequence of time slots is defined on the TDMA channel and partitioned into a number (Ng2) of slot groups, where Ng2is made larger than Ng1. Generally, slot assignment according to the present invention is a two-step process. First, in the sequence, the slot groups are allocated to the AT groups so that AT groups with better channel conditions will receive more slot groups while each AT group will receive at least one slot group. Second, in each AT group, the time slots allocated to an AT group are assigned to the individual ATs in the group. By assigning more slot groups to AT groups with better channel conditions, the algorithm will optimize the overall data throughput. By assigning at least one slot group to each AT groups, the algorithm will guarantee minimum service to ATs with poor channel conditions.

REFERENCES:
patent: 5914950 (1999-06-01), Tiedernann, Jr. et al.
patent: 6587443 (2003-07-01), Dutta
patent: 2002/0193133 (2002-12-01), Shibutani
patent: 0 975 190 (2000-01-01), None
patent: 0 986 282 (2000-03-01), None
patent: 2000-059400 (2000-02-01), None
patent: 2003-508992 (2003-03-01), None
patent: WO 99/09779 (1999-02-01), None
patent: WO 01/17311 (2001-03-01), None
F. Adachi et al., “Wideband DS-CDMA for Next-Generation Mobile Communications Systems”, IEEE Communication Magazine, vol. 36, pp. 56-69, Sep. 1998.
3rdGeneration Partnership Project 2, “cdma 2000 High Rate Packet Data Air Interface Specification”, 3GPP2 C.S0024, Sep. 12, 2000.
A. Jalali et al., “Data Throughput of CDMA-HDR a High Efficiency-High Data Rate Personal Communication Wireless System”, IEEE VTC2000-Spring, pp. 1854-1858, Tokyo, May 2000.
T. Ue et al., “Symbol Rate and Modulation Level-Controlled Adaptive Modulation/TDMA/TDD System for Personal Communication Systems”, IEEE Vehicular Technology Conference 0098-3551, vol. 45/V1, pp. 306-310, Jul. 1995.
S. Sampei et al., “Adaptive Modulation/TDMA Scheme for Large Capacity Personal Multi-Media Communication Systems”, IEICE Trans. Commun., vol. E77-B, No. 9, Sep. 1994.
A. Yamaguchi et al., “Forwardlink Packet Scheduler for Packet Data System”, IEICE General Conference, Mar. 26-29, 2001.
A. Fujiwara et al., “Link Adaptation Method Using Fading Frequency for High-Speed Packet Transmission with Adaptive Modulation and Coding Scheme in DS-CDMA Mobile Radio”, IEICE, The 2000 Communications Society Conference, B-5-79, p. 367, Sep. 30-Oct. 3, 2000.
K. Higuchi et al., “Throughput Performance of High-Speed Packet Transmission Using Multi-Level Mudolation in W-CDMA Forward Link”, IEICE, The 2000 Communications Society Conference, SB-11-7, pp. 531-532, Sep. 30-Oct. 3, 2000.
N. Kinoshita et al., “Field Experiments on 16QAM/TDMA and Trellis Coded 16QAM/TDMA Systems for Digital Land Mobile Radio Communications”, IEICE Trans. Commun., vol. E77-B, No. 7, Jul. 1994.

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

Slot assignment algorithm does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Slot assignment algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Slot assignment algorithm will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3422898

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