Senior Fitness - Exercise and Nutrition for Aging Men and Women
FREE Article Feed for your website.
Home Ownership Magazine
Party Planning Information
Article Marketing Resources
Bio-Medical Research Article Database
Informative Articles on Life, Love and Happiness
Tutorials on Business to Writing
Famous Quotes from Famous People
Song Lyric Information
New US Patent Information
Comprehensive List of Content by Category
Online Auctions and Shopping Related Articles
Article Search
Most Recent Articles
Title: Oblique angled suspension caster fork for wheelchairs
Patent Number: 6,892,421 Issued on 05/17/2005 to Cooper,   et al.

Title: Methods and systems for implementing a profitability model
Patent Number: 7,124,104 Issued on 10/17/2006 to Casciano,   et al.

Title: Process for the preparation of aryl-pyridinyl compounds
Patent Number: 6,765,097 Issued on 07/20/2004 to Giordano,   et al.

Title: Removable mother/daughter peripheral card
Patent Number: 6,893,268 Issued on 05/17/2005 to Harari,   et al.

Title: Feed conveyor/rock trap and header drive for an agricultural combine
Patent Number: 6,705,067 Issued on 03/16/2004 to Schroeder,   et al.

Title: Computer-generated hologram and its fabrication process, reflector using a computer-generated hologram, and reflective liquid crystal display
Patent Number: 7,054,044 Issued on 05/30/2006 to Hamano,   et al.

Title: Station identification for a local area augmentation system on a visual display
Patent Number: 6,950,036 Issued on 09/27/2005 to Snodgrass,   et al.

Title: Phenol resin forming material for pulley used in motor vehicles and phenol resin pulley for motor vehicles
Patent Number: 6,765,051 Issued on 07/20/2004 to Yazawa,   et al.

Title: Method and apparatus for dithering or undithering data words in a data stream
Patent Number: 7,054,037 Issued on 05/30/2006 to Mevissen

Title: Methods and apparatus for controlling a motor/generator
Patent Number: 7,116,073 Issued on 10/03/2006 to Sorkin

Title: Unified control of vehicle dynamics using force and moment control
Patent Number: 6,892,123 Issued on 05/10/2005 to Hac

Title: Polygon mirror and optical scanning device having the same
Patent Number: 7,054,047 Issued on 05/30/2006 to Tamaru

Title: Copy protection apparatus and method
Patent Number: 6,865,553 Issued on 03/08/2005 to Morito,   et al.

Title: Stacked polysilicon layer for boron penetration inhibition
Patent Number: 6,762,454 Issued on 07/13/2004 to Ibok,   et al.

Title: Optical sub-assembly module for suppressing optical back-reflection and effectively guiding light from light source to optical waveguide
Patent Number: 6,945,710 Issued on 09/20/2005 to Chen,   et al.

Title: Low-contaminative hose and rubber composition for use in making the same
Patent Number: 6,737,480 Issued on 05/18/2004 to Ikeda,   et al.

Title: Cup lid having combined straw slot depression and tear back lid retainer
Patent Number: 6,948,633 Issued on 09/27/2005 to Freek,   et al.

Title: High-accuracy capacitor digital-to-analog converter
Patent Number: 7,123,072 Issued on 10/17/2006 to Bu,   et al.

Title: Apparatus for adaptively adjusting a data receiver
Patent Number: 7,123,046 Issued on 10/17/2006 to Keeth

Title: Method of making multilevel MEMS structures
Patent Number: 6,861,363 Issued on 03/01/2005 to Harchanko,   et al.

Title: Marine vessel monitoring system
Patent Number: 6,816,088 Issued on 11/09/2004 to Knoska,   et al.

Title: Router bit system
Patent Number: 7,140,817 Issued on 11/28/2006 to Phillips,   et al.

Title: Concrete stamping apparatus
Patent Number: 7,140,804 Issued on 11/28/2006 to Gregg

Title: Imaging apparatus having a carrier support and drive arrangement
Patent Number: 7,140,793 Issued on 11/28/2006 to Cook

Title: Joint structure for power transmitting member and method for producing the same
Patent Number: 7,140,800 Issued on 11/28/2006 to Sugiyama,   et al.

Title: Casing arrangement
Patent Number: 7,140,836 Issued on 11/28/2006 to Balsdon

Title: Rotary-die-method and fill wedge for producing capsules, in particular soft capsules
Patent Number: 6,935,090 Issued on 08/30/2005 to Stolz

Title: Restraint coupling
Patent Number: 6,962,394 Issued on 11/08/2005 to Anthony,   et al.

Title: Corner cooled turbine nozzle
Patent Number: 7,140,835 Issued on 11/28/2006 to Lee,   et al.

Title: Attachment for forming shapes following excavation
Patent Number: 7,140,831 Issued on 11/28/2006 to Wollgast,   et al.

Title: Optical disc drive and optical disc discriminating method
Patent Number: 6,956,801 Issued on 10/18/2005 to Horimoto

Title: Method of drilling lateral wellbores from a slant well without utilizing a whipstock
Patent Number: 6,964,308 Issued on 11/15/2005 to Zupanick

Title: Manufacturing method of semiconductor device
Patent Number: 7,105,400 Issued on 09/12/2006 to Imai,   et al.

Title: Damper system with sealing plug
Patent Number: 6,796,328 Issued on 09/28/2004 to Myles

Title: Mixture fitting for a combustible gas burner system
Patent Number: 6,796,302 Issued on 09/28/2004 to Butler,   et al.

Title: Duct repairing material, repairing structure, and repairing method
Patent Number: 6,796,334 Issued on 09/28/2004 to Ishikawa,   et al.

Title: Optical viewer instrument with photographing function
Patent Number: 6,914,636 Issued on 07/05/2005 to Hirunuma,   et al.

Title: Internal combustion engine with valve train
Patent Number: 6,796,281 Issued on 09/28/2004 to Shimoyama,   et al.

Title: Method for diagnosing a network
Patent Number: 6,795,941 Issued on 09/21/2004 to Nickels

Title: Priority coloring for VLSI designs
Patent Number: 6,795,961 Issued on 09/21/2004 to Liebmann,   et al.

Title: Methods and apparatus for ManArray PE-PE switch control
Patent Number: 6,795,909 Issued on 09/21/2004 to Barry,   et al.

Title: Prevention of power state change in response to chassis intrusion when computer system is not in powered up power state
Patent Number: 6,795,926 Issued on 09/21/2004 to Matula,   et al.

Title: Ignition spark enhancing device
Patent Number: 6,796,298 Issued on 09/28/2004 to Kiker

Title: Intake pressure sensor arrangement for engine
Patent Number: 6,796,291 Issued on 09/28/2004 to Suzuki,   et al.

Title: Method and system for setting optical drive write strategies
Patent Number: 6,915,374 Issued on 07/05/2005 to Pereira

Title: Inductor and method for producing the same
Patent Number: 6,909,350 Issued on 06/21/2005 to Uriu,   et al.

Title: Diaphragm system
Patent Number: 6,796,336 Issued on 09/28/2004 to Ijspeert

Title: Fuel injection system for an internal combustion engine
Patent Number: 6,796,290 Issued on 09/28/2004 to Boehland,   et al.

Title: Handheld massager
Patent Number: 7,141,030 Issued on 11/28/2006 to Chen

Title: Use of inhaled NO as anti-inflammatory agent
Patent Number: 6,811,768 Issued on 11/02/2004 to Zapol,   et al.

Title: Multivalent MHC class II--peptide chimeras
Patent Number: 6,811,785 Issued on 11/02/2004 to Brumeanu,   et al.

Title: Support for an LCD monitor
Patent Number: 6,796,541 Issued on 09/28/2004 to Lu

