BRPI0814591B1 - transmitting or receiving device, method for interleaving partition on transmitting or receiving device and computer readable memory - Google Patents

Abstract

systems and methods for generalized partition / entanglement mapping a transmitting or receiving device includes a processing system configured to have one or more pilot entanglement vectors and one or more distance vectors. the processing system is further configured to generate a first partition entanglement for a first partition based on one or more pilot entanglement vectors, and is additionally configured to generate a second partition entanglement for a second partition based on the first entanglement partition and one or more distance vectors. additional partition entanglements for all other partitions can also be generated based on the first partition entanglement and one or more distance vectors.

Description

“TRANSMITTING OR RECEIVING DEVICE, METHOD FOR INTERLACING PARTITION IN TRANSMITTING OR RECEIVING DEVICE AND MEMORY READABLE BY COMPUTER

Field of the Invention

[0001] The technology in question generally refers to telecommunications, and more specifically to systems and methods for generalized partition / interlacing mapping.

Description of the Prior Art

[0002] Direct Link Only (FLO) is a digital wireless technology that was developed by a group led by the wireless supplier industry. FLO technology has been designed in a case for a mobile multimedia environment and exhibits the performance characteristics suitable for use on mobile devices. It uses advances in encoding and interleaving to achieve high quality reception, both for real-time content streaming and other data services. FLO technology can provide robust mobile performance and high capacity without compromising power consumption. The technology also reduces the cost of the network to deliver multimedia content by dramatically decreasing the number of transmitting devices needed to be developed. In addition, multimedia multicasting based on FLO technology complements cellular network data from wireless operators and voice services, delivering the content to the same cellular devices used on 3G networks.

[0003] The FLO wireless system was designed to broadcast (broadcast) audio and video signals in real time, apart from non-real time services to users

Petition 870190116196, of 11/11/2019, p. 6/67

2/44 furniture. The respective FLO transmission is carried out using large and high power transmitting devices to ensure wide coverage in a given geographical area. In addition, it is common to develop 3 to 4 transmitting devices in most markets to ensure that the FLO signal reaches a significant part of the population in a given market. During the process of acquiring a FLO data package, several determinations and computations are made to determine aspects such as frequency offsets for the respective wireless receiver device. Given the nature of FLO broadcasts that support multimedia data acquisitions, efficient processing of such data and associated overhead information is paramount. For example, when determining frequency offsets or other parameters, complex processing and determinations are required where phase determinations and associated angles are employed to facilitate FLO transmission and data reception.

[0004] Wireless communication systems such as FLO are designed to work in a mobile environment where channel characteristics in terms of channel number match significant energy, travel gains and travel delays are expected to vary completely significantly over a period of time. In an orthogonal frequency division (OFDM) multiplexing system, the timing synchronization block on a receiving device responds to changes in the channel profile by selecting the OFDM symbol border appropriately to maximize the energy captured in the Fast Fourier Transform window (FFT). When such timing corrections occur, it is

Petition 870190116196, of 11/11/2019, p. 7/67

3/44 It is important that the channel estimation algorithm takes into account timing corrections when computing the channel estimate to be used when demodulating a given OFDM symbol. In some implementations, the channel estimate is also used to determine the timing adjustment to the symbol edge that needs to be applied to future symbols, thus resulting in a subtle interaction between the timing corrections that have already been introduced and the corrections of timing that will be determined for future symbols. In addition, it is common for the channel estimation block to process pilot observations from the multiple OFDM symbols in order to result in a channel estimate that has the best average noise and also resolves longer channel delay propagations. When pilot observations of multiple OFDM symbols are processed together to generate the channel estimate, it is important that the underlying OFDM symbols are aligned with respect to symbol timing. Summary of the Invention

[0005] The following description provides a simplified summary of various configurations of the technology in question in order to provide a basic understanding of some aspects of the configurations. This summary is not an extensive overview. It is not intended to identify key / critical elements or to outline the scope of the configurations disclosed here. Its sole purpose is to present some concepts in a simplified form as a prelude to the more detailed description that is presented later.

[0006] In one aspect of the invention, a transmitting or receiving device includes a processing system

Petition 870190116196, of 11/11/2019, p. 8/67

4/44 configured to have one or more pilot interlacing vectors and one or more distance vectors. The processing system is additionally configured to provide a first partition entanglement based on one or more pilot entanglement vectors, and is additionally configured to provide a second partition entanglement based on the first partition entanglement and one or more vectors from distance.

[0007] In another aspect of the invention, a transmitter or receiver device includes mechanisms to include one or more pilot interlace vectors, mechanisms to include one or more distance vectors, mechanisms to provide a first partition interlace based on the one or more pilot interleaving vectors, and mechanisms for providing a second partition interleaving based on the first partition interleaving and one or more distance vectors.

[0008] In a further aspect of the invention, a method is described for providing partition entanglements or providing communication on a transmitting or receiving device. The method includes receiving one or more pilot interlace vectors, receiving one or more distance vectors, providing a first partition interlacing based on one or more pilot interlacing vectors, and providing a second partition interlacing based on the first partition entanglement and one or more distance vectors.

[0009] In still a further aspect of the invention, a readable medium includes instructions executable by a transmitting or receiving device. The instructions

Petition 870190116196, of 11/11/2019, p. 9/67

5/44 include code to receive one or more pilot interlace vectors, receive one or more distance vectors, provide a first partition interlace based on one or more pilot interlace vectors, and provide a second partition interlace with based on the first partition interlacing and one or more distance vectors.

[0010] In still a further aspect of the invention, a transmitting or receiving device includes a pilot interlace vector unit configured to include one or more pilot interlace vectors and a distance vector unit configured to include one or more distance vectors. The transmitting or receiving device additionally includes a partition interleaving computing unit to provide a first partition entanglement based on one or more pilot entanglement vectors and additionally configured to provide a second partition entanglement based on the first partition entanglement and distance vectors.

[0011] In a still further aspect of the invention, additional partition interleavings for all other partitions can be generated based on the first partition interleaving and one or more distance vectors.

[0012] It is understood that other configurations will become readily apparent to those skilled in the art from the following detailed description, where various configurations are shown and described for illustration. As will be done, the teachings here can be extended to other

Petition 870190116196, of 11/11/2019, p. 10/67

6/44 and different configurations and their various details are capable of modification in several other aspects, all without departing from the scope of the present invention. Consequently, the drawings and the detailed description are to be considered as illustrative in nature and not as restrictive. Brief Description of the Figures

[0013] figure 1 - is a conceptual block diagram that illustrates an example of a wireless network system for direct link networks only (FLOs).

[0014] figure 2 - is a conceptual block diagram that illustrates an example of a receiving device that can

be employed in a wireless communication environment. [0015] that illustrates figure 3 an example it is a in conceptual block diagram one system which includes a device transmitter and one or more devices receivers. [0016] figure 4 - illustrates a super- layer frame FLO physics exemplary. [0017] figure 5 - illustrates a structure of

exemplary interlacing.

[0018] figure 6 - is an exemplary table for mapping partition / entanglement.

[0019] figure 7 - is a conceptual block diagram that illustrates an exemplary hardware implementation architecture for generalized partition / interlacing maps.

[0020] figure 8 - is a conceptual block diagram that illustrates an example of the functionality of a processing system in a transmitting or receiving device.

Petition 870190116196, of 11/11/2019, p. 11/67

7/44

[0021] figure 9 - is a flowchart that illustrates an exemplary operation of providing partition entanglements or providing communication on a transmitting or receiving device.

Detailed Description of the Invention

[0022] The detailed description determined below in relation to the added drawings is intended as a description of various configurations and is not intended to represent the only configurations in which the concepts described here can be practiced. The detailed description includes specific details for the purpose of providing a complete understanding of the technology in question. However, it will be apparent to those skilled in the art that the technology in question can be practiced without these specific details. In some cases, known structures and components are shown in the form of a block diagram in order to avoid obscuring the concepts of the technology in question.

[0023] Figure 1 is a conceptual block diagram that illustrates an example of a wireless network system 100 for Direct Link networks only. System 100 includes one or more transmitting devices 110 that can communicate over a wireless network 112 to one or more receiving devices 120.

[0024] A receiving device 120 can be any appropriate communications device such as a cell phone, a cordless phone, a wired phone, a laptop computer, a desktop computer, a personal digital assistant (PDA), a data transceiver , a modem, a pager, a camera, a game console, an MP3 player (MPEG Audio Layer-3), a media gateway system, a

Petition 870190116196, of 11/11/2019, p. 12/67

8/44 audio communications device, a video communications device, a multimedia communications device, a component of any of the foregoing devices (for example, a printed circuit board, an integrated circuit, or a circuit component ), or any other appropriate audio, video, or multimedia device, or a combination thereof. A transmitting device 110 can be any appropriate communications device that can transmit, such as a base station or a transmitting station. In addition, some of the devices described above in this paragraph can be a receiving device, if they can receive a signal, or a transmitting device, if they can transmit a signal. Thus, some of the receiving devices described above can be a transmitting device, if they can transmit a signal, and some of the transmitting devices described above can be a receiving device, if they can receive a signal. In addition, a device can be referred to as a user device when it is used, or to be used, by a user.

