EP4646792A1 - Procédé de signalisation d'exigences de mémoire dans atsc3.0 lorsque des données en désordre sont utilisées - Google Patents

Procédé de signalisation d'exigences de mémoire dans atsc3.0 lorsque des données en désordre sont utilisées

Info

Publication number
EP4646792A1
EP4646792A1 EP23844367.5A EP23844367A EP4646792A1 EP 4646792 A1 EP4646792 A1 EP 4646792A1 EP 23844367 A EP23844367 A EP 23844367A EP 4646792 A1 EP4646792 A1 EP 4646792A1
Authority
EP
European Patent Office
Prior art keywords
file
digital television
partition
partitions
receiver
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
EP23844367.5A
Other languages
German (de)
English (en)
Inventor
Graham Clift
Luke Fay
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Sony Group Corp
Original Assignee
Sony Group Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from US18/186,808 external-priority patent/US12223192B2/en
Application filed by Sony Group Corp filed Critical Sony Group Corp
Publication of EP4646792A1 publication Critical patent/EP4646792A1/fr
Pending legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/37—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
    • H03M13/3761—Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35 using code combining, i.e. using combining of codeword portions which may have been transmitted separately, e.g. Digital Fountain codes, Raptor codes or Luby Transform [LT] codes
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/27—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes using interleaving techniques
    • H03M13/2778—Interleaver using block-wise interleaving, e.g. the interleaving matrix is sub-divided into sub-matrices and the permutation is performed in blocks of sub-matrices
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/65—Purpose and implementation aspects
    • H03M13/6502—Reduction of hardware complexity or efficient processing
    • H03M13/6505—Memory efficient implementations
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/41—Structure of client; Structure of client peripherals
    • H04N21/426—Internal components of the client ; Characteristics thereof
    • H04N21/42692—Internal components of the client ; Characteristics thereof for reading from or writing on a volatile storage medium, e.g. Random Access Memory [RAM]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40—Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/43—Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network or synchronising decoder's clock; Client middleware
    • H04N21/438—Interfacing the downstream path of the transmission network originating from a server, e.g. retrieving encoded video stream packets from an IP network
    • H04N21/4382—Demodulation or channel decoding, e.g. QPSK demodulation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/60—Network structure or processes for video distribution between server and client or between remote clients; Control signalling between clients, server and network components; Transmission of management data between server and client, e.g. sending from server to client commands for recording incoming content stream; Communication details between server and client 
    • H04N21/61—Network physical structure; Signal processing
    • H04N21/6106—Network physical structure; Signal processing specially adapted to the downstream path of the transmission network
    • H04N21/6112—Network physical structure; Signal processing specially adapted to the downstream path of the transmission network involving terrestrial transmission, e.g. DVB-T
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/80—Generation or processing of content or additional data by content creator independently of the distribution process; Content per se
    • H04N21/83—Generation or processing of protective or descriptive data associated with content; Content structuring
    • H04N21/845—Structuring of content, e.g. decomposing content into time segments
    • H04N21/8456—Structuring of content, e.g. decomposing content into time segments by decomposing the content in the time domain, e.g. in time segments

