# US 2015/0103935 A1 · Method for Improving Synchronization and Information Transmission in a Communication System

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

- Number: US 2015/0103935 A1
- Document ID: US20150103935A1
- Status: Published application
- Kind: A1
- Application number: 14/523,478
- Filed: 2014-10-24
- Published: 2015-04-16
- Earliest claimed: 2006-01-18
- Assignees: Huawei Technologies Co., Ltd.
- Applicants: Huawei Technologies Co., Ltd.
- Inventors: Branislav POPOVIC
- Web page: https://patentgrep.com/patent/US20150103935A1

## CPC

- H04L 7/043: {Pseudo-noise [PN] codes variable during transmission (synchronisation of spread spectrum receivers H04B1/69)}
- H04L 5/0007: {the frequencies being orthogonal, e.g. OFDM(A) or DMT}
- H04L 27/2613: {Structure of the reference signals}
- H04L 27/2655: {Synchronisation arrangements}
- H04L 27/2675: {Pilot or known symbols}
- H04L 7/041: {using special codes as synchronising signal}
- H04L 27/26132: {using repetition}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

A method is provided for improving synchronization and information transmission in a communication system, including: generating a signal with a centrally symmetric part s(k) exploitable for synchronization; and sending the signal over a communication channel. The signal is based on a uniquely identifiable sequence c(l) from a set of sequences exploitable for information transmission. The centrally symmetric part s(k) is centrally symmetric in the shape of absolute value thereof. The centrally symmetric part s(k) is of arbitrary length N.

## Claims

### Claim 1

A communication system for improving synchronization and information transmission, comprising:
a transmitter, configured to generate a signal with a centrally symmetric part s(k) exploitable for synchronization, and send the signal over a communication channel;
a receiver, configured to receive the signal;
wherein the signal is based on a uniquely identifiable sequence c(l) from a set of sequences exploitable for information transmission, the centrally symmetric part s(k) is centrally symmetric in the shape of absolute value thereof, and the centrally symmetric part s(k) is of arbitrary length N.

### Claim 2 (depends on 1)

The communication system according to claim 1, wherein the signal is based on a sequence c(l) exploitable for information transmission from the transmitter to the receiver, the sequence c(l) is a Zadoff-Chu sequence defined as c(l)=WLrl(l+1)/2, l=0, 1, . . . , L−1, L is odd, where WL=exp(−j2π/L), j=√{square root over (−1)} and the sequence c(l) is mapped to a cell identification number.

### Claim 3 (depends on 1)

The communication system according to claim 1, wherein elements of the sequence c(l)
are used for modulating sub-carriers occupied by the signal.

### Claim 4 (depends on 1)

The communication system according to claim 1, wherein the centrally symmetric part s(k) is one of the following:
s

