US2014019828A1PendingUtilityA1
Low-power transmission system
Est. expiryJun 8, 2031(~4.9 yrs left)· nominal 20-yr term from priority
H04L 1/0071H04L 1/0057H04L 1/0045
49
PatentIndex Score
0
Cited by
0
References
0
Claims
Abstract
An efficient method and transceiver architecture combines elements to enable and facilitate the low power operation of a communications device; the combination of design elements, features, and functionalities are efficiently distributed among RF, APE, and baseband modules in order to exploit opportunities that can serve the goal of low or ultra low power consumption.
Claims
exact text as granted — not AI-modified1 . A decoder module configured to perform the steps of:
obtaining a packet comprising a plurality of codewords; determining if a first codeword of the packet contains a detectable correctable error; not decoding subsequent codewords from the packet if the first codeword contains an uncorrectable error; and decoding the first codeword and determining if a next codeword of the packet contains an correctable error if the first codeword does not contain a detectable uncorrectable error.
2 . The decoder module of claim 1 , wherein the codewords of the packet are from a predetermined algebraic forward error correction (FEC) code, and wherein the step of determining if a first codeword of the packet contains a detectable uncorrectable error comprises;
determining an error locator polynomial for the first codeword; determining the roots of the error locator polynomial; determining that the first codeword contains a detectable uncorrectable error if the number of determined roots of the error locator polynomial is less than the degree of the error locator polynomial.
3 . The decoder module of claim 2 , wherein the step of determining the roots of the error locator polynomial is performed using a Chien search.
4 . A method, comprising:
obtaining a packet comprising a plurality of codewords; determining if a first codeword of the packet contains a detectable uncorrectable error; not decoding subsequent codewords from the packet if the first codeword contains an uncorrectable error; and decoding the first codeword and determining if a next codeword of the packet contains an uncorrectable error if the first codeword does not contain a detectable uncorrectable error.
5 . The method of claim 4 , wherein the codewords of the packet are from a predetermined algebraic forward error correction (FEC) code, and wherein the step of determining if a first codeword of the packet contains a detectable uncorrectable error comprises:
determining an error locator polynomial for the first codeword; determining the roots of the error locator polynomial; determining that the first codeword contains a detectable uncorrectable error if the number of determined roots of the error locator polynomial is less than the degree of the error locator polynomial.
6 . The method of claim 5 , wherein the step of determining the roots of the error locator polynomial is performed using a Chien search.Cited by (0)
No later patents cite this yet.
References (0)
No backward citations on record.