Definitions

  • This application relates to technical advances necessarily rooted in computer technology and directed to digital television, and more particularly to Advanced Television Systems Committee (ATSC) 3.0.
  • ATSC Advanced Television Systems Committee
  • ATSC 3.0 The Advanced Television Systems Committee (ATSC) 3.0 suite of standards is a set of over a dozen industry technical standards as indicated in A/300 for delivering the next generation of broadcast television.
  • ATSC 3.0 supports delivery of a wide range of television services including televised video, interactive services, non-real time delivery of data, and tailored advertising to a large number of receiving devices, from ultra-high-definition televisions to wireless telephones.
  • ATSC 3.0 also orchestrates coordination between broadcast content (referred to as “over the air”) and related broadband delivered content and services (referred to as “over the top”).
  • ATSC 3.0 is designed to be flexible so that as technology evolves, advances can be readily incorporated without requiring a complete overhaul of any related technical standard.
  • ATSC 3.0 can be used to deliver data to mobile receivers, such as delivering maps or operating manuals to moving vehicles.
  • mobile receivers such as delivering maps or operating manuals to moving vehicles.
  • file delivery as further understood herein, any packet loss results in corruption.
  • Present principles introduce error correction techniques to improve data reception for all files including video media.
  • A-FEC application layer forward error correction
  • RFC 6330 Reliable and Low Latency Communication
  • present principles recognize the advantage of first breaking up a data file into partitions and then for each partition randomly order the packets OOO.
  • partitioning of 000 packet delivery knowing that a contiguous block (partition) of the data is being delivered 000 at any one time reduces the non-persistent memory requirements.
  • the memory requirement should still be sufficient to contain two partitions, one for current data being received and the second to concurrently move previously received data to persistent memory to free up memory for the next partition.
  • repair of data in the non-persistent memory requires two partitions plus repair data (e.g., 2 x percent repair). In the case of 10% repair, the memory requirement becomes 2.two times the size of the partition. In the case that the receiver generates intermediate symbols for repair as source symbols are received then this memory requirement becomes four times the partition.
  • a receiver will also retain the partial data for a partition that was incomplete due to reception beginning in the middle of the partition.
  • This example places the non-persistent memory requirement at three partitions plus repair data, or six times if intermediate symbols are being generated, so that on a second file carousel the first received partition can be filled in with the missing data.
  • the total RAM memory could be far smaller than the size that would be needed to store the entire file sent with packets 000.
  • the time needed by the receiver to move data from non-persistent memory to persistent memory and, if needed to repair the data can be estimated based on the bit rate and partition size.
  • a method in digital television, includes dividing at least one file into plural partitions. The method includes, within each partition, arranging packets of the partition out of order (OOO), and sending the resulting partitions in order with their respective packets 000 to at least one receiver.
  • OOO partition out of order
  • the method can include interleaving plural source blocks of the file with repair symbols, with each partition including plural source blocks.
  • the file has Z source blocks, wherein Z is greater than or equal to an integer ceiling of F/T divided by kmax, wherein kmax represents the number of symbols in each source block, T is the number of bytes in each symbol, and F is the size of the file.
  • At least some partitions include Z1 source blocks, wherein Z1 equals the ceiling of Z divided by P n , wherein P n is the total number of partitions.
  • at least one partition can include Z s source blocks, wherein Z s equals a floor of Z divided by P n . Ceiling means round up to the nearest integer and floor means round down to the nearest integer.
  • a digital television apparatus in another aspect, includes at least one receiver configured to receive digital television from a digital television transmitter system.
  • the receiver in turn includes at least one processor programmed with instructions for receiving into non-persistent memory at least some of plural partitions of at least one file, each partition comprising packets out of order (000).
  • the instructions are executable for ordering the packets into correct order, sending at least one partition in non-persistent memory to persistent memory, and receiving into the non-persistent memory additional partitions.
  • a digital television apparatus includes at least one transmitter that in turn includes at least one processor programmed with instructions to configure the processor for dividing at least one file into plural partitions, and within each partition, arranging packets of the partition out of order (OOO).
  • the instructions are executable for sending the partitions in order with their respective packets 000 to at least one receiver.
  • FIG 1 illustrates an Advanced Television Systems Committee (ATSC) 3.0 system
  • FIG. 1 illustrates components of the devices shown in Figure 1;
  • Figure 3 illustrates an example transmitter side architecture
  • Figure 4 illustrates an example receiver side architecture
  • Figure 5 illustrates schematic partitions sent in order, with their internal packets arranged out of order (000);
  • Figure 6 illustrates example transmitter logic in example flow chart format
  • Figure 7 illustrates example receiver logic in example flow chart format
  • Figure 8 illustrates source blocks of a file
  • Figure 9 illustrates partitions containing source blocks of Figure 8.
  • Figure 10 illustrates 000 delivery with repair data and partitioning.
  • An example system herein may include ATSC 3.0 source components and client components, connected via broadcast and/or over a network such that data may be exchanged between the client and ATSC 3.0 source components.
  • the client components may include one or more computing devices including portable televisions (e.g. smart TVs, Internet-enabled TVs), portable computers such as laptops and tablet computers, and other mobile devices including smart phones and additional examples discussed below.
  • portable televisions e.g. smart TVs, Internet-enabled TVs
  • portable computers e.g. smart TVs, Internet-enabled TVs
  • portable computers such as laptops and tablet computers
  • other mobile devices including smart phones and additional examples discussed below.
  • These client devices may operate with a variety of operating environments.
  • some of the client computers may employ, as examples, operating systems from Microsoft, or a Unix operating system, or operating systems produced by Apple Computer or Google, such as Android®.
  • These operating environments may be used to execute one or more browsing programs, such as a browser made by Microsoft or Google or Mozilla or other browser
  • ATSC 3.0 publication A/331, Annex A, incorporated herein by reference, may be particularly relevant to techniques described herein.
  • ATSC 3.0 source components may include broadcast transmission components and servers and/or gateways that may include one or more processors executing instructions that configure the source components to broadcast data and/or to transmit data over a network such as the Internet.
  • a client component and/or a local ATSC 3.0 source component may be instantiated by a game console such as a Sony PlayStation®, a personal computer, etc.
  • servers and/or clients can include firewalls, load balancers, temporary storages, and proxies, and other network infrastructure for reliability and security.
  • instructions refer to computer-implemented steps for processing information in the system. Instructions can be implemented in software, firmware or hardware and include any type of programmed step undertaken by components of the system.
  • a processor may be a single- or multi-chip processor that can execute logic by means of various lines such as address lines, data lines, and control lines and registers and shift registers.
  • Software modules described by way of the flow charts and user interfaces herein can include various sub-routines, procedures, etc. Without limiting the disclosure, logic stated to be executed by a particular module can be redistributed to other software modules and/or combined together in a single module and/or made available in a shareable library. While flow chart format may be used, it is to be understood that software may be implemented as a state machine or other logical method.
  • logical blocks, modules, and circuits can be implemented or performed with a general-purpose processor, a digital signal processor (DSP), a field programmable gate array (FPGA) or other programmable logic device such as an application specific integrated circuit (ASIC), discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein.
  • DSP digital signal processor
  • FPGA field programmable gate array
  • ASIC application specific integrated circuit
  • a processor can be implemented by a controller or state machine or a combination of computing devices.
  • HTTP hypertext markup language
  • ROM read-only memory
  • EEPROM electrically erasable programmable read-only memory
  • CD- ROM compact disk read-only memory
  • DVD digital versatile disc
  • a connection may establish a computer-readable medium.
  • Such connections can include, as examples, hard-wired cables including fiber optics and coaxial wires and digital subscriber line (DSL) and twisted pair wires.
  • An [element] having at least one of A, B, and C includes A alone, B alone, C alone, A and B together, A and C together, B and C together, and/or A, B, and C together, etc.
  • an example of an ATSC 3.0 source component is labeled “broadcaster equipment” 10 and may include over-the-air (OTA) equipment 12 for wirelessly broadcasting, typically via orthogonal frequency division multiplexing (OFDM) in a one-to-many relationship, television data to plural receivers 14 such as ATSC 3.0 televisions.
  • a receiver 14 may have both non-persistent memory 14A such as certain types of solid state RAM and persistent memory 14B such as flash.
  • One or more receivers 14 may communicate with one or more companion devices 16 such as remote controls, tablet computers, mobile telephones, and the like over a short range, typically wireless link 18 that may be implemented by Bluetooth®, low energy Bluetooth, other near field communication (NFC) protocol, infrared (IR), etc.
  • one or more of the receivers 14 may communicate, via a wired and/or wireless network link 20 such as the Internet, with over-the-top (OTT) equipment 22 of the broadcaster equipment 10 typically in a one-to-one relationship.
  • the OTA equipment 12 may be co-located with the OTT equipment 22 or the two sides 12, 22 of the broadcaster equipment 10 may be remote from each other and may communicate with each other through appropriate means.
  • a receiver 14 may receive ATSC 3.0 television signals OTA over a tuned-to ATSC 3.0 television channel and may also receive related content, including television, OTT (broadband).
  • computerized devices described in all of the figures herein may include some or all of the components set forth for various devices in Figures 1 and 2.
  • Figure 2 illustrates an example protocol stack that may be implemented by a combination of hardware and software.
  • broadcasters can send hybrid service delivery in which one or more program elements are delivered via a computer network (referred to herein as “broadband” and “over-the-top” (OTT)) as well as via a wireless broadcast (referred to herein as “broadcast” and “over-the-air” (OTA)).
  • Figure 2 also illustrates an example stack with hardware that may be embodied by a receiver.
  • the application layer 204 can include one or more software applications written in, e.g., HTML5/Javascript running in a runtime environment.
  • the applications in the application stack 204 may include linear TV applications, interactive service applications, companion screen applications, personalization applications, emergency alert applications, and usage reporting applications.
  • the applications typically are embodied in software that represents the elements that the viewer experiences, including video coding, audio coding and the run-time environment.
  • an application may be provided that enables a user to control dialog, use alternate audio tracks, control audio parameters such as normalization and dynamic range, and so on.
  • the presentation layer 206 includes, on the broadcast (OTA) side, broadcast audio-video playback devices referred to as Media Processing Units (MPU) 208 that, when implemented in a receiver, decode and playback, on one or more displays and speakers, wirelessly broadcast audio video content.
  • the MPU 208 is configured to present International Organization for Standardization (ISO) base media file format (BMFF) data representations 210 and video in high efficiency video coding (HEVC) with audio in, e.g., Dolby audio compression (AC-4) format.
  • ISO BMFF is a general file structure for timebased media files broken into “segments” and presentation metadata. Each of the files is essentially a collection of nested objects each with a type and a length.
  • the MPU 208 may access a broadcast side encrypted media extension (EME)/common encryption (CENC) module 212.
  • EME broadcast side encrypted media extension
  • CENC common encryption
  • Figure 2 further illustrates that on the broadcast side the presentation layer 206 may include signaling modules, including either motion pictures expert group (MPEG) media transport protocol (MMTP) signaling module 214 or real-time object delivery over unidirectional transport (ROUTE) signaling module 216 for delivering non-real time (NRT) content 218 that is accessible to the application layer 204.
  • NRT content may include but is not limited to stored replacement advertisements.
  • the presentation layer 206 can include one or more dynamic adaptive streaming over hypertext transfer protocol (HTTP) (DASH) player/decoders 220 for decoding and playing audio-video content from the Internet.
  • DASH dynamic adaptive streaming over hypertext transfer protocol
  • the DASH player 220 may access a broadband side EME/CENC module 222.
  • the DASH content may be provided as DASH segments 224 in ISO/BMFF format.
  • the broadband side of the presentation layer 206 may include NRT content in files 226 and may also include signaling objects 228 for providing play back signaling.
  • the session layer 230 includes, on the broadcast side, either MMTP protocol 232 or ROUTE protocol 234. Note that the ATSC standard provides an option to use MPEG MMT for transport, though it is not shown here.
  • the session layer 230 includes HTTP protocol 236 which may be implemented as HTTP-secure (HTTP(S)).
  • HTTP HTTP-secure
  • the broadcast side of the session layer 230 also may employ a HTTP proxy module 238 and a service list table (SLT) 240.
  • SLT 240 includes a table of signaling information which is used to build a basic service listing and provide bootstrap discovery of the broadcast content.
  • Media presentation descriptions (MPD) are included in the “ROUTE Signaling” tables delivered over user datagram protocol (UDP) by the ROUTE transport protocol.
  • a transport layer 242 is below the session layer 230 in the protocol stack for establishing low-latency and loss-tolerating connections.
  • the transport layer 242 uses (UDP 244 and on the broadband side transmission control protocol (TCP) 246.
  • the example non-limiting protocol stack shown in Figure 2 also includes a network layer 248 below the transport layer 242.
  • the network layer 248 uses Internet protocol (IP) on both sides for IP packet communication, with multicast delivery being typical on the broadcast side and unicast being typical on the broadband side.
  • IP Internet protocol
  • the physical layer 250 which includes broadcast transmission/receive equipment 252 and computer network interface(s) 254 for communicating on the respective physical media associated with the two sides.
  • the physical layer 250 converts Internet Protocol (IP) packets to be suitable to be transported over the relevant medium and may add forward error correction functionality to enable error correction at the receiver as well as contain modulation and demodulation modules to incorporate modulation and demodulation functionalities. This converts bits into symbols for long distance transmission as well as to increase bandwidth efficiency.
  • IP Internet Protocol
  • the physical layer 250 typically includes a wireless broadcast transmitter to broadcast data wirelessly using orthogonal frequency division multiplexing (OFDM) while on the OTT side the physical layer 250 includes computer transmission components to send data over the Internet.
  • OFDM orthogonal frequency division multiplexing
  • DASH-IF DASH Industry Forum
  • HTTP/TCP/IP DASH Industry Forum
  • Media files in the DASH- IF profile based on the ISO BMFF may be used as the delivery, media encapsulation and synchronization format for both broadcast and broadband delivery.
  • Each receiver 14 typically includes a protocol stack that is complementary to that of the broadcaster equipment.
  • a receiver 14 in Figure 1 may include, as shown in Figure 2, an Internet-enabled TV with an ATSC 3.0 TV tuner (equivalently, set top box controlling a TV) 256.
  • the receiver 14 may be an Android®-based system.
  • the receiver 14 alternatively may be implemented by a computerized Internet enabled (“smart”) telephone, a tablet computer, a notebook computer, a wearable computerized device, and so on. Regardless, it is to be understood that the receiver 14 and/or other computers described herein is configured to undertake present principles (e.g. communicate with other devices to undertake present principles, execute the logic described herein, and perform any other functions and/or operations described herein).
  • the receiver 14 can be established by some or all of the components shown in Figure 1.
  • the receiver 14 can include one or more displays 258 that may be implemented by a high definition or ultra-high definition “4K” or higher flat screen and that may or may not be touch-enabled for receiving user input signals via touches on the display.
  • the receiver 14 may also include one or more speakers 260 for outputting audio in accordance with present principles, and at least one additional input device 262 such as, e.g., an audio receiver/microphone for, e.g., entering audible commands to the receiver 14 to control the receiver 14.
  • the example receiver 14 may further include one or more network interfaces 264 for communication over at least one network such as the Internet, a WAN, a LAN, a PAN etc. under control of one or more processors 266.
  • the interface 264 may be, without limitation, a WiFi transceiver, which is an example of a wireless computer network interface, such as but not limited to a mesh network transceiver.
  • the interface 264 may be, without limitation, a Bluetooth® transceiver, Zigbee® transceiver, Infrared Data Association (IrDA) transceiver, Wireless USB transceiver, wired USB, wired LAN, Powerline or Multimedia over Coax Alliance (MoCA).
  • IrDA Infrared Data Association
  • the processor 266 controls the receiver 14 to undertake present principles, including the other elements of the receiver 14 described herein such as, for instance, controlling the display 258 to present images thereon and receiving input therefrom.
  • the network interface 264 may be, e.g., a wired or wireless modem or router, or other appropriate interface such as, e.g., a wireless telephony transceiver, or Wi-Fi transceiver as mentioned above, etc.
  • the receiver 14 may also include one or more input ports 268 such as a high definition multimedia interface (HDMI) port or a USB port to physically connect (using a wired connection) to another CE device and/or a headphone port to connect headphones to the receiver 14 for presentation of audio from the receiver 14 to a user through the headphones.
  • the input port 268 may be connected via wire or wirelessly to a cable or satellite source of audio video content.
  • the source may be a separate or integrated set top box, or a satellite receiver.
  • the source may be a game console or disk player.
  • the receiver 14 may further include one or more computer memories 270 such as diskbased or solid-state storage that are not transitory signals, in some cases embodied in the chassis of the receiver as standalone devices or as a personal video recording device (PVR) or video disk player either internal or external to the chassis of the receiver for playing back audio video (AV) programs or as removable memory media.
  • the receiver 14 can include a position or location receiver 272 such as but not limited to a cellphone receiver, global positioning satellite (GPS) receiver, and/or altimeter that is configured to e.g. receive geographic position information from at least one satellite or cellphone tower and provide the information to the processor 266 and/or determine an altitude at which the receiver 14 is disposed in conjunction with the processor 266.
  • GPS global positioning satellite
  • altimeter that is configured to e.g. receive geographic position information from at least one satellite or cellphone tower and provide the information to the processor 266 and/or determine an altitude at which the receiver 14 is disposed in conjunction with the processor 266.
  • another suitable position receiver other than a
  • the receiver 14 may include one or more cameras 274 that may include one or more of a thermal imaging camera, a digital camera such as a webcam, and/or a camera integrated into the receiver 14 and controllable by the processor 266 to gather pictures/images and/or video in accordance with present principles.
  • a Bluetooth® transceiver 276 or other Near Field Communication (NFC) element for communication with other devices using Bluetooth® and/or NFC technology, respectively.
  • NFC element can be a radio frequency identification (RFID) element.
  • the receiver 14 may include one or more auxiliary sensors 278 (such as a motion sensor such as an accelerometer, gyroscope, cyclometer, or a magnetic sensor and combinations thereof), an infrared (IR) sensor for receiving IR commands from a remote control, an optical sensor, a speed and/or cadence sensor, a gesture sensor (for sensing gesture commands) and so on providing input to the processor 266.
  • auxiliary sensors 278 such as a motion sensor such as an accelerometer, gyroscope, cyclometer, or a magnetic sensor and combinations thereof
  • IR infrared
  • An IR sensor 280 may be provided to receive commands from a wireless remote control.
  • a battery (not shown) may be provided for powering the receiver 14.
  • the companion device 16 may incorporate some or all of the elements shown in relation to the receiver 14 described above.
  • the methods described herein may be implemented as software instructions executed by a processor, suitably configured application specific integrated circuits (ASIC) or field programmable gate array (FPGA) modules, or any other convenient manner as would be appreciated by those skilled in those art.
  • ASIC application specific integrated circuits
  • FPGA field programmable gate array
  • the software instructions may be embodied in a non-transitory device such as a CD ROM or Flash drive.
  • the software code instructions may alternatively be embodied in a transitory arrangement such as a radio or optical signal, or via a download over the Internet.
  • a ROUTE session 300 is established at an ATSC 3.0 transmitter that delivers layered coding transport (LCT) packets 302.
  • These packets may carry source objects or FEC repair data.
  • a source protocol consists of one or more LCT channels, each carrying delivery objects and, optionally, object metadata 304.
  • the metadata may be statically delivered in signaling metadata or may be dynamically delivered, either as a compound object in the entity mode or as LCT extension headers in packet headers.
  • the packets are carried in ROUTE using a specific FEC scheme 306 that permits flexible fragmentation of the object at arbitrary byte boundaries.
  • delivery objects may be FEC protected, either individually or in bundles 308.
  • the bundled object is encoded and the repair symbols are delivered via a ROUTE session over UDP/IP 310.
  • the received repair symbols permit the recovery of delivery object bundles.
  • one or more repair flows may be generated, each with different characteristics, for example to support different latency requirements, different protection requirements, etc.
  • FIG. 4 illustrates the basic receiver operation.
  • a receiver 400 such as any appropriately configured receiver herein receives packets 402 and filters those packets accordingly. From the ROUTE session and each contained LCT channel, the receiver regenerates delivery objects 404 from the ROUTE session and each contained LCT channel. The delivery objects are in turn passed to the appropriate handler 406 for further data processing for use by an application or a media player 408.
  • a file has been divided into plural partitions 500.
  • the first partition Pl represents a first sequence of data in the file
  • the second partition P2 represents the next succeeding sequence of data in the file, and so on, so that the partitions Pi,... ,P n are arranged for transmission in order as defined by the file.
  • the data packets 502 within each partition 500 are not in order, but rather are arranged out-of-order (OOO), e.g., by random distribution of packets within a partition.
  • OOO out-of-order
  • packet #8 in the first partition Pi is first, then packet #2, followed by packet #20, followed by packet #3, and so on until all packets within the first partition Pi have been arranged OOO.
  • Figure 6 illustrates transmitter logic consistent with Figure 5.
  • state 600 the number and/or size of partitions to a requested file to be transmitted for instance OTA using ATSC 3.0 techniques is determined.
  • state 602 the file is divided into the into plural partitions.
  • the data packets of the partition are arranged (or re-ordered) to be out of order (OOO).
  • the packets are randomly ordered within the partition to which they belong.
  • the partitions are transmitted to one or more receivers in correct partition order but with their respective packets OOO.
  • Figure 7 illustrates receiver side logic.
  • the receiver receives the transmitted file first partition first, which is stored in non-persistent memory.
  • the packets in the received partition may be re-ordered into correct order using packet information in the ATSC 3.0 signaling. Note that re-ordering may occur later, after the partition has been transferred to persistent memory.
  • State 704 indicates that the next succeeding partition is received into non-persistent memory. That is, plural partitions may be resident in non-persistent memory at once, although typically not all partitions will reside in non-persistent memory at the same time because as discussed below partitions are offloaded into persistent memory as the file is being received.
  • States 706 indicate that if desired, errors in packets can be corrected, in the example shown while the partitions still reside in non-persistent memory, although it is to be understood that error correction may occur after the partition has been offloaded to persistent memory at state 708 (for the first partition) and 712 (for the second partition).
  • One or more subsequent partitions of the file are then received into non-persistent memory at state 710 and the process continues this loop 714 of receiving partitions of the file in non-persistent memory, offloading them to persistent memory, and continuing to receive successive partitions into non-persistent memory.
  • Some or all of the file may be displayed or provided for use to another application.
  • each partition 800 of the file is interleaved with repair symbols 801. As will be discussed shortly, each partition includes plural source blocks.
  • the file includes Z source blocks.
  • Z is greater than or equal to a ceiling of F/T divided by kmax, wherein kmax (indicated at 806 in Figure 8) represents a number of symbols in each source block, T (indicated at 804 in Figure 8) is a number of bytes in each symbol, and F (indicated at 802 in Figure 8) is a size of the file.
  • kmax indicated at 806 in Figure 8
  • T 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.
  • between five and twenty five percent of the number of symbols in a source block may be repair symbols.
  • ten percent of the number of symbols in a source block may be repair symbols.
  • Figure 9 picks up additional disclosure.
  • at least some partitions 900 include Zi source blocks (indicated at 902 in Figure 9), wherein Zi equals the ceiling of Z divided by P n (indicated at 904 in Figure 9), wherein P n is the total number of partitions in the file.
  • at least one partition includes Z s source blocks, wherein Z s equals a floor of Z divided by P n .
  • some partitions will have different numbers of source blocks than other partitions.
  • the top bar represents data symbols 1000 of source blocks interleaved with repair symbols 1002.
  • Both non-persistent memory 1004 and persistent memory 1006 are represented in figure 10.
  • incomplete data may be saved 1010 to FLASH (persistent memory example), along with repair 1012 and/or a record of the gaps in the data.
  • This incomplete data can be retrieved next time around the carousel when the partition appears. This maximizes the chance that the partition will complete. In this instance, this incomplete partition can be removed from non-persistent memory.
  • ATSC 3.0 signaling such as in an extension to a file deliver table (FDT) instance may include the following element to support present techniques.
  • the signaling enables a receiver to assess if it has the memory capability in RAM to receive a large file that is delivered OOO, but that is also partitioned. Additional signaling to indicate the percentage of repair data is included also to complete this memory requirement assessment.

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Probability & Statistics with Applications (AREA)
  • Theoretical Computer Science (AREA)
  • Mathematical Physics (AREA)
  • Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)