Title: Multimedia interface for a communications network
Patent Number: 6,934,278 Issued on 08/23/2005 to Champa,   et al.

Title: Projection system using spatial filter
Patent Number: 7,140,737 Issued on 11/28/2006 to Kim,   et al.

Title: Helicobacter pylori proteins useful for vaccines and diagnostics
Patent Number: 7,141,244 Issued on 11/28/2006 to Covacci,   et al.

Title: High frequency coaxial jack
Patent Number: 6,932,634 Issued on 08/23/2005 to Cooper,   et al.

Title: Light source assembly, backlight assembly and liquid crystal display apparatus having the same
Patent Number: 7,140,750 Issued on 11/28/2006 to Kim

Title: Actuator for a micro-electromechanical valve assembly
Patent Number: 7,140,719 Issued on 11/28/2006 to Silverbrook

Title: Device for the continuous cabling and setting of yarns followed by additional heat treatment
Patent Number: 6,986,242 Issued on 01/17/2006 to Antouly

Title: Recessed lamp mount
Patent Number: 7,140,749 Issued on 11/28/2006 to Culbert

Title: Surface-mount semiconductor lighting apparatus
Patent Number: 7,140,742 Issued on 11/28/2006 to Pohlert,   et al.

Title: Pressure-contact type semiconductor device
Patent Number: 6,995,464 Issued on 02/07/2006 to Oota,   et al.

Title: Film bulk acoustic resonator (FBAR) with high thermal conductivity
Patent Number: 7,164,222 Issued on 01/16/2007 to Wang

Title: Trailer wheel lock
Patent Number: 6,796,154 Issued on 09/28/2004 to Gebow,   et al.

Title: Light beam adjusting device for vehicle
Patent Number: 7,140,759 Issued on 11/28/2006 to Tsai,   et al.

Title: Vehicle mirror assembly that includes light unit
Patent Number: 7,140,757 Issued on 11/28/2006 to Sakai

Title: Exterior rear view mirror having a chin strap and a repeater
Patent Number: 7,140,756 Issued on 11/28/2006 to McCloy,   et al.

Title: Process gas conditioning for tobacco dryers
Patent Number: 6,880,814 Issued on 04/19/2005 to Pluckhahn,   et al.

Title: Systems and methods using phonon mediated intersubband laser
Patent Number: 6,829,269 Issued on 12/07/2004 to Goodhue,   et al.

Title: Method of processing a proteinous material, a product so obtained, and use thereof
Patent Number: 6,866,879 Issued on 03/15/2005 to Vaarala,   et al.

Title: Method and apparatus for providing efficient application-level switching for multiplexed internet protocol media streams
Patent Number: 6,829,254 Issued on 12/07/2004 to Rajahalme,   et al.

Title: Fiber laser apparatus as well as optical multi/demultiplexer and image display apparatus therefor
Patent Number: 6,829,256 Issued on 12/07/2004 to Sugiyama,   et al.

Title: Semiconductor laser array
Patent Number: 6,829,265 Issued on 12/07/2004 to Nakatsuka,   et al.

Title: Synchronous servo control for a tunable laser
Patent Number: 6,829,268 Issued on 12/07/2004 to Pontis,   et al.

Title: Radiation system with inner and outer gantry parts
Patent Number: 6,865,254 Issued on 03/08/2005 to Nafstadius

Method and system for analyzing digital wireless network performance Number:7,395,058 from the United States Patent and Trademark Office (PTO) owispatent

Home    Author Login    Submit Article    Article Search    Add Your Link    Edit Your Link    Contact Us    Advertising    Disclaimer

   

 
Web LinkGrinder.com

Top Breaking News
     Greek, Cypriot Leaders Resume Unification Talks in Nicosia by Nathan Morley
     Indonesia Tobacco Sales Grow, Raising Health Fears
     South Korea Allows Top Defector to Travel Overseas by VOA News

Title: Method and system for analyzing digital wireless network performance

Abstract: A system (36) provides a network designer with a mechanism for analyzing the performance of a code division multiple access wireless network (20). The system (36) includes executable code in the form of a probable server identification module (52), a forward link initial estimation module (54), a reverse link initial estimation module (56), a forward link analysis module (58), and a reverse link analysis (60). The modular architecture of the modules (52, 54, 56, 58, and 60) are appropriately configured and interconnected in order to form a network performance analysis process (62) that accurately analyzes both the reverse link performance and the forward link performance of the network (20).

Patent Number: 7,395,058 Issued on 07/01/2008 to Kalofonos,   et al.


Inventors: Kalofonos; Dimitris N. (Watertown, MA), Ganesh; Rajamani (Bedford, MA), Fagen; Donna (Lexington, MA), O'Byrne; Vincent A. (Boston, MA), Yang; Ning (Burlington, MA)
Assignee: Verizon Laboratories Inc. (Waltham, MA)
Appl. No.: 10/891,780
Filed: July 15, 2004


Related U.S. Patent Documents

Application NumberFiling DatePatent NumberIssue Date
09694450Oct., 20006810246

Current U.S. Class: 455/423 ; 455/420; 455/424; 455/425; 455/522
Current International Class: H04Q 7/20 (20060101)
Field of Search: 455/522,423,424,418,420,425 450/226.2 370/335,241


References Cited [Referenced By]

U.S. Patent Documents
5710758 January 1998 Soliman et al.
6035183 March 2000 Todd et al.
6144861 November 2000 Sundelin et al.
6212386 April 2001 Briere et al.
6310868 October 2001 Uebayashi et al.
6397043 May 2002 Kang
2002/0012326 January 2002 Chang
2002/0155853 October 2002 Lee et al.
Primary Examiner: Nguyen; David Q

Parent Case Text



RELATED INVENTION

The present invention is a continuation of "Method And System For Analyzing Digital Wireless Network Performance," U.S. patent application Ser. No. 09/694,450, filed 23 Oct. 2000 now U.S. Pat. No. 6,810,246, which is incorporated by reference herein.
Claims



What is claimed is:

1. A computer-based method, in a network planning tool, for analyzing a performance of a digital wireless network defined by locations, said method comprising: identifying probable servers for said locations in said network; performing an initial reverse link assessment of said network to produce initial reverse link output parameters; executing a forward link analysis in response to said performing operation utilizing said initial reverse link output parameters as inputs for said forward link analysis; and implementing a reverse link analysis in response to said executing operation, wherein said executing operation comprises generating at least one of a plurality of forward link quality figures to analyze said performance of a forward link of said network.

2. A computer-based method as claimed in claim 1 wherein said plurality of forward link quality figures includes a forward link in-cell supported load value, an outage load value, a forward margin value, and an interference margin value.

3. A computer-based method as claimed in claim 1 wherein said implementing operation comprises generating at least one of a plurality of reverse link quality figures to analyze said performance of a reverse link of said network.

4. A computer-based method as claimed in claim 3 wherein said plurality of reverse link quality figures includes a reverse link margin value, a reverse link noise floor elevation value, a percentage of pole capacity value, a frequency reuse efficiency value, an in-cell supported load value, a mobile station transmit power value, and an updated list of probable servers for each of said locations in said network.

5. A computer-based method as claimed in claim 1 further comprising: determining one of a forward link and a reverse link is a limiting link; and conducting said performing, executing, and implementing operations when said forward link is said limiting link.

6. A computer-based method as claimed in claim 5 further comprising: performing an initial forward link assessment of said network when said reverse link is said limiting link; implementing said reverse link analysis in response to said initial forward link assessment; and executing said forward link analysis in response to said reverse link analysis.

