-
公开(公告)号：DE60023525D1
公开(公告)日：2005-12-01
申请号：DE60023525
申请日：2000-08-30
Applicant: QUALCOMM INC
Inventor： LUPIN D , SINDHUSHAYANA T
Abstract: The invention presented is a novel method and apparatus for generating PN sequences with an arbitrary number of bits, where the number of bits is provided in parallel with each clock pulse. This allows the sequences to be generated at high speed when needed, and allows parallel processing in the acquisition and demodulation processes. In the invention, the initial values of states are loaded into registers of a parallel PN generator, which immediately generates the next n bits of the PN sequence, where n is an arbitrary number dependent on performance required. Then, a first sub-part of the PN generator of the present invention receives the present state of the PN generator and outputs the state of the PN generator n bits in the future. The output of this first sub-part is then provided to a second sub-part of the generator, which generates the next n bits of the PN sequence. In this fashion, the entire PN sequence can be continuously generated. The PN generator also contains a control processor, coordinating co-operation between sub-systems.
-
公开(公告)号：DE69837101D1
公开(公告)日：2007-03-29
申请号：DE69837101
申请日：1998-11-03
Applicant: QUALCOMM INC
Inventor： PADOVANI ROBERTO , SINDHUSHAYANA T , WHEATLEY E , BENDER E , BLACK J , GROB MATTHEW , HINDERLING K
IPC: H04W40/16 , H04B1/7103 , H04B7/005 , H04L1/00 , H04L1/08 , H04L1/16 , H04L1/18 , H04L12/56 , H04L29/08 , H04W16/14 , H04W24/00 , H04W28/22 , H04W52/04 , H04W52/12 , H04W52/24 , H04W52/26 , H04W52/40 , H04W72/08
Abstract: In a data communication system capable of variable rate transmission, high rate packet data transmission improves utilization of the forward link and decreases the transmission delay. Data transmission on the forward link is time multiplexed and the base station transmits at the highest data rate supported by the forward link at each time slot to one mobile station. The data rate is determined by the largest C/I measurement of the forward link signals as measured at the mobile station. Upon determination of a data packet received in error, the mobile station transmits a NACK message back to the base station. The NACK message results in retransmission of the data packet received in error. The data packets can be transmitted out of sequence by the use of sequence number to identify each data unit within the data packets.
-
公开(公告)号：DE69837101T2
公开(公告)日：2007-10-31
申请号：DE69837101
申请日：1998-11-03
Applicant: QUALCOMM INC
Inventor： PADOVANI ROBERTO , SINDHUSHAYANA T , WHEATLEY E , BENDER E , BLACK J , GROB MATTHEW , HINDERLING K
IPC: H04W40/16 , H04B1/7103 , H04B7/005 , H04L1/00 , H04L1/08 , H04L1/16 , H04L1/18 , H04L12/56 , H04L29/08 , H04W16/14 , H04W24/00 , H04W28/22 , H04W52/04 , H04W52/12 , H04W52/24 , H04W52/26 , H04W52/40 , H04W72/08
Abstract: In a data communication system capable of variable rate transmission, high rate packet data transmission improves utilization of the forward link and decreases the transmission delay. Data transmission on the forward link is time multiplexed and the base station transmits at the highest data rate supported by the forward link at each time slot to one mobile station. The data rate is determined by the largest C/I measurement of the forward link signals as measured at the mobile station. Upon determination of a data packet received in error, the mobile station transmits a NACK message back to the base station. The NACK message results in retransmission of the data packet received in error. The data packets can be transmitted out of sequence by the use of sequence number to identify each data unit within the data packets.
-
Patent Agency Ranking
公开(公告)号：DE60214052D1
公开(公告)日：2006-09-28
申请号：DE60214052
申请日：2002-11-26
Applicant: QUALCOMM INC
Inventor： EKVETCHAVIT THUNYACHATE , SINDHUSHAYANA T , GURELLI MEHMET , BLACK J
Abstract: A receiver system determines a current preamble threshold and a current preamble metric and determines whether a preamble is detected. If a preamble is detected, the receiver determines whether an earlier preamble has been detected in an earlier time slot having a common time slot interlace index, and resolves multiple detections of a preamble based on at least one of the current preamble and an old preamble thresholds, the current and an old preamble metrics. The receiver decodes data following the selected preamble and determines the CRC of the decoded data. If a CRC failure is detected, the receiver determines a new current preamble threshold. The new current preamble threshold is larger than the current preamble threshold. If the current preamble metric is larger than the new current preamble threshold, the receiver determines the CRC failure as an actual CRC failure, otherwise as a false CRC failure.
-
公开(公告)号：DE60023525T2
公开(公告)日：2006-07-20
申请号：DE60023525
申请日：2000-08-30
Applicant: QUALCOMM INC
Inventor： LUPIN D , SINDHUSHAYANA T
Abstract: The invention presented is a novel method and apparatus for generating PN sequences with an arbitrary number of bits, where the number of bits is provided in parallel with each clock pulse. This allows the sequences to be generated at high speed when needed, and allows parallel processing in the acquisition and demodulation processes. In the invention, the initial values of states are loaded into registers of a parallel PN generator, which immediately generates the next n bits of the PN sequence, where n is an arbitrary number dependent on performance required. Then, a first sub-part of the PN generator of the present invention receives the present state of the PN generator and outputs the state of the PN generator n bits in the future. The output of this first sub-part is then provided to a second sub-part of the generator, which generates the next n bits of the PN sequence. In this fashion, the entire PN sequence can be continuously generated. The PN generator also contains a control processor, coordinating co-operation between sub-systems.
-
公开(公告)号：DE60029749T2
公开(公告)日：2007-06-28
申请号：DE60029749
申请日：2000-01-12
Applicant: QUALCOMM INC
Inventor： PANJAK RAJESH , SINDHUSHAYANA T
Abstract: A resource scheduler in a communication system, the communication system including a common node and a plurality of customer nodes associated with the common node, the common node having at any particular service interval a finite resource seized by one or more engaging customer nodes to the exclusion of any remaining customer nodes, each of the customer nodes having an instantaneous rate of consuming the finite resource. The resource scheduler comprises logic for maintaining a weight associated with each of the customer nodes; logic for selecting one or more of the remaining customer nodes to seize the finite resource in a subsequent service interval based upon a comparison of the weight associated with the selected remaining customer nodes and the respective weights associated with the other remaining customer nodes, the subsequent service interval following a present service interval in which the finite resources are seized by one or more engaging customer nodes; and logic for changing the weight of the selected customer node based upon the instantaneous rate at which the selected customer node consumes the finite resource. The resource scheduler further includes logic for determining a duration of an override time interval, the override time interval having a beginning and an end, associated with at least one customer node based upon a minimum average rate of consuming the finite resource associated with the at least one customer node and the instantaneous rate of consuming the finite resource associated with the at least one customer node; and logic for initializing the override time interval whenever the at least one customer node seizes the finite resource and whenever the override time interval ends, wherein the logic for selecting schedules the at least one customer node to seize the finite resource in the subsequent service interval independent of the weights associated with the customer nodes when each override time interval ends. A corresponding method is also disclosed.
-
公开(公告)号：DE60214052T2
公开(公告)日：2007-03-29
申请号：DE60214052
申请日：2002-11-26
Applicant: QUALCOMM INC
Inventor： EKVETCHAVIT THUNYACHATE , SINDHUSHAYANA T , GURELLI MEHMET , BLACK J
Abstract: A receiver system determines a current preamble threshold and a current preamble metric and determines whether a preamble is detected. If a preamble is detected, the receiver determines whether an earlier preamble has been detected in an earlier time slot having a common time slot interlace index, and resolves multiple detections of a preamble based on at least one of the current preamble and an old preamble thresholds, the current and an old preamble metrics. The receiver decodes data following the selected preamble and determines the CRC of the decoded data. If a CRC failure is detected, the receiver determines a new current preamble threshold. The new current preamble threshold is larger than the current preamble threshold. If the current preamble metric is larger than the new current preamble threshold, the receiver determines the CRC failure as an actual CRC failure, otherwise as a false CRC failure.
-
公开(公告)号：DE60029749D1
公开(公告)日：2006-09-14
申请号：DE60029749
申请日：2000-01-12
Applicant: QUALCOMM INC
Inventor： PANJAK RAJESH , SINDHUSHAYANA T
Abstract: A resource scheduler in a communication system, the communication system including a common node and a plurality of customer nodes associated with the common node, the common node having at any particular service interval a finite resource seized by one or more engaging customer nodes to the exclusion of any remaining customer nodes, each of the customer nodes having an instantaneous rate of consuming the finite resource. The resource scheduler comprises logic for maintaining a weight associated with each of the customer nodes; logic for selecting one or more of the remaining customer nodes to seize the finite resource in a subsequent service interval based upon a comparison of the weight associated with the selected remaining customer nodes and the respective weights associated with the other remaining customer nodes, the subsequent service interval following a present service interval in which the finite resources are seized by one or more engaging customer nodes; and logic for changing the weight of the selected customer node based upon the instantaneous rate at which the selected customer node consumes the finite resource. The resource scheduler further includes logic for determining a duration of an override time interval, the override time interval having a beginning and an end, associated with at least one customer node based upon a minimum average rate of consuming the finite resource associated with the at least one customer node and the instantaneous rate of consuming the finite resource associated with the at least one customer node; and logic for initializing the override time interval whenever the at least one customer node seizes the finite resource and whenever the override time interval ends, wherein the logic for selecting schedules the at least one customer node to seize the finite resource in the subsequent service interval independent of the weights associated with the customer nodes when each override time interval ends. A corresponding method is also disclosed.
-
-
-
-
-
-
-
Search Results
8
records
(took 0.022 seconds)
