IP Library Granted Patent US 12,401,448
Granted Patent B2
US 12,401,448 · App. 18/769,229 · Granted Aug 26, 2025

Message transmission method and device

Inventors: Tong Ji (Beijing, CN); Zhe Jin (Beijing, CN); Zhihu Luo (Beijing, CN); Weiliang Zhang (Beijing, CN)
Assignee: Huawei Technologies Co., Ltd
H04L1/001H04L5/005H04W88/08
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 12,401,448
App. No.
18/769,229
Granted
Aug 26, 2025
Kind
B2
Abstract

A message transmission method and device relating to the field of communications technologies are described that improve an anti-interference capability in message transmission. The method includes generating a scrambling code according to a scrambling code initialization seed, wherein the scrambling code initialization seed meets the following expression: c init =R·2 a 7 +P·(n f mod k +1)·2 b 7 and then scrambling a message according to the scrambling code. The method further includes sending the scrambled message to a terminal on a physical downlink shared channel. Because the first time parameter has different values at at least two different moments, scrambling codes determined at the at least two corresponding different moments are different. Therefore, a possibility at which the base station uses a same scrambling code to scramble a same system message repeatedly in a time period is reduced, so that an anti-interference capability in system message transmission is improved.

Claims (448)

1. A message sending method, comprising:

generating a scrambling code according to a scrambling code initialization seed c init , wherein the scrambling code initialization seed meets the following expression:

c

init

=

k

1

8

n

RNTI

·

2

b

8

+

(

k

7

N

ID

N

c

e

I

l

+

k

8

)

(

k

9

n

RNTI

+

k

10

)

[

(

k

1

1

n

f

+

k

12

n

s

/

2

+

k

13

)

mod

k

14

+

k

1

5

]

u

2

·

2

c

8

+

k

1

6

N

ID

N

c

e

l

l

+

k

17

wherein k 18 , k 7 , k 8 , k 9 , k 10 , k 11 , k 12 , k 13 , k 14 , k 15 , k 16 , k 17 , b 8 , u 2 and c 8 are non- negative integers, n RNTI is a wireless network temporary identity, N ID Ncell is a cell identity, n f is a radio frame number, and n s is a slot number, and wherein k 18 =0, k 8 =1, k 9 =1, k 10 =1, k 11 =10, k 12 =1, k 13 =0, k 14 is a prime number, k 15 =1, k 16 =1, k 17 =0, u 2 =1 and c 8 =9;

scrambling a first message according to the scrambling code; and

sending the scrambled first message on a first channel starting from a slot of a radio frame indicated by the slot number and the radio frame number.

2. The method according to claim 1 , wherein the first message is one or more of the group consisting of: a data message, a part of a data message, an encoded data message, and a part of encoded data message.

3. The method according to claim 1 , wherein the first channel is a physical downlink shared channel.

4. The method according to claim 3 , wherein k 14 is 61.

5. The method according to claim 1 , wherein the first channel is a physical uplink shared channel.

6. The method according to claim 1 , wherein the scrambling a first message according to the scrambling code is a symbol-level scrambling.

7. A message receiving method, comprising:

generating a scrambling code according to a scrambling code initialization seed c init , wherein the scrambling code initialization seed meets the following expression:

c

init

=

k

18

n

RNTI

·

2

b

8

+

(

k

7

N

ID

N

c

e

l

l

+

k

8

)

(

k

9

n

RNTI

+

k

10

)

[

(

k

11

n

f

+

k

12

n

s

/

2

+

k

1

3

)

mod

k

14

+

k

15

]

u

2

·

2

c

8

+

k

16

N

ID

N

c

e

l

l

+

k

17

wherein k 18 , k 7 , k 8 , k 9 , k 10 , k 11 , k 12 , k 13 , k 14 , k 15 , k 16 , k 17 , b 8 , u 2 and c 8 are non- negative integers, n RNTI is a wireless network temporary identity, N ID Ncell is a cell identity, n f is a radio frame number, and n s is a slot number, and wherein k 18 =0, k 8 =1, k 9 =1, k 10 =1, k 11 =10, k 12 =1, k 13 =0, k 14 is a prime number, k 15 =1, k 16 =1, k 17 =0, 2=1 and c 8 =9;

receiving a scrambled first message on a first channel starting from a slot of a radio frame indicated by the slot number and the radio frame number; and

descrambling the scrambled first message according to the scrambling code to obtain a first message.

8. The method according to claim 7 , wherein the first message is one or more of the group consisting of: a data message, a part of a data message, an encoded data message, and a part of encoded data message.

9. The method according to claim 7 , wherein the first channel is a physical downlink shared channel.

10. The method according to claim 9 , wherein k 14 is 61.

11. The method according to claim 7 , wherein the first channel is a physical uplink shared channel.

