Automatic verification of Walsh code orthogonality
AssigneeLucent Technologies Inc.
InventorsSatish Chandra, Patrice I. Godefroid, Christopher D. Palm, Steven M. Welsh
Life of this patent
Estimating the term…
Abstract
A method of verifying that a CDMA code allocator maintains mutual orthogonality between all concurrently busy codes includes the steps of identifying a code being allocated by the allocator, and determining if the identified code is busy. It is also determined if any ancestral parent of the identified code is busy, and if any descendant of the identified code is busy. If the identified code, one of the identified code's ancestral parents, or one of the identified code's descendants is determined to be busy, then an error in allocator operation is indicated.
Claims16
A method of verifying that a CDMA code allocator maintains mutual orthogonality between all concurrently busy codes, said method comprising:
- (a) monitoring the allocator to identify a code being allocated by the allocator;
- (b) determining if the identified code is busy;
- (c) determining if any ancestral parent of the identified code is busy;
- and,
- (d) determining if any descendant of the identified code is busy;
- wherein, if at least one of:
- the identified code;
- one of the identified code's ancestral parents;
- or, one of the identified code's descendants;
- is determined to be busy, then an error in allocator operation is indicated.
An allocator testing system for testing a Walsh code allocator to verify that its operation maintains mutual orthogonality between all concurrently busy Walsh codes, said allocator testing system comprising:
- a call generator which drives an allocator being tested, said call generator providing an input of the allocator with a pattern of channel openings and closings in response to which the allocator outputs Walsh code allocations;
- and,
- a verification module arranged to receive the allocator outputs, said verification module determining for each Walsh code allocation whether or not it would result in at least two non-orthogonal Walsh codes being concurrently busy.
Dependencies are inferred from the claim text.