7. A computing system, in a network planning tool, for analyzing a performance of a digital wireless network defined by locations, and said computing system comprising: a processor; a computer-readable storage medium; and executable code recorded on said computer-readable storage medium for instructing said processor to analyze said performance of said network, said executable code including: a probable server identification module for identifying probable servers for said locations in said network; a reverse link initial estimation module for providing an initial reverse link assessment of said network, said, initial reverse link assessment producing initial reverse link output parameters; a forward link initial estimation module for providing an initial forward link assessment of said network, said initial forward link assessment producing initial forward link output parameters; a forward link analysis module for analyzing a forward link performance of said network, said forward link analysis module utilizing said initial reverse link output parameters as inputs for said forward link analysis; and a reverse link analysis module for analyzing a reverse link performance of said network, said reverse link analysis module utilizing said initial forward link output parameters as inputs for said reverse link analysis, wherein: said forward link analysis module analyzes said forward link performance in response to one of said initial reverse link assessment and said analyzed reverse link performance; and said reverse link analysis module analyzes said reverse link performance in response to one of said initial forward link assessment and said analyzed forward link performance.
Description



RELATED PATENTS

The present invention is related to "System and Methods for Rapidly Determining CDMA Network Performance," by O'Byrne et al., U.S. patent application Ser. No. 09/547,970, filed 12 Apr. 2000, and incorporated by reference herein.

TECHNICAL FIELD OF THE INVENTION

The present invention relates to the field of communication systems. More specifically, the present invention relates to systems and methods that analyze the performance of a digital wireless network.

BACKGROUND OF THE INVENTION

The wireless communication industry has made tremendous strides in commercial operations throughout the world. Growth in major metropolitan areas has far exceeded expectations and is rapidly outstripping network capacity, that is, the information carrying ability of the network. Digital communication technologies, such as Code Division Multiple Access (CDMA), Time Division Multiple Access (TDMA), Global System for Mobile Communications (GSM), and so forth, are emerging as techniques for increasing the capacity of wireless networks to support call traffic. Such digital technologies result in substantial increases of capacity of the RF spectrum, for example, up to ten times that of an analog technology, such as the Advanced Mobile Phone Service (AMPS). In addition, digital technology has the potential to mitigate three major problems encountered by users of analog technology, i.e., static, loss/interruption of signal when passing between cells, and failure to get a connection because of congestion.

In order to design efficient digital wireless networks, designers need to be able to quickly and accurately evaluate the performance of a proposed wireless communication network, such as a CDMA wireless network. An accurate network analysis can be used to evaluate the network design and identify problematic sectors or cells. In addition, an accurate network analysis will allow the network designer to better estimate how well equipment settings will perform given the required, or expected, call traffic levels.

A CDMA wireless network provides the capability of two-way communication between a number of user mobile stations and corresponding servers, or base stations. Each direction of communication is performed on a separate radio link and involves a different set of system functions. The communication link from a server to a mobile station is referred to as the forward link and the link from a mobile station to a server is referred to as the reverse link.

In CDMA, network performance is defined by both the forward link and the reverse link. However, the performance of a CDMA network depends largely on system functions exercised by servers in the forward link because most of the information on timing and synchronization occurs on this link. Accordingly, the forward link behavior contributes significantly to overall network performance. Nevertheless, the amount of call traffic that can be supported, which determines the interference levels and ultimately the performance of both links, depends on the most limiting link, either the forward or the reverse link.

The forward link may be considered to be more limiting in a CDMA network scenario in which there are many servers, because a large number of servers correspondingly increases the interference experienced at the mobile station. Thus, the transmit power in the forward link may need to increase in order to overcome the interference. However, equipment settings may limit the system's ability to compensate for the performance and thus the system at this location becomes forward limited. In an alternative scenario, the reverse link may be considered to be more limiting due to hardware constraints such as the particular type of voice coder, or vocoder, or limited transmit power used by the mobile stations.

The performance of the network depends on the most limiting link because the requirements of both links should desirably be satisfied in order for communication to be established. Therefore, the performances of the two links are tightly coupled. In an ideal network model and without considering any practical limitation, an analysis of both links should desirably be part of the same iterative procedure due to this tight coupling. Unfortunately, such an iterative process is extremely complex and impractical because of the excessive computation time that would be required.

Thus, what is needed is a system and method that accurately analyze network performance of both the forward and reverse links in a time and cost effective manner while maintaining overall system operation integrity.

SUMMARY OF THE INVENTION

Accordingly, it is an advantage of the present invention that a system and method is provided for analyzing the performance of a digital wireless communication network.

It is another advantage of the present invention that the system and method provide an accurate analysis of both forward link and reverse link performance.

It is another advantage of the present invention that a flexible architecture is provided that can be appropriately configured and interconnected to analyze the performance of the network in response to the more limiting of the forward and reverse links.

It is yet another advantage of the present invention that the system and method provide an accurate analysis of network performance while taking into consideration the practical limitations of computation complexity, execution time, and cost.

The above and other advantages of the present invention are carried out in one form by a computer-based method for analyzing a performance of a digital wireless network having sectors, the sectors being defined by locations. The method calls for identifying probable servers for the locations in the network and performing an initial reverse link assessment of the network. The method further calls for executing a forward link analysis in response to the performing operation and implementing a reverse link analysis in response to the executing operation.

The above and other advantages of the present invention are carried out in another form by a computing system for analyzing a performance of a digital wireless network having sectors, the sectors being defined by locations. The computing system includes a processor, a computer-readable storage medium, and executable code recorded on the computer-readable storage medium for instructing the processor to analyze the performance of the network. The executable code includes a probable server identification module for identifying probable servers for the locations in the network. A reverse link initial estimation module provides an initial reverse link assessment of the network, and a forward link initial estimation module provides an initial forward link assessment of the network. A forward link analysis module analyzes a forward link performance of the network, and a reverse link analysis module analyzes a reverse link performance of the network. The forward link analysis module analyzes the forward link performance in response to the initial reverse link assessment or the analyzed reverse link performance. Likewise, the reverse link analysis module analyzes the reverse link performance in response to the initial forward link assessment or the analyzed forward link performance.

BRIEF DESCRIPTION OF THE DRAWINGS

A more complete understanding of the present invention may be derived by referring to the detailed description and claims when considered in connection with the Figures, wherein like reference numbers refer to similar items throughout the Figures, and:

FIG. 1 shows a block diagram of an exemplary digital wireless communication network;

FIG. 2 shows a block diagram of a computing system for analyzing the performance of the exemplary digital wireless communication network of FIG. 1;

FIGS. 3A and 3B show a flow chart of a probable server identification module;

FIG. 4 shows a flow chart of a forward link initial estimation module;

FIG. 5 shows a flow chart of a reverse link initial estimation module;

FIG. 6 shows a flow chart of a forward link analysis module;

FIG. 7 shows a flow chart of a forward link iteration process of the forward link analysis module;

FIG. 8 shows a flow chart of a reverse link analysis module;

FIG. 9 shows a flow chart of a reverse link iteration process of the reverse link analysis module; and

FIG. 10 shows a flow chart of a network performance analysis process.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

FIG. 1 shows a block diagram of an exemplary digital wireless communication network 20. Network 20 includes a number of base stations, or servers 22, through which two-way communication radio links are established between network 20 and mobile stations 24. For example, a forward link 23 may be established from one of servers 22 to one of mobile stations 24 and a reverse link 25 may be established from the one of mobile stations 24 to the one of servers 22 to form the two-way communication radio link.

In an exemplary embodiment, servers 22 operate using a code division multiple access (CDMA) digital communication technology. Those skilled in the art will recognize that in a CDMA digital wireless network, mobile station 24 may be in two-way communication with more than one of servers 22, i.e., those servers 22 in the active set for mobile station 24. Servers 22 in a mobile station's active set are those servers 22 whose signal is demodulated at the rake receiver of mobile station 24.

Mobile stations 24 are conventional digital wireless communication devices, such as a cellular telephone, a personal digital assistant, and so forth, that communicate with servers 22 in a manner known to those skilled in the art.

Each server 22 controls communication in at least one of a number of wireless coverage areas, i.e., cells 26, or a sector of one of cells 26 via directional antennas 28, 30, and 32. The terms "cell" and "sector" represent radio coverage areas within network 20. As such, cell and sector may be used interchangeably herein. Servers 22 may alternatively include one or more omni-directional antennas. While network 20 shows only seven of cells 26, the actual number of cells 26 may be larger or smaller in practice. In addition, cells 26 are shown as being generally hexagonal in shape. This hexagonal representation is convenient for schematically denoting a cell's radio coverage area. Those skilled in the art will appreciate that the actual shape and size of cells 26 will vary from cell to cell, and between technology types.

As digital wireless technology, such as CDMA, evolves and the advantages of digital wireless technology over analog technology become more apparent, it is anticipated that the number of subscribers to the digital wireless technology will grow. This growing subscriber base will lead to ever increasing call traffic loads and increased interference between subscribers. The present invention accurately analyzes the network design to identify problematic areas within sectors or cells. An accurate analysis allows a network designer to evaluate the ability of servers 22 to accommodate the increased call traffic loads, to determine the level of interference, to set transmission power levels of servers 22, to determine the quantities of related terminating and switching equipment needed to meet the increased traffic loads, to make channel assignments, and so forth.

FIG. 2 shows a block diagram of a computing system 36 for analyzing the performance of digital wireless communication network 20 (FIG. 1). System 36 includes a processor 38 on which the methods according to the invention can be practiced. Processor 38 is in communication with an input element 40, an output element 42, a computer-readable storage medium 44, and memory 46. These elements are interconnected by a bus structure 48. The components of system 36 may be implemented utilizing several known off-the-shelf components.

Memory 46 is addressable storage space, accessible by processor 38, which stores information or instructions for use. Processor 38 includes a data reader (not shown) for reading information from memory 46. The data reader may include a hard disk drive internal or external to processor 38, a tape drive, floppy disk drive, CD-ROM, or a combination thereof. Memory 46 may be a hard disk, floppy disk, a compact disk, a personal computer memory card international association (PCMCIA) card, and the like.

Input device 40 can encompass a keyboard, mouse, pointing device, audio device (e.g., a microphone), or other devices providing input to processor 38. Output device 42 can encompass a display, a printer, an audio device (e.g., a speaker), or other devices providing output from processor 38. Input and output devices 40 and 42 can also include network connections, modems, or other devices used for communications with other computer systems or devices.

Computer-readable storage medium 44 may be a hard disk drive internal or external to processor 38, a magnetic disk, compact disk, or any other volatile or non-volatile mass storage system readable by processor 38. Computer-readable storage medium 44 may also include cooperating or interconnected computer readable media, which exist exclusively on computing system 36 or are distributed among multiple interconnected computer systems (not shown) that may be local or remote.

Executable code, in the form of a probable server identification module 52, a forward link initial estimation module 54, a reverse link initial estimation module 56, a forward link analysis module 58, and a reverse link analysis module 60 are employed to assemble a network performance analysis process 62. Process 62, recorded on computer-readable storage medium 44, is implemented in a network planning tool (not shown) for instructing processor 38 to analyze a performance of digital wireless network 20 (FIG. 1).

Process 62 is assembled utilizing the flexible modular architecture of modules 52, 54, 56, 58, and 60 to provide a full analysis of both forward and reverse links 23 and 25, respectively, (FIG. 1) of communication network 20 (FIG. 1). Moreover, process 62 is assembled to take into account the more limiting of the forward and reverse links 23 and 25. That is, the more limiting of the forward and reverse links 23 and 25 will be analyzed prior to the other of the forward and reverse links 23 and 25 using initial assessment parameters acquired through the execution of one of forward link initial estimation and reverse link initial estimation modules 54 and 56.

The following discussion, in combination with a flow of tasks illustrated in FIGS. 3-9, will describe the functions performed by each of modules 52, 54, 56, 58, and 60 and the resulting parameters output through the execution of each of modules 52, 54, 56, 58, and 60. The application of the parameters generated in modules 52, 54, 56, 58, and 60 will be described in connection with a description of network performance analysis process 62 as illustrated in FIG. 10.

FIGS. 3A and 3B show a flow chart of probable server identification module 52. In other words, FIGS. 3A and 3B illustrate an exemplary process, performed through the execution of probable server identification module 52, for determining CDMA probable servers for each location in network 20 (FIG. 1).

Referring momentarily to FIG. 1, network 20 is subdivided into a plurality of locations 64, of which only a few are shown. Locations 64 are the basic units that make up network 20 and represent the smallest area of interest, i.e. a location, in an actual environment represented by network 20. For example, each of sections 64 may represent a region in an actual environment having an area of approximately one hundred meters by one hundred meters. The actual size of the location is a tradeoff between accuracy (more locations, or higher resolution) and increased processing speed (fewer locations, or reduced resolution).

In CDMA, the probable servers for a given one of locations 64 is a list that contains the most probable servers 22 (up to a number equal to a predetermined active set size) that may be in the active set of one of mobile stations 24 (FIG. 1) located at the given one of locations 64. The active set is the set of one or more pilot channels associated with the forward traffic channels that may be assigned to the mobile station. The pilot channel is a forward link channel that is transmitted by a server, and is used as a reference for the detection of all forward link channels transmitted from that server. Among the list of probable servers, the server whose pilot channel has the highest probability to be in the active set of a mobile station at a particular location is called the CDMA Best Server (discussed below).

Referring back to FIGS. 3A and 3B, probable server identification module 52 begins with a task 66. Task 66 causes processor 38 (FIG. 2) to retrieve data representing the path loss from every server 22 (FIG. 1) within network 20 to every location 64 (FIG. 1) within the range of calculation for that server 22, as defined by the user on a global or per server 22 basis. In other words, task 66 uses path loss files (not shown) that may be stored in memory 46 (FIG. 2) of computing system 36 (FIG. 2). The path loss files were generated previously through the execution of a propagation path loss module to determine the path loss, Pl, from every server 22 within the plan to every location 64 within the server's range of calculation. Task 66 ignores any of locations 64 having inadequate field strength (e.g., one of locations 64 lying outside the range of calculation of a particular one of servers 22). In addition, task 66 ignores any of locations 64 due to Land Use Land Cover (LULC) traffic shifting or highway enhancements or whose pilot channel power is sufficiently small.

Following task 66, a task 68 is performed. At task 68, processor 38 (FIG. 2) determines the received CDMA pilot channel power at each location 64 from every server 22 within its server size and range of calculation. The received pilot channel power is determined by: R.sub.pilot,j=P.sub.pilot,j-L.sub.fw.sub.--.sub.c,j+G.sub.t,j+G.sub.m-Pl.- sub.j (1) where P.sub.pilot,j is the transmitted power, or signal strength, of the CDMA pilot channel in dBW at server j, G.sub.t,j is the antenna gain of server j in dBi in the direction of the location of interest, G.sub.m is the antenna gain of wireless station 24 in that location 64 in dBi as seen by server 22, L.sub.fw.sub.--.sub.c,j is the forward cable loss at this server j, and Pl.sub.j is the path loss between location 64 and server j. A received pilot channel power value 67 may be temporarily stored in association with one of servers 22 in an array in memory 46 (FIG. 2).

Following task 68, a task 70 is performed. Task 70 determines a representative of the minimum interference, I.sub.tot.sub.--.sub.min, at each of locations 64 (FIG. 1). The minimum interference, I.sub.tot.sub.--.sub.min, for one of locations 64 can be determined, for example, by:

