# US 10,771,297 B2 · Method and device for multi-service transmission with FC-OFDM modulation and corresponding receiver

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 10,771,297 B2
- Document ID: US10771297B2
- Status: Granted
- Kind: B2
- Application number: 16/084,090
- Filed: 2017-03-13
- Published: 2019-02-28
- Granted: 2020-09-08
- Earliest claimed: 2016-03-11
- Assignees: Orange
- Applicants: Orange
- Inventors: Hao Lin
- Web page: https://patentgrep.com/patent/US10771297B2

## CPC

- H04L 27/265: {Fourier transform demodulators, e.g. fast Fourier transform [FFT] or discrete Fourier transform [DFT] demodulators (H04L27/26524 takes precedence)}
- H04L 25/03828: {Arrangements for spectral shaping; Arrangements for providing signals with specified spectral properties (partial response systems H04L25/497)}
- H04L 27/26: Systems using multi-frequency codes (H04L27/32 takes precedence)
- H04L 27/2607: {Cyclic extensions}
- H04L 27/2636: {with FFT or DFT modulators, e.g. standard single-carrier frequency-division multiple access [SC-FDMA] transmitter or DFT spread orthogonal frequency division multiplexing [DFT-SOFDM]}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A method implementing the same frequency-time transform of size M irrespective of the service. The method adds, during a frame setup, a cyclic extension of L=L1+L2 samples in order to obtain a sequence of M+L samples. The method carries out a time-domain filtering according to a function ƒ(n) of the samples n of the sequence of M+L samples.

## Claims

### Claim 1

A method comprising:
transmitting data corresponding to a service from amongst several communications services implementing a same frequency-time transform (IFFT) of size M irrespective of the service in order to generate orthogonal multi-carrier symbols of M samples starting from data symbols including:
during a frame setup, adding a cyclic extension of L=L1+L2 samples in order to obtain a sequence of M+L samples, and
setting up the frame according to a configuration depending on the service, which allows a selection between no, one or several processing operations from amongst a padding, a discrete Fourier transform of size N and a spread for adapting the data prior to mapping at an input of the frequency-time transform, and
the method comprises time-domain filtering according to a function ƒ(n) of the samples n of the sequence, L and M being non-zero natural numbers, L<M:
f
⁡
(
n
)
=
{
a
⁡
(
n
)
n
∈
[
0
,
L
-
1
]
1
n
∈
[
L
,
M
-
1
]
b
⁡
(
n
)
n
∈
[
M
,
M
+
L
-
1
]
with a(n) and b(n) monotonic functions and with a2 (n)+b2 (n+M)=1 for n∈[0, L−1], L1≥0 and L2≥0.

### Claim 2 (depends on 1)

The method as claimed in claim 1, in which the function ƒ (n) is non-symmetrical: ƒ(n)≠ƒ(M+L−1−n) for n∈[0, L−1].

### Claim 3 (depends on 1)

The method as claimed in claim 1, in which the cyclic extension comprises a cyclic prefix of L1 samples and a cyclic suffix of L2 samples, L1≠0 and L2≠0.

### Claim 4 (depends on 1)

The method as claimed in claim 1, in which the transmitting complies with a time-frequency frame with preambles multiplexed within the frame according to a configuration depending on the service under a constraint of a maximum number of preambles, the configuration depending on the service being able to allow a time-domain multiplexing of the preambles or a time-domain and frequency-domain multiplexing of the preambles to be selected.

### Claim 5 (depends on 1)

The method as claimed in claim 1 in which the spread has a spread factor P and each spread data value is multiplied by a weighting wp, p=1, . . . , P.

### Claim 6 (depends on 1)

The method as claimed in claim 1 in which
a
⁡
(
n
)
=
cos
⁡
(
π
2
⁢
⁢
L
⁢
(
L
-
1
-
n
)
)
⁢
⁢
and
⁢
⁢
b
⁡
(
n
)
=
sin
⁡
(
π
2
⁢
⁢
L
⁢
(
M
+
L
-
1
-
n
)
)
.

### Claim 7 (depends on 1)

The method as claimed in claim 1 in which
a
⁡
(
n
)
=
cos
⁡
(
π
2
⁢
⁢
L
2
⁢
(
L
-
1
-
n
)
2
)
⁢
⁢
and
⁢
⁢
b
⁡
(
n
)
=
sin
⁡
(
π
2
⁢
⁢
L
2
⁢
(
M
+
L
-
1
-
n
)
2
)
.

### Claim 8 (depends on 1)

The method as claimed in claim 1 in which
b
⁡
(
n
)
=
e
-
(
α
⁡
(
n
-
M
L
)
β
)
and a(n)=√{square root over (1−b2 (n+M))} for n∈[0,L−1], α and β being parameters having a real value strictly greater than zero.

### Claim 9 (depends on 1)

The method as claimed in claim 1 in which, during the frame setup, two successive symbols overlap in time by a value D, D being an integer greater than or equal to zero.

### Claim 10 (depends on 1)

The method as claimed in claim 1, comprising transmission of a signaling message coding the configuration.