US6201811B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Transferring Identifier information in a telecommunications system
Assignee: Wi-Fi One LLC
•
Filing: 1998-03-24
•
Granted: 2001-03-13
•
Expires: 2018-03-24
Abstract
Abstract In a wireless telecommunications network, transporting identification information, such as access point identifier (AP ID) and wireless terminal identifier (WT ID) information, in each uplink and each downlink protocol data unit (PDU) being transmitted between a sender and a receiver, without increasing bandwidth requirements. This is accomplished by modifying each PDU as a function of a first identification vector, prior to transmission, wherein the first identification vector reflects, for example, the AP ID and the corresponding WT ID. At the receiver, the PDU is re-modified as a function of a second identification vector, wherein the second identification vector reflects an expected AP ID and WT ID. If the receiver is the intended recipient of the PDU, the first and second identification vectors will be the same, and the process of re-modifying the PDU merely serves to restore the original value of the PDU. The receiver can detect whether the original value of the PDU has been restored through a data integrity check, for example, one which employs a cyclic redundancy code (CRC). The result can then be used to determine whether the receiver is, in fact, the intended receiver, and whether the receiver should decode the PDU or discard it.
Inventors
- 👤 Mikael Larsson
- 👤 Peter Larsson
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-05 07:31
CPC Classifications
H; H04; H04L; H04L49/00; H04L49/10; H04L49/104; H04L49/105; H04L49/108; H04Q; H04Q11/00; H04Q11/04; H04Q11/0428; H04Q11/0478; H04L12/00; H04L12/54; H04L12/56; H04L12/5601; H04L2012/5614; H04L2012/5616; H04L2012/5638; H04L2012/5646; H04L2012/5647; H04L2012/5652; H04L2012/5672; H04L2012/5673
Claims Analysis
Total Claims: 43
Claim 1
Independent Claim
96 words
A method of transporting a protocol data unit (PDU) from a sender to an intended receiver in a telecommunications network comprising the steps of: at the sender, generating a PDU containing a data word; encoding said data word as a function of a first identification vector without increasing the bandwidth required to transport said PDU from the sender to the receiver, wherein said first identification vector comprises a priori identification information relating to the sender and the intended receiver; and transmitting a data frame that includes said PDU from the sender to a plurality of receivers.
Claim 2
Independent Claim
96 words
A method of transporting a protocol data unit (PDU) from a sender to an intended receiver in a telecommunications network comprising the steps of: at the sender, generating a PDU containing a data word; encoding said data word as a function of a first identification vector without increasing the bandwidth required to transport said PDU from the sender to the receiver, wherein said first identification vector comprises a priori identification information relating to the sender and the intended receiver; and transmitting a data frame that includes said PDU from the sender to a plurality of receivers.
Claim 3
Dependent Claim
44 words
The method of claim 1 , wherein said step of encoding said data word as a function of a first identification vector without increasing the bandwidth required to transport said PDU comprises the step of: XORing said data word and said first identification vector.
Claim 4
Dependent Claim
23 words
The method of claim 1 , wherein said data word comprises a user data vector and an error detection and correction code vector.
Claim 5
Dependent Claim
57 words
The method of claim 3 , wherein said error detection and correction code vector is a cyclic redundancy code (CRC) vector, and wherein said method further comprises the steps of: generating said CRC vector as a function of said user data vector; and generating said data word by appending said CRC vector to said user data vector.
Claim 6
Dependent Claim
76 words
The method of claim 4 , wherein said first identification vector comprises a first portion and a second portion, said first portion containing said identification information relating to the sender and the intended receiver and said first portion being less than or equal in length to said CRC vector, said second portion containing a number of bits which are set equal to zero and said second portion being equal in length to said user data vector.
Claim 7
Dependent Claim
21 words
The method of claim 5 , wherein said first portion contains a network address of the sender and the intended receiver.
Claim 8
Dependent Claim
20 words
The method of claim 3 , wherein said error detection and error correction code is a Reed Solomon code vector.
Claim 9
Dependent Claim
33 words
The method of claim 1 , wherein said identification information relating to the sender and the intended receiver comprises an address associated with the sender and an address associated with the intended receiver.
Claim 10
Dependent Claim
46 words
The method of claim 1 , wherein said step of transmitting said data frame that includes said PDU from the sender to a plurality of receivers comprises the step of: transmitting said data frame and said PDU in accordance with an asynchronous transfer mode (ATM) protocol.
Claim 11
Dependent Claim
23 words
The method of claim 9 , wherein said identification information relating to the sender and the intended receiver comprises a connection identifier code.
Claim 12
Dependent Claim
23 words
The method of claim 9 , wherein said identification information relating to the sender and the intended receiver comprises a packet sequence number.
Claim 13
Dependent Claim
85 words
The method of claim 1 further comprising the steps of: at a receiver, decoding said encoded data word as a function of a second identification vector; wherein said second identification vector comprises identification information relating to the receiver and an expected sender; verifying the integrity of said decoded data word as a function of said user data vector and said CRC vector; and determining whether the receiver is the intended receiver of the PDU based on the result of the decoded data word integrity verification.
Claim 14
Dependent Claim
37 words
The method of claim 12 , wherein said step of decoding said encoded data word as a function of said second identification vector comprises the step of: XORing said encoded data word with said second identification vector.
Claim 15
Dependent Claim
97 words
The method of claim 12 , wherein said first and said second identification vectors are defined such that the step of encoding said data word as a function of said first identification vector and said step of decoding said encoded data word as a function of said second identification vector do not induce in said decoded data word a number of bit errors which exceeds a number of errors that can be detected during said step of verifying the integrity of said decoded data word as a function of said user data vector and said CRC vector.
Claim 16
Dependent Claim
58 words
The method of claim 14 , wherein said first and said second identification vectors comprise a sequence of bits having a length L, wherein the length L is equal to the length of said data word, and wherein exactly two bit positions are set equal to “1” and the remaining L-2 bit positions are set equal to “0”.
Claim 17
Dependent Claim
64 words
The method of claim 14 , wherein said first and said second identification vectors comprise a sequence of bits having a length L, wherein the length L is equal to the length of said data word, and wherein a first bit position is set equal to either “1” or “0” and exactly one of the remaining L-1 bit positions is set equal to “1”.
Claim 18
Dependent Claim
64 words
The method of claim 14 , wherein said first and said second identification vectors comprise a sequence of bits having a length L, wherein the length L is equal to the length of said data word, and wherein a first bit position is set equal to either “1” or “0” and exactly two of the remaining L-1 bit positions are set equal to “1”.
Claim 19
Dependent Claim
53 words
The method of claim 1 further comprising the step of: selecting said first identifier code as a function of said identification information relating to the sender and the intended receiver, from amongst a plurality of identifier codes stored in a lookup table, wherein said plurality of identifier codes were generated by an algorithm.
Claim 20
Dependent Claim
48 words
The method of claim 1 , wherein said data frame comprises a broadcast data field and a plurality of PDUs, and wherein said broadcast data field includes a list of the plurality of PDUs and information relating to the intended receiver of each of said plurality of PDUs.
Claim 21
Dependent Claim
107 words
The method of claim 19 further comprising the steps of: at a receiver, decoding the data words associated with each of said plurality of PDUs as a function of each of a plurality of second identification vectors which are derived from said list in said broadcast data field and the information relating to the intended receiver of each of said plurality of PDUs; verifying the integrity of said decoded data words as a function of the user data vectors and CRC vectors associated with each data word; and verifying the integrity of said broadcast data field based on the data integrity verification of said decoded data words.
Claim 22
Dependent Claim
41 words
The method of claim 20 , wherein said step of verifying the integrity of said broadcast data field comprises the step of: comparing a number of PDUs which fail the integrity verification with a predefined number of PDU integrity verification failures.
Claim 23
Independent Claim
171 words
A method for determining whether a receiver is an intended receiver of a protocol data unit (PDU) transmitted to the receiver from a sender in a telecommunications network, said method comprising the steps of: receiving said PDU, wherein said PDU comprises a user data vector and a cyclic redundancy code (CRC) vector, and wherein said user data vector and said CRC vector have been modified at the sender, without increasing the bandwidth required to transmit the PDU from the sender to the intended receiver, as a function of a first identification vector which contains identification information relating to the sender and the intended receiver; re-modifying said user data vector and said CRC vector as a function of a second identification vector which contains identification information relating to the receiver and an expected sender; verifying the integrity of said PDU as a function of said re-modified user data vector and said re-modified CRC vector; and determining whether the receiver is the intended receiver based on the result of the PDU integrity verification.
Claim 24
Independent Claim
171 words
A method for determining whether a receiver is an intended receiver of a protocol data unit (PDU) transmitted to the receiver from a sender in a telecommunications network, said method comprising the steps of: receiving said PDU, wherein said PDU comprises a user data vector and a cyclic redundancy code (CRC) vector, and wherein said user data vector and said CRC vector have been modified at the sender, without increasing the bandwidth required to transmit the PDU from the sender to the intended receiver, as a function of a first identification vector which contains identification information relating to the sender and the intended receiver; re-modifying said user data vector and said CRC vector as a function of a second identification vector which contains identification information relating to the receiver and an expected sender; verifying the integrity of said PDU as a function of said re-modified user data vector and said re-modified CRC vector; and determining whether the receiver is the intended receiver based on the result of the PDU integrity verification.
Claim 25
Dependent Claim
41 words
The method of claim 22 , wherein said step of verifying the integrity of said PDU as a function of the intended receiver comprises the step of: dividing a CRC generator polynomial into said re-modified user data vector using modulus-2 division.
Claim 26
Dependent Claim
51 words
The method of claim 23 , wherein said step of determining whether the receiver is the intended receiver comprises the steps of: determining whether the modulus-2 division resulted in a zero remainder; and if the modulus-2 division did result in a zero remainder, determining that the receiver is the intended receiver.
Claim 27
Dependent Claim
23 words
The method of claim 24 , wherein said first and said second identification vectors are equivalent if the receiver is the intended receiver.
Claim 28
Dependent Claim
52 words
The method of claim 23 , wherein said step of determining whether the receiver is the intended receiver comprises the steps of: determining whether the modulus-2 division resulted in a non-zero remainder; and if the modulus-2 division did result in a non-zero remainder, determining that the receiver is not the intended receiver.
Claim 29
Dependent Claim
25 words
The method of claim 26 further comprising said step of: discarding said PDU if it is determined that the receiver is not the intended receiver.
Claim 30
Independent Claim
97 words
A method of transporting a protocol data unit (PDU) from a sender to an intended receiver in a telecommunications network, wherein said PDU contains a user data vector, said method comprising the steps of: appending a first identification vector to said user data vector; generating a cyclic redundancy code (CRC) vector based on said user data vector and said appended, first identification vector; appending said CRC vector to said user data vector; removing said appended, first identification vector from said user data vector; and transmitting said PDU, including said user data vector and said appended CRC vector.
Claim 31
Independent Claim
97 words
A method of transporting a protocol data unit (PDU) from a sender to an intended receiver in a telecommunications network, wherein said PDU contains a user data vector, said method comprising the steps of: appending a first identification vector to said user data vector; generating a cyclic redundancy code (CRC) vector based on said user data vector and said appended, first identification vector; appending said CRC vector to said user data vector; removing said appended, first identification vector from said user data vector; and transmitting said PDU, including said user data vector and said appended CRC vector.
Claim 32
Dependent Claim
15 words
The method of claim 28 , wherein said first identification vector comprises a network address.
Claim 33
Dependent Claim
28 words
The method of claim 29 further comprising the step of: generating control data to be transmitted prior to said PDU, wherein said control data defines said network address.
Claim 34
Dependent Claim
20 words
The method of claim 30 , wherein said control data defines said network address is an access point identifier code.
Claim 35
Dependent Claim
20 words
The method of claim 30 , wherein said control data defines said network address is a wireless terminal identifier code.
Claim 36
Dependent Claim
26 words
The method of claim 30 , wherein said control data defines said network address is an access point identifier code and a wireless terminal identifier code.
Claim 37
Dependent Claim
73 words
The method of claim 28 further comprising the steps of: at a receiver, appending a second identification vector to said user data vector; generating a CRC generator polynomial from said CRC vector; verifying the integrity of said PDU by dividing said CRC generator polynomial into said user data vector and said appended, second identification vector; and determining whether the receiver is the intended receiver based on the result of the PDU integrity verification.
Claim 38
Dependent Claim
144 words
In a telecommunications network, a method of determining whether a receiver is an intended receiver of a protocol data unit (PDU) transmitted from a sender, wherein said PDU comprises a user data vector and a cyclic redundancy code (CRC) vector, and wherein said CRC vector was derived at the sender as a function of said user data vector and a first identification vector that was appended to said user data vector only for the purpose of deriving said CRC vector, said method comprising the steps of: at the receiver, generating a CRC generator polynomial based on said CRC vector; appending a second identification vector to said user data vector; dividing said CRC generator polynomial into a data word comprising said user data vector and said appended, second identification vector; determining whether the receiver is the intended receiver based on the result of the division.
Claim 39
Dependent Claim
144 words
In a telecommunications network, a method of determining whether a receiver is an intended receiver of a protocol data unit (PDU) transmitted from a sender, wherein said PDU comprises a user data vector and a cyclic redundancy code (CRC) vector, and wherein said CRC vector was derived at the sender as a function of said user data vector and a first identification vector that was appended to said user data vector only for the purpose of deriving said CRC vector, said method comprising the steps of: at the receiver, generating a CRC generator polynomial based on said CRC vector; appending a second identification vector to said user data vector; dividing said CRC generator polynomial into a data word comprising said user data vector and said appended, second identification vector; determining whether the receiver is the intended receiver based on the result of the division.
Claim 40
Dependent Claim
22 words
The method of claim 35 , wherein said step of dividing said CRC generator polynomial into the data word involves modulus-2 division.
Claim 41
Dependent Claim
49 words
The method of claim 35 , wherein said step of determining whether the receiver is the intended receiver comprises the step of: determining whether the division resulted in a zero remainder; and if the division did result in a zero remainder, determining that the receiver is the intended receiver.
Claim 42
Dependent Claim
50 words
The method of claim 35 , wherein said step of determining whether the receiver is the intended receiver comprises the step of: determining whether the division resulted in a non-zero remainder; and if the division did result in a non-zero remainder, determining that the receiver is not the intended receiver.
Claim 43
Dependent Claim
25 words
The method of claim 38 further comprising said step of: discarding said PDU if it is determined that the receiver is not the intended receiver.
References Cited (Backward Citations)
US5461627A
Cited
US5408469A
Cited
EP0660570A2
Cited
US5640395A
Cited
US5600653A
Cited
US5699369A
Cited
US5642421A
Cited
US5684791A
Cited
US5812545A
Cited
US5828677A
Cited
US5907544A
Cited
US5936949A
Cited
US6088337A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2004-03-12 | 2004-09-11 | 2005-03-13 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2008-03-12 | 2008-09-11 | 2009-03-13 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2012-03-12 | 2012-09-11 | 2013-03-13 | $7700.00 | Window Closed / Lapsed |