12. The method according to claim 7 , wherein the descrambling the scrambled first message according to the scrambling code is a symbol-level descrambling.

13. An apparatus, comprising:

at least one processor; and

at least one computer readable memories coupled to the at least one processor and storing instructions that, when the instructions are performed by the at least one processor, cause the apparatus to:

generate a scrambling code according to a scrambling code initialization seed c init , wherein the scrambling code initialization seed meets the following expression:

c

init

=

k

18

n

RNTI

·

2

b

8

+

(

k

7

N

ID

N

c

e

l

l

+

k

8

)

(

k

9

n

RNTI

+

k

0

)

[

(

k

11

n

f

+

k

12

n

s

/

2

+

k

1

3

)

mod

k

4

+

k

15

]

u

2

·

2

c

8

+

k

16

N

ID

N

c

e

l

l

+

k

17

wherein k 18 , k 7 , k 8 , k 9 , k 10 , k 11 , k 12 , k 13 , k 14 , k 15 , k 16 , k 17 , b 8 , u 2 and c 8 are non- negative integers, n RNTI is a wireless network temporary identity, N ID Ncell is a cell identity, n f is a radio frame number, and n s is a slot number, and wherein k 18 =0, k 8 =1, k 9 =1, k 10 =1, k 11 =10, k 12 =1, k 13 =0, k 14 is a prime number, k 15 =1, k 16 =1, k 17 =0, u 2 =1 and c 8 =9;

scramble a first message according to the scrambling code; and

send the scrambled first message on a first channel starting from a slot of a radio frame indicated by the slot number and the radio frame number.

14. The apparatus according to claim 13 , wherein the first message is one or more of the group consisting of: a data message, a part of a data message, an encoded data message, and a part of encoded data message.

15. The apparatus according to claim 13 , wherein the first channel is a physical downlink shared channel k 14 .

16. The apparatus according to claim 13 , wherein the scrambling a first message according to the scrambling code is a symbol-level scrambling.

17. An apparatus, comprising:

at least one processor; and

at least one computer readable memories coupled to the at least one processor and storing instructions that, when the instructions are performed by the at least one processor, cause the apparatus to:

generate a scrambling code according to a scrambling code initialization seed c init , wherein the scrambling code initialization seed meets the following expression:

c

init

=

k

1

8

n

RNTI

·

2

b

8

+

(

k

7

N

ID

N

c

e

I

l

+

k

8

)

(

k

9

n

RNTI

+

k

10

)

[

(

k

1

1

n

f

+

k

12

n

s

/

2

+

k

3

)

mod

k

4

+

k

1

5

]

u

2

·

2

c

8

+

k

1

6

N

ID

N

c

e

l

l

+

k

17

wherein k 18 , k 7 , k 8 , k 9 , k 10 , k 11 , k 12 , k 13 , k 14 , k 15 , k 16 , k 17 , b 8 , u 2 and c 8 are non- negative integers, n RNTI is a wireless network temporary identity, N ID Ncell is a cell identity, n f is a radio frame number, and n s is a slot number, and wherein k 18 =0, k 8 =1, k 9 =1, k 10 =1, k 11 =10, k 12 =1, k 13 =0, k 14 is a prime number, k 15 =1, k 16 =1, k 17 =0, u 2 =1 and c 8 =9;

receive a scrambled first message on a first channel starting from a slot of a radio frame indicated by the slot number and the radio frame number; and

descramble the scrambled first message according to the scrambling code to obtain a first message.

18. The apparatus according to claim 17 , wherein the first message is one or more of the group consisting of: a data message, a part of a data message, an encoded data message, and a part of encoded data message.

19. The apparatus according to claim 17 , wherein the first channel is a physical downlink shared channel k 14 .

20. The apparatus according to claim 17 , wherein the descrambling the scrambled first message according to the scrambling code is a symbol-level descrambling.