Abstract

L'invention concerne des techniques destinées à étendre et/ou à améliorer le protocole de télévision 3.0 du comité des systèmes de télévision avancés (ATSC) en fournissant de façon robuste les services de radiodiffusion télévisuelle de nouvelle génération. Pour améliorer la robustesse des fichiers de diffusion de données pour des plateformes de mémoire limitées, chaque fichier est divisé en partitions, puis les paquets dans une partition sont agencés en désordre (OOO), les partitions étant ensuite envoyées dans l'ordre avec leurs paquets respectifs OOO.
EP23844367.5A 2023-02-22 2023-12-13 Procédé de signalisation d'exigences de mémoire dans atsc3.0 lorsque des données en désordre sont utilisées Pending EP4646792A1 (fr)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
US202363486286P 2023-02-22 2023-02-22
US18/186,808 US12223192B2 (en) 2023-02-22 2023-03-20 Method for signaling memory requirements in ATSC3.0 when out-of-order data is being utilized
PCT/IB2023/062568 WO2024175991A1 (fr) 2023-02-22 2023-12-13 Procédé de signalisation d'exigences de mémoire dans atsc3.0 lorsque des données en désordre sont utilisées

Publications (1)

Publication Number Publication Date
EP4646792A1 true EP4646792A1 (fr) 2025-11-12