(
k
)
=
{
s

(
N
-
1
-
k
)
,
k
=
0
,
1
,
⋯

,
N
-
1
0
,
elsewhere
,

s

(
k
)
=
{
s
*

(
N
-
1
-
k
)
,
k
=
0
,
1
,
⋯

,
N
-
1
0
,
elsewhere
,

s

(
k
)
=
{
-
s

(
N
-
1
-
k
)
,
k
=
0
,
1
,
⋯

,
N
-
1
0
,
elsewhere
,

s

(
k
)
=
{
-
s
*

(
N
-
1
-
k
)
,
k
=
0
,
1
,
⋯

,
N
-
1
0
,
elsewhere
,

s

(
k
)
=
{
s

(
N
-
k
)
,
k
=
1
,
⋯

,
N
-
1
0
,
elsewhere
,

s

(
k
)
=
{
s
*

(
N
-
k
)
,
k
=
1
,
⋯

,
N
-
1
0
,
elsewhere
,

s

(
k
)
=
{
-
s

(
N
-
k
)
,
k
=
1
,
⋯

,
N
-
1
0
,
elsewhere
,
and


s

(
k
)
=
{
-
s
*

(
N
-
k
)
,
k
=
1
,
⋯

,
N
-
1
0
,
elsewhere
.

### Claim 5 (depends on 1)

The communication system according to claim 1, wherein the centrally symmetric part s(k) is preceded by a cyclic prefix of LCP samples being identical to the last LCP samples of the centrally symmetric part s(k).

### Claim 6 (depends on 1)

The communication system according to claim 1, wherein the centrally symmetric part s(k) is obtained as inverse discrete fourier transform (IDFT) of a spectrum H(n) of N sub-carrier weights, the spectrum H(n) being generated by using elements of the sequence c(l),] l=0, 1, . . . , L−1, L≦N, as Fourier coefficients at sub-carrier frequencies occupied by the signal.

### Claim 7 (depends on 6)

The communication system according to claim 6, wherein H(n)=H(N−n), n=0, 1, 2, . . . , N−1, where H(N)=H(0) holds according to the periodicity of discrete fourier transform (DFT).

### Claim 8 (depends on 6)

The communication system according to claim 6, wherein the sequence c(l) is mapped on to the spectrum
H(n) as
H

(
n
)
=
{
c

(
n
+
L
-
1
2
)
,
n
=
0
,
1
,
2
,
⋯

,
L
-
1
2
c

(
n
-
N
+
L
-
1
2
)
,
n
=
N
-
L
-
1
2
,
⋯

,
N
-
1
,
0
,
n
=
L
-
1
2
+
1
,
⋯

,
N
-
L
-
1
2
-
1
.

### Claim 9 (depends on 6)

The communication system according to claim 6, wherein the sequence c(l) is mapped on to the spectrum
H(n) as
H

(
n
)
=
{
c

(
n
R
+
L
-
1
2
)
,
n
=
0
,
R
,
2

R
,
⋯

,
(
L
-
1
2
)

R
c

(
n
-
N
R
+
L
-
1
2
)
,
n
=
N
-
(
L
-
1
2
)

R
,
N
-
(
L
-
3
2
)

R
,
⋯

,
N
-
R
,
0
,
elsewhere
,
where R is the number of periods of a certain basic waveform within the signal, such that N mod R=0.

### Claim 10 (depends on 1)

The communication system according to claim 1, the receiver is further configured to:
calculate and store a reverse differential correlation D(p) from a block of N samples of the signal,
repeat, a number of times, the calculate and store step for a new block of N samples of the signal, taken after a delay of one sample compared to the previous block,
find the delay of the block of N samples that result in a maximum correlation magnitude,
select such a delay as the initial timing for demodulation, and
detect the unique sequence c(l) from the set of sequences.

### Claim 11

A method of synchronization in a communication system, comprising:
generating a signal with a centrally symmetric part s(k) exploitable for synchronization;
sending the signal over a communication channel; and
receiving the signal;
wherein the signal is based on a uniquely identifiable sequence c(l) from a set of sequences exploitable for information transmission, the centrally symmetric part s(k) is centrally symmetric in the shape of absolute value thereof, and the centrally symmetric part s(k) is of arbitrary length N.

### Claim 12 (depends on 11)

The method according to claim 11, wherein the signal is based on a sequence c(l) exploitable for information transmission from the transmitter to the receiver, the sequence c(l) is a Zadoff-Chu sequence defined as c(l)=WLrl(l+1)/2, l=0, 1, . . . , L−1, L is odd, where WL=exp(−j2π/L), j=√{square root over (−1)}, and the sequence c(l) is mapped to a cell identification number.

### Claim 13 (depends on 11)

The method according to claim 11, wherein elements of the sequence c(l) are used for modulating sub-carriers occupied by the signal.

### Claim 14 (depends on 11)

The method according to claim 11, wherein the centrally symmetric part s(k) is one of the following:
s

(
k
)
=
{
s

(
N
-
1
-
k
)
,
k
=
0
,
1
,
⋯

,
N
-
1
0
,
elsewhere
,

s

(
k
)
=
{
s
*

(
N
-
1
-
k
)
,
k
=
0
,
1
,
⋯

,
N
-
1
0
,
elsewhere
,

s

(
k
)
=
{
-
s

(
N
-
1
-
k
)
,
k
=
0
,
1
,
⋯

,
N
-
1
0
,
elsewhere
,

s

(
k
)
=
{
-
s
*

(
N
-
1
-
k
)
,
k
=
0
,
1
,
⋯

,
N
-
1
0
,
elsewhere
,

s

(
k
)
=
{
s

(
N
-
k
)
,
k
=
1
,
⋯

,
N
-
1
0
,
elsewhere
,

s

(
k
)
=
{
s
*

(
N
-
k
)
,
k
=
1
,
⋯

,
N
-
1
0
,
elsewhere
,

s

(
k
)
=
{
-
s

(
N
-
k
)
,
k
=
1
,
⋯

,
N
-
1
0
,
elsewhere
,
and


s

(
k
)
=
{
-
s
*

(
N
-
k
)
,
k
=
1
,
⋯

,
N
-
1
0
,
elsewhere
.

### Claim 15 (depends on 11)

The method according to claim 11, wherein the centrally symmetric part s(k) is preceded by a cyclic prefix of LCP samples being identical to the last LCP samples of the centrally symmetric part s(k).

### Claim 16 (depends on 11)

The method according to claim 11, wherein the centrally symmetric part s(k) is obtained as inverse discrete fourier transform (IDFT) of a spectrum H(n) of N sub-carrier weights, the spectrum H(n) being generated by using elements of the sequence c(l),] l=0, 1, . . . , L−1, L≦N, as Fourier coefficients at sub-carrier frequencies occupied by the signal.

### Claim 17 (depends on 16)

The method according to claim 16, wherein H(n)=H(N−n), n=0, 1, 2, . . . , N−1, where H(N)=H(0) holds according to the periodicity of discrete fourier transform (DFT).

### Claim 18 (depends on 16)

The method according to claim 16, wherein the sequence c(l) is mapped on to the spectrum
H(n) as
(
n
)
=
{
c

(
n
+
L
-
1
2
)
,
n
=
0
,
1
,
2
,
⋯

,
L
-
1
2
c

(
n
-
N
+
L
-
1
2
)
,
n
=
N
-
L
-
1
2
,
⋯

,
N
-
1
,
0
,
n
=
L
-
1
2
+
1
,
⋯

,
N
-
L
-
1
2
-
1
.

### Claim 19 (depends on 16)

The method according to claim 16, wherein the sequence c(l) is mapped on to the spectrum
H(n) as
H

(
n
)
=
{
c

(
n
R
+
L
-
1
2
)
,
n
=
0
,
R
,
2

R
,
⋯

,
(
L
-
1
2
)

R
c

(
n
-
N
R
+
L
-
1
2
)
,
n
=
N
-
(
L
-
1
2
)

R
,
N
-
(
L
-
3
2
)

R
,
⋯

,
N
-
R
,
0
,
elsewhere
,
where R is the number of periods of a certain basic waveform within the signal, such that N mod R=0.

### Claim 20 (depends on 11)

The method according to claim 11, further comprising:
calculate and store a reverse differential correlation D(p) from a block of N samples of the signal;
repeat, a number of times, the calculate and store step for a new block of N samples of the signal, taken after a delay of one sample compared to the previous block; find the delay of the block of N samples that result in a maximum correlation magnitude; select such a delay as the initial timing for demodulation; and detect the unique sequence c(l) from the set of sequences.