.times..times..times..times..times..times..times..times. ##EQU00001## where M is the number of servers 22, j, within whose ranges of calculations location 64 resides, R.sub.sync,j, R.sub.paging,j, R.sub.traffic,j, R.sub.pilot,j, are the powers received at this location 64 from the synchronization, paging, traffic, and pilot channels of server j, respectively, and are given by: R.sub.sync,j=P.sub.sync,j-L.sub.fw.sub.--.sub.c,j+G.sub.t,j+G.sub.m-Pl.su- b.j (3) R.sub.traffic,j=P.sub.traffic.sub.--.sub.min,j-L.sub.fw.sub.--.su- b.c,j+G.sub.t,j+G.sub.m-Pl.sub.j (4) R.sub.paging,j=P.sub.paging,j-L.sub.fw.sub.--.sub.c,j+G.sub.t,j+G.sub.m-P- l.sub.j (5) where P.sub.sync,j and P.sub.paging,j denote, respectively, the transmit powers of the sync and paging channels, and P.sub.traffic.sub.--.sub.min,j represents the minimum transmit power (i.e., the minimum power control allocation of a traffic channel at server j). It should be noted that this power is only representative of the lowest possible traffic power. Other values, such as an average value, are also valid. The process assumes initially that there is only one sync, one paging, and one traffic channel per server 22. It should be noted that the computation of I.sub.tot.sub.--.sub.min is independent of the size of cell 26 (FIG. 1) or sector of cell 26.

In response to tasks 68 and 70, probable server identification module 52 proceeds to a task 72. Task 72 determines the ratio of the received pilot channel power of one of servers 22 over the total received transmit power from all of servers 22, E.sub.c,j/I.sub.tot.sub.--.sub.min. E.sub.c,j/I.sub.tot.sub.--.sub.min is determined using the ratio of the transmit power of the pilot channel, R.sub.pilot,j, to interference, I.sub.tot.sub.--.sub.min, for every one of locations 64 (FIG. 1) within cell 26, that is, the coverage area, of server 22, j, as follows: E.sub.c,j/I.sub.tot.sub.--.sub.min=R.sub.pilot,j/I.sub.tot.sub.--.sub.min (6)

Task 72 subsequently causes processor 38 (FIG. 2) to store the calculated values of E.sub.c,j/I.sub.tot.sub.--.sub.min in a server array (not shown) in, for example, memory 46 (FIG. 2) of computing system 36 (FIG. 2).

Following task 72, a task 74 is performed. Task 74 of process 52 defines an initial CDMA best server area. Task 74 defines one of locations 64 (FIG. 1) to be in the best server area of server 22, j, if location 64 is within the sector size of server 22, j, and the conditions given by the following equations are satisfied: E.sub.c,j/I.sub.tot.sub.--.sub.min>(E.sub.c/I.sub.o).sub.threshold (7) E.sub.c,j/I.sub.tot.sub.--.sub.min>E.sub.c,i/I.sub.tot.sub.--.sub.- min, where server, j, is not a beacon sector and for the set of servers i.epsilon.{1 . . . M} and i.noteq.j (8)

The threshold value, (E.sub.c/I.sub.o).sub.threshold, is defined internally as a global parameter. It is typically a very low value used to eliminate locations 64 where the received pilot channel power, E.sub.c,j, at one of locations 64 relative to the total received transmit power from all of servers 22, I.sub.tot.sub.--.sub.min, at one of locations 64 is so low that pilot channel acquisition by one of mobile stations 24 at location 64 becomes improbable. Task 74 assumes that any of locations 64 where the above conditions are not satisfied are determined not to have coverage under the loading conditions as stated above.

Following task 74, a task 76 sorts the received power of the pilot channels, E.sub.c,j, at each of locations 64 in descending order (with the strongest received pilot power first). Sorting task 76 also takes into account the sector size, i.e., size of one of cells 26 (FIG. 1), controlled by each of servers 22 (FIG. 1) and ignores beacon cells. A beacon cell is a type of geographic area controlled by a beacon server that is employed in a dual mode (e.g., AMPS/CDMA) network. The beacon server allows a mobile station user to transition between a geographical area offering analog and digital communication (i.e., dual mode) service and a geographical area providing only analog service.

A task 78 is performed in response to task 76. Task 78 causes processor 38 (FIG. 2) to populate a CDMA probable server array with servers 22 corresponding to the highest received pilot powers, E.sub.c,j, at each of locations 64 to define a probable active set of pilot channels for each of locations 64. Only servers 22, j, with E.sub.c,j/I.sub.tot.sub.--.sub.min>(E.sub.c/I.sub.o).sub.threshold and for which location 64 lies within their corresponding sector size are included in the list of probable servers of location 64. In other words, CDMA probable server array associates a number of probable servers, up to the size of the active set, with each of locations 64 of network 20. The one of servers 22 whose pilot channel power, E.sub.c,j, is greatest as determined in sorting task 74 is, by definition, the first (or strongest) in the list of probable servers calculated in task 78.

A task 80 is also performed in response to task 76. Task 80 causes processor 38 to populate the pilot power to interference ratios, E.sub.c,j/I.sub.tot.sub.--.sub.min in a CDMA E.sub.c/I.sub.o ratio array that corresponds to the elements in the CDMA probable server array of task 78. In other words, task 80 uses the highest received pilot powers, E.sub.c,j, at each of locations 64 to calculate the elements in the CDMA E.sub.c/I.sub.o ratio array.

Following tasks 78 and 80, a task 82 is performed to determine a number of locations 64 for which a particular one of servers 22 may be a CDMA best server, or the server 22 with the highest probability to be in the active set for one of mobile stations 24 (FIG. 1) at locations 64. In other words, by referring to the CDMA probable servers array populated in task 78 and the CDMA E.sub.c/I.sub.o ratio array populated in task 80, a server 22, j, whose corresponding pilot channel power, E.sub.c,j, received at one of locations 64 and whose corresponding E.sub.c,j/I.sub.tot.sub.--.sub.min may be higher than the others of CDMA probable servers 22 for that location 64 may be determined to be the CDMA best server for that location 64. Task 82 reviews each of locations 64 to determine the number of locations 64 for which a particular one of servers 22 may be a CDMA best server.

Following task 82, a task 84 is performed to assign each of locations 64 with an appropriate amount of call traffic. The appropriate amount of call traffic is based on the total Erlang traffic, or call traffic load, offered to a cell 26, or coverage area of the best server as determined by the user. The call traffic load may be a figure that estimates the number of transmitted and received calls that may be attempted in a given unit of time for a selected server and technology.

Following task 84, a task 86 is performed to populate a CDMA traffic array (not shown) and store the CDMA traffic array in memory 46 (FIG. 2) for later use. The CDMA traffic array includes a listing of each of locations 64 (FIG. 1) of network 20 and the amount of call traffic, in Erlangs, assigned to each of locations 64. Following task 86, processor 38 (FIG. 2) ends the execution of probable server identification module 52 having generated a CDMA probable server array at task 78, a CDMA E.sub.c/I.sub.o ratio array at task 80, and a CDMA traffic array at task 86.

FIG. 4 shows a flow chart of forward link initial estimation module 54. That is, FIG. 4 illustrates an exemplary process performed through the execution of module 54. Forward link initial estimation module 54 is executed to provide an initial forward link assessment of network 20 (FIG. 1) prior to executing reverse link analysis module 60. The estimated parameters resulting from forward link initial estimation module 54 will be inputs for reverse link analysis module 60 when reverse link analysis module 60 (FIG. 2) is implemented prior to forward link analysis module 58 (FIG. 2) in network performance analysis process 62 (FIG. 2).

Module 54 begins with a task 88. At task 88, processor 38 (FIG. 2) determines a server load carried by each of servers 22 (FIG. 1). In other words, task 88 calculates an amount of the call traffic, representing a quantity of users (equivalently represented as a call traffic load, in Erlangs), that is being carried by each server 22.

