Abstract: Techniques are provided for utilizing network positioning protocols to perform a base station location and orientation computation procedure. An example method of determining an orientation of a base station antenna with a network server includes receiving measurement values from a base station based on uplink reference signals transmitted by a plurality of reference location devices, obtaining location information for the plurality of reference location devices, and determining the orientation of the base station antenna based on the measurement values and the location information.

Abstract: Techniques are provided for utilizing network positioning protocols to perform a base station location and orientation computation procedure. An example method of determining an orientation of a base station antenna with a network server includes receiving measurement values from a base station based on uplink reference signals transmitted by a plurality of reference location devices, obtaining location information for the plurality of reference location devices, and determining the orientation of the base station antenna based on the measurement values and the location information.

Abstract: In an embodiment, a product acceptance test application is transmitted by an apparatus across a wireless network to a wireless communications device. The product acceptance test application is configured to be executed by the wireless communications device so as to simulate network communications corresponding to a network communications test scenario. The wireless communications device simulates the network communications using the product acceptance test application and generates product acceptance data which is sent to the apparatus. The apparatus receives the product acceptance data from the wireless communication device indicative of test result data that is based upon the simulated network communications. The apparatus determines a product acceptance decision based on the product acceptance data.

Abstract: Scheduling real-time Quality of Service (QoS) data flows in a large-scale wireless communications system uses credit allocation to active QoS flows based on quality-of-service weights, and the credits are measured in dimensionless units of air interface slot capacity. Scheduling addresses inactive QoS flows with no data pending for transmission that may accumulate up to a burst credits limit based upon a fair share of all credits that would be allocated in a 100% busy system. Intermittent flows such as echo requests or keyboard input can thereby get immediate service by using their burst credits. The flow with the highest credit accumulation is serviced first and may use up to a full time slot (or system quanta) of air interface time reducing header encapsulation overhead when payload sizes (and spectral efficiency) are low. Additive and multiplicative aspects age the negative credits back to zero whenever a flow overspends its credit allocation.

Abstract: In an embodiment, a product acceptance test application is transmitted by an apparatus across a wireless network to a wireless communications device. The product acceptance test application is configured to be executed by the wireless communications device so as to simulate network communications corresponding to a network communications test scenario. The wireless communications device simulates the network communications using the product acceptance test application and generates product acceptance data which is sent to the apparatus. The apparatus receives the product acceptance data from the wireless communication device indicative of test result data that is based upon the simulated network communications. The apparatus determines a product acceptance decision based on the product acceptance data.

Abstract: Scheduling real-time Quality of Service (QoS) data flows in a large-scale wireless communications system uses credit allocation to active QoS flows based on quality-of-service weights, and the credits are measured in dimensionless units of air interface slot capacity. Scheduling addresses inactive QoS flows with no data pending for transmission that may accumulate up to a burst credits limit based upon a fair share of all credits that would be allocated in a 100% busy system. Intermittent flows such as echo requests or keyboard input can thereby get immediate service by using their burst credits. The flow with the highest credit accumulation is serviced first and may use up to a full time slot (or system quanta) of air interface time reducing header encapsulation overhead when payload sizes (and spectral efficiency) are low. Additive and multiplicative aspects age the negative credits back to zero whenever a flow overspends its credit allocation.

Abstract: A method and apparatus for reducing the amount of RAM required while maintaining fast data access. Data records are often saved in nonvolatile memory in order to maintain the contents of the data records even when the circuit is powered down. In the present invention each record in the nonvolatile RAM collection of data records is input to a function H(x) that outputs a tag value. The calculated tag value is saved in predetermined memory locations in RAM. Each calculated tag is shorter in length than the record saved in nonvolatile RAM. Therefore less RAM is required to save one tag value for each data record than is required to save the entire collection of data records in RAM. The value of H(y) is calculated when a data record entry corresponding to y is desired. Then the value of H(y) is compared to all the values in the tag value table. If a match is found, the corresponding record from its location in non-volatile RAM is retrieved and compared to y.