公开(公告)号：JP2002232431A

公开(公告)日：2002-08-16

申请号：JP2001366200

申请日：2001-11-30

Applicant: LUCENT TECHNOLOGIES INC

Inventor： BALOGH DAN ANTHONY ,  BURGESS JOHN K ,  KIANG T ROGER ,  VITEBSKY STANLEY

IPC: H04B1/74 ,  H04L12/28 ,  H04L12/56 ,  H04W72/14 ,  H04Q7/22 ,  H04Q7/24 ,  H04Q7/26 ,  H04Q7/30

Abstract: PROBLEM TO BE SOLVED: To provide a method for more efficiently using SCH(supplemental channel) resources for a SCH by minimizing a gap between data bursts due to overhead delay. SOLUTION: The gap is minimized by prospectively assigning the SCH resources supporting existing SCH by using a supplemental channel sharing algorithm and scheduling the future issuance of DNR(data notify request). The SCH resources which are currently unavailable are prospectively allocated based on the states of the SCH resources. An existing SCH means an SCH to which data burst is currently being transmitted.

公开(公告)号：JP2002353937A

公开(公告)日：2002-12-06

申请号：JP2002137328

申请日：2002-05-13

Applicant: LUCENT TECHNOLOGIES INC

Inventor： BURGESS JOHN K ,  MEIER STEVEN KENT ,  PALM CHRISTOPHER D ,  WELSH STEVEN M

IPC: H04B1/69 ,  H04J11/00 ,  H04J13/00 ,  H04J13/18

Abstract: PROBLEM TO BE SOLVED: To implement Walsh code allocation, so that an amplifier is operated non-linearly and the risk of unwanted interferences can be prevented or minimized, that is a peak/average power ratio can be kept equal to or lower than the allowable level. SOLUTION: In the method for allocating a CDMA code from the set of CDMA codes, to be used together with a wireless communication network, after a step for identifying the desired size of a code to be allocated, this method is provided with a step for determining whether a code of the desired size whose sibling exists. When such a code is discovered, that code is allocated. Otherwise, it is determined whether a code smaller than the desired size whose siblings unavailable. When such a code (a code smaller than the desired size whose sibling is unavailable) is discovered, a descendant thereof having the desired size is allocated.

公开(公告)号：CA2379720C

公开(公告)日：2005-12-27

申请号：CA2379720

申请日：2002-04-02

Applicant: LUCENT TECHNOLOGIES INC

Inventor： WELSH STEVEN M ,  PALM CHRISTOPHER D ,  MEIER STEVEN KENT ,  BURGESS JOHN K

IPC: H04B1/69 ,  H04J11/00 ,  H04J13/00 ,  H04J13/18 ,  H04B7/216

Abstract: A method of allocating CDMA codes from a set of the same is provided for u se in connection with a wireless network. The method includes, after identifyin g a desired size of the code to be allocated, determining if there exists a code of the desired size whose sibling is unavailable. If such a code is found, then it is allocated. Otherwise, it is determined if there exists a code of smaller than the desired size whose sibling is unavailable. When such a code (i.e., a code of smaller than the desired size whose sibling is unavailable) is found, a descendant thereof which has the desired size is allocated.

公开(公告)号：DE60109717T2

公开(公告)日：2006-02-02

申请号：DE60109717

申请日：2001-06-11

Applicant: LUCENT TECHNOLOGIES INC

Inventor： BALOGH DAN ANTHONY ,  BURGESS JOHN K ,  KIANG T ROGER ,  VITEBSKY STANLEY

IPC: H04B1/74 ,  H04L12/28 ,  H04L12/56 ,  H04L29/06 ,  H04W72/14

Abstract: Disclosed is a method for utilizing SCH resources more efficiently for supplemental channels (SCH) by minimizing gaps between data bursts due to overhead delays. Such gaps are minimized using a supplemental channel sharing algorithm to prospectively assign SCH resources supporting existing SCHs and to schedule future issuance of data notify requests DNRs such that currently unavailable SCH resources may be prospectively assigned based on states of the SCH resources, wherein an existing SCH is a SCH over which a data burst is currently being transmitted. For this purpose a data burst is followed by a preferred used assignment window (PUA), indicating the current user, a waiting user assignment window (WUA) and an expired reassignment window (ERA).

公开(公告)号：AT292360T

公开(公告)日：2005-04-15

申请号：AT01305079

申请日：2001-06-11

Applicant: LUCENT TECHNOLOGIES INC

Inventor： BALOGH DAN ANTHONY ,  BURGESS JOHN K ,  KIANG T ROGER ,  VITEBSKY STANLEY

IPC: H04B1/74 ,  H04L12/28 ,  H04L12/56 ,  H04W72/14 ,  H04Q7/38 ,  H04L29/06

Abstract: Disclosed is a method for utilizing SCH resources more efficiently for supplemental channels (SCH) by minimizing gaps between data bursts due to overhead delays. Such gaps are minimized using a supplemental channel sharing algorithm to prospectively assign SCH resources supporting existing SCHs and to schedule future issuance of data notify requests DNRs such that currently unavailable SCH resources may be prospectively assigned based on states of the SCH resources, wherein an existing SCH is a SCH over which a data burst is currently being transmitted. For this purpose a data burst is followed by a preferred used assignment window (PUA), indicating the current user, a waiting user assignment window (WUA) and an expired reassignment window (ERA).

