Abstract
A method of, and system for, communicating messages in an environment which is subject to fading, in which data to be transmitted is encoded and formatted, a checksum is determined for said encoded and formatted data and in which the checksum is added to an address code word which is concatenated with the encoded and formatted message code words to form a message. A receiver is energized for receiving transmissions in its predetermined frame. In response to recognizing its address code word the concatenated code words are decoded and stored. As each code word is stored, substantially simultaneously a checksum is computed for the message assembled so far and is compared to the checksum in the address code word, if and when they are equal it is concluded that a complete message has been received and further analysis of the stored message is terminated. In a variant of the present invention each message is transmitted at least twice and a final version of the message is assembled code word by code word by comparing the corresponding code words in the respective transmissions and selecting the better (or best) version. As the final version is being assembled the checksum is computed and compared to determine the end of the message. In a further variant the detection of an address or idle code word following a message code word is treated as the beginning of a new message and the computed checksum is used when an undecodable code word is received.
| Technology | Declaration Information | Specification Information | Explicitly Disclosed | Patent Type | |||||
|---|---|---|---|---|---|---|---|---|---|
| Declaration Date | Declaration Reference | Declaring Company | Specification Number | ||||||
| 3G | 27/08/2003 | ISLD-200309-005 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| 3G | 25/11/2009 | ISLD-201001-011 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
Specification Information
Specification Information
Technologies
Family Information
| All Granted Patents In Patent Family : | ---- |
| All Pending Patents In Patent Family : | ---- |
| Publication No | Technology | Declaration Information | Specification Information | Explicitly Disclosed | Patent Type | |||||
|---|---|---|---|---|---|---|---|---|---|---|
| Declaration Date | Declaration Reference | Declaring Company | Specification Number | |||||||
| CN1146179C | 3G | 27/08/2003 | ISLD-200309-005 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| CN1146179C | 3G | 25/11/2009 | ISLD-201001-011 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| EP0721714A1 | 3G | 27/08/2003 | ISLD-200309-005 | KONINKLIJKE PHILIPS NV | Yes | Basis Patent | ||||
| EP0721714A1 | 3G | 27/08/2003 | ISLD-200309-005 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| EP0721714A1 | 3G | 25/11/2009 | ISLD-201001-011 | KONINKLIJKE PHILIPS NV | Yes | Basis Patent | ||||
| EP0721714B1 | 3G | 27/08/2003 | ISLD-200309-005 | KONINKLIJKE PHILIPS NV | Yes | Basis Patent | ||||
| EP0721714B1 | 3G | 27/08/2003 | ISLD-200309-005 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| EP0721714B1 | 3G | 25/11/2009 | ISLD-201001-011 | KONINKLIJKE PHILIPS NV | Yes | Basis Patent | ||||
| AU695562B2 | 3G | 27/08/2003 | ISLD-200309-005 | KONINKLIJKE PHILIPS NV | Yes | Basis Patent | ||||
| AU695562B2 | 3G | 27/08/2003 | ISLD-200309-005 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| AU695562B2 | 3G | 25/11/2009 | ISLD-201001-011 | KONINKLIJKE PHILIPS NV | Yes | Family Member | ||||
| CN100409603C | 3G | 27/08/2003 | ISLD-200309-005 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| CN100409603C | 3G | 25/11/2009 | ISLD-201001-011 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| CN1496053A | 3G | 27/08/2003 | ISLD-200309-005 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| CN1496053A | 3G | 25/11/2009 | ISLD-201001-011 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| CN100409604C | 3G | 27/08/2003 | ISLD-200309-005 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| CN100409604C | 3G | 25/11/2009 | ISLD-201001-011 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| CN1496054A | 3G | 27/08/2003 | ISLD-200309-005 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| CN1496054A | 3G | 25/11/2009 | ISLD-201001-011 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| ES2220931T3 | 3G | 27/08/2003 | ISLD-200309-005 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| ES2220931T3 | 3G | 25/11/2009 | ISLD-201001-011 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| HU219941B | 3G | 27/08/2003 | ISLD-200309-005 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| HU219941B | 3G | 25/11/2009 | ISLD-201001-011 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| HUT74625A | 3G | 27/08/2003 | ISLD-200309-005 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| HUT74625A | 3G | 25/11/2009 | ISLD-201001-011 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| JP3778932B2 | 3G | 27/08/2003 | ISLD-200309-005 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| JP3778932B2 | 3G | 25/11/2009 | ISLD-201001-011 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| JPH09503371A | 3G | 27/08/2003 | ISLD-200309-005 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| JPH09503371A | 3G | 25/11/2009 | ISLD-201001-011 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| JP2003110534A | 3G | 27/08/2003 | ISLD-200309-005 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| JP2003110534A | 3G | 25/11/2009 | ISLD-201001-011 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| JP2003060624A | 3G | 27/08/2003 | ISLD-200309-005 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| JP2003060624A | 3G | 25/11/2009 | ISLD-201001-011 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| JP2006074819A | 3G | 27/08/2003 | ISLD-200309-005 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| JP2006074819A | 3G | 25/11/2009 | ISLD-201001-011 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| JP3862734B2 | 3G | 27/08/2003 | ISLD-200309-005 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| JP3862734B2 | 3G | 25/11/2009 | ISLD-201001-011 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| JP2006042391A | 3G | 27/08/2003 | ISLD-200309-005 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| JP2006042391A | 3G | 25/11/2009 | ISLD-201001-011 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| JP3862735B2 | 3G | 27/08/2003 | ISLD-200309-005 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| JP3862735B2 | 3G | 25/11/2009 | ISLD-201001-011 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| PL178432B1 | 3G | 27/08/2003 | ISLD-200309-005 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| PL178432B1 | 3G | 25/11/2009 | ISLD-201001-011 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| PL314230A1 | 3G | 27/08/2003 | ISLD-200309-005 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| PL314230A1 | 3G | 25/11/2009 | ISLD-201001-011 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| RU2144736C1 | 3G | 27/08/2003 | ISLD-200309-005 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| RU2144736C1 | 3G | 25/11/2009 | ISLD-201001-011 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| US5721743A | 3G | 27/08/2003 | ISLD-200309-005 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| US5721743A | 3G | 25/11/2009 | ISLD-201001-011 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| WO9603820A2 | 3G | 27/08/2003 | ISLD-200309-005 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| WO9603820A2 | 3G | 25/11/2009 | ISLD-201001-011 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| WO9603820A3 | 3G | 27/08/2003 | ISLD-200309-005 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| WO9603820A3 | 3G | 25/11/2009 | ISLD-201001-011 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| BR9506289A | 3G | 27/08/2003 | ISLD-200309-005 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| BR9506289A | 3G | 25/11/2009 | ISLD-201001-011 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| CN1135273A | 3G | 27/08/2003 | ISLD-200309-005 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| CN1135273A | 3G | 25/11/2009 | ISLD-201001-011 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| DE69532987T2 | 3G | 27/08/2003 | ISLD-200309-005 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| DE69532987T2 | 3G | 25/11/2009 | ISLD-201001-011 | KONINKLIJKE PHILIPS NV | No | Family Member | ||||
| CZ89296A3 | ----- | ----- | ----- | ----- | ----- | ----- | ----- | |||
| Publication No | Technology | Declaration Information | Specification Information | Explicitly Disclosed | Patent Type | Status | National Phase Entries | |||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Declaration Date | Declaration Reference | Declaring Company | Specification Information | |||||||||
| ----- | ----- | ----- | ----- | ----- |
S1
|
----- | ----- | ----- | ----- | |||
Technologies
Signal Processing
Product
Use Cases
Wireless communication
Services
Claim
1. A method of transmitting and receiving data messages, comprising the steps of compiling a message from a plurality of code words, calculating a checksum for that message and embedding the checksum in the message; transmitting the message; receiving the transmitted message; recovering the code words; storing successive code words; after each code word has been stored, determining the checksum using the same algorithm as used to determine the checksum in the originally transmitted message, and, if the checksum so determined corresponds to that embedded in the originally transmitted message, and recording this correspondence.
2. A method as claimed in claim 1 , characterised in that in response to recording said correspondence the message is treated as being complete.
3. A method as claimed in claim 1 , characterised by decoding stored code words until an address code word is noted and in response thereto treating the message up to the previous code word as being complete.
4. A method as claimed in claim 1 , characterised by decoding successive stored code words in turn until an undecodable code word is detected, checking if said correspondence has been obtained and, if so, treating the message up to and including the code word providing said correspondence as a complete message.
5. A method as claimed in claim 1 , wherein a message comprises an address code word and concatenated message code words, characterised in that the checksum is embedded in the address code word.
6. A method as claimed in claim 1 , wherein a message comprises an address code word and concatenated message code words, characterised in that the checksum is embedded in the message code word concatenated with the address code word.
7. A method as claimed in claim 1 , characterised by transmitting each message at least twice; receiving the first transmission of the message; error correcting the code words if required; decoding each code word and storing the decoded code word; receiving the or each repeat of the message, error correcting the code words of the or each received message repeat, if required; decoding each code word, storing the repeated message code word by code word; commencing with the stored version of the first message, assembling a final version of the message by comparing corresponding code words in the first message and the or each repeat thereof; after each code word has been added to the final version of the message being assembled, determining the checksum using the same algorithm as used to determine the checksum in the originally transmitted message, and, if the checksum so determined corresponds to that embedded in the originally transmitted message, terminating further comparison of the original and the repeated message(s).
8. A method of communicating messages, comprising encoding and formatting data to be transmitted; determining a checksum for said encoded and formatted data and embedding the checksum in the formatted data to form a message, and transmitting the message at least twice at predetermined intervals for each transmission of the same message, receiving and decoding message data in the respective batches and storing the decoded data; determining, by considering the corresponding code words in the decoded data, which of the code words is correct and storing the correct code word and substantially simultaneously computing a checksum in respect of the stored correct code words, whereby when the checksum computed equals the checksum embedded in the formatted data it is concluded that a complete message has been received and further analysis of the stored message is terminated.
9. A method as claimed in claim 8, characterised in that the messages are transmitted in a predetermined frame of at least two concatenated batches, in that the decoded message or concatenated messages present in the predetermined frame of the first of the at least two batches is stored, in that the decoded message code words present in the same predetermined frame of the second and optionally subsequent batches are stored code word by code word until an indication of the end of a message is noted
10. A method as claimed in claim 8 or 9, characterised in that the checksum is embedded in an address code word which is concatenated with data code words
11. A method as claimed in any one of claims 1 to 10, characterised in that the code words are transmitted bit interleaved and are de-interleaved on being received
12. A system for transmitting and receiving data messages, comprising means for calculating and embedding a checksum in each message, means for receiving the transmitted message, means for error correcting the message, if required, means for storing successive code words, means responsive to the addition of each code word to the stored code words, for determining a checksum using the same algorithm as was used to calculate the checksum in the originally transmitted message, and means for recording when the determined checksum corresponds to that embedded in the originally transmitted message
13. A system for transmitting and receiving data messages, comprising means for calculating and embedding a checksum in each message, means for transmitting the message and at least one repeat thereof, means for receiving the original transmission of the message and the or each repeat of the message, means for error correcting the message and the or each repeat thereof, if required, means for storing successive code words of the message, said means storing the repeated message(s) code word by code word, means for assembling a final version of the message, said means including means for comparing corresponding code words in the originally received message and the or each repeat thereof, means responsive to the addition of each code word to the final version of the message being assembled, for determining the checksum using the same algorithm as used to calculate the checksum in the originally transmitted message, means for determining that a complete message has been received in response to the calculated checksum corresponding to that embedded in the originally transmitted message, and means for terminating further comparison of the original and the repeated message(s)
14. A communication system comprising means for encoding and formatting data to be transmitted, means for calculating a checksum for said encoded and formatted data and embedding the checksum in the formatted message, means for transmitting the message, means for receiving the transmitted message, means for decoding message code words, means for storing the decoded code words, means responsive to the storing of each code word for computing a checksum, means for comparing the checksum computed with the checksum embedded in the transmitted message, and means for determining that the checksums are the same and, in response thereto, for inhibiting further comparison of the checksums and for storing the correct code words as a complete message
15. A primary station for use in the communication system as claimed in claim 14, comprising means for encoding and formatting data to be transmitted, means for determining a checksum for said encoded and formatted data and embedding the checksum in the formatted data to form a message
16. A secondary station for use in the communication system as claimed in claim 14, comprising means for receiving a transmitted message, means for decoding code words comprising the message, means for storing the decoded code words means responsive to the storing of each code word for computing a checksum, means for comparing the checksum computed with the checksum embedded in the formatted message as transmitted, and means for recording when the computed and embedded checksums correspond.']
Associated Portfolios
Licensor Claim Chart
 Claim Chart |
 Technology |
 Creation Date |
 Download |
|---|---|---|---|
|
Claim charts will soon be available!
|
|||
SUMMARY
ClaimChart-AU2897095A-STO
Patent number:AU2897095A
Claim Chart Type : SEP Claim Chart
Price: 200 €
To view claim charts you must become a Gold or Platinum Member.
Upgrade your subscriptionYou have reached the maximum number of patents which can be associated to your account per your subscription. If you wish to associate more patents
Please upgrade your subscription.Note:
The information in blue was extracted from the third parties (Standard Setting Organisation, Espacenet)
The information in grey was provided by the patent holder
The information in purple was extracted from the FrandAvenue
Explicitly disclosed patent:openly and comprehensibly describes all details of the invention in the patent document.
Implicitly disclosed patent:does not explicitly state certain aspects of the invention, but still allows for these to be inferred from the information provided.
Basis patent:The core patent in a family, outlining the fundamental invention from which related patents or applications originate.
Family member:related patents or applications that share a common priority or original filing.