# US 8,279,846 B2 · Broadcast channel timing detection

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

- Number: US 8,279,846 B2
- Document ID: US8279846B2
- Status: Granted
- Kind: B2
- Application number: 12/599,089
- Filed: 2008-03-25
- Published: 2011-01-13
- Granted: 2012-10-02
- Earliest claimed: 2007-05-10
- Assignees: Telefonaktiebolaget LM Ericsson (publ)
- Inventors: Ylva Jading; Erik Dahlman
- Web page: https://patentgrep.com/patent/US8279846B2

## CPC

- H04L 1/0072: {Error control for data other than payload data, e.g. control data}
- H04L 1/08: by repeating transmission, e.g. Verdan system {(H04L1/1858 and H04L1/189 take precedence)}
- H04L 25/03866: {using scrambling}
- H04J 11/0069: {Cell search, i.e. determining cell identity [cell-ID] (design of multiplexing codes H04J13/00; processing access restriction or access information H04W48/16; discovery of network devices for network data management H04W8/005; sounding signals for channel estimation H04L25/0226; structure of reference signals in multicarrier modulation systems H04L27/2613; frame, time or carrier synchronisation in multicarrier modulation systems H04L27/2655)}
- H04L 5/0053: {Allocation of signalling, i.e. of overhead other than pilot signals}
- H04L 5/0064: {Rate requirement of the data, e.g. scalable bandwidth, data priority}
- H04L 5/0091: {Signalling for the administration of the divided path, e.g. signalling of configuration information}
- H04L 27/2613: {Structure of the reference signals}
- H04L 27/2656: {Frame synchronisation, e.g. packet synchronisation, time division duplex [TDD] switching point detection or subframe synchronisation}
- H04L 2001/0093: {Point-to-multipoint}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04J: MULTIPLEX COMMUNICATION (transmission in general H04B; peculiar to transmission of digital information H04L5/00; systems for the simultaneous or sequential transmission of more than one television signal H04N7/08; in exchanges H04Q11/00; stereophonic systems H04S)

## Abstract

A broadcast control channel (BCH) transport block is communicated in a cellular communications system having a physical layer in which information is communicated in one or more frames, wherein the BCH transport block represents BCH information. This involves coding (901) the BCH transport block (1001, 1101) to generate M bits of coded information. Nframes segments of coded bits are formed (903) from the M bits of coded information, wherein the BCH information can be derived from any one of the Nframes segments of coded bits. A unique one of Nframes mapping functions is applied (905) to each of the Nframes segments of coded bits to produce Nframes mapped segments of coded bits. A different one of the Nframes mapped segments of coded bits is transmitted (907) in each of Nframes frames. This enables multi-frame timing to be determined even when fewer than all BCH segments are received.

## Claims

### Claim 1

A method of communicating a broadcast control channel, BCH, transport block in a cellular communications system having a physical layer in which information is communicated in one or more frames, wherein the BCH transport block represents BCH information, the method comprising:
coding the BCH transport block to generate M bits of coded information, wherein M is an integer;
forming Nframes segments of coded bits from the M bits of coded information, wherein the BCH information can be derived from any one of the Nframes segments of coded bits;
applying a unique one of Nframes mapping functions to each of the Nframes segments of coded bits to produce Nframes mapped segments of coded bits; and
transmitting a different one of the Nframes mapped segments of coded bits in each of Nframes frames.

### Claim 2 (depends on 1)

The method of claim 1, wherein Nframes=4.

### Claim 3 (depends on 1)

The method of claim 1, wherein the Nframes frames are Nframes consecutively occurring frames.

### Claim 4 (depends on 1)

The method of claim 1, wherein applying a unique one of Nframes mapping functions to each of the Nframes segments of coded bits to produce Nframes mapped segments of coded bits comprises:
scrambling each of the Nframes segments of coded bits by a unique one of Nframes different scrambling patterns, to produce Nframes segments of scrambled bits, wherein, for any one of the Nframes segments of scrambled bits, successful derivation of the BCH information is assured only when a decoding process is applied to the Nframes segments of coded bits.

### Claim 5 (depends on 1)

The method of claim 1, wherein applying a unique one of Nframes mapping functions to each of the Nframes segments of coded bits to produce Nframes mapped segments of coded bits comprises:
multiplying each of the Nframes segments of coded bits by a different one of Nframes different code elements, to produce Nframes segments of multiplied bits, wherein, for any one of the Nframes segments of multiplied bits, successful derivation of the BCH information is assured only when a decoding process is applied to the Nframes segments of coded bits.

### Claim 6

A method of receiving a broadcast control channel (BCH) transport block and determining multi-frame timing in a cellular communications system having a physical layer in which information is communicated in one or more frames, wherein the BCH transport block represents BCH information, the method comprising:
receiving one or more of Nframes mapped segments of coded bits that have been transmitted in a group comprising Nframes frames;
applying one or more inverse mapping functions to the one or more received mapped segments of coded bits to produce one or more unmapped segments of coded bits, wherein the one or more inverse mapping functions are selected from Nframes inverse mapping functions;
testing at least one of the one or more unmapped segments of bits to determine whether the at least one of the one or more unmapped segments of bits is correctly decodable; and
ascertaining multi-frame timing based on which of the Nframes inverse mapping functions resulted in a correctly decodable unmapped segment of bits.

### Claim 7 (depends on 6)

The method of claim 6, wherein Nframes=4.

### Claim 8 (depends on 6)

The method of claim 6, wherein the Nframes frames are Nframes consecutively occurring frames.

### Claim 9 (depends on 6)

The method of claim 6, wherein applying one or more inverse mapping functions to the one or more received mapped segments of coded bits to produce one or more unmapped segments of coded bits comprises:
applying one or more of Nframes unscrambling functions to the one or more received mapped segments of coded bits to produce one or more unscrambled segments of coded bits.

### Claim 10 (depends on 6)

The method of claim 6, wherein applying one or more inverse mapping functions to the one or more received mapped segments of coded bits to produce one or more unmapped segments of coded bits comprises:
multiplying each of the one or more received mapped segments of coded bits by a conjugate of one or more of Nframes code elements to produce one or more multiplied segments of coded bits.

### Claim 11

An apparatus for communicating a broadcast control channel (BCH) transport block in a cellular communications system having a physical layer in which information is communicated in one or more frames, wherein the BCH transport block represents BCH information, the apparatus comprising:
logic configured to code the BCH transport block to generate M bits of coded information, wherein M is an integer;
logic configured to form Nframes segments of coded bits from the M bits of coded information, wherein the BCH information can be derived from any one of the Nframes segments of coded bits;
logic configured to apply a unique one of Nframes mapping functions to each of the Nframes segments of coded bits to produce Nframes mapped segments of coded bits; and
logic configured to transmit a different one of the Nframes mapped segments of coded bits in each of Nframes frames.

### Claim 12 (depends on 11)

The apparatus of claim 11, wherein Nframes=4.

### Claim 13 (depends on 11)

The apparatus of claim 11, wherein the Nframes frames are Nframes consecutively occurring frames.

### Claim 14 (depends on 11)

The apparatus of claim 11, wherein the logic configured to apply a unique one of Nframes mapping functions to each of the Nframes segments of coded bits to produce Nframes mapped segments of coded bits comprises:
logic configured to scramble each of the Nframes segments of coded bits by a unique one of Nframes different scrambling patterns, to produce Nframes segments of scrambled bits, wherein, for any one of the Nframes segments of scrambled bits, successful derivation of the BCH information is assured only when a decoding process is applied to the Nframes segments of coded bits.

### Claim 15 (depends on 11)

The apparatus of claim 11, wherein the logic configured to apply a unique one of Nframes mapping functions to each of the Nframes segments of coded bits to produce Nframes mapped segments of coded bits comprises:
logic configured to multiply each of the Nframes segments of coded bits by a different one of Nframes different code elements, to produce Nframes segments of multiplied bits, wherein, for any one of the Nframes segments of multiplied bits, successful derivation of the BCH information is assured only when a decoding process is applied to the Nframes segments of coded bits.

### Claim 16

An apparatus for receiving a broadcast control channel (BCH) transport block and determining multi-frame timing in a cellular communications system having a physical layer in which information is communicated in one or more frames, wherein the BCH transport block represents BCH information, the apparatus comprising:
logic configured to receive one or more of Nframes mapped segments of coded bits that have been transmitted in a group comprising Nframes frames;
logic configured to apply one or more inverse mapping functions to the one or more received mapped segments of coded bits to produce one or more unmapped segments of coded bits, wherein the one or more inverse mapping functions are selected from Nframes inverse mapping functions;
logic configured to test at least one of the one or more unmapped segments of bits to determine whether the at least one of the one or more unmapped segments of bits is correctly decodable; and
logic configured to ascertain multi-frame timing based on which of the Nframes inverse mapping functions resulted in a correctly decodable unmapped segment of bits.

### Claim 17 (depends on 16)

The apparatus of claim 16, wherein Nframes=4.

### Claim 18 (depends on 16)

The apparatus of claim 16, wherein the Nframes frames are Nframes consecutively occurring frames.

### Claim 19 (depends on 16)

The apparatus of claim 16, wherein the logic configured to apply one or more inverse mapping functions to the one or more received mapped segments of coded bits to produce one or more unmapped segments of coded bits comprises:
logic configured to apply one or more of Nframes unscrambling functions to the one or more received mapped segments of coded bits to produce one or more unscrambled segments of coded bits.

### Claim 20 (depends on 16)

The apparatus of claim 16, wherein the logic configured to apply one or more inverse mapping functions to the one or more received mapped segments of coded bits to produce one or more unmapped segments of coded bits comprises:
logic configured to multiply each of the one or more received mapped segments of coded bits by a conjugate of one or more of Nframes code elements to produce one or more multiplied segments of coded bits.
