← Back to Patent Explorer
US6044486A Expired / Lapsed US ⏱️ 0.0 years remaining

Method and device for majority vote optimization over wireless communication channels

Assignee: Uniden America Corp
•
Filing: 1997-09-11
•
Granted: 2000-03-28
•
Expires: 2017-09-11
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method and device for error-correcting a plurality of bits transmitted over RF channels in a cellular communication system are provided. The present invention applies principles of majority voting to error-correct a plurality of bits in a message word simultaneously. Further, the present invention applies its error-correction capability to virtually any number of repeat transmissions over forward and reverse control/voice channels. Following synchronization of the transmit and receive stations, a message word having n-bits is transmitted repeatedly. The repeat bits are separated and analyzed whereafter the true logical state of the original n-bits is determined. The originally transmitted message word is then reconstructed based upon the determined true logical state of the n-bits.

Inventors

  • 👤 Mark Underseth
  • 👤 Nobusuke Matsuoka

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-29 12:34
CPC Classifications
H; H04; H04L; H04L1/00; H04L1/08

Claims Analysis

Total Claims: 28
Claim 1
Independent Claim 104 words
In a communication system having a transmit (TX) station and a receive (RX) station including at least one processor, a method of error-correcting a plurality of transmitted bits representing a message word, comprising the steps of: receiving said plurality of transmitted bits from the TX station multiple times as a plurality of repeat sets at said RX station; and instructing said at least one processor to execute at least one majority vote upon a first repeat set corresponding to a first original bit substantially simultaneously with at least another repeat set corresponding to another original bit which is adjacent to said first original bit.
Claim 2
Dependent Claim 104 words
In a communication system having a transmit (TX) station and a receive (RX) station including at least one processor, a method of error-correcting a plurality of transmitted bits representing a message word, comprising the steps of: receiving said plurality of transmitted bits from the TX station multiple times as a plurality of repeat sets at said RX station; and instructing said at least one processor to execute at least one majority vote upon a first repeat set corresponding to a first original bit substantially simultaneously with at least another repeat set corresponding to another original bit which is adjacent to said first original bit.
Claim 3
Dependent Claim 36 words
The method as defined in claim 1, wherein the step of instructing said at least one processor further comprises using a first processing bit and at least another processing bit of said at least one processor.
Claim 4
Dependent Claim 27 words
The method as defined in claim 1, further comprising the step of reconstructing said message word based on the outcome of said at least one majority vote.
Claim 5
Dependent Claim 29 words
The method as defined in claim 1, wherein each of said plurality of repeat sets comprises a plurality of repeat bits received for a bit in the message word.
Claim 6
Dependent Claim 46 words
The method as defined in claim 1, wherein each of said plurality of repeat sets comprises a first bit, a second bit, a third bit, a fourth bit, and a fifth bit, which are received at said RX station for a bit in the message word.
Claim 7
Dependent Claim 39 words
The method as defined in claim 5, further comprising the step of determining a number of bit pairs and a number of bit cancels among said first bit, second bit, third bit, and fourth bit at said RX station.
Claim 8
Dependent Claim 37 words
The method as defined in claim 6, further comprising the step of determining the true logical state of the bit in the message word based upon said number of bit pairs and said number of bit cancels.
Claim 9
Dependent Claim 37 words
The method as defined in claim 6, further comprising the step of using said number of bit pairs and said number of bit cancels to determine whether said fifth bit should be examined as a tie breaker.
Claim 10
Dependent Claim 29 words
The method as defined in claim 6, further comprising the step of using an exclusive-OR circuit to determine said number of bit pairs and said number of bit cancels.
Claim 11
Dependent Claim 34 words
The method as defined in claim 1, wherein the number of bits in each of said plurality of repeat sets is represented by R, and wherein R may be any integer greater than 1.
Claim 12
Dependent Claim 46 words
The method as defined in claim 10, wherein R=11 and each of said plurality of repeat sets comprises a first set of bits, a second set of bits, and an eleventh bit, which are received at said RX station for a bit in the message word.
Claim 13
Dependent Claim 25 words
The method as defined in claim 11, further comprising the step of applying a first majority vote-5 ("MVote-5") method on said first set of bits.
Claim 14
Dependent Claim 23 words
The method as defined in claim 12, further comprising the step of applying a second MVote-5 method on said second set of bits.
Claim 15
Dependent Claim 36 words
The method as defined in claim 13, further comprising the step of assessing the outcomes of said first MVote-5 and second MVote-5 applications to determine whether said eleventh bit should be examined as a tie breaker.
Claim 16
Dependent Claim 36 words
The method as defined in claim 14, further comprising the step of applying at least one more MVote-5 on a selected set of bits based upon the outcomes of said first MVote-5 and second MVote-5 applications.
Claim 17
Dependent Claim 105 words
In a communication system having a transmit (TX) station and a receive (RX) station including at least one processor, a device which error-corrects a plurality of transmitted bits representing a message word, comprising: means for receiving said plurality of transmitted bits from said TX station multiple times as a plurality of repeat sets at said RX station; and means for instructing said at least one processor to execute at least one majority vote upon a first repeat set corresponding to a first original bit substantially simultaneously with at least another repeat set corresponding to another original bit which is adjacent to said first original bit.
Claim 18
Dependent Claim 105 words
In a communication system having a transmit (TX) station and a receive (RX) station including at least one processor, a device which error-corrects a plurality of transmitted bits representing a message word, comprising: means for receiving said plurality of transmitted bits from said TX station multiple times as a plurality of repeat sets at said RX station; and means for instructing said at least one processor to execute at least one majority vote upon a first repeat set corresponding to a first original bit substantially simultaneously with at least another repeat set corresponding to another original bit which is adjacent to said first original bit.
Claim 19
Dependent Claim 32 words
The device as defined in claim 16, wherein said instructing means further comprise means for using a first processing bit and at least another processing bit of said at least one processor.
Claim 20
Dependent Claim 26 words
The device as defined in claim 16, further comprising means for reconstructing said message word based on the outcome of said at least one majority vote.
Claim 21
Dependent Claim 29 words
The device as defined in claim 16, wherein each of said plurality of repeat sets comprises a plurality of repeat bits received for a bit in the message word.
Claim 22
Dependent Claim 104 words
In a communication system, a device which error-corrects a plurality of transmitted bits representing a message word having "n" bits, the device comprising: a receiver configured to receive the plurality of transmitted bits as a plurality of repeat sets, each repeat set having a plurality of repeat bits received for each of the "n" bits; and a processor operationally connected to the receiver and configured to substantially simultaneously execute at least one majority vote upon a first repeat set, corresponding to a first original bit, with at least another repeat set, corresponding to another original bit which is adjacent to the first original bit.
Claim 23
Dependent Claim 104 words
In a communication system, a device which error-corrects a plurality of transmitted bits representing a message word having "n" bits, the device comprising: a receiver configured to receive the plurality of transmitted bits as a plurality of repeat sets, each repeat set having a plurality of repeat bits received for each of the "n" bits; and a processor operationally connected to the receiver and configured to substantially simultaneously execute at least one majority vote upon a first repeat set, corresponding to a first original bit, with at least another repeat set, corresponding to another original bit which is adjacent to the first original bit.
Claim 24
Dependent Claim 27 words
The device as defined in claim 20, wherein the processor determines the number of bit pairs and the number of bit cancels among the plurality of bits.
Claim 25
Dependent Claim 28 words
The device as defined in claim 21, wherein the processor determines whether a last bit of the plurality of repeat bits should be examined as a tie breaker.
Claim 26
Dependent Claim 43 words
The device as defined in claim 20, wherein the plurality of repeat bits comprises a first set of bits having five bits, a second set of bits having five bits, and an eleventh bit, which are received for each of the "n" bits.
Claim 27
Dependent Claim 32 words
The device as defined in claim 23, wherein the processor performs a first majority vote-5 (MVote-5) on the first set of bits, and a second MVote-5 on the second set of bits.
Claim 28
Dependent Claim 31 words
The device as defined in claim 24, wherein the processor determines, based on the outcomes of the first and second MVote-5, whether to examine the eleventh bit as a tie breaker.

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2003-03-28 2003-09-27 2004-03-28 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2007-03-28 2007-09-27 2008-03-28 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2011-03-28 2011-09-27 2012-03-28 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag