IP Library Granted Patent US 7,187,728
Granted Patent B2
US 7,187,728 · App. 10/204,299 · Granted Mar 6, 2007

Coding method and use of a receiver with a convolutional decoder

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 7,187,728
App. No.
10/204,299
Granted
Mar 6, 2007
Kind
B2
Abstract

A coding method for modulating carrier signals with 16 different digital states (4 bit signals) possesses a high synchronicity robustness and an at least partially improved coding gain. The coding parameters are obtained by the following steps: a) using a 2 ASK/8 PSK coding; b) choosing a convolutional code and determining all possible code word sequences with the free distance of the convolutional code; c) producing possible mappings by allocating a partial quantity of the 2 ASK/8 PSK channel bits to subsets; d) choosing the mapping at which, after determination of the optimum radii of the two amplitudes for every possible mapping, the resulting minimum Euclidean distance takes a maximum value between two possible subset sequences code word sequence.

Claims (28)

1. A method of determining coding parameters of a convolution decoder for improving coding gain in a receiver for receiving carrier signals modulated with sixteen different digital states, comprising the step of:

a) using a 2 ASK/8 PSK coding;

b) selecting a deconvolution code for the decoder and determining all possible code word sequences with a free distance of the deconvolution code;

c) forming possible mappings by allocating a partial set of 2 ASK/8 PSK channel bits into subsets; and

d) selecting the possible mappings in which, after determining optimal radii of two amplitudes for each possible mapping, a minimal Euclidean distance produced between two possible subset becomes maximal thereby improving the coding gain, the optimal radii denoted by ac and c being determined by the following equations:

8( ac ) 2 +8 c 2 =16

n·d 11 2 +m·d 01 2 +k·d 10 2 =(2 ac ) 2

for

2 ac≦√{square root over (c 2 +(ac) 2 )}

and

n·d 11 2 +m·d 01 2 +k·d 10 2 =c 2 +( ac ) 2

for

2 ac≧√{square root over (c 2 +(ac) 2 )},

in which d 11 is the minimal geometric distance of a subset transition 00→11 and n is the number of these transitions in the considered code word sequence,

d 01 is the minimal geometric distance of a subset transition 00→01 and m is the number of these transitions in the considered code word sequence and

d 10 is the minimal geometric distance of a subset transition 00→10 and k is the number of these transitions in the considered code word sequence.

2. The method according to claim 1 , characterized by the fact that the subsets are chosen by the following equations:

d 11 =d 1 =c−ac

for

c−ac≦ac·√{square root over (2)}

or

d 11 =d 1 =ac·√{square root over (2)}

for

ac ·√{square root over (2)} ≦c−ac

and

d 01 =d 10 =d 0 =ac √{square root over ((1−√{square root over (0.5)}))}.

3. The method according to claim 2 , characterized by the fact that, for determining the optimal radii, it is assumed that:

d 1 ≦√{square root over (2)} ·d 0 .

Assignments (4)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 30, 2007
From: MARCONI COMMUNICATIONS GMBH (NOW KNOWN AS TELENT GMBH)
To: ERICSSON AB
Reel/Frame 020218/0769 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 22, 2002
From: SEIER, UDO
To: MARCONI COMMUNICATIONS GMBH
Reel/Frame 013518/0013 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 18, 2002
From: ENGEL, ANDREAS
To: MARCONI COMMUNICATIONS GMBH
Reel/Frame 013517/0919 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 18, 2002
From: MUELLER, JOERG-MARTIN
To: MARCONI COMMUNICATIONS GMBH
Reel/Frame 013517/0997 →