[0025] The parts of the receiving devices 120 can be used to decode a subset of symbols 130 and other data such as multimedia data. The subset of symbols 130 can be transmitted in an orthogonal frequency division (OFDM) multiplexing network that employs Direct Link Only (FLO) protocols for transferring multimedia data. The channel estimation can be based on the evenly spaced pilot tones introduced in the frequency domain, and the respective OFDM symbols.

Petition 870190116196, of 11/11/2019, p. 13/67

9/44

[0026] Figure 2 is a conceptual block diagram that illustrates an example of a receiving device 200 that can be used in a wireless communication environment, according to one or more aspects determined here. A receiver device 200 may include a receiver 202 that receives a signal from, for example, a receiving antenna (not shown), and performs typical actions (for example, filters, amplifies, downwards converts, etc.) on the received signal and digitizes the conditioned signal to obtain samples. A demodulator 204 can demodulate and provide received pilot symbols to a processing system 206 for channel estimation. A FLO channel component 210 can be provided to process FLO signals. This can include, for example, digital flow processing and / or positioning location calculations among other processes. A processing system 206 can be, for example, a dedicated processor for analyzing the information received by the receiver 202 and / or generating the information for transmission by a transmitter 216, a processor that controls one or more components of the receiving device 200, or by a processor that analyzes the information received by the receiver 202, generates the information for transmission by the transmitter 216, and controls one or more components of the receiving device 200.

[0027] Processing system 206 can be implemented using software, hardware, or a combination of both. The software will be constructed widely to signify instructions, data, or any combination thereof, whether referred to as software, firmware, middleware, micro-code, hardware description language, or otherwise.

Petition 870190116196, of 11/11/2019, p. 14/67

10/44

As an example, processing system 206 can be implemented with one or more processors. A processor can be a general purpose microprocessor, a microcontroller, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable port arrangement (FPGA), a programmable logic device (PLD ), a controller, a state machine, switched logic, discrete hardware components, or any other appropriate entity that can perform calculations or other information manipulations.

[0028] The receiving device 200 may additionally include a memory 208 which is operatively coupled to the processing system 206 and which can store information relating to data processing.

[0029] Readable media may include storage integrated into a processor, as may be the case with an ASIC, and / or storage external to a processor such as 208 memory. For illustration, and not limitation, readable media may include one or more of volatile memory, non-volatile memory, a Random Access Memory (RAM), a Flash memory, a Read-Only Memory (ROM), a Programmable Read-Only Memory (PROM), an Erasable PROM (EPROM ), a recorder, a hard disk, a removable disk, a CD-ROM, a DVD, or any other appropriate storage device. In addition, readable means may include a transmission line or a carrier wave that encodes a data signal. A readable medium can be a computer-readable medium encoded or stored with a computer program or instructions. The computer program or instructions can be

Petition 870190116196, of 11/11/2019, p. 15/67

11/44 executable by a transmitting or receiving device or by a processing system of a transmitting or receiving device.

[0030] Receiving device 200 may further include a background monitor 214 for processing FLO data, a symbol modulator 214, and transmitter 216 which transmits the modulated signal.

[0031] Figure 3 is a conceptual block diagram illustrating an example of a system 300 that includes a transmitting device 302 and one or more receiving devices 304. The transmitting device 302 can include a receiver 310 that receives signals from a or more receiving devices 304 through one or more receiving antennas 306, and a transmitter 322 that transmits to one or more receiving devices 304 with one or more transmitting antennas 308. The receiver 310 can be operatively associated with a demodulator 312 that demodulates the information received. Demodulated symbols can be analyzed by a processing system 314 that is similar to the processing system 206 described above, which can be coupled to a memory 316 that stores information related to data processing.

[0032] The processing system 314 can also be coupled to a FLO channel component 318 which facilitates the processing of the FLO information associated with one or more respective receiving devices 304. The FLO channel component 318 can add the information to a signal relating to an updated data stream for a given transmission stream for communication with the receiving devices 304, to provide an indication that a new

Petition 870190116196, of 11/11/2019, p. 16/67

12/44 optimal channel was identified and recognized. A modulator 320 can also be provided to multiplex a signal for transmission by transmitter 322. The descriptions provided above for a processing system and the readable means with reference to figure 2 apply similarly to the components in figure 3.

[0033] Figure 4 illustrates an exemplary FLO 400 physical layer superframe. A superframe 400 may include, among others, Time Division Multiplexed (TDM) pilots (eg TDM Pilot 1 and Pilot 2 TDM), Wide Area Identification Channel (WIC), Local Area Identification Channel (LIC), Overhead Information Symbols (OIS), four data frames (for example, Table 1 to Table 4), Pilot Channel Positioning System (PPC), and Signaling Parameter Channel (SPC). TDM pilots can allow rapid acquisition of OIS. The ISO can describe the location of the data for each media service in the superframe. A superframe structure is not limited to what is shown in figure 4, and a superframe can consist of fewer elements or more elements than what is illustrated in figure 4.

[0034] OFDM is a form of multiport modulation. The available bandwidth can be divided into N bands, referred to as subcarriers, with each subcarrier modulated, for example, by a quadrature amplitude modulated (QAM) symbol. In FLO, transmission and reception can be based on using 4096 subcarriers (4K), and QAM modulation symbols can be chosen, for example, from a QPSK or 16-QAM alphabet.

Petition 870190116196, of 11/11/2019, p. 17/67

13/44

[0035] Each superframe can include multiple OFDM symbols. For illustration, a superframe can include 200 OFDM symbols per MHz of the available bandwidth (for example, 1200 OFDM symbols for 6 MHz). In each symbol, there can be multiple subcarriers (for example, 4000 subcarriers). These subcarriers can be grouped separately in interlaces.

[0036] As illustrated in figure 5, an exemplary interlacing structure can include, for example, 8 interlacing. In this example, the interlacing indices range from 0 to 7 (ie, I0, I1, I2, I3, I4,

I5, I6, I7 and I8). Each interlacing can consist, for example, of 500 subcarriers that are evenly spaced across the signal bandwidth. Among the adjacent subcarriers within each interlacing, there are 7 subcarriers, each of which belongs to a different interlacing. In each OFDM symbol, an interlacing can be assigned to the pilot interlacing and can be used for channel estimation. Therefore, 500 subcarriers can be modulated with known modulation (pilot) symbols. The remaining 7 entanglements, or 3500 subcarriers, may be available for modulation with data symbols. While figure 5 illustrates an exemplary interlacing structure / function, an interlacing structure / function is not limited to this configuration, and can be of other types of configurations (for example, having any number of interlaces).

[0037] Each interlacing can be evenly distributed in frequency, so that you can achieve full frequency diversity within the bandwidth

Petition 870190116196, of 11/11/2019, p. 18/67

14/44 available. These interlaces can be attributed to the logical channels that vary in terms of duration and the number of actual interlaces used. This provides flexibility in the time diversity achieved by any given data source. Lower data rate channels can be assigned with less interlacing to improve time diversity, while higher data rate channels can use more interlacing to minimize on-time radio's and reduce power consumption.

[0038] Figure 6 is an exemplary table for mapping partition / entanglement. The vertical axis indicates partition indexes. The horizontal axis indicates symbol indexes. The values in the table indicate interlacing indices. According to one aspect of the invention, a partition can refer to a group of symbols, an interlacing can refer to a group of subcarriers, and each partition can be mapped to an interlacing in each symbol period based on a scheme of partition / interlacing mapping. A partition, which can be referred to as a transmission partition, can correspond to an interlacing or a group of modulation symbols in a symbol period. In another aspect of the invention, a partition can be mapped to one or more interlocks, and a interlaced can be mapped to one or more partitions. A time unit for a frame can include a MAC time unit at the MAC layer (or allocation) and an OFDM symbol period at the physical (PHY) layer. A symbol period can refer to a MAC time unit in the context of physical layer channel allocation (PLC) or an OFDM symbol period in the context of subcarrier allocation. a

Petition 870190116196, of 11/11/2019, p. 19/67

15/44 symbol period can refer to a unit of time of a symbol index.

[0039] While the number of subcarriers (i.e., FFT size) can be 4K, as previously described, the technology in question is not limited to this number of subcarriers or FFT size. The technology in question is capable of multiplexing and transmitting multiple data streams in OFDM systems of various sizes of FFT. For an OFDM system with a 4K size of FFT, a group of 500 modulation symbols, forming a partition, can be mapped into an interlacing.

[0040] In one aspect of the invention, a partition can be fixed using different sizes of FFT. In addition, the size of an interlacing can be 1/8 th of the number of active subcarriers, and a partition can be mapped either in a fraction or multiple (which includes one) interlacing based on the size of FFT. For example, for a size of