Task 88 may employ predetermined handoff probabilities. The handoff probabilities indicate the likelihood of a mobile station 24 (FIG. 1) being in a single, two-way, or three-way handoff with more than one of servers 22. Such probabilities may be located, for example, in an array in memory 46 (FIG. 2) of computing system 36 (FIG. 2). Alternatively, the handoff probabilities may be read in from an external source, such as from an external database.

The handoff probabilities are a function of the velocity of mobile station 24, handoff condition of the three strongest received pilot channel powers, E.sub.c,j, the amount of the call traffic load added per server 22, the call traffic load dropped per server, and the ratios E.sub.c,j/I.sub.tot.sub.--.sub.min in the CDMA E.sub.c/I.sub.o ratio array that correspond to the highest received pilot channel powers, E.sub.c,j, detected at one of locations 64. The handoff probabilities read from an external database take into account the effects due to Rayleigh and Rician fading, lognormal shadowing, the power control mechanism employed on the overall required ratio of the useful user signal energy per bit over the noise, E.sub.b/N.sub.o, and the resultant mean required traffic channel power.

Task 88 determines the call traffic loading at one of servers 22 by analyzing each of locations 64 of network 20 and incrementally updating the call traffic load of the active set of pilots, i.e. the three strongest received pilot channel powers, E.sub.c,j, at one of locations 64.

Following task 88, a task 90 is performed. Task 90 causes processor 38 (FIG. 2) to determine a server transmit power for each of servers 22. Processor 38 defines the total transmit power for any of servers 22 by using the server load determined in task 88 together with a voice activity factor, v, and the call traffic, pilot, sync, and paging channel powers. The total transmit power, which is calculated for every server j in network 20 may be defined as follows: CDMA.sub.--fw.sub.--tx.sub.--pow[j]=P.sub.pilot.sub.--.sub.j+P.sub.sync.s- ub.--.sub.j+P.sub.paging.sub.--.sub.j+CDMA_Sector_Load[j](v)(P.sub.traffic- .sub.--.sub.nominal.sub.--.sub.j) (9) where voice activity factor, v, is the average duty cycle (active time/total time) of a voice signal, and P.sub.traffic.sub.--.sub.nominal.sub.--.sub.j is the nominal transmit power allocation of a traffic channel at server j.

Following task 90, a task 92 is performed. Task 92 causes processor 38 (FIG. 2) to determine total interference power for each of locations 64, denoted by the character "p". Processor 38 determines the total interference power, I_tot[p] received from all servers 22 in network 20 as the sum of the received power at location 64, p, from server j, as follows:

.function..times..times..times..times..function..times. ##EQU00002## where path_loss(j,p) represents the path loss between location p and server j, after applying corrections for the mobile station antenna gain and head or body signal attenuation.

Following task 92, a task 94 is performed. Task 94 is only performed for multiple mode networks, that is networks that offer more than one communication service, for example, a AMPS/CDMA network. Task 94 causes processor 38 (FIG. 2) to determine the hand-down traffic in network 20 (FIG. 1) and determine a digital communication traffic map, or CDMA-only traffic map. The determination of whether the CDMA call traffic at a particular one of locations 64, p, should be handed down to an analog technology is different for beacon servers and border servers. As discussed previously, a beacon server in a beacon cell allows a mobile station user to transition between a geographical area offering digital communication service and a geographical area providing analog service. Likewise, a border server of a border cell allows a transition between a geographical area offering digital service and a geographical area providing analog service. However, a border server carries call traffic.

For those of servers 22 that are beacon servers, if the received E.sub.c,j/I_tot[p] from a beacon server at one of locations 64 is greater than a "beacon-threshold" criterion, the call traffic at that one of locations 64 is handed down to an analog wireless communication system and this call traffic is denoted as beacon traffic. For border servers, if all the pilot channels in the active set for one of locations 64 satisfy a "border-threshold" criterion, then the call traffic at that one of locations 64 is handed down to the analog wireless communication system and this call traffic is denoted as border traffic.

This determination of hand-down call traffic in task 94 may be performed in a two-step process. First, at every location 64, p, (within the user-defined range of calculation), processor 38 compares the E.sub.c,j/I_tot value of any beacon pilot channel in the network to the "beacon-threshold." If it is above the threshold, that call traffic is handed down to the analog system and the call traffic corresponding to this location 64 is deleted from the CDMA traffic array and recorded in a beacon traffic array. If it is below the threshold, that call traffic remains as CDMA traffic in the CDMA traffic array.

Second, processor 38 compares the E.sub.c,j/I_tot value of any border pilot channel in the CDMA probable server array, populated at task 78 (FIG. 3B) of probable server identification module (FIGS. 3A and 3B), to the "border-threshold" criterion. If E.sub.c,j/I_tot satisfies the criterion and all the pilots in the active set for that location 64 are from border servers, that call traffic is handed down to the analog system and the call traffic corresponding to this location 64 is deleted from the CDMA traffic array and recorded in a border traffic array. If the criterion is not satisfied, the call traffic remains as CDMA traffic in the CDMA traffic array. Using the above-described information, forward link initial estimation module 54 generates, at task 94, a CDMA-only traffic map (i.e., a map of the digital call traffic to be offered to CDMA network 20). The remaining call traffic in the CDMA traffic array is subsequently used to form the CDMA-only offered traffic map.

Following task 94, a task 96 is performed to re-compute the server load, transmit power, and total interference power. Task 96 re-computes the server load, transmit power, and total interference power based on the hand-down traffic determination of task 94. Re-computation task 96 may be accomplished by first re-computing the server load and server transmit power, CDMA_fw_tx_pow[j] using equation (9). Since the CDMA-call traffic has changed for all border servers and regular servers 22 having beacon servers as their neighbors, the call traffic load for these servers needs to be re-computed using the new values of call traffic, in Erlangs, from the CDMA-only traffic map. Task 96 can then re-compute the total interference power using equation (10) to update the interference power I_tot[p] at all locations 64 pertaining to border sectors. Task 96 may also update the CDMA E.sub.c/I.sub.o ratio array for later use during network analysis.

Following task 96, processor 38 (FIG. 2) ends the execution of forward link initial estimation module 54 having provided an initial forward link assessment of network 20 to be used by reverse link analysis module 60 (FIG. 2). The initial forward link assessment provides estimated parameters that include a CDMA-only traffic map generated at task 94, an updated server transmit power (CDMA_fw_tx_pow[j]), and an updated value of the total interference power (I_tot) at each of locations 64 re-computed at task 96.

FIG. 5 shows a flow chart of reverse link initial estimation module 56. That is, FIG. 5 illustrates an exemplary process performed through the execution of module 56. Reverse link initial estimation module 56 is executed to provide an initial reverse link assessment of network 20 (FIG. 1) prior to executing forward link analysis module 58. The estimated parameters resulting from reverse link initial estimation module 56 will be inputs for forward link analysis module 58 when forward link analysis module 58 (FIG. 2) is executed prior to reverse link analysis module 60 (FIG. 2) in network performance analysis process 62 (FIG. 2).

Module 56 begins with a task 98. Task 98 causes processor 38 (FIG. 2) to estimate a receivable signal level parameter, or a required received signal level, (rsl_req).sub.dBm, for each of servers 22 (FIG. 1). Assuming a perfect power control mechanism for reverse link 25 (FIG. 1), all reverse link signals from mobile stations 24 (FIG. 1) that are power controlled by a particular one of servers 22 will be received at the particular one of servers 22 with the same signal level, or power. This signal level is the required power receivable at one of servers 22 so that a user-specified frame error rate (FER) performance requirement is achieved. The receivable signal level parameter, or required received signal level, is defined as follows: (rsl_req).sub.dBm=(min_rsl).sub.dBm+(RLrise).sub.dB (11) where (min_rsl).sub.dBm is the minimum required signal level assuming no other-user interference and (RLrise).sub.dB is a reverse link noise floor elevation factor, (RLrise).sub.dB, due to the presence of other-user interference.