Priority Claims (2)
WO PCT/CN2017/070927 · Jan 11, 2017 · international
WO PCT/CN2017/073680 · Feb 15, 2017 · international
Continuity (5)
Continuation 18315347 · May 10, 2023
Continuation 17317530 · May 11, 2021
Continuation 16507866 · Jul 10, 2019
Continuation PCTCN2017079375 · Apr 1, 2017
Related Publication 20240364446A1 · Oct 31, 2024
References Cited (55)
US 8588150B2 · Luo et al. · 2013 [cited by applicant]
US 9057772B1 · Chavez et al. · 2015 [cited by applicant]
US 9960911B2 · Shanmugam · 2018 [cited by examiner]
US 10439775B2 · Mirbagheri · 2019 [cited by examiner]
US 11101916B2 · Ji et al. · 2021 [cited by applicant]
US 11562156B2 · Rokhsaz · 2023 [cited by examiner]
US 20090052503A1 · Santoru et al. · 2009 [cited by applicant]
US 20090303972A1 · Flammer et al. · 2009 [cited by applicant]
US 20100034161A1 · Luo et al. · 2010 [cited by applicant]
US 20110305237A1 · Luo et al. · 2011 [cited by applicant]
US 20120039158A1 · Cheng et al. · 2012 [cited by applicant]
US 20120250642A1 · Qu et al. · 2012 [cited by applicant]
US 20120257697A1 · Zhou et al. · 2012 [cited by applicant]
US 20130064239A1 · Yu et al. · 2013 [cited by applicant]
US 20140269847A1 · Chiu · 2014 [cited by applicant]
US 20150078348A1 · Han et al. · 2015 [cited by applicant]
US 20150312771A1 · Li · 2015 [cited by applicant]
US 20150358998A1 · Golitschek Edler Von Elbwart et al. · 2015 [cited by applicant]
US 20160014675A1 · Park et al. · 2016 [cited by applicant]
US 20160065342A1 · Mirbagheri et al. · 2016 [cited by applicant]
US 20160249306A1 · Luo et al. · 2016 [cited by applicant]
US 20170078088A1 · Shanmugam · 2017 [cited by applicant]
US 20170126456A1 · Lee et al. · 2017 [cited by applicant]
US 20170156133A1 · Xia et al. · 2017 [cited by applicant]
US 20170257188A1 · Taniguchi et al. · 2017 [cited by applicant]
US 20170285132A1 · Fischer · 2017 [cited by applicant]
US 20170294949A1 · Zhang · 2017 [cited by examiner]
US 20170311285A1 · Ly et al. · 2017 [cited by applicant]
US 20180027482A1 · Jin et al. · 2018 [cited by applicant]
US 20180076992A1 · Nabetani et al. · 2018 [cited by applicant]
US 20180176973A1 · Kim et al. · 2018 [cited by applicant]
US 20190034672A1 · Rokhsaz · 2019 [cited by applicant]
US 20190150155A1 · Chatterjee · 2019 [cited by applicant]
CN 101248606A · 2008 [cited by applicant]
CN 101925056A · 2010 [cited by applicant]
CN 102113403A · 2011 [cited by applicant]
CN 102271023A · 2011 [cited by applicant]
CN 103095625A · 2013 [cited by applicant]
CN 104104466A · 2014 [cited by applicant]
CN 104518843A · 2015 [cited by applicant]
CN 105453456A · 2016 [cited by applicant]
CN 103959874B · 2019 [cited by applicant]
JP 2010526470A · 2010 [cited by applicant]
JP 2014531152A · 2014 [cited by applicant]
KR 20090131621A · 2009 [cited by applicant]
WO 2016006903A1 · 2016 [cited by applicant]
WO 2016120949A1 · 2016 [cited by applicant]
“Coverage enhancement of PBCH for low cost MTC,” 3GPP TSG RAN WG1 Meeting #75 R1-135103, San Francisco, USA, pp. 1-7, 3rd Generation Partnership Project Project, Valbonne, France (Nov. 11-15, 2013). [cited by applicant]
“3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Evolved Universal Terrestrial Radio Access (E-UTRA); Physical channels and modulation (Release 14),” 3GPP TS 36.211 V14.1.0, pp. 1… [cited by applicant]
“3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Evolved Universal Terrestrial Radio Access (E-UTRA); Multiplexing and channel coding (Release 14),” 3GPP TS 36.212 V14.1.1, pp. 1-… [cited by applicant]
“3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Evolved Universal Terrestrial Radio Access (E-UTRA); Physical layer procedures (Release 14),” 3GPP TS 36.213 V14.1.0, pp. 1-414, 3… [cited by applicant]
“3rd Generation Partnership Project; Technical Specification Group Radio Access Network; Evolved Universal Terrestrial Radio Access (E-UTRA); Radio Resource Control (RRC); Protocol specification (Release 14),” 3GPP TS 3… [cited by applicant]
“PBCH coverage enhancement for low cost MTC,” 3GPP TSG RAN WG1 Meeting #74bis, Guangzhou, China, R1-134129, XP050717319, pp. 1-4, 3rd Generation Partnership Project, Valbonne, France (Oct. 7-11, 2013). [cited by applicant]
Texas Instruments, “Modification on PRBS Initialization for DL RS,” 3GPP TSG RAN WG1 53, Kansas City, MO, USA, R1-081993, total 4 pages, 3rd Generation Partnership Project, Valbonne, France (May 5-9, 2008). [cited by applicant]
Intel Corporation., “PBCH coverage enhancement for low cost MTC,” 3GPP TSG RAN WG1 Meeting #74bis, Guangzhou, China, R1-134129, 3rd Generation Partnership Project (3GPP), Mobile Competence Centre; 650, Route Des Luciole… [cited by applicant]