2K of FFT, a partition (that is, 500 modulation symbols) maps in 2 interlaces over 2 consecutive 2K OFDM symbols. Similarly, for a size of 1K FFT, a partition maps 4 interlaces over 4 consecutive 1K OFDM symbols. In addition, as an example, the number of subcarriers useful for 1K, 2K, 4K and

8K of FFT, respectively, can be 1000, 2000, 4000 and 8000, provided that useful subcarriers may not include, for example, guard subcarriers. That is, an FFT size of 1K contains 1024 subcarriers, where 24 of the subcarriers can be used as guard subcarriers, for example.

The number of guard subcarriers can, for example, increase proportionally with the size of the FFT.

Petition 870190116196, of 11/11/2019, p. 20/67

16/44

[0041] It follows that for an 8K FFT size, a partition maps in half of an interlacing over half of an 8K OFDM symbol. It is noted that, despite the size of the FFT, a MAC time unit can comprise, for example, 8 partitions. Table 1 below shows exemplary relationships between FFT sizes of 1K, 2K, 4K and 8K and their respective number of OFDM symbols per MAC time unit, number of subcarriers per interlaced, and the number of interlaced per partition:

Table 1

Size of FFT Number of OFDM Symbols per MAC Time Unit Number of Subcarriers by Interlacing Number of interlaces per partition 1024 (1K) 4 125 4 2048 (2K) 2 250 2 4096 (4K) 1 500 1 8192 (8K) 1/2 1000 1/2

[0042] The exemplary relationships between OFDM symbol indices and MAC time indices are shown in table 2 below.

Table 2

FFT size OFDM Symbol Indices for Time Index MAC m (m = 4, 5, ...) 1024 (1K) 4m - 12, 4m -11, 4m -10, 4m-9 2048 (2K) 2m -4, 2m -3 4096 (4K) m 8192 (8K) (m + 3) / 2

[0043] According to one aspect of the invention, relying on the relationships between MAC time units and symbols

OFDM and in the relationships between partitions and

Petition 870190116196, of 11/11/2019, p. 21/67

17/44 interlacing, the technology in question is capable of multiplexing the MAC layer over MAC drives and time partitions, regardless of the FFT size of the OFDM system. The physical layer can map MAC units and time partitions into OFDM and interlacing symbols, respectively, for various FFT sizes.

[0044] Although the examples above refer only to 1K, 2K, 4K and 8K FFT sizes, the technology in question is not limited to these particular FFT sizes and other FFT sizes can be implemented without departing the scope of the technology in question.

[0045] A system can include multiple partitions per symbol (for example, 8 partitions per symbol as shown in figure 6). When a partition (for example, partition 0) can be assigned to the pilot symbols, the other partitions (for example, partitions 1 to 7) may be available for allocation to the data symbols. Pilot symbols are known a priori by the transmitting and receiving devices. Pilot symbols can be used by a transmitting or receiving device for, for example, frame synchronization, frequency acquisition, time acquisition, and / or channel estimation. In this example, partition 0 can be referred to as a pilot partition, and partitions 1 to 7 can be referred to as data partitions. Alternatively, multiple partitions (for example, partition 1 and 3) can be assigned to pilot symbols, and the remaining partitions can be allocated to data symbols. In this alternative example, partitions 1 and 3 can be referred to as the pilot partitions, and the remaining partitions can be referred to as

Petition 870190116196, of 11/11/2019, p. 22/67

18/44 data partitions. While figure 6 illustrates an exemplary partition structure / function, a partition structure / function is not limited to this configuration. A partition structure / function can be of other types of configurations (for example, a partition structure can have any number of partitions, and partitions can be allocated in many different ways and for various types of information).

[0046] In figure 6, each of the partitions is assigned or mapped to an interlacing. For example, partition 1 is assigned to interlaces 3, 1, 0, 7, 5, 4, etc. through successive OFDM symbol indices 4, 5, 6,

6, 7, 8, 0, etc. According to one aspect of the invention, a partition interleaving can refer to an interlacing to which a partition is mapped or to be mapped. A pilot interlace can refer to a partition interlace associated with a pilot partition. In another aspect of the invention, a partition entanglement can refer to a partition to which an entanglement is mapped or to be mapped. A pilot interlace can refer to a partition interlace associated with a pilot interlace. In yet another aspect of the invention, a partition interlace can refer to a partition / interlace mapping function or to a partition / interlace mapping function. A partition / interlace mapping function and a partition / interlace mapping function can be the same or equivalent, except that a partition / interlace mapping function can use a partition (or a

Petition 870190116196, of 11/11/2019, p. 23/67

19/44 partition index) as an input and provide an interlace (or an interlace index) as an output and that a partition / interlace mapping function can use an interlace (or an interlace index) as an input and provide a partition (or a partition index) as an output. Terms such as a partition, an interlacing, a pilot partition, a pilot interlacing, a symbol, and the like are sometimes used to refer to a partition index, an interlacing index, a partition pilot index, a pilot interlacing index, and a symbol index, respectively.

[0047] A FLO system is capable of several multicast services, such as live video and audio streams (for example, news, music or sports channels). A service can be seen as an aggregation of one or more related data components, such as the video, audio, text or signaling associated with a service. Each FLO service can be loaded over one or more logical channels, referred to as Multi-Broadcast Logical Channels (MLCs). For example, the video and audio components of a given service can be shipped on multiple MLCs (for example, two different MLCs). One or more partitions for data symbols can be used for MLCs.

For example, partitions 1 to 3 can be used for the video components of a given service, and partitions 4 a can be used for audio components of a given service.

[0048] Exemplary systems and methods for generalized partition / interlacing mapping for FLO

Petition 870190116196, of 11/11/2019, p. 24/67

20/44 are described in detail below. Such systems and methods can support an entire family of partition / entanglement maps on FLO transmitting and receiving devices. Generalized partitioning / interlacing maps can provide the different channel length estimates that can be computed on a receiving device as well as the best Doppler resilience. Generalized partition / entanglement maps are sometimes referred to as flexible partition / entanglement maps. A particular partition / interleave map can sometimes be referred to by the corresponding pilot staggering pattern used in the partition / interleave map.

[0049] The FLO aerial interface specification for 4K mode (TIA-1099) together with its associated implementation can support a scaling pattern referred to as the standards (2,6). In this case, the changes in pilot interlacing between interlaces 2 and 6 through successive OFDM symbols in a superframe. A scaling pattern (2,6) provides the pilot observations of two different interlaces 2 and 6. This allows the computation of the channel estimation up to a length of 1024 when operating in 4K mode. While 1024 channel length estimates may suffice for distributions in regions such as the United States, supporting longer channel estimates (longer than two pilot interlocks) may be required in other modalities of FLO distribution (eg example, 2K mode or VHF band distribution).

Petition 870190116196, of 11/11/2019, p. 25/67

21/44

[0050] Partition / interlacing map patterns such as those using pilot scaling patterns (0.3.6) and (0.2.4.6) can also be used to allow flexibility in channel estimation. These standards can provide a maximum of channel estimates of length 4096 and 2048, respectively, according to an exemplary implementation. It is also possible to estimate a longer channel delay spread (for example, greater than 4096 and greater than 2048) with a higher channel estimation error.

[0051] According to one aspect of the invention, flexible partition / interlacing maps can be used for OIS and data symbols. The TDM pilot symbols (such as TDM pilot 1 and TDM pilot 2), WIC, LIC, PPC and SPC can have fixed interlaces independent of the partition / interleave map in use for the rest of the superframe. Under normal operating circumstances, a FLO receiving device can determine the partition / interlacing map to be used after having decoded the SPC symbols, which occur at the end of the superframe.

[0052] Exemplary implementations of the generalized partition / entanglement maps using the pilot scaling patterns (0.3.6), (0.2.4.6) and (2.6) are described in detail below. Partition / entanglement maps as well as associated implementations are based on the concept of pilot entanglements and distance vectors for different data partitions. The length of a distance vector can be the number of interlaces minus the number of interlaces

Petition 870190116196, of 11/11/2019, p. 26/67

22/44 pilot. In these examples, 8 interlaces and 8 partitions are used. However, the technology in question is not limited to these numbers, and any number of interlaces and any number of partitions can be used.

[0053] Scaling Standard (0,3,6)

[0054] A pilot interlacing vector (Io) can be determined by the scaling pattern. One or more distance vectors (D) can be defined for each partition / interlacing map. Distance vectors can be used to determine the interlacing index for each data partition. After having determined the pilot interlacing, data partitions can be arranged using remaining interlacing such that the relative distance of the remaining interlacing for a given partition can be obtained from the rotations of one or more distance vectors. An exemplary implementation of this is described below.