Family

ID=89707802

Family Applications (1)

Application Number Title Priority Date Filing Date
EP23844367.5A Pending EP4646792A1 (fr) 2023-02-22 2023-12-13 Procédé de signalisation d'exigences de mémoire dans atsc3.0 lorsque des données en désordre sont utilisées

Country Status (4)

Country Link
EP (1) EP4646792A1 (fr)
JP (1) JP2026507645A (fr)
CN (1) CN120642216A (fr)
WO (1) WO2024175991A1 (fr)

Also Published As

Publication number Publication date
CN120642216A (zh) 2025-09-12
JP2026507645A (ja) 2026-03-04
WO2024175991A1 (fr) 2024-08-29

Similar Documents

Publication Publication Date Title
US20250126332A1 (en) Atsc boundary condition fall over to internet
US11729456B2 (en) Long duration error correction with fast channel change for ATSC 3.0 real-time broadcast mobile application
KR102935551B1 (ko) Atsc 3.0 tv에서의 대체 콘텐츠 시그널링에 대한 기술들
US11606528B2 (en) Advanced television systems committee (ATSC) 3.0 latency-free display of content attribute
US12223192B2 (en) Method for signaling memory requirements in ATSC3.0 when out-of-order data is being utilized
EP4646792A1 (fr) Procédé de signalisation d'exigences de mémoire dans atsc3.0 lorsque des données en désordre sont utilisées
US11451854B2 (en) Dongle to convert formats to ATSC 3.0 low power wireless
US11153640B2 (en) Memory management of replacement content in digital TV system
US20240283464A1 (en) Robustness when using application layer forward error correction (al-fec) in an atsc3 receiver
JP7732576B2 (ja) ストリーム修復メモリ管理
US20260101086A1 (en) Hls-based atsc 3.0 playback using mmtp data
EP4646808A1 (fr) Amélioration de la robustesse lors de l'utilisation d'une correction d'erreur directe de couche d'application (al-fec) dans un récepteur atsc3
US11792473B2 (en) Stream repair memory management
US11553230B2 (en) Platform-independent USB driver communicating I2C commands to USB dongle through JAVA application
US12532050B1 (en) ATSC 3.0 playback of encrypted MMT media through construction of dash file
US11159831B2 (en) Non-real time (NRT) memory management in advanced television systems committee (ATSC) 3.0 system
US11812083B2 (en) Techniques for pushing personalized storefront ads using digital TV
CN116830587A (zh) 流修复存储器管理
US20210250573A1 (en) Digital television rendering verification
WO2021116839A1 (fr) Affichage sans latence à la norme atsc (advanced television systems committee) 3.0 d'attribut de contenu

Legal Events

Date Code Title Description
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: UNKNOWN

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE

PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE

17P Request for examination filed

Effective date: 20250805

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC ME MK MT NL NO PL PT RO RS SE SI SK SM TR