# US 12,223,192 B2 · Method for signaling memory requirements in ATSC3.0 when out-of-order data is being utilized > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 12,223,192 B2 - Document ID: US12223192B2 - Status: Granted - Kind: B2 - Application number: 18/186,808 - Filed: 2023-03-20 - Published: 2024-08-22 - Granted: 2025-02-11 - Earliest claimed: 2023-02-22 - Applicants: Sony Group Corporation - Inventors: Graham Clift; Luke Fay - Web page: https://patentgrep.com/patent/US12223192B2 ## CPC - G06F 3/0644: {Management of space entities, e.g. partitions, extents, pools} - G06F 3/064: {Management of blocks} - G06F 3/0604: {Improving or facilitating administration, e.g. storage management} - G06F 3/0679: {Non-volatile semiconductor memory device, e.g. flash memory, one time programmable memory [OTP]} - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) ## Abstract Techniques are described for expanding and/or improving the Advanced Television Systems Committee (ATSC) 3.0 television protocol in robustly delivering the next generation broadcast television services. To improve robustness for datacast files to limited memory platforms, each file is divided into partitions and then the packets in a partition are arranged out of order (OOO), with the partitions then being sent in order with their respective packets OOO. ## Claims ### Claim 1 A method, comprising: dividing at least one file into plural partitions; within each partition, arranging packets of the partition out of order (OOO), the packets of the partition being arranged OOO relative to the packets being in order as defined by the at least one file; and sending the partitions in order with their respective packets OOO to at least one receiver, the partitions being in order as defined by the at least one file. ### Claim 2 (depends on 1) The method of claim 1, comprising: interleaving plural source blocks of the file with repair symbols, each partition comprising plural source blocks. ### Claim 3 (depends on 2) The method of claim 2, wherein the file comprises Z source blocks, wherein Z is greater than or equal to a ceiling of F/T divided by kmax, wherein kmax represents a number of symbols in each source block, T is a number of bytes in each symbol, F is a size of the file, and ceiling represents rounding up to the nearest integer. ### Claim 4 (depends on 3) The method of claim 3, wherein at least some partitions comprise Zl source blocks, wherein Zl equals the ceiling of Z divided by Pn, wherein Pn comprises a total number of partitions. ### Claim 5 (depends on 4) The method of claim 4, wherein at least one partition comprises Zs source blocks, wherein Zs equals a floor of Z divided by Pn, wherein floor represents rounding down to the nearest integer. ### Claim 6 (depends on 1) The method claim 1, wherein the method is implemented in an advanced television systems committee (ATSC) 3.0 system. ### Claim 7 A digital television apparatus, comprising: at least one receiver configured to receive digital television signals from a digital television transmitter system, the receiver comprising at least one processor programmed with instructions for: receiving, into non-persistent memory, at least some partitions of plural partitions of at least one file, each partition of the at least some partitions comprising packets out of order (OOO), the packets being OOO relative to the packets being in correct order as defined by the at least one file; ordering the packets from OOO into the correct order; sending at least one partition in non-persistent memory to persistent memory; and receiving into the non-persistent memory additional partitions. ### Claim 8 (depends on 7) The digital television apparatus of claim 7, wherein the digital television apparatus comprises an advanced television systems committee (ATSC) 3.0 receiver. ### Claim 9 (depends on 7) The digital television apparatus of claim 7, wherein plural source blocks of the file are interleaved with repair symbols, each partition of the at least some partitions comprising plural source blocks. ### Claim 10 (depends on 9) The digital television apparatus of claim 9, wherein the file comprises Z source blocks, wherein Z is greater than or equal to a ceiling of F/T divided by kmax, wherein kmax represents a number of symbols in each source block, T is a number of bytes in each symbol, and F is a size of the file. ### Claim 11 (depends on 10) The digital television apparatus of claim 10, wherein at least some partitions comprise Zl source blocks, wherein Zl equals the ceiling of Z divided by Pn, wherein Pn comprises a total number of partitions. ### Claim 12 (depends on 11) The digital television apparatus of claim 11, wherein at least one partition comprises Zs source blocks, wherein Zs equals a floor of Z divided by Pn. ### Claim 13 (depends on 7) The digital television apparatus of claim 7, wherein the instructions are executable for: correcting errors in one or more of the packets while the packets are in non-persistent memory. ### Claim 14 (depends on 7) The digital television apparatus of claim 7, wherein the instructions are executable for: correcting errors in one or more of the packets while the packets are in persistent memory. ### Claim 15 (depends on 7) The digital television apparatus of claim 7, wherein the instructions are executable for displaying the file. ### Claim 16 A digital television apparatus, comprising: at least one transmitter comprising at least one processor programmed with instructions to configure the processor for: dividing at least one file into plural partitions; within each partition, arranging packets of the partition out of order (OOO), the packets of the partition being arranged OOO relative to the packets being in order as defined by the at least one file; and sending the partitions in order with their respective packets OOO to at least one receiver, the partitions being in order as defined by the at least one file. ### Claim 17 (depends on 16) The digital television apparatus of claim 16, wherein the instructions are executable for: interleaving plural source blocks of the file with repair symbols, each partition comprising plural source blocks. ### Claim 18 (depends on 17) The digital television apparatus of claim 17, wherein the file comprises Z source blocks, wherein Z is greater than or equal to a ceiling of F/T divided by kmax, wherein kmax represents a number of symbols in each source block, T is a number of bytes in each symbol, and F is a size of the file. ### Claim 19 (depends on 18) The digital television apparatus of claim 18, wherein at least some partitions comprise Zl source blocks, wherein Zl equals the ceiling of Z divided by Pn, wherein Pn comprises a total number of partitions. ### Claim 20 (depends on 19) The digital television apparatus of claim 19, wherein at least one partition comprises Zs source blocks, wherein Zs equals a floor of Z divided by Pn.