[0055] As an illustration, for the scaling pattern (0.3,6), Io = [0,3,6,1,4,7,2,5], and leave D = [7,2,4, 6.1,5,3]. For the step pattern (0.3,6), the pilot jump is 3, and Io is determined as follows: (i) start with the 0 of the step pattern, (ii) add the pilot jump of 3 to the initial value 0 to get 3 as the next value, (iii) add 3 to get 6, (iv) add 3 to get 9, which is translated to 1, (v) add 3 to get 12, which is translated to 4 , (vi) add 3 to get 15, which translates to 7, (vii) add 3 to get 18, which translates to 2, and (viii) add 3 to get 21, which translates to 5. The translation described above can be

Petition 870190116196, of 11/11/2019, p. 27/67

23/44 performed using, for example, the total number of interlaces and a module operation.

[0056] Let n denote the OFDM symbol index in the superframe, where n ranges from 0 to 1199. Note that the symbol index 0 corresponds to TDM1. Let s denote the partition index so that s varies from 0 to 7. Let the partition interleave I [s, n] correspond to the interlacing to which partition s is mapped in the OFDM symbol n index. Note that s in I [s, n] can take the values from 0 to 7. The partition 0 (that is, s = 0) corresponds to the pilot partition for which the interlacing is given by the chosen scaling pattern. Thus, the I [0, n] partition interlacing can be referred to as a pilot interlacing.

1. Given the index n of the OFDM symbol, a pilot interlacing (I [0, n]) can be determined by indexing in Io using n. For example, l [0, n] = Io [(n mod 8)].

2. For data partitions, first compute a rotation factor Rn for the distance vector D based on the OFDM symbol index n. For example, Rn = 2n mod 7.

Then perform a cyclic shift to the right of the vector D by Rn. Leave the vector after the right cyclic shift is DRn. Then, the partition / interlacing map for data partitions in the OFDM symbol index n can be given by I [s, n] = (l [0, n] + DRn [s]) mod 8, where s = 1 , 2, .., 7.

[0057] The resulting map ensures that in a block of 7 successive OFDM symbols, each partition occurs at all possible distances from the pilot interlacing. In addition, in a block of 56 successive OFDM symbols, each partition occupies each available interlacing exactly 7 times. Each partition goes through all interlaces

Petition 870190116196, of 11/11/2019, p. 28/67

24/44 available at least once in a window of 17 OFDM symbols. It also ensures that there are at least three intermediate OFDM symbols before a particular interlacing is assigned to the same partition.

[0058] Scaling Standard (2.6)

[0059] An exemplary generalized partition / interlacing map based on the scaling pattern (2.6) can be performed using pilot interlacing and distance vectors. In this example, a pilot interlacing vector (Io) and two different distance vectors (Do and D1)

are used to perceive the pattern in partition on interlacing all. [0060] As an illustration, for The pattern of staggering (2.6), Io = [2.6.2 , 6,2,6,2, 6], and leave Do =

[6,2,4,7,3,1,5] and D1 = [2,6,4,3,7,5,1]. Using the notations described above, the interlacing of partition I [s, n], which is the interlacing that corresponds to partition s in the OFDM symbol index n, can be determined as follows:

1. Given the OFDM symbol index n, a pilot interlacing (I [0, n]) can be determined by indexing in Io using n. For example, I [0, n] = Io [(n mod 8)].

2. If n is even, set D to be Do. If n is odd, set D to be D1.

3. For data partitions, first compute a rotation factor Rn for the distance vector D based on the OFDM symbol index n. For example, Rn = 2n mod 7. Then perform a cyclic shift to the right of the distance vector D by Rn. Leave the vector after the right cyclic shift is DRn. Then, the partition / interlacing map for the data partitions in the OFDM symbol index n can

Petition 870190116196, of 11/11/2019, p. 29/67

25/44 be given by I [s, n] = (I [0, n] + DRn [s]) mod 8, where s = 1,

2, ..., 7.

[0061] Note that with two distance vectors, there is an additional step of selecting the appropriate distance vector based on the OFDM symbol index n. In order to generalize the structure, eight different distance vectors can be used for any pilot interlacing vector. In addition, two interlacing pilot scaling patterns can also be generated using the same structure, where the pilot interlacing and distance vectors can be chosen appropriately in the software.

[0062] Scaling Standard (0,2,4,6)

[0063] An exemplary generalized partition / interlacing map based on the scaling pattern (0,2,4,6) can be performed using a pilot interlacing and a distance vector. In this example, a pilot interlace vector (I0) and a distance vector (D) are used to perceive the entire partition / interlace pattern.

[0064] As an illustration, for the scaling pattern (0,2,4,6), I0 = [0,2,4,6,0,2,4,6], and let D =

[1,6,4,2,7,5,3]. Using the notations described above, the interlacing of partition I [s, n] can be determined as follows:

1. Given the OFDM symbol index n, a pilot interlacing (I [0, n]) can be determined by positioning at I0 using n. For example, I [0, n] = I0 [(n mod 8)].

2. For data partitions, first compute a rotation factor Rn for the distance vector D based on the OFDM symbol index n. For example, Rn = 2n mod 7. Then perform a cyclic shift to the right of the vector D

Petition 870190116196, of 11/11/2019, p. 30/67

26/44 by Rn. Leave the vector after the right cyclic shift is DRn. Then, the partition / interlacing map for the data partitions in the OFDM symbol index n can be given by I [s, n] = (I [0, n] + DRn [s]) mod 8, where s = 1 , 2, .., 7.

[0065] For this exemplary implementation, each partition (with the exception of a pilot partition) is assigned to each interlacing at least once in every 10 successive OFDM symbols. An interlacing is repeated for a partition only after three OFDM symbols. Given the distance vector of length 7, each partition occupies all possible distances from the pilot interlacing in a block of 7 successive OFDM symbols. In addition, in a block of 28 successive OFDM symbols, each partition occupies interlaces 0, 2, 4 and 6 three times and interlaces 1, 3, 5 and 7 four times.

[0066] Referring back to figure 6, this concept is explained in detail. For the scaling pattern (0,2,4,6) described above, each of the partitions 1 to 7 is assigned to each of the interlaces 0, 1, 2, 3, 4, 5, 6, and 7 at least one every 10 successive OFDM symbols. For example, partition 1 is assigned to interleave 3 for the OFDM symbol index 4, assigned to interleave 1 for the OFDM symbol index 5, assigned to interleave 0 for the OFDM symbol index 6, assigned to interleave 7 for the index OFDM symbol 7, assigned to interleave 5 for the OFDM symbol index 8, assigned to interleave 4 for the OFDM symbol index 9, assigned to interleave 2 for the OFDM symbol index 10, assigned to interleave 1 for the symbol index OFDM 11, assigned to interlacing

Petition 870190116196, of 11/11/2019, p. 31/67

27/44 for the OFDM symbol index 12, and assigned to interleaving 6 for the OFDM symbol index 13.

[0067]

Still referring to figure 6, an interlacing index is repeated for a partition only after 3 symbols. For example, for partition 0, interlacing 0 is repeated only after 3 successive indexes of OFDM symbols. This is the same for interleave 2, interleave 4 and interleave 6. In addition, figure 6 illustrates that each partition occupies all possible distances from the pilot interleave in 7 successive OFDM symbols. For example, partition 0 is for pilot interlacing, and is assigned to interlaces 0, 2, 4, 6, 0, 2, and 4 for OFDM symbol indices 4, 5, 6, 7, 8, 9, and 10, respectively. Partition 3 is assigned to interlaces 6, 5, 3, 2, 1, 7, and 6 for OFDM symbol indices 4, 5, 6, 7, 8, 9, and 10, respectively. Thus, the distance between partition 3 and partition 0 is the absolute value of the difference between the interlacing indices of partition 3 and partition 0. In this example, the distance is 6, 3, 7 (which is a translation of -1 ), (which is a translation of -4), 1, 5, and 2 for OFDM symbol indexes 4, 5, 6, 7, 8, 9, and 10, respectively. The absolute value can be obtained, for example, by performing a module operation.

0068]

According to one aspect of the invention, one or more vectors of pilot interlaces (for example, Io, I1, I2, etc.) can be used, and one or more distance vectors (for example, Do, D1, D2, etc.) can be used. The number of partitions and the number of interlaces is not limited to 8, and each of them can

Petition 870190116196, of 11/11/2019, p. 32/67

28/44 be any number. Thus, there can be a number p of partitions, and a number q of interlaces. The variables p and q can be the same. The length of each of the pilot interlacing vectors can be q. An exemplary implementation can be described as follows:

1. Given the OFDM symbol index n, a pilot interlacing vector can be selected from one or more pilot interlacing vectors based on, for example, n. A pilot interlacing can be determined by indexing the selected I using n. For example, I [0, n] = I [(n mod m1)], where m1 is any integer. It is also possible to have more than one pilot interlacing. For example, the pilot interlacing can be expressed as follows: I [x, n] = I [(n mod m1)], where x can represent indexes of the pilot partitions. The indexes for the pilot partitions do not have to be contiguous. For example, pilot partitions can occupy partition 1, partition 3 and partition 7, in this case x = 1, 3, 7.