公开(公告)号：BR0105397A

公开(公告)日：2003-12-02

申请号：BR0105397

申请日：2001-11-22

Applicant: LUCENT TECHNOLOGIES INC

Inventor： BALOGH DAN ANTHONY ,  VITEBSKY STANLEY ,  KIANG T ROGER ,  BURGESS JOHN K

IPC: H04B1/74 ,  H04L12/28 ,  H04L12/56 ,  H04W72/14 ,  H04Q7/32

Abstract: Disclosed is a method for utilizing SCH resources more efficiently for supplemental channels (SCH) by minimizing gaps between data bursts due to overhead delays. Such gaps are minimized using a supplemental channel sharing algorithm to prospectively assign SCH resources supporting existing SCHs and to schedule future issuance of data notify requests DNRs such that currently unavailable SCH resources may be prospectively assigned based on states of the SCH resources, wherein an existing SCH is a SCH over which a data burst is currently being transmitted. For this purpose a data burst is followed by a preferred used assignment window (PUA), indicating the current user, a waiting user assignment window (WUA) and an expired reassignment window (ERA).

公开(公告)号：DE60200046D1

公开(公告)日：2003-11-06

申请号：DE60200046

申请日：2002-05-08

Applicant: LUCENT TECHNOLOGIES INC

Inventor： MEIER STEVEN K ,  PALM CHRISTOPHER D ,  WELSH STEVEN M ,  BURGESS JOHN K

IPC: H04B1/69 ,  H04J11/00 ,  H04J13/00 ,  H04J13/18

Abstract: A method of allocating CDMA codes from a set of the same is provided for use in connection with a wireless network. The method includes, after identifying a desired size of the code to be allocated, determining if there exists a code of the desired size whose sibling is unavailable. If such a code is found, then it is allocated. Otherwise, it is determined if there exists a code of smaller than the desired size whose sibling is unavailable. When such a code (i.e., a code of smaller than the desired size whose sibling is unavailable) is found, a descendant thereof which has the desired size is allocated

公开(公告)号：AT251362T

公开(公告)日：2003-10-15

申请号：AT02253211

申请日：2002-05-08

Applicant: LUCENT TECHNOLOGIES INC

Inventor： MEIER STEVEN K ,  PALM CHRISTOPHER D ,  WELSH STEVEN M ,  BURGESS JOHN K

IPC: H04B1/69 ,  H04J11/00 ,  H04J13/00 ,  H04J13/18

Abstract: A method of allocating CDMA codes from a set of the same is provided for use in connection with a wireless network. The method includes, after identifying a desired size of the code to be allocated, determining if there exists a code of the desired size whose sibling is unavailable. If such a code is found, then it is allocated. Otherwise, it is determined if there exists a code of smaller than the desired size whose sibling is unavailable. When such a code (i.e., a code of smaller than the desired size whose sibling is unavailable) is found, a descendant thereof which has the desired size is allocated

公开(公告)号：DE60109717D1

公开(公告)日：2005-05-04

申请号：DE60109717

申请日：2001-06-11

Applicant: LUCENT TECHNOLOGIES INC

Inventor： BALOGH DAN ANTHONY ,  BURGESS JOHN K ,  KIANG T ROGER ,  VITEBSKY STANLEY

IPC: H04B1/74 ,  H04L12/28 ,  H04L12/56 ,  H04W72/14 ,  H04Q7/38 ,  H04L29/06

Abstract: Disclosed is a method for utilizing SCH resources more efficiently for supplemental channels (SCH) by minimizing gaps between data bursts due to overhead delays. Such gaps are minimized using a supplemental channel sharing algorithm to prospectively assign SCH resources supporting existing SCHs and to schedule future issuance of data notify requests DNRs such that currently unavailable SCH resources may be prospectively assigned based on states of the SCH resources, wherein an existing SCH is a SCH over which a data burst is currently being transmitted. For this purpose a data burst is followed by a preferred used assignment window (PUA), indicating the current user, a waiting user assignment window (WUA) and an expired reassignment window (ERA).

公开(公告)号：CA2379720A1

公开(公告)日：2002-11-16

申请号：CA2379720

申请日：2002-04-02

Applicant: LUCENT TECHNOLOGIES INC

Inventor： BURGESS JOHN K ,  WELSH STEVEN M ,  PALM CHRISTOPHER D ,  MEIER STEVEN KENT

IPC: H04B1/69 ,  H04J11/00 ,  H04J13/00 ,  H04J13/18 ,  H04B7/216

Abstract: A method of allocating CDMA codes from a set of the same is provided for u se in connection with a wireless network. The method includes, after identifyin g a desired size of the code to be allocated, determining if there exists a code of the desired size whose sibling is unavailable. If such a code is found, then it is allocated. Otherwise, it is determined if there exists a code of smaller than the desired size whose sibling is unavailable. When such a code (i.e., a code of smaller than the desired size whose sibling is unavailable) is found, a descendant thereof which has the desired size is allocated.