Back to results
US 8,619,913 B2Granted
Method of selecting metrics and receiver using the same
AssigneeElectronics and Telecommunications Research Institute
InventorsJong Ee Oh, Hun Sik Kang, Jung Bo Son, Sok Kyu Lee
Life of this patent
Estimating the term…
Abstract
A method and apparatus of selecting N metrics among M metrics is provided. The apparatus determines M metrics P(i), where i=1, . . . , M. Each P(i) is represented by B bits. The apparatus determines N metrics among M metrics. The complexity for configuring the circuit is decreased, and the length of the critical path is reduced.
Claims15
A non-transitory computer-implemented method for determining a path metric in a receiver by selecting N metrics among M metrics, where M>N≧1, the method comprising:
- determining, using a computer processor, M metrics P(i)=[bi(B−1) . . . bi(1) bi(0)], where i=1, . . . , M, each P(i) being represented by B bits;
- initializing, using a computer processor, two comparison values, P(i)0 and P(i)1, to zero for each P(i);
- determining, using a computer processor, a sum of j-th bit for M P(i)s, where j=0, 1, . . . , B−1, as shown:
- sum
-
- (
- j
- )
- =
- ∑
- i
- =
- 1
- M
-
- (
- ~
- P
-
- (
- i
- )
- 0
- )
- &
-
-
- (
- P
-
- (
- i
- )
- 1
- |
- b
- i
-
- (
- j
- )
- )
- where sum(j) denotes the sum of j-th bit for M P(i)s, ‘˜’ denotes a bit inversion operation, ‘&’ denotes a bit AND operation, and ‘|’ denotes a bit OR operation;
- updating, using a computer processor, P(i)0 and P(i)1 for each P(i) by comparing sum(j) and (M−N);
- and
- selecting, using a computer processor, at least one P(i) having a P(i)0 value of 1 among M P(i)s.
43 more elements
A method of receiving data, the method comprising:
- receiving, by a receiver, a receive signal from a transmitter;
- determining, by the receiver, M metrics P(i)=[bi(B−1) . . . bi(1) bi(0)] of the receiver, where i=1, . . . , M, based on a channel on which the receive signal is received, each P(i) being represented by B bits;
- determining, by the receiver, N metrics among the M P(i)s, where M>N≧1;
- and
- restoring, by the receiver, a transmit signal transmitted by the transmitter from the receive signal based on the N metrics,
- wherein the step of determining N metrics includes:
- initializing two comparison values, P(i)0 and P(i)1, to zero for each P(i);
- determining a sum of j-th bit for M P(i)s, where j=0, 1, . . . , B−1, as shown:
- sum
-
- (
- j
- )
- =
- ∑
- i
- =
- 1
- M
-
- (
- ~
- P
-
- (
- i
- )
- 0
- )
- &
-
-
- (
- P
-
- (
- i
- )
- 1
- |
- b
- i
-
- (
- j
- )
- )
- where sum(j) denotes the sum of j-th bit for M P(i)s, ‘˜’ denotes a bit inversion operation, ‘&’ denotes a bit AND operation, and ‘|’ denotes a bit OR operation;
- updating, by the receiver, P(i)0 and P(i)1 for each P(i) by comparing sum(j) and (M−N);
- and
- selecting, by the receiver, at least one P(i) having a P(i)0 value of 1 among M P(i)s.
48 more elements
A receiver comprising:
- a receive circuit configured for receiving a receive signal from a transmitter;
- a metric determining unit configured for determining M metrics P(i)=[bi(B−1) . . . bi(1) bi(0)], where i=1, . . . , M, based on a channel on which the receive signal is received, each P(i) being represented by B bits, and determining N metrics among the M P(i)s, where M>N≧1;
- and
- a restoring unit configured for restoring a transmit signal transmitted by the transmitter from the receive signal based on the N metrics,
- wherein the metric determining unit is configured for determining N metrics by:
- initializing two comparison values, P(i)0 and P(i)1, to zero for each P(i);
- determining a sum of j-th bit for M P(i)s, where j=0, 1, . . . , B−1, as shown:
- sum
-
- (
- j
- )
- =
- ∑
- i
- =
- 1
- M
-
- (
- ~
- P
-
- (
- i
- )
- 0
- )
- &
-
-
- (
- P
-
- (
- i
- )
- 1
- |
- b
- i
-
- (
- j
- )
- )
- where sum(j) denotes the sum of j-th bit for M P(i)s, ‘˜’ denotes a bit inversion operation, ‘&’ denotes a bit AND operation, and ‘|’ denotes a bit OR operation;
- updating P(i)0 and P(i)1 for each P(i) by comparing sum(j) and (M−N);
- and
- selecting at least one P(i) having a P(i)0 value of 1 among M P(i)s.
47 more elements
Dependencies are inferred from the claim text.