2. Given the OFDM symbol index n, a distance vector D can be selected from one or more distance vectors based on n (for example, based on n mod m1, where m1 is any integer) and / or optionally the pilot interlacing selected in step 1 above.

3. For data partitions, first compute a rotation factor Rn for the distance vector D based on the OFDM symbol index n. For example, Rn = k * n mod m3, where each of k and m3 is an integer. Then perform a cyclic shift to the right of the distance vector D by Rn. Leave the vector after the right cyclic shift is DRn. Then, the partition / interlacing map for the

Petition 870190116196, of 11/11/2019, p. 33/67

29/44 data partitions in the OFDM symbol index n can be given by I [s, n] = (I [0, n] + DRn [s]) mod m4, where s = l, 2, ..., p-1, p, m4 is any integer. If there are multiple pilot interlaces such as I [x, n], then the partition / interlacing map can be expressed as: I [s, n] = (I [x, n] + DRn [s]) mod m4, where s can represent non-pilot partition indexes (for example, data partitions). The variables k, m1, m2, m3 and m4 can be the same or different. It is also possible that there may be more than one rotation factor.

[0069] According to one aspect of the invention, one or more (or all) of the following properties can be associated with generalized partition / interlacing mapping:

1. An interlacing is associated with non-contiguous subcarriers (for example, I0 is associated with non-contiguous subcarrier indices 48, 56, etc., as shown in figure 5).

2. Each of the partitions occupies as many different interlaces as possible over a set of successive symbols. For example, in figure 6, partition 2 occupies interlaces 1, 7, 6, 4, and 3 on successive symbol indices 4, 5, 6, 7, and 8. Thus, each partition can occupy each available interleaving on a set of successive symbols, and the partition / interlacing assignment may change over time.

3. Each partition occupies all possible distances from a pilot interlacing over a set of successive symbols. The number of successive symbols in the set can be the interlacing number minus the number

Petition 870190116196, of 11/11/2019, p. 34/67

30/44 pilot interlacing. For example, in figure 6, the distance between partition 6 (data partition) and partition 0 (pilot partition) is 7, 4, 1, 5, 2, 6, and 3 over symbol indices 4, 5, 6, 7, 8, 9, and 10. Thus, partition 6 occupies all possible distances (1 to 7) from the pilot interlacing over six successive symbols.

4. Each partition is assigned to the same interlacing only after a predetermined number of successive symbols. That is, an interlacing index is repeated for a given partition only after a predetermined number of successive symbols. For example, in figure 6, partition 0 is assigned to interlacing 0 again only after three successive symbols.

[0070] Hardware Implementation Architecture

[0071] Figure 7 is a conceptual block diagram that illustrates the exemplary hardware implementation architecture for generalized partition / interlacing maps. A processing system 710 of a transmitting or receiving device may include a pilot interlace vector unit 710, a distance vector unit 730, and a partition interlace computing unit 740. In this exemplary implementation, 8 partitions and 8 interlacing is used, but the technology in question is not limited to these numbers of partitions and interlacing.

[0072] The various parameters required to compute the partition / entanglement map such as the pilot entanglement vector, distance vectors and other control parameters such as permit_displacement can be programmed by the software to allow the

Petition 870190116196, of 11/11/2019, p. 35/67

31/44 easy programmability in the mapping used. The software may be able to directly program the hardware registers (for example, the pilot interlacing vector unit 710 and the distance vector unit 730) that contain some of these parameters. These parameters can be programmed at initiation (based on default parameters) or after processing the SPC symbols. In addition, the hardware is awake when the software tries to program these registers. Since the time frame of the hardware rest is available in the software, the software can readily handle issues related to the rest. Providing direct control to the software can ensure that OIS decoding is enabled at an appropriate time in the software. OIS decoding can be enabled after the partition / entanglement parameters are programmed in the hardware.

[0073] The pilot interlace vector unit 710 can include a pilot interlace vector Io which includes, for example, vector 8 x 1 programmed by the software. Each element of the vector can be 3 bits long (to represent one of eight interlaces from 000 to 111). For scaling patterns like (2,6), the pattern can be repeated periodically until all eight elements in the vector are used. For example, a scaling pattern (2.6) can generate a pilot interlacing vector of (2.6.2.6.2.6.2.6). A scaling pattern (0.3.6) can generate an Iode pilot interlacing vector (0.3,6,1,4,7,2,5). A scaling pattern (0,2,4,6) can generate an Iode pilot interlacing vector (0,2,4,6,0,2,4,6).

Petition 870190116196, of 11/11/2019, p. 36/67

32/44

[0074] The software can also program the distance vector unit 730, which includes, for example, an 8 x 7 distance vector table. Each entry in this table can be represented using three bits. As a result, the table can include 8 rows, each 21 bits long. Each row in this table corresponds to a distance vector. As in the case of the pilot interlacing vector, if the number of distance vectors is less than 8, then the distance vectors are repeated periodically to fill the entire table. Consequently, in the case of the pattern (0,3,6), a vector is repeated 8 times to fill the table. In the case of the scaling pattern (2,6), where there are two distinct distance vectors, each distance vector occurs four times in alternate locations in the table. The software can handle periodic repetitions while writing to the tables.

[0075] An allow_displacement indicator 775 (1 bit) can be used by the hardware to enable or disable the cyclic rotation of the distance vector based on the OFDM symbol index. The allow_displacement indicator 775 can also be initialized by the software while initializing the pilot interlacing vector and distance vectors.

[0076] After all software programming is complete, hardware operations can be performed as follows. Note that the OFDM symbol index n in the following description corresponds to the OFDM symbol index in the superframe. The hardware first uses the OFDM symbol n index for which the partition / interlacing map is to be generated, selects the three least significant bits (LSBs)

Petition 870190116196, of 11/11/2019, p. 37/67

33/44 (module 8 operation), and uses the three LSBs to index the pilot interlace vector to obtain pilot interlace. To conserve record space, the pilot interlacing vector can be stored in a packet format using 8x3 = 24 bits in a 32-bit register. The format can be such that the pilot interlacing for the OFDM symbol index 0 occupies the 3 least significant bits. The pilot interlacing can be given by the three bits in the vector that occupy the positions (n mod 8) *

3, (n mod 8) * 3 + 1 and (n mod 8) * 3 + 2. Let this be denoted by I [0, n].

[0077] The OFDM symbol index n can also be used to index the distance vector as well as the rotation factor that is used in the distance vector. The allow_displacement indicator 775, which is adjusted by the software (depending on the partition / interlacing map being used), can determine whether a nonzero rotation should be used in the distance vector. If the allow_displacement indicator 775 is set, then the OFDM symbol index n is first shifted to the left by 1 using a left shift unit 795 (multiplication by 2), and then a module operation 7 is performed on the result using a module unit 7 7 90. A multiplier 770 multiplies the result by 3 (to consider 3 bits used for each entry in the distance vector table) to arrive at Rn, which is used as an argument for a right-shift unit 742.

[007 8] OFDM symbol index n can also be used to select the appropriate distance vector line in the distance vector matrix. For example,

Petition 870190116196, of 11/11/2019, p. 38/67

34/44 three LSBs of the OFDM symbol index (for example, n mod 8) can be used as the line index to select the distance vector to result in D. The distance vector D is then cyclically shifted to the right by the argument given by Rn to reach DRn. In this particular example, because the vector D occupies only 24 bits in a 32-bit register, the cyclic shift operation needs to take this into account. Alternatively, to simplify hardware operation, the software can perform a cyclic extension of the 24 vectors from bit to 32 bits by placing the 8 LSBs at the front. An extended array can assist in the cyclic shift operation for the hardware. In such a case, Dr _d corresponds to 24 LSBs of the cyclically displaced vector.

[0079] Partition interlacing 725 for data partitions 1 through 7 in the OFDM symbol index n can be obtained as follows. The pilot interlacing I [0, n] that was obtained previously can be added to the three DRn LSBs using a 745 adder. Then a module 8 operation can be performed on the result using a module unit 8 750. The result can be placed in a data interleaving table unit 760, which can include a 1 x 7 vector. Each element of the vector can be 3 bits long. The first result can be a partition interlacing corresponding to partition 1. Generally, for partition s, the interlacing index is given by the operation (I [0, n] + DRn (3s - 3: 3s - 1)) mod 8 Note that in DRn, (x: y) corresponds to bit locations x, x-1, ..., y in the above expression.

[0080] The interlacing indices obtained for all seven data partitions and the pilot partition can

Petition 870190116196, of 11/11/2019, p. 39/67

35/44 can be stored in a lookup table (not shown) which can then be positioned using the partition index.