In an initial assessment, task 98 of reverse link initial estimation process 56 assumes that there is a zero reverse link noise floor elevation, (Rlrise).sub.dB, at server 22. In other words, there is no other-user interference. If there is no other-user interference, the required received signal level, (rsl_req).sub.dBm, at one of servers 22 is estimated as follows: (rsl_req).sub.dBm=(min_rsl).sub.dBm (12) and

.function..times..times..times. ##EQU00003## where NF is the noise figure of the receiver at server 22 and rev_cable_loss is a factor that accounts for the cable loss at server 22. Thus, (min_rsl).sub.dBm is the minimum required received signal level when there is no reverse interference and depends on the thermal noise floor and the required signal to noise ratio for a give frame error rate (FER). Accordingly, task 98 generates an estimate of a required received signal level, (rsl_req).sub.dBm, in the absence of other-user interference, (RLrise).sub.dB, for each of servers 22.

Following task 98 of reverse link initial estimation module 56, a task 100 of a reverse link median margin estimation process 102 (denoted by dashed lines) is performed. In CDMA, the reverse link margin is a quantity defined as the ratio (difference in the logarithmic scale) between the maximum transmit power of a mobile station 24 (FIG. 1) and the required transmit power from the mobile station 24 to achieve a desired performance of reverse link 25 (FIG. 1) for a given availability level.

In a preferred embodiment, the desired performance of reverse link 25 is determined from a desired maximum frame error rate (FER), or the ratio of the number of voice or data frames that are received at server 22 with errors over the total number of received frames. As such, FER is a measure of the quality of service provided to the users. The availability level is the probability that the user of mobile station 24 will observe an FER less than or equal to the desired maximum FER value. The availability level may also be interpreted as the percentage of time for which the user is guaranteed satisfactory performance.

Process 102 computes a reverse link median margin estimate, median_marg.sub.dB[p] [j] for each probable server 22 at each of locations 64. The reverse link median margin estimate, median_marg.sub.db[p] [j], is a reverse link margin estimated for an availability level of fifty percent.

Task 100 of process 102 causes processor 38 (FIG. 2) to select a next one of locations 64 (FIG. 1) from the CDMA probable server array populated at task 78 of probable server identification module 52 (FIGS. 3A and 3B). As discussed in connection with task 78, CDMA probable server array is a data structure that includes each of locations 64 of network 20 and a number of probable servers associated therewith. Thus, processor may select the next one of locations 64 in accordance with a predetermined order of locations 64 within the CDMA probable server array.

Following task 100, a query task 104 is performed. Query task 104 determines if there is a CDMA probable server associated with the selected one of locations 64. If there is not a CDMA probable server associated with the selected location 64, program control proceeds to a query task 106 to determine if there is another one of locations 64 in CDMA probable server array.

However, if query task 104 determines that there is a CDMA probable server for the selected one of locations 64, process 102 proceeds to a task 108. At task 108, a CDMA probable server associated with the selected one of locations 64 is selected.

A task 110 is performed in response to task 108. Task 110 causes processor 38 (FIG. 2) to calculate the reverse link median margin estimate, median_marg.sub.dB[p] [j]. The reverse link median margin estimate, median_marg.sub.dB[p] [j], observed at location "p" with respect to server "j" is defined as follows: median_marg.sub.dB[p][j]=portable_max_ERP.sub.dBm-path_loss.sub.dB[j][p]+- (max_antenna_gain).sub.dB[j]-(rsl_req)dBm[j] (14) where portable_max_ERP.sub.dBm is the maximum Effective Radiated Power (ERP) of mobile station 24 (including the mobile station antenna gain), path_loss.sub.db[j] [p] is the median path-loss between server j and location p, (max_antenna_gain).sub.dB[j] is the maximum antenna gain of the server j, and (rsl_req).sub.dBm=(min_rsl).sub.dBm as computed in task 98.

Following task 110, a task 112 is performed to associate the calculated reverse link median margin estimate, median_marg.sub.dB[p] [j], with the probable server selected at task 108 and the next one of locations 64 selected at task 100 in an estimate array. Following task 112, a query task 114 is performed.

Query task 114 determines if there is another CDMA probable server in association with the selected one of locations 64 for which the reverse link median margin estimate, median_marg.sub.dB[p] [j], calculation is to be performed. When there is another CDMA probable server, process 102 loops back to task 108 to select the next CDMA probable server and repeat the calculation of the reverse link median margin estimate, median_marg.sub.dB[p] [j], for the next probable server. Thus, query task 114 causes the reverse link median margin estimate, median_marg.sub.dB[p] [j], to be calculated for each CDMA probable server likely to be in a mobile station active set of pilot channels at a selected one of locations 64.

When query task 114 determines that there is not another CDMA probable server, process 102 proceeds to query task 106. Likewise, as discussed previously at query task 104, when query task 104 determines that there are no CDMA probable servers associated with the selected one of locations 64, process 102 proceeds to query task 106.

Query task 106 determines if there is another location 64 in the CDMA probable server array for which process 102 is to be performed. When query task 106 determines that there is another location 64, process loops back to task 100 to select the next location, select the next CDMA probable server associated with that location, and repeat the calculation of the reverse link median margin estimate, median_marg.sub.dB[p] [j] for the next CDMA probable server. Thus, query task 106 causes the reverse link median margin estimate, median_marg.sub.dB[p] [j], to be calculated for every CDMA probable server associated with every one of locations 64 in network 20 (FIG. 1).

When query task 106 determines that there is not another location 64, a task 116 of a reverse link coverage layer generation process 118 (denoted by dashed lines) is performed. Task 116 causes processor 38 to scan the estimate array to select a next one of locations 64.

In a preferred embodiment, process 118 evaluates each of the calculated reverse link median margin estimates, median_marg.sub.dB[p] [j], for each CDMA probable server at each of locations 64 to determine whether those locations 64 may be supported in reverse link 25 (FIG. 1) by the respective CDMA probable servers. Process 118 subsequently generates an estimated reverse link coverage layer of those locations 64 where a mobile station is likely to meet the reverse link requirements (discussed below).

Following task 116, a query task 122 determines if all reverse link median margin estimates, median_marg.sub.dB[p] [j], for the selected location are less than a predetermined threshold. In the preferred embodiment, the predetermined threshold is zero. In other words, query task 122 is performed to determine if the maximum Effective Radiated Power (ERP) of mobile station 24 minus the path_loss.sub.dB[j][p] plus the maximum antenna gain of the server j is less than the minimum required signal level, (min_rsl).sub.dBm, assuming no other-user interference (see equations (11) through (14).

When query task 122 determines that all reverse link median margin estimates, median_marg.sub.dB[p] [j], are greater than zero, process 118 proceeds to a task 124. At task 124, the location is rejected from or refused entry into an estimated reverse link coverage layer. The net result of task 124 is a rejection of part of the offered call traffic load in subsequent analyses for locations 64 where a mobile station 24 (FIG. 1) may not meet the reverse link requirements because of mobile station transmit power limitations even when there is no reverse link other-user interference.

However, when query task 122 determines that the reverse link median margin estimates, median_marg.sub.dB[p] [j], is less than zero, process 118 proceeds to a task 126. At task 126, the location is retained in the estimated reverse link coverage layer. The net result of task 126 is an inclusion of the offered call traffic load in subsequent analyses in locations 64 where a mobile station 24 (FIG. 1) will meet the reverse link requirements of adequate mobile station transmission power in the absence of reverse link other-user interference.

Following either of tasks 124 and 126, a query task 128 is performed. At query task 128, processor 38 (FIG. 2) determines if there is another one of locations 64. In other words, processor 38 scans the estimate array to locate another one of locations 64.

When query task 128 determines that there is another one of locations 64, process 118 loops back to task 120 to select that location 64 and evaluate the associated reverse link median margin estimates, median_marg.sub.dB[p] [j]. However, when query task 128 determines that there is not another one of locations 64, reverse link coverage layer generation process 118 is complete and the execution of reverse link initial estimation module 56 ends. The product of module 56 is an estimated reverse link coverage layer that describes the region of network 20 (FIG. 1) that can support a mobile station 24 (FIG. 1) in reverse link 25 (FIG. 1). This estimated coverage layer is very conservative since this is the maximum possible reverse link coverage calculated neglecting the effect of the reverse link interference. Hence, the estimated reverse link coverage layer is an initial reverse link assessment of network 20 to be used by forward link analysis module 58 (FIG. 2).

FIG. 6 shows a flow chart of forward link analysis module 58. That is, FIG. 6 illustrates an exemplary process performed through the execution of module 58. Forward link analysis module 58 is executed to provide an analysis of the average server transmit power necessary to carry the offered call traffic load at a certain performance level. Forward link analysis module 58 also ascertains the margins (forward, interference, and coverage) and the handoff percentages to determine forward link performance.

Module 58 begins with a query task 132. Query task 132 determines if reverse link analysis has already been performed through the implementation of reverse link analysis module 60 (FIG. 2). In a preferred embodiment, forward link analysis module 58 may be executed prior to or following the execution of reverse link analysis module 60 in a network performance analysis, such as the exemplary network performance analysis 62 (described below). The order of execution of modules 58 and 60 depends upon which of forward and reverse links 23 and 25 (FIG. 1) is predicted to be the more limiting of the links. As such, the more limiting of the links will be analyzed prior to the other of links 23 and 25.

At query task 132, when processor 38 (FIG. 2) determines that reverse link analysis has already been performed, through the implementation of reverse link analysis module 60 (FIG. 2), program control proceeds to a task 134. Task 134 causes processor 38 to obtain reverse link analysis output parameters generated through the execution of reverse link analysis module 60 (FIG. 2). In particular, task 134 obtains a reverse link coverage layer generated through the execution of reverse link analysis module 60 (discussed below). This reverse link coverage layer is a compilation of locations 64, "p" (FIG. 1) of network 20 (FIG. 1) that have a calculated reverse link margin, CDMA_rev.sub.dB[p], that is greater than a predetermined threshold of zero. That is, only those of locations 64 having a positive reverse link margin, CDMA_rev.sub.dB[p], in response to the execution of reverse link analysis module 60, are considered when executing forward link analysis module 58.

Alternatively, at query task 132, when processor 38 (FIG. 2) determines that reverse link analysis has not been performed, program control proceeds to a task 136. Task 136 causes processor 38 to obtain initial reverse link assessment output parameters generated through the execution of reverse link initial estimation module 56 (FIG. 5). In particular, task 136 obtains the estimated reverse link coverage layer generated through the execution of process 118 (FIG. 5) of reverse link initial estimation module 56 (FIG. 5). This estimated reverse link coverage layer is a compilation of locations 64, "p" (FIG. 1) of network 20 (FIG. 1) that have a reverse link median margin estimate with respect to at least one of probable servers j, median_marg.sub.dB[p] [j], that is greater than the predetermined threshold of zero. That is, only those of locations 64 having a positive reverse link median margin estimate with respect to at least one of probable servers j, median_marg.sub.db[p] [j], in response to the execution of reverse link initial estimation module 56, are considered when executing forward link analysis module 58.

A task 138 is performed in connection with task 136. At task 138, processor 38 (FIG. 2) executes forward link initial estimation module 54 (FIG. 4) using the estimated reverse link coverage layer. Referring momentarily to FIG. 4, in connection with task 138, task 88 of module 54 determines the server load at one of servers 22 by analyzing each of locations 64 of network 20 and incrementally updating the call traffic load of the active set of pilots, i.e. the three strongest received pilot channel powers, E.sub.c,j, at one of locations 64. However, at task 88, the locations 64 analyzed are those locations in the estimated reverse link coverage layer obtained at task 136. Likewise, task 90 causes processor 38 (FIG. 2) to determine a server transmit power for each of servers 22 in the reverse link coverage layer, using equation (9). The parameters obtained through the execution of tasks 92, 94, and 96 are subsequently affected by the total transmit power calculated in response to the estimated reverse link coverage layer obtained at task 136.

Referring back to FIG. 6, following either of tasks 134 and 138, program control of forward link analysis module 58 proceeds to a task 140. At task 140, a forward link initialization process is performed by processor 38 (FIG. 2). The purpose of forward link initialization task 140 is to generate a forward link interference layer. Task 140 is only performed for those locations 64 in an analyzed or estimated reverse link coverage area obtained at either of tasks 134 or 136.

The forward link interference layer is the interference at each location 64 that would be detected by one of mobile stations 24 (FIG. 1) positioned at that location. The forward link interference for each location is the summation of the server transmit power of all servers that are not in the active set for that location, i.e., not in the CDMA probable server list for that location. In other words, the interference is calculated at each of locations 64, given how much power is being transmitted from each of servers 22 that are not in the CDMA probable server list for that location. The product of task 140 may be an interference array that includes each of locations 64 and an interference value associated therewith.

Following task 140, a task 142 is executed by processor 38. At task 142, a forward link iteration process is performed. FIG. 7 shows a flow chart of a forward link iteration process 144 of forward link analysis module 58. Forward link iteration process 144 is performed to estimate the server power required, given that the call traffic is being carried at a certain performance level (in terms of FER and availability), as specified by the network designer. Accordingly, inputs to process 144 include the reverse link coverage layer obtained at one of tasks 134 and 136, the forward link interference layer generated at task 140 (FIG. 6), the CDMA-only traffic map generated during the execution of task 94 (FIG. 4) of forward link initial estimation module 54 (FIG. 4) or generated during the execution of task 138. In addition, other parameters such as quality of service (QOS), path loss, and most probable handoff criteria may be inputs to process 144.

Process 144 begins with a task 146. At task 146, processor 38 (FIG. 2) selects a next one of servers 22 whose total power is to be calculated. Processor 38 may select one of servers 22 in response to a predetermined listed order as directed by a pointer.

Following task 146, a task 148 causes processor 38 to select a next one of locations 64 in the calculation range of the selected one of servers 22 selected at task 146. Forward link iteration process 144 only considers those of locations 64 having a positive re


Free Web Sudoku Puzzles.
Solve with your browser.
  7   5     4    
  6 4 7          
5     3       8  
      4     5   1
        9        
2   3     6      
  8       2     7
          1 2 3  
    2     5   9  
What is it?



Add Your Site · Terms Of Service · Privacy Policy


DISCLAIMER
Linkgrinder is a free service that searches the Internet and indexes all files found so that you may search quickly and easily for shared files. These files are created and made available individually by users whose identity we are not aware of and who we have no control over. In essence we function like a search engine tool; these files ARE NOT STORED OR SERVED BY OUR NETWORK. We are not responsible for any materials obtained by using our service. We do not monitor any of the contents of these files. These files may contain viruses, illegal materials, materials inappropriate for minors, offensive files and the like. BY USING OUR SERVICE, YOU ASSUME FULL RESPONSIBILITY FOR DOWNLOADING THESE MATERIALS AND WILL INDEMNIFY US FOR ANY DAMAGES THAT MAY BE INCURRED.

For More Specific Information VIEW OUR TERMS OF SERVICE.

Thank you and Enjoy!