[0081] A processing system 710 shown in figure 7 can also be used to map an interlacing in a partition when OFDM symbols are received. Pilot interleave 720 can provide a pilot partition for a given pilot interleave, and partition interlaces 725 can provide a partition for a given interleave. The processing system 710 can be pre-programmed with one or more pilot interlacing vectors, one or more distance vectors and optionally one or more rotation factors. Alternatively, the processing system 710 can receive some or all of these through other appropriate means (for example, a FLO network, another type of network, another type of communication). For a given symbol index and an interlacing, the processing system 710 can provide corresponding partitions using a partition interlacing computing unit. Also, for a given symbol index and a pilot interlace, the processing system 710 can provide corresponding pilot partitions using the partition interlace computing unit. The implementation of the partition computing unit may be similar to or different from

what the implementation of the computing unit in interlacing of partition 740. [0082] Module 7 Implementation in Hardware [0083] An exemplary operation of module 7 that can to be used in an implementation in map in partition / interlacing is explained in detail below. Per

Petition 870190116196, of 11/11/2019, p. 40/67

36/44 example, a 2n mod 7 operation can be performed where n is the OFDM symbol index in the superframe. According to an exemplary configuration, a module 7 operation is performed using adder only. A basic concept is described below.

[0084] It is known that 8 = 1 (mod 7). Consequently, any power of 8 is also congruent to 1 module 7. That is, for any integer m, 8 ^m = 1 (mod 7). Based on this concept of congruence and expansion of any number in powers of 8, the positive integer k of bit 3m can be expressed as k = 8 ^m-1 pm-1 + 8 ^m-2 pm-2 + ... + 8 ¹ p1 + pc, using appropriate integers. This equation can be written using module 7 as, k = pm-1 + pm-2 + ... + p1 + pc, (mod 7). Each pi represents three consecutive bits at the position (3i + 2: 3i) in the binary representation of k. Consequently, three successive bits in the form of (3i + 2: 3i) can be added until the final result is reduced to 3 bits.

[0085] According to an exemplary aspect of the invention, this technique can be applied to the OFDM symbol index n on the superframe as follows. Note that when the OFDM symbol index n is an 11-bit number in a

FLO across all bandwidths, 2n is a 12-bit number.

1. First, the group bits (0-2), (3-5), (6-

8), and (9-11), and then add them until it results in a 5-bit number.

2. Next, group the resulting 5-bit number again as bits (0-2) and (3-4), and then add them until you get a 4-bit number.

Petition 870190116196, of 11/11/2019, p. 41/67

37/44

3. At this stage, the resulting number is guaranteed to be between 0 and 8 (decimal). A lookup table can be used at this stage, or a final addition can be made.

If an addition is made, follow the step 4 below is fulfilled then. 4. Add bit 4 to 3 LSBs. THE result is guaranteed to be between 0 and 7. 5. If the number is 7, the then map it back to 0 (once that 7 is 0 module 7). If the result is smaller than

7, use the result as is.

[0086] This implementation uses 6 adders. It is also possible to use a higher power of 8 (for example,

64) and reduce operations to 2 additions. A lookup table can be used to map it back to the final result of module 7.

[0087] According to another exemplary aspect of the invention, a module 7 operation can be performed in the following way.

1. Since the OFDM symbol index n is expressed using, for example, a complementary binary representation of 2, and 2n is a number of ki bits in length, select the size (m bits) of a group, where m is greater than or equal to 2, em is less than ki, m is an integer, and ki is an integer.

2. Based on the size (m bits) of the group, determine the number (ni) of the groups for the number of length ki bits, where each of the groups has a length of m bits, ni is an integer, and the groups are represented as group 1 to group ni. ni can be rounded (ki / m).

3. Group the number of ki bits in length in the group to the group ni, starting from the least significant bit (s)

Petition 870190116196, of 11/11/2019, p. 42/67

38/44 of the number of ki bits in length so that group 1 is associated with the least significant bit (s) of the number of ki bits in length.

4. Add group 1 to group ni to generate a number of k2 bits in length, where k2 is less than ki, and k2 is an integer.

5. Determine the number (ni) of the i ^th group for the number of ki bits in length, where each of the i ^th groups has a length of m bits, i is an integer, i is greater than 1, and the i ^th hi groups are represented as group 1 ^th to i ni ^th group. ni can be rounded (ki / m).

6. Group the number of ki bits length in the i ^th group 1 to the i ^th group ni, where the i ^th group 1 is associated with the least significant bits of the number of ki bits.

7. Add the i ^th group 1 to the i ^th group ni to generate a number of ki + i bits in length, where ki + i is less than ki, and ki + i is an integer.

8. Increments i.

9. Repeat steps 5 through 8, until ki + i is equal to or less than m.

10. If ki + i is equal to or less than m, and m is 3, then step 9 can provide the desired end result. If m is greater than 3 (for example, 6), then a lookup table can be used at this stage. Alternatively, steps similar to steps 5 to 8 can be repeated with m being, for example, 3.

11. If the resulting number is 7, then map it back to 0 (since 7 is 0 module 7). If the result is less than 7, use the result as is.

Petition 870190116196, of 11/11/2019, p. 43/67

39/44

[0088] Now returning to figure 2, in an exemplary process, the receiver 202 of the receiving device 200 can receive a signal. Demodulator 204 can perform demodulation on the received signal and supply OFDM symbols to processing system 206, which can separate the interlacing OFDM symbols and map the interlaces in the partitions using one or more pilot interlocks and one or more partition interlaces. The processing system 206 can also generate modulation symbols from the partitions and convert the modulation symbols into data streams.

[0089] Referring to figure 3, in an exemplary process, the transmitting device 302 can receive data streams and convert the data streams into symbols. The processing system 314 of the transmitting device 302 can assign the symbols on partitions and map the partitions / interlaces using one or more pilot interlocks and one or more partition interlaces. Modulator 320 can perform modulation to generate a modulated signal, and transmitter 322 can transmit the modulated signal.

[0090] Figure 8 is a conceptual block diagram that illustrates an example of the functionality of a processing system in a transmitting or receiving device. A processing system 314 or 206 of a transmitting or receiving device 302 or 200 (see figures 2 and 3) includes a module 810 to include one or more pilot interlace vectors and a module 820 to include one or more distance vectors. The 206 or 314 processing system also includes an 830 module to provide a first

Petition 870190116196, of 11/11/2019, p. 44/67

40/44 partition interleaving based on one or more pilot interleaving vectors and an 840 module to provide a second partition interleaving based on the first partition interleaving and one or more distance vectors.

[0091] Figure 9 is a flowchart that illustrates an exemplary operation of providing partition entanglements or providing communication on a transmitting or receiving device. In step 910, a processing system 314 or

206 of a 302 or 200 transmitting or receiving device (see figures 2 and 3) can receive one or more pilot interlace vectors. In step 920, the processing system 314 or 206 can receive one or more distance vectors. In step 930, it can provide a first partition interleaving based on one or more pilot interleaving vectors. In addition, at step 940, the processing system 314 or 206 can provide a second partition interleaving based on the first partition interleaving and one or more distance vectors. A readable medium can be encoded or stored with instructions executable by a transmitting or receiving device, or by a processing system for such a device, where the instructions include the code for steps 910, 920, 930 and 940 described above.

[0092] As described above, the hardware architecture can be used to implement a family of partition / interlacing maps with the configuration of some hardware registers. The architecture can support partition / entanglement maps with different pilot scaling patterns. The ability of channel estimation and the

Petition 870190116196, of 11/11/2019, p. 45/67

41/44 Doppler resilience depends on the pilot scaling pattern in an OFDM system such as FLO. With the architecture described above, a single FLO receiver device can support different partition / interlacing maps that can be developed on different networks. The architecture also supports backward compatibility with the FLO overhead specification.

[0093] According to one aspect of the invention, it may be desirable for pilot observations obtained from multiple OFDM symbols to match as many different subcarriers as possible to ensure a channel estimate that satisfies the system's delay propagation requirements of communication. In addition to the pilot symbols spanning a wide array of subcarriers, it may also be desirable for the data symbols to be interleaved between both pilot subcarriers as well as the total available set of subcarriers in the OFDM system so that the data symbols can appreciate the benefits of channel estimation as well as frequency diversity. Therefore, partition / entanglement maps play a vital role in OFDM systems.

[0094] The hardware and software implementations presented above are exemplary implementations. The technology in question is not limited to these implementations, and other appropriate implementations can be used. The technology in question is also not limited to a system of

FLO, and can be used in a variety of communications systems. While the scaling patterns (2.6), (0.3.6) and (0.2.4.6) are described above, these are merely examples, and the technology in question is not limited to these

Petition 870190116196, of 11/11/2019, p. 46/67

42/44 examples. Descriptions related to OFDM symbols and the OFDM symbol index may apply to other symbols and symbol index. The term symbol used here can refer to an OFDM symbol, any other type of symbol, data or information. The term vector used here can refer to an arrangement, a group, a set, or a plurality of items. The term mapping used here can refer to assign or allocate, and vice versa.

[0095] Those skilled in the art would appreciate that the various components, blocks, modules, elements, networks, devices, processing systems, methods, systems, and illustrative algorithms described here can be implemented in hardware, in software, or in a combination of both. For example, a component can be, but not be limited to, a process running on a processor, an object, an executable, a thread, a program, and / or a computer. By way of illustration, an application running on a communications device and the device can be a component. One or more components can reside within a process and / or thread, and a component can be located on a computer and / or distributed between two or more computers. In addition, these components can run from the various readable media that have multiple data structures stored in them. Components can communicate via local and / or remote processes as per a signal that has one or more data packets (for example, data from a component that interacts with another component on a local system, on the distributed system, and / or through a wired or wireless network such as the Internet).

Petition 870190116196, of 11/11/2019, p. 47/67

43/44

[0096] It is understood that the specific order or hierarchy of steps in the disclosed processes is an illustration of exemplary approaches. Based on design references, it is understood that the specific order or hierarchy of steps in processes can be rearranged. The tracking method claims the current elements of the various steps in a sample order, and does not mean being limited to the specific order or hierarchy presented.

[0097] The preceding description is provided to enable anyone versed in the technique of practicing the various aspects described here. The various modifications to these aspects will be readily apparent to those skilled in the art, and the generic principles defined here can be applied to other aspects. Thus, the claims are not intended to be limited to the aspects shown here, but the full scope consistent with the language claims should be agreed, in which the reference to an element in the singular is not intended to mean "one and only one" unless that specifically stated so, but instead one or more ”. Unless specifically stated otherwise, the term "some" refers to one or more. The underlined and / or italicized titles and subtitles are used for convenience only, do not limit the invention, and are not referred to in relation to the interpretation of the invention.

[0098] All structural and functional equivalents to the elements of the various aspects described throughout this invention that are known or later become known to those skilled in the art are expressly incorporated herein by reference and intended

Petition 870190116196, of 11/11/2019, p. 48/67

44/44 to be covered by the claims. In addition, nothing disclosed here is intended to be dedicated to the public regardless of whether such an invention is explicitly reported in the claims. No element of the claim shall be interpreted under the provisions of 35 US $ 112, sixth paragraph, unless the element is expressly reported using the phrase “means for or, in the case of a method claim, the element is reported using the phrase“ step to. Furthermore, to the extent that the term "include or" have is used either in the description or in the claims, such term is intended to be inclusive in a similar way to the term "understanding as" understanding is interpreted when used as a transitional word in a claim.

Claims (48)

1. Transmitting or receiving device, characterized by the fact that it comprises: a processing system configured to include one or more pilot interlacing vectors determined by at least one scaling pattern and one or more distance vectors for a partition / interlacing map, where one or more distance vectors are used to determining an interlacing index for each partition of the partition / interleaving map data, and where a length of one or more distance vectors is a number of interleavings on the partition / interleaving map minus a number of one or more pilot interlacing vectors , the processing system further configured to provide a first partition interleaving based on one or more pilot interleaving vectors, the processing system additionally configured to provide a second partition interleaving based on the first partition interleaving and one or more distance vectors. 2. Transmitting or receiving device according to claim 1, characterized in that the processing system is additionally configured to provide the first partition entanglement based on one or more pilot entanglement vectors and a symbol index. 3. Transmitting or receiving device according to claim 1, characterized by the fact that one or more distance vectors include a plurality of Petition 870190116196, of 11/11/2019, p. 50/67 2/16 distance vectors, and the processing system is further configured to select a distance vector from the plurality of distance vectors based on a symbol index. 4. Transmitting or receiving device according to claim 3, characterized in that the processing system is additionally configured to provide the second partition entanglement based on the first partition entanglement and the selected distance vector. 5. Transmitting or receiving device according to claim 3, characterized by the fact that one or more pilot interlacing vectors include a plurality of pilot interlacing vectors, the processing system is additionally configured to select an interlacing vector pilot from the plurality of pilot interlacing vectors based on a symbol index, and the processing system is further configured to select the distance vector from the plurality of distance vectors based on the symbol index and the selected pilot interlacing. Transmitter or receiver device according to claim 1, characterized in that the first partition interleave includes one or more pilot interleaves, and the second partition interleave includes one or more partition interleaves for data. 7. Transmitting or receiving device, according to claim 1, characterized by the fact that the system Petition 870190116196, of 11/11/2019, p. 51/67 3/16 processing is additionally configured to rotate the one or more vectors away to provide the second partition interlacing. 8. Transmitting or receiving device according to claim 1, characterized by the fact that the processing system is additionally configured to select a pilot interlace vector from one or more pilot interlace vectors based on an index of symbols. 9. Transmitting or receiving device according to claim 1, characterized by the fact that the first partition entanglement is for a first partition, the second partition entanglement is for a second partition, and the processing system is further configured to provide additional partition interleavings for all other partitions based on the first partition interleaving and one or more distance vectors. Transmitting or receiving device according to claim 1, characterized in that the processing system is additionally configured to determine the length of a channel estimate of a transmit or receive channel. 11. Transmitting or receiving device according to claim 1, characterized by the fact that the second partition entanglement is configured to map a partition on one or more entanglements or to map an entanglement on one or more partitions, and in which a symbol corresponds to one or more MAC time units, or a MAC time unit corresponds to one or more symbols. Petition 870190116196, of 11/11/2019, p. 52/67 4/16 12. Transmitting or receiving device, characterized by the fact that it comprises: mechanisms for including one or more pilot interlacing vectors determined by at least one scaling pattern; mechanisms for including one or more distance vectors for a partition / interleave map, where the one or more distance vectors are used to determine an interlacing index for each partition of the partition / interleave map data, and in which a length of one or more distance vectors is a number of interlaces on the partition / interlacing map minus a number of one or more pilot interlacing vectors; mechanisms for providing a first partition interlacing based on one or more pilot interlacing vectors; and mechanisms for providing a second partition entanglement based on the first partition entanglement and one or more distance vectors. Transmitter or receiver device according to claim 12, characterized in that the mechanisms for providing the first partition entanglement are configured to provide the first partition entanglement based on one or more pilot entanglement vectors and one symbol index. Transmitter or receiver device according to claim 12, characterized in that the one or more distance vectors include a plurality of distance vectors, and the transmitter or receiver device further comprises mechanisms for Petition 870190116196, of 11/11/2019, p. 53/67 5/16 select a distance vector from the plurality of distance vectors based on a symbol index. 15. Transmitting or receiving device, according to claim 14, characterized by the fact that the mechanisms for provide the second interlacing of partition are configured for provide the second interlacing partition with based on first interlacing partition and in vector of distance selected. Transmitter or receiver device according to claim 14, characterized in that the one or more pilot interlace vectors include a plurality of pilot interlace vectors, and in which the transmitting or receiving device further comprises: mechanisms for selecting a pilot interlace vector from the plurality of pilot interlace vectors based on a symbol index; and mechanisms for selecting the distance vector from the plurality of distance vectors based on the symbol index and the selected pilot interlacing. Transmitter or receiver device according to claim 12, characterized in that the first partition interleave includes one or more pilot interleaves, and the second partition interleave includes one or more partition interleaves for data. Petition 870190116196, of 11/11/2019, p. 54/67 6/16 Transmitter or receiver device according to claim 12, characterized in that it additionally comprises mechanisms for rotating the one or more distance vectors to provide the second partition entanglement. 19. Transmitting or receiving device according to claim 12, characterized in that it additionally comprises mechanisms for selecting a pilot interlace vector from one or more pilot interlace vectors based on a symbol index. 20. Transmitting or receiving device according to claim 12, characterized in that the first partition entanglement is for a first partition, the second partition entanglement is for a second partition, and in which the transmitting or receiving device comprises additionally mechanisms to provide additional partition interleavings for all other partitions based on the first partition interleaving and one or more distance vectors. 21. Transmitting or receiving device according to claim 12, characterized in that it further comprises mechanisms for determining the length of a channel estimate of a transmit or receive channel. 22. Transmitting or receiving device according to claim 12, characterized in that the second partition interleave is configured to map a partition in one or more interlaces or to map an interleave in one or more partitions, and in which one Petition 870190116196, of 11/11/2019, p. 55/67 7/16 symbol corresponds to one or more MAC time units, or a MAC time unit corresponds to one or more symbols. 23. Method for providing partition entanglements or providing communication on a transmitting or receiving device, characterized by the fact that it comprises: receiving, at the transmitter or receiver, one or more pilot interlacing vectors determined by at least one scaling pattern; receiving, at the transmitter or receiver, one or more distance vectors for a partition / entanglement map, where the one or more distance vectors are used to determine an interlacing index for each data partition of the partition / entanglement map, and wherein a length of one or more distance vectors is a number of interleavings on the partition / interlaced map minus a number of one or more pilot interlacing vectors; providing, at the transmitter or receiver, a first partition entanglement based on one or more pilot entanglement vectors; and to provide, at the transmitter or receiver, one second interlacing in partition with based on first interlacing in partition and us one or more vectors of distance. 24. Method, according claim 23, featured fur fact that the step of provide the first partition entanglement comprises providing the first partition entanglement based on one or more pilot entanglement vectors and a symbol index. Petition 870190116196, of 11/11/2019, p. 56/67 8/16 25. Method according to claim 23, characterized by the fact that one or more distance vectors include a plurality of distance vectors, and the method further comprises selecting a distance vector from the plurality of distance vectors based on in a symbol index. 26. Method according to claim 25, characterized in that the step of providing the second partition entanglement comprises providing the second partition entanglement based on the first partition entanglement and the selected distance vector. 27. Method according to claim 25, characterized by the fact that one or more pilot interlace vectors include a plurality of pilot interlace vectors, and wherein the method further comprises: selecting a pilot interlacing vector from the plurality of pilot interlacing vectors based on an index of symbols; and selecting the distance vector from the plurality of distance vectors based on the symbol index and the selected pilot interlacing. 28. Method according to claim 23, characterized in that the first partition interleave includes one or more pilot interleaves, and the second partition interleave includes one or more partition interlaces for data. 29. Method, according to claim 23, characterized by the fact that it additionally comprises Petition 870190116196, of 11/11/2019, p. 57/67 9/16 rotate one or more vectors away to provide the second partition interlacing. 30. Method according to claim 23, characterized in that it further comprises selecting a pilot interlace vector from one or more pilot interlace vectors based on an index of symbols. 31. Method according to claim 23, characterized in that the first partition interleaving is for a first partition, the second partition interleaving is for a second partition, and in which the method further comprises providing additional partition interleavings for all other partitions based on the first partition interlacing and one or more distance vectors. 32. Method according to claim 23, characterized in that it further comprises determining the length of a channel estimate of a transmit or receive channel. 33. Method according to claim 23, characterized in that the second partition interleave maps a partition in one or more interlaces or maps an interleave in one or more partitions, and in which a symbol corresponds to one or more units MAC time, or a MAC time unit corresponds to one or more symbols. 34. Method according to claim 23, characterized by the fact that the step of providing the second partition entanglement comprises: Petition 870190116196, of 11/11/2019, p. 58/67 10/16 represents twice a symbol index as a number of ki-bit size, where ki is an integer; determine ni number of first groups for the number of ki bits size, where each of the first groups is m bits in size, m is greater than or equal to 2, m is less than ki, m is an integer, ni is an integer, and the first groups are represented as first group 1 to first group ni; group the number of ki bits size in the first group 1 to the first group ni; and adding the first group 1 to the first group ni to generate a k2 bit size number, where k2 is less than ki, and k2 is an integer. 35. The method of claim 34, characterized by the fact in what the stage of to provide The second interlacing in partition comprises additionally: determine number ni in nth groups for the number in size of ki bits, where each of the i ^th groups has a size of m bits, i is an integer, i is greater than 1, and i ^th groups are represented as i ^th group 1 to i ^th group ni; group the number of ki bits size in the i ^th group 1 to the i ^th group ni; adding the i ^th group 1 to the i ^th group ni to generate a number of size of ki + i bits, where ki + i is less than ki, and ki + i is an integer; increment i; and repeat the steps to determine ni number of i ^th groups, group the number of ki bits size, add the Petition 870190116196, of 11/11/2019, p. 59/67 11/16 i ^th g _rU po 1 to the ^nth group ni, and increment i, until ki + i is equal to or less than m. 36. Method according to claim 23, characterized by the fact that it additionally comprises: convert data streams into symbols; assign symbols to partitions; map partitions / interlaces using the first partition interleave and the second partition interleave, where the first partition interleave includes one or more pilot interlaces, and the second partition interleave includes one or more partition interlaces for data; perform modulation; generate a modulated signal; and transmit the modulated signal. 37. Method according to claim 23, characterized by the fact that it additionally comprises: get symbols; separate the symbols into interlacing; map the interlaces into partitions using the first partition interleave and the second partition interleave, wherein the first partition interleave includes one or more pilot interlaces, and the second partition interleave includes one or more partition interlaces for data; generate modulation symbols from partitions; and convert modulation symbols into data streams. Petition 870190116196, of 11/11/2019, p. 60/67 12/16 38. Computer-readable memory characterized by the fact that it comprises instructions stored therein, the instructions being executable by a transmitting or receiving device and comprising the steps of: receiving one or more pilot interlace vectors determined by at least one scaling pattern; receive one or more distance vectors for a partition / interleave map, where the one or more distance vectors are used to determine an interlacing index for each partition of the partition / interleave map data, and in which a length of one or more distance vectors is a number of interlaces on the partition / interlacing map minus a number of one or more pilot interlacing vectors; provide a first interlacing of partition with base one or more vectors interlacing pilot; and provide a second interlacing of partition with base in the first partition interlacing and us one or more distance vectors. 39. Computer-readable memory, from according to claim 38, characterized in that the step of providing the first partition entanglement comprises providing the first partition entanglement based on one or more pilot entanglement vectors and a symbol index. 40. Computer-readable memory according to claim 38, characterized by the fact that one or more distance vectors include a plurality of distance vectors, and the instructions additionally comprise Petition 870190116196, of 11/11/2019, p. 61/67 13/16 select a distance vector from the plurality of distance vectors based on a symbol index. 41. Computer-readable memory according to claim 40, characterized in that the step of providing the second partition entanglement comprises providing the second partition entanglement based on the first partition entanglement and the selected distance vector. 42. Computer-readable memory according to claim 40, characterized by the fact that one or more pilot interlace vectors include a plurality of pilot interlace vectors, and in which the instructions further comprise: selecting a pilot interlacing vector from the plurality of pilot interlacing vectors based on an index of symbols; and selecting the distance vector from the plurality of distance vectors based on the symbol index and the selected pilot interlacing. 43. Computer-readable memory according to claim 38, characterized in that the first partition interleave includes one or more pilot interleaves, and the second partition interleave includes one or more partition interlaces for data. 44. Computer-readable memory according to claim 38, characterized in that the instructions additionally comprise rotating the one or more vectors away to provide the second partition interlacing. Petition 870190116196, of 11/11/2019, p. 62/67 14/16 45. Computer-readable memory according to claim 38, characterized in that the instructions additionally comprise selecting a pilot interlace vector from one or more pilot interlace vectors based on a symbol index. 46. Computer-readable memory according to claim 38, characterized by the fact that the first partition interleave is for a first partition, the second partition interleave is for a second partition, and in which the instructions further comprise providing interlaces additional partition values for all other partitions based on the first partition interlacing and one or more distance vectors. 47. Computer-readable memory according to claim 38, characterized in that the instructions additionally comprise determining the length of a channel estimate of a transmit or receive channel. 48. Computer-readable memory according to claim 38, characterized in that the second partition interleave maps a partition in one or more interlaces or maps an interleave in one or more partitions, and in which a symbol corresponds to a or more MAC time units, or a MAC time unit corresponds to one or more symbols. 49. Computer-readable memory according to claim 38, characterized by the fact that the instructions additionally comprise: Petition 870190116196, of 11/11/2019, p. 63/67 15/16 twice represent an index of symbols as a number of ki bit size, where ki is an integer; determine ni number of first groups for the number of ki bits size, where each of the first groups is m bits in size, m is greater than or equal to 2, m is less than ki, m is an integer, ni is an integer, and the first groups are represented as first group 1 to first group ni; group the number of ki bits size in the first group 1 to the first group ni; and add the first group 1 to first group ni to generate a number of size from k2 bits, in that k2 is smaller than ki, and is a all. 50. Memory readable by computer , in a deal with The claim 49, characterized fur fact in what at instructions additionally comprise: determine ni number of i ^th groups for the number of ki bits size, where each of the i ^th groups is m bits long, i is an integer, i is greater than 1, and i ^th groups are represented as i ^th group 1 to i ^th group ni; group the number of ki bits size in the i ^th group 1 to the i ^th group ni; adding the i ^th group 1 to the i ^th group ni to generate a number of size of ki + i bits, where ki + i is less than ki, and ki + i is an integer; increment i; and repeat the steps to determine ni number of i ^th groups, group the number of ki bits size, add the Petition 870190116196, of 11/11/2019, p. 64/67 16/16 i ^th g _rU po 1 to the ^nth group ni, and increment i, until ki + i is equal to or less than m. 51. Transmitting or receiving device, characterized by the fact that it comprises: a pilot interlace vector unit configured to include one or more pilot interlace vectors determined by at least one scaling pattern; a distance vector unit configured to include one or more distance vectors for a partition / interleave map, where the one or more distance vectors are used to determine an interlacing index for each partition / interleave map data partition , and where a length of one or more distance vectors is a number of interlaces on the partition / interleave map minus a number of one or more pilot interleave vectors; and a partition interlace computing unit configured to provide a first partition interlace based on one or more pilot interlace vectors and additionally configured to provide a second partition interlace based on the first partition interlace and one or more distance vectors.