EP3451332B1 - Annulation du repliement de domaine temporel fourni par décodeur lors de transitions sans perte ou avec perte - Google Patents

Annulation du repliement de domaine temporel fourni par décodeur lors de transitions sans perte ou avec perte Download PDF

Info

Publication number
EP3451332B1
EP3451332B1 EP18191910.1A EP18191910A EP3451332B1 EP 3451332 B1 EP3451332 B1 EP 3451332B1 EP 18191910 A EP18191910 A EP 18191910A EP 3451332 B1 EP3451332 B1 EP 3451332B1
Authority
EP
European Patent Office
Prior art keywords
lossy
lossless
decoder
aliasing cancellation
cancellation component
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.)
Active
Application number
EP18191910.1A
Other languages
German (de)
English (en)
Other versions
EP3451332A1 (fr
Inventor
Arijit Biswas
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.)
Dolby International AB
Original Assignee
Dolby International AB
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
Application filed by Dolby International AB filed Critical Dolby International AB
Publication of EP3451332A1 publication Critical patent/EP3451332A1/fr
Application granted granted Critical
Publication of EP3451332B1 publication Critical patent/EP3451332B1/fr
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G10—MUSICAL INSTRUMENTS; ACOUSTICS
    • G10L—SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING
    • G10L19/00—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis
    • G10L19/0017—Lossless audio signal coding; Perfect reconstruction of coded audio signal by transmission of coding error
    • G—PHYSICS
    • G10—MUSICAL INSTRUMENTS; ACOUSTICS
    • G10L—SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING
    • G10L19/00—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis
    • G10L19/04—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis using predictive techniques
    • G10L19/16—Vocoder architecture
    • G10L19/18—Vocoders using multiple modes
    • G10L19/24—Variable rate codecs, e.g. for generating different qualities using a scalable representation such as hierarchical encoding or layered encoding
    • G—PHYSICS
    • G10—MUSICAL INSTRUMENTS; ACOUSTICS
    • G10L—SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING
    • G10L19/00—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis
    • G10L19/02—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis using spectral analysis, e.g. transform vocoders or subband vocoders
    • G10L19/0212—Speech or audio signals analysis-synthesis techniques for redundancy reduction, e.g. in vocoders; Coding or decoding of speech or audio signals, using source filter models or psychoacoustic analysis using spectral analysis, e.g. transform vocoders or subband vocoders using orthogonal transformation

Definitions

  • Embodiments herein relate generally to audio signal processing, and more specifically to switching between lossy coded time segments and a lossless stream of the same source audio.
  • a method, a computer program product and a decoder according to the invention are proposed in independent claims 1, 8 and 10, respectively.
  • Systems and methods are described for switching between lossy coded time segments and a lossless stream of the same source audio.
  • a decoder may receive a stream of lossy coded time segments that includes audio encoded using a frequency-domain lossy coding method over a network.
  • the decoder may also receive, over the network, a lossless stream that includes the audio encoded using a lossless coding method.
  • the decoder may provide audio playback of the lossless stream.
  • the lossy coded time segments and the lossless stream may be encoded from the same source audio, may also be time-aligned, and may have a same sampling rate.
  • the decoder may generate an aliasing cancellation component based on a previously-decoded frame of the lossless stream.
  • the generated aliasing cancellation component may be added to a lossy time segment at a transition frame.
  • the sum of the aliasing cancellation component and the lossy time segment may be normalized using a weight caused by an encoding window applied to the transition frame, thereby providing aliasing cancellation on the transition frame. Audio playback of the lossy time segment may then be provided by the decoder, beginning with the aliasing-canceled transition frame.
  • the aliasing cancellation component may be generated based on reconstructing an adjacent frame of the previously-decoded frames of the lossless stream as a sum of a lossy component and an aliasing cancellation component for the adjacent frame.
  • the aliasing cancellation component for the adjacent frame may then be extrapolated to generate the aliasing cancellation component for the transition frame.
  • TDAC Time Domain Aliasing Cancelation
  • the proposed solution does not require additional bits to be sent from the encoder side (as metadata) because adjacent decoded lossless samples (past frames, in the case of lossless to lossy switching, and future frames, in the case of lossy to lossless switching) are utilized to generate aliasing cancelation terms by the decoder.
  • AC-4 lossless mode is used for music delivery over a network protocol, such as an Internet protocol
  • acute network bandwidth constraints may require transition to and from a fallback lossy AC-4 sub-stream.
  • fallback to ASF mode can be sufficient to preserve high-quality playback. Therefore, transitions to and from a frequency-domain lossy modified discrete cosine transform ("MDCT") -coded time segment, which may use overlapping windows, and a time segment coded by the lossless coder, which may use rectangular non-overlapping windows, should be handled efficiently.
  • MDCT frequency-domain lossy modified discrete cosine transform
  • a lossy MDCT frame relies on TDAC of adjacent windows (which is why overlapping windows are commonly used).
  • the MDCT removes the aliasing part of the current frame by combining with the signal decoded in the following frame. Therefore, if the encoding mode of the next frame is lossless coding, the aliasing term of the frame coded with lossy coding is not canceled, since the frame coded with the lossless codec does not have the corresponding time domain alias cancelation components to cancel out the time domain aliasing of the previous lossy frame.
  • the aliasing cancellation components for the lossy MDCT encoding are generally forwarded to the decoder by the encoder. This side information will not be available, if it is not sent by the encoder in advance. Furthermore, forwarding aliasing cancellation components is not an option for responding to bandwidth constraints, because the decoder performing the switching does not know a priori the transition points between encoding methods.
  • FIGS. 1A-B show exemplary signal segments where forwarding aliasing cancelation is used to switch between a lossless stream and lossy coded time segments by an encoder, according to conventional forward aliasing cancelation.
  • the transition is made from lossless coded stream 115 to the lossy coded time segment 120 (in diagram 100), and vice-versa (in diagram 150) by the encoder, and necessary steps required to do the seamless switching for the overall encoder-decoder system are managed on the encoder side, prior to transmitting the streams to the decoder.
  • lossless-coded time segments 115 and 170 are rectangular-windowed segments.
  • the MDCT windowed lossy-coded time segments 120 and 165 are also shown.
  • the encoder determines and transmits a forwarding aliasing cancellation (FAC) signal 125 and 175 in the frames 105 and 110 and similarly in the frames 155 and 160 where the transition occurs.
  • the FAC signal 125 may include an aliasing cancellation component 129 and a symmetric windowed signal 127.
  • the FAC signal 125 may be forwarded to the decoder from the encoder, where the FAC signals 125 and 175 are added to the corresponding lossy time segments 120 and 165 at the frames 105 and 110 and 155 and 160 where the transition occurs.
  • the FAC signals 125 and 175 may be symmetric windowed signals to the lossy time segments 120 and 165.
  • unaliased signals 130 and 180 are generated at the frames 110 and 155, where the transitions respectively occur.
  • the last rows of diagrams 100 and 150 represent lossless signals in the same frame as the lossy time segment 140. Since the lossless signals (dummy signal 115 in frame X 0 105 in figure 100, and dummy signal 170 in frame X 3 160 in the figure 150) are available to the decoder for reconstruction, the FAC signals are not needed to cancel aliasing in the lossy time segments. Omitting transmission of the dummy signal by the encoder may reduce the need for side information transmission in encoder-side switching applications.
  • a decoded signal of adjacent frames may be used to generate the relevant aliasing cancelation signals.
  • Output audio signals may be reconstructed by adding a generated aliasing cancelation component to the decoded lossy time segment, and by normalizing the sum using a weight caused by the encoding window.
  • FIG. 2 shows a flow diagram for a method 200 of switching between a lossy coded time segment and a lossless stream of the same source audio, according to an embodiment.
  • a decoder may receive lossy coded time segments that include audio encoded using a frequency-domain lossy coding method over a network at step 205.
  • the decoder may also receive, over the network, a lossless stream that includes the audio encoded using a lossless coding method at step 210.
  • the lossless coding method may be a time domain coding method, as is commonly the case.
  • the decoder may also provide audio playback of the lossless stream.
  • the lossy and lossless streams may be transmitted in parallel over the network, so switching may be performed at any time desired by a user interacting with the decoder.
  • the lossy coded time segments and the lossless stream may be encoded from the same source audio and may also be time-aligned.
  • the lossy and lossless sub-streams (when streamed together) may share a same video frame rate and may have a same sampling rate.
  • FIG. 3 shows a simplified block diagram of a decoder 300 for switching between lossy coded time segments and a lossless stream of the same source audio, according to an embodiment.
  • Decoder 300 may include lossy decoder 315, which receives and decodes lossy coded time segments 305, and lossless decoder 320, which receives and decodes lossless stream 310.
  • Figure 3 also shows typical peripheral components of AC-4 lossless and lossy decoder. While a high-level summary of the components shown in FIG.
  • Lossy decoder 315 includes an MDCT spectral front end decoder, complex quadrature mirror filters (CQMF) 325, and an SRC.
  • the MDCT spectral front end decoder may use an MDCT domain signal buffer to predict each bin of the lossy coded time segments.
  • the CQMF 325 may include three modules as shown: modules for parametric decoders, object audio renderer and upmixer module, and dialogue and loudness management module.
  • the parametric decoders may include a plurality of coding tools, including one or more of companding, advanced spectral extension algorithms, advanced coupling, advanced joint object coding, and advanced joint channel coding.
  • the object audio renderer and upmixer module may perform spatial rendering of decoded audio based on metadata associated with the received lossy coded time segments.
  • the dialogue and loudness management module may allow users to adjust the relative level of voice and adjust loudness filtering and/or processing.
  • the SRC (sampling rate conversion) module may perform video frame synchronizing at a desired frame rate.
  • the exemplary lossless decoder 320 may include a core decoder, an SRC module (which operates substantially similarly to the SRC of the lossy decoder 315, though it may be likely that the SRC of the lossless decoder 320 operates in the time domain, rather than the frequency domain), a CQMF 330, and a second SRC module, applied after the CQMF 330 has been applied to the received lossless stream 310.
  • the core decoder may be any suitable lossless decoder.
  • the CQMF 330 may include an object audio renderer and upmixer module and a dialogue and loudness management module.
  • the sub-modules of CQMF 330 may function substantially similarly to the corresponding modules of CQMF 325, again with the caveat that objects CQMF 330 operates on may be encoded in the time domain, while the objects that CQMF 325 operate on may be in the frequency domain.
  • a first potential switching point may be achieved by running MDCT on the pulse-code modulation (PCM) output 340 of the lossless decoder 320, and splicing the MDCT output of the lossless decoder with the MDCT output of the lossy decoder 315. Switching after running MDCT on the output 340 of the lossless decoder 320 may advantageously provide built-in MDCT overlap/add to facilitate smooth transitions.
  • PCM pulse-code modulation
  • a second potential switching point may be at the PCM stage between MDCT and the CQMF 325 of the lossy decoder.
  • switching before the CQMF 325 may necessitate a smooth fading strategy, and in addition may suffer from the same problems as switching after running MDCT on the output 340 of the lossless decoder 320 described above.
  • a third potential switching point may take place at the indicated switch/crossfade block 350, before the peak-limiter 360 (which may be any suitable post-processing module) is applied to the output of the decoder 380. While switching at block 350 may also require a smooth fading strategy, there are several key benefits to switching at 350. Notably, since all content is rendered to the same number of output speakers, programs with different numbers/arrangements of objects may be switched, thereby avoiding a major drawback of the first two switching points described above.
  • the decoder may generate an aliasing cancellation component based on previously-decoded frames of the lossless stream at step 220.
  • FIG. 4A a diagram 400 which shows exemplary signal segments where minimized forwarding aliasing cancelation (AC) is used to switch between lossy coded time segments and a lossless stream, according to an embodiment.
  • AC forwarding aliasing cancelation
  • AC signal 425 may be derived, without side information from the encoder, by expressing the lossless segment 415 before transition frame X 1 410, during frame X 0 405, in terms of being a sum of an aliased signal and an aliasing cancellation component. To do so, time domain lossy aliased samples may be derived in terms of the original lossless data samples. Based on research published in Britanak, Vladimir, and Huibert J. Lincklaen Arri ⁇ ns.
  • equations (1) - (4) refer to lossy time segment signals in each of frames X 0 -X 3 , for example.
  • J in equations (1) - (4) may refer to an identity matrix that time reverses a signal vector.
  • the aliased lossy signal x ⁇ 1 for frame X 1 410 may be rewritten as -JX 0 + X 1
  • a MDCT window vector Wk may be introduced, causing the above equation to be rewritten as:
  • the ° indicates element-wise multiplication between the window vectors W 0 and W 1 by the lossless signal segment vectors X 0 and X 1 respectively.
  • the decoder may reconstruct a transition frame lossless signal during time segment X 1 410 as a sum of a lossy time segment component 420 and an aliasing cancellation component based on adjacent (previous, in the case of switching from lossless to lossy) lossless time segment 415.
  • the determined aliasing cancellation component from segment 415 may then be used to extrapolate the aliasing cancellation component for frame X 1 410.
  • the unused determined AC signal 440 can be discarded, because this particular time segment can be reconstructed by the lossless decoder.
  • the generated aliasing cancellation component 425 may be added to the lossy time segment 420 at a transition frame 410 at step 240.
  • the sum of the aliasing cancellation component and the lossy time segment may be normalized using a weight caused by the encoding window applied to the transition frame at step 250, thereby providing aliasing cancellation at the transition frame.
  • An exemplary unaliased signal 430 for frame X 1 may be expressed as shown below, in equation (6).
  • the aliasing cancellation component is the leftmost term, derived from equation (2) and the rightmost term is the lossy time segment component.
  • -JX 0 W 0 is the aliasing component in the time-domain aliased signal in Equation (5) for frame X 1 .
  • the leftmost term in Equation (6) generated based on the decoder previously decoding frame X 0 of the lossless stream 415, is added to the lossy time segment component for frame X 1 .
  • Equation (6) also illustrates the normalizing step 250, as the terms are multiplied by the inverse window function term W 1 -1 for transition frame X 1 410. Audio playback of the lossy coded time segment may then be provided by the decoder at step 260, beginning with the unaliased signal 430 at the transition frame.
  • FIG. 5 shows a flow diagram for a method 500 of switching back from lossy coded time segments to a lossless stream of the same source audio, according to an embodiment.
  • FIG. 4B a diagram 450 which shows exemplary signal segments where minimized forwarding aliasing cancelation is used to switch between a lossy coded time segment and a lossless stream, according to an embodiment.
  • the decoder may receive a lossy time segment 465 that includes audio encoded using a lossy coding method over a network at step 505.
  • the decoder may also provide audio playback of the lossy coded time segments.
  • the decoder may also receive, over the network, a lossless stream 470 that includes the audio encoded using a lossless coding method at step 510.
  • the decoder may switch the playback from the lossy coded time segments to the lossless stream.
  • the decoder may perform the switch automatically, after determining that network bandwidth exceeds a predetermined threshold for providing adequate performance for the lossless stream, or in response to a user-provided indication on an interface in communication with the decoder.
  • the decoder may generate an aliasing cancellation component 475 based on previously-decoded frames of the lossless stream at step 520.
  • the previously-decoded frame may be the subsequent frame (i.e., the first decoded frame of the lossless stream).
  • the aliased lossy time segment for frame X 2 455 may be rewritten, based on equation (3) as: X 2 + JX 3 .
  • the decoder may reconstruct transition frame X 2 455 as a sum of a lossy time segment component 465 and aliasing cancellation component for adjacent time segment X 3 460.
  • Using lossless signals from frames after the transition frame is possible due to the decoder receiving both the lossy and the lossless streams, and by buffering decoded time segments of the lossless stream.
  • the determined aliasing cancellation component for segment X 3 460 may then be used to extrapolate the aliasing cancellation component for frame X 2 455.
  • the generated aliasing cancellation component 475 may be added to the lossy time segment 465 at a transition frame 455 at step 540.
  • the sum of the aliasing cancellation component and the lossy time segment may be normalized using a weight caused by the encoding window applied to the transition frame at step 550, thereby providing aliasing cancellation at the transition frame.
  • An exemplary unaliased signal 480 for frame X 3 may be expressed as shown below, in equation (8).
  • the aliasing cancellation component is the rightmost term, derived from equation (3) and the leftmost term is the lossy time segment component.
  • JX 3 W 3 is the aliasing component in the time-domain aliased signal in Equation (7) for frame X 3 .
  • Equation (8) illustrates the normalizing step 550 as well, where the terms are multiplied by the inverse window function term W 2 -1 for transition frame X 2 455. Audio playback of the lossless stream may then be provided by the decoder, after the unaliased signal 480 at step 560.
  • FIG. 6 is a block diagram of an exemplary system for providing decoder-side switching between lossy coded time segments and a lossless stream of the same source audio as described above.
  • an exemplary system for implementing the subject matter disclosed herein, including the methods described above includes a hardware device 600, including a processing unit 602, memory 604, storage 606, data entry module 608, display adapter 610, communication interface 612, and a bus 614 that couples elements 604-612 to the processing unit 602.
  • the bus 614 may comprise any type of bus architecture. Examples include a memory bus, a peripheral bus, a local bus, etc.
  • the processing unit 602 is an instruction execution machine, apparatus, or device and may comprise a microprocessor, a digital signal processor, a graphics processing unit, an application specific integrated circuit (ASIC), a field programmable gate array (FPGA), etc.
  • the processing unit 602 may be configured to execute program instructions stored in memory 604 and/or storage 606 and/or received via data entry module 608.
  • the memory 604 may include read only memory (ROM) 616 and random access memory (RAM) 618.
  • Memory 604 may be configured to store program instructions and data during operation of device 600.
  • memory 604 may include any of a variety of memory technologies such as static random access memory (SRAM) or dynamic RAM (DRAM), including variants such as dual data rate synchronous DRAM (DDR SDRAM), error correcting code synchronous DRAM (ECC SDRAM), or RAMBUS DRAM (RDRAM), for example.
  • SRAM static random access memory
  • DRAM dynamic RAM
  • DRAM dynamic RAM
  • ECC SDRAM error correcting code synchronous DRAM
  • RDRAM RAMBUS DRAM
  • Memory 604 may also include nonvolatile memory technologies such as nonvolatile flash RAM (NVRAM) or ROM.
  • NVRAM nonvolatile flash RAM
  • NVRAM nonvolatile flash RAM
  • ROM basic input/output system
  • BIOS basic input/output system
  • the storage 606 may include a flash memory data storage device for reading from and writing to flash memory, a hard disk drive for reading from and writing to a hard disk, a magnetic disk drive for reading from or writing to a removable magnetic disk, and/or an optical disk drive for reading from or writing to a removable optical disk such as a CD ROM, DVD or other optical media.
  • the drives and their associated computer-readable media provide nonvolatile storage of computer readable instructions, data structures, program modules and other data for the hardware device 600.
  • the methods described herein can be embodied in executable instructions stored in a non-transitory computer readable medium for use by or in connection with an instruction execution machine, apparatus, or device, such as a computer-based or processor-containing machine, apparatus, or device. It will be appreciated by those skilled in the art that for some embodiments, other types of computer readable media may be used which can store data that is accessible by a computer, such as magnetic cassettes, flash memory cards, digital video disks, Bernoulli cartridges, RAM, ROM, and the like may also be used in the exemplary operating environment.
  • a "computer-readable medium” can include one or more of any suitable media for storing the executable instructions of a computer program in one or more of an electronic, magnetic, optical, and electromagnetic format, such that the instruction execution machine, system, apparatus, or device can read (or fetch) the instructions from the computer readable medium and execute the instructions for carrying out the described methods.
  • a non-exhaustive list of conventional exemplary computer readable medium includes: a portable computer diskette; a RAM; a ROM; an erasable programmable read only memory (EPROM or flash memory); optical storage devices, including a portable compact disc (CD), a portable digital video disc (DVD), a high definition DVD (HD-DVDTM), a BLU-RAY disc; and the like.
  • a number of program modules may be stored on the storage 606, ROM 616 or RAM 618, including an operating system 622, one or more applications programs 624, program data 626, and other program modules 628.
  • a user may enter commands and information into the hardware device 600 through data entry module 608.
  • Data entry module 608 may include mechanisms such as a keyboard, a touch screen, a pointing device, etc.
  • Other external input devices (not shown) are connected to the hardware device 600 via external data entry interface 630.
  • external input devices may include a microphone, joystick, game pad, satellite dish, scanner, or the like.
  • external input devices may include video or audio input devices such as a video camera, a still camera, etc.
  • Data entry module 608 may be configured to receive input from one or more users of device 600 and to deliver such input to processing unit 602 and/or memory 604 via bus 614.
  • the hardware device 600 may operate in a networked environment using logical connections to one or more remote nodes (not shown) via communication interface 612.
  • the remote node may be another computer, a server, a router, a peer device or other common network node, and typically includes many or all of the elements described above relative to the hardware device 600.
  • the communication interface 612 may interface with a wireless network and/or a wired network. Examples of wireless networks include, for example, a BLUETOOTH network, a wireless personal area network, a wireless 802.11 local area network (LAN), and/or wireless telephony network (e.g., a cellular, PCS, or GSM network).
  • wireless networks include, for example, a BLUETOOTH network, a wireless personal area network, a wireless 802.11 local area network (LAN), and/or wireless telephony network (e.g., a cellular, PCS, or GSM network).
  • wired networks include, for example, a LAN, a fiber optic network, a wired personal area network, a telephony network, and/or a wide area network (WAN).
  • WAN wide area network
  • communication interface 612 may include logic configured to support direct memory access (DMA) transfers between memory 604 and other devices.
  • DMA direct memory access
  • program modules depicted relative to the hardware device 600 may be stored in a remote storage device, such as, for example, on a server. It will be appreciated that other hardware and/or software to establish a communications link between the hardware device 600 and other devices may be used.
  • At least one component defined by the claims is implemented at least partially as an electronic hardware component, such as an instruction execution machine (e.g., a processor-based or processor-containing machine) and/or as specialized circuits or circuitry (e.g., discrete logic gates interconnected to perform a specialized function), such as those illustrated in FIG. 6 .
  • Other components may be implemented in software, hardware, or a combination of software and hardware. Moreover, some or all of these other components may be combined, some may be omitted altogether, and additional components can be added while still achieving the functionality described herein.
  • the subject matter described herein can be embodied in many different variations, and all such variations are contemplated to be within the scope of what is claimed.
  • the terms “component,” “module,” and “process,” may be used interchangeably to refer to a processing unit that performs a particular function and that may be implemented through computer program code (software), digital or analog circuitry, computer firmware, or any combination thereof.
  • a decoder may receive a stream of lossy coded time segments that includes audio encoded using a frequency-domain lossy coding method over a network.
  • the decoder may also receive, over the network, a lossless stream that includes the audio encoded using a lossless coding method.
  • the decoder may provide audio playback of the lossless stream.
  • the lossy coded time segments and the lossless stream may be encoded from the same source audio, may also be time-aligned, and may have a same sampling rate.
  • the decoder may generate an aliasing cancellation component based on a previously-decoded frame of the lossless stream.
  • the generated aliasing cancellation component may be added to a lossy time segment at a transition frame.
  • the sum of the aliasing cancellation component and the lossy time segment may be normalized using a weight caused by an encoding window applied to the transition frame, thereby providing aliasing cancellation on the transition frame. Audio playback of the lossy time segment may then be provided by the decoder, beginning with the aliasing-canceled transition frame.
  • the lossless coding method may use MDCT with overlapping windows, and the lossless coding method may use rectangular non-overlapping windows that are different from windows used by the lossy coding method.
  • the switching may be performed in various locations in the decoding process, including, in response to receiving the determination that network bandwidth is constrained, selecting the transition frame to be before a peak-limiter is applied to the lossless stream.
  • the aliasing cancellation component may be generated based on reconstructing an adjacent frame of the previously-decoded frames of the lossless stream as a sum of a lossy component and an aliasing cancellation component for the adjacent frame.
  • the aliasing cancellation component for the adjacent frame may then be extrapolated to generate the aliasing cancellation component for the transition frame.
  • the normalizing may include multiplying the sum of the aliasing cancellation component and the lossy time segment by an inverse window function vector determined for the transition frame.
  • the determination that network bandwidth is constrained may be received using several different methods. For example, the determination may be received from a user-provided indication on an interface in communication with the decoder (e.g., using a software application running on a computer). The determination may alternatively be automatically generated by software that monitors network bandwidth.
  • Computer program products comprising computer-readable program code to be executed by one or more processors when retrieved from a non-transitory computer-readable medium, are also described for switching between lossy coded time segments and a lossless stream of the same source audio.
  • the program code may include instructions to receive a stream of lossy coded time segments that includes audio encoded using a frequency-domain lossy coding method over a network.
  • the program code may also include instructions to receive, over the network, a lossless stream that includes the audio encoded using a lossless coding method.
  • the decoder may provide audio playback of the lossless stream.
  • the lossy coded time segments and the lossless stream may be encoded from the same source audio, may also be time-aligned, and may have a same sampling rate.
  • the decoder may generate an aliasing cancellation component based on a previously-decoded frame of the lossless stream.
  • the generated aliasing cancellation component may be added to a lossy time segment at a transition frame.
  • the sum of the aliasing cancellation component and the lossy time segment may be normalized using a weight caused by an encoding window applied to the transition frame, thereby providing aliasing cancellation on the transition frame. Audio playback of the lossy time segment may then be provided by the decoder, beginning with the aliasing-canceled transition frame.
  • an exemplary decoder may include a lossy decoder circuit, an lossless decoder circuit, and an analysis circuit.
  • the lossy decoder circuit may receive lossy coded time segments from a network connection, the lossy coded time segments comprising audio encoded using a frequency-domain lossy coding method.
  • the lossless decoder circuit may receive a lossless stream from the network connection, the lossless stream comprising the audio encoded using a lossless coding method, the lossy coded time segments and the lossless stream being encoded from the same source audio, being time-aligned, and having a same sampling rate, the decoder providing audio playback of the lossless stream.
  • the analysis circuit may be coupled to both the lossy decoder circuit and the lossless decoder circuit.
  • the analysis circuit may, in response to a determination that network bandwidth is constrained, generate an aliasing cancellation component based on previously-decoded frames of the lossless stream, add the generated aliasing cancellation component to a lossy time segment at a transition frame, normalize the sum of the generated aliasing cancellation component and the lossy time segment using a weight caused by an encoding window applied to the transition frame to provide aliasing cancellation on the transition frame, and provide audio playback of the lossy coded time segments beginning with the aliasing-canceled transition frame.
  • the lossless coding method may use MDCT with overlapping windows, and the lossless coding method may use rectangular non-overlapping windows that are different from windows used by the lossy coding method.
  • the switching may be performed in various locations in the decoding process.
  • the analysis circuit may, in response to receiving the determination that network bandwidth is constrained, select the transition frame to be before a peak-limiter is applied to the lossless stream.
  • the aliasing cancellation component may be generated based on reconstructing an adjacent frame of the previously-decoded frames of the lossless stream as a sum of a lossy component and an aliasing cancellation component for the adjacent frame.
  • the aliasing cancellation component for the adjacent frame may then be extrapolated to generate the aliasing cancellation component for the transition frame.
  • the normalizing may include multiplying the sum of the aliasing cancellation component and the lossy time segment by an inverse window function vector determined for the transition frame.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computational Linguistics (AREA)
  • Signal Processing (AREA)
  • Health & Medical Sciences (AREA)
  • Audiology, Speech & Language Pathology (AREA)
  • Human Computer Interaction (AREA)
  • Physics & Mathematics (AREA)
  • Acoustics & Sound (AREA)
  • Multimedia (AREA)
  • Quality & Reliability (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)

Claims (15)

  1. Procédé comprenant :
    la réception (205), par un décodeur sur un réseau, de segments temporels codés avec perte contenant un signal audio codé à l'aide d'un procédé de codage de domaine fréquentiel avec perte ;
    la réception (210) d'un flux sans perte par le décodeur sur le réseau, le flux sans perte contenant le signal audio codé à l'aide d'un procédé de codage sans perte, les segments temporels codés avec perte et le flux sans perte étant codés à partir du même signal audio source, étant alignés dans le temps et ayant une même fréquence d'échantillonnage, le décodeur fournissant une lecture audio du flux sans perte ;
    en réponse à la réception d'une détermination indiquant que la bande passante du réseau est limitée :
    la génération (220), par le décodeur, une composante d'annulation de repliement sur la base de trames précédemment décodées du flux sans perte ;
    l'ajout (240) de la composante d'annulation de repliement générée à un segment temporel avec perte au niveau d'une trame de transition ;
    la normalisation (250) de la somme de la composante d'annulation de repliement générée et du segment temporel avec perte en utilisant une pondération produite par une fenêtre de codage appliquée à la trame de transition, ce qui assure une annulation de repliement sur la trame de transition ; et
    la fourniture (260) d'une lecture audio des segments temporels codés avec perte en commençant par la trame de transition ayant fait l'objet de l'annulation de repliement.
  2. Procédé selon la revendication 1, dans lequel le procédé de codage avec perte utilise une MDCT avec des fenêtres en chevauchement.
  3. Procédé selon une quelconque revendication précédente, dans lequel le procédé de codage sans perte utilise des fenêtres rectangulaires sans chevauchement qui sont différentes des fenêtres utilisées par le procédé de codage avec perte.
  4. Procédé selon une quelconque revendication précédente, comprenant en outre, en réponse à la réception de la détermination indiquant que la bande passante du réseau est limitée, la sélection de la trame de transition devant se présenter avant qu'un écrêteur ne soit appliqué au flux sans perte.
  5. Procédé selon une quelconque revendication précédente, la génération de la composante d'annulation de repliement comprenant :
    la reconstruction d'une trame adjacente des trames précédemment décodées du flux sans perte sous la forme d'une somme d'une composante avec perte et d'une composante d'annulation de repliement pour la trame adjacente ; et
    l'extrapolation de la composante d'annulation de repliement pour la trame adjacente de façon à générer la composante d'annulation de repliement.
  6. Procédé selon une quelconque revendication précédente, la normalisation comprenant une multiplication par un vecteur de fonction de fenêtre inverse déterminé pour la trame de transition.
  7. Procédé selon une quelconque revendication précédente, la détermination indiquant que la bande passante du réseau est limitée étant reçue à partir d'une indication fournie par l'utilisateur sur une interface en communication avec le décodeur.
  8. Produit programme informatique contenant un code de programme lisible par ordinateur devant être exécuté par un ou plusieurs processeurs d'un décodeur lorsqu'il est récupéré à partir d'un support non transitoire lisible par ordinateur, le code de programme contenant des instructions visant à :
    recevoir (205) des segments temporels codés avec perte contenant un signal audio codé à l'aide d'un procédé de codage de domaine fréquentiel avec perte ;
    recevoir (210) un flux sans perte, le flux sans perte contenant le signal audio codé à l'aide d'un procédé de codage sans perte, les segments temporels codés avec perte et le flux sans perte étant codés à partir du même signal audio source, étant alignés dans le temps et ayant une même fréquence d'échantillonnage, le décodeur fournissant une lecture audio du flux sans perte ;
    en réponse à la réception d'une détermination indiquant que la bande passante du réseau est limitée :
    générer (220), au moyen du décodeur, une composante d'annulation de repliement sur la base de trames précédemment décodées du flux sans perte ;
    ajouter (240) la composante d'annulation de repliement générée à un segment temporel avec perte au niveau d'une trame de transition ;
    normaliser (250) la somme de la composante d'annulation de repliement générée et du segment temporel avec perte en utilisant une pondération produite par une fenêtre de codage appliquée à la trame de transition, ce qui assure une annulation de repliement sur la trame de transition ; et
    fournir (260) une lecture audio des segments temporels codés avec perte en commençant par la trame de transition ayant fait l'objet de l'annulation de repliement.
  9. Produit programme informatique selon la revendication 8, dans lequel les instructions de génération de la composante d'annulation de repliement comprennent des instructions visant à :
    reconstruire une trame adjacente des trames précédemment décodées du flux sans perte sous la forme d'une somme d'une composante avec perte et d'une composante d'annulation de repliement pour la trame adjacente ; et
    extrapoler la composante d'annulation de repliement pour la trame adjacente de façon à générer la composante d'annulation de repliement.
  10. Décodeur pour flux audio comprenant
    un circuit de décodeur avec perte qui reçoit (205) des segments temporels codés avec perte à partir d'une connexion de réseau, les segments temporels codés avec perte contenant un signal audio codé à l'aide d'un procédé de codage de domaine fréquentiel avec perte ;
    un circuit de décodeur sans perte qui reçoit (210) un flux sans perte à partir de la connexion de réseau, le flux sans perte contenant le signal audio codé à l'aide d'un procédé de codage sans perte, les segments temporels codés avec perte et le flux sans perte étant codés à partir du même signal audio source, étant alignés dans le temps et ayant une même fréquence d'échantillonnage, le décodeur fournissant une lecture audio du flux sans perte ; et
    un circuit d'analyse couplé à la fois au circuit de décodeur avec perte et au circuit de décodeur sans perte, le circuit d'analyse étant conçu pour générer (220), en réponse à une détermination indiquant que la bande passante du réseau est limitée, une composante d'annulation de repliement sur la base de trames précédemment décodées du flux sans perte, ajouter (240) la composante d'annulation de repliement générée à un segment temporel avec perte au niveau d'une trame de transition, normaliser (250) la somme de la composante d'annulation de repliement générée et du segment temporel avec perte en utilisant une pondération produite par une fenêtre de codage appliquée à la trame de transition de façon à assurer une annulation de repliement sur la trame de transition, et fournir (260) une lecture audio des segments temporels codés avec perte en commençant par la trame de transition ayant fait l'objet de l'annulation de repliement.
  11. Décodeur selon la revendication 10, dans lequel le procédé de codage avec perte utilise une MDCT avec des fenêtres en chevauchement.
  12. Décodeur selon la revendication 10 ou 11, dans lequel le procédé de codage sans perte utilise des fenêtres rectangulaires sans chevauchement qui sont différentes des fenêtres utilisées par le procédé de codage avec perte.
  13. Décodeur selon l'une quelconque des revendications 10 à 12, le circuit d'analyse sélectionnant la trame de transition devant se présenter avant qu'un écrêteur ne soit appliqué au flux sans perte.
  14. Décodeur selon l'une quelconque des revendications 10 à 13, la génération de la composante d'annulation de repliement comprenant :
    la reconstruction d'une trame adjacente des trames précédemment décodées du flux sans perte sous la forme d'une somme d'une composante avec perte et d'une composante d'annulation de repliement pour la trame adjacente ; et
    l'extrapolation de la composante d'annulation de repliement pour la trame adjacente de façon à générer la composante d'annulation de repliement.
  15. Décodeur selon l'une quelconque des revendications 10 à 14, la normalisation comprenant une multiplication par un vecteur de fonction de fenêtre inverse déterminé pour la trame de transition.
EP18191910.1A 2017-08-31 2018-08-31 Annulation du repliement de domaine temporel fourni par décodeur lors de transitions sans perte ou avec perte Active EP3451332B1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US201762553042P 2017-08-31 2017-08-31
EP17188694 2017-08-31

Publications (2)

Publication Number Publication Date
EP3451332A1 EP3451332A1 (fr) 2019-03-06
EP3451332B1 true EP3451332B1 (fr) 2020-03-25

Family

ID=59745775

Family Applications (1)

Application Number Title Priority Date Filing Date
EP18191910.1A Active EP3451332B1 (fr) 2017-08-31 2018-08-31 Annulation du repliement de domaine temporel fourni par décodeur lors de transitions sans perte ou avec perte

Country Status (1)

Country Link
EP (1) EP3451332B1 (fr)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111049829B (zh) * 2019-12-13 2021-12-03 南方科技大学 视频流传输方法、装置、计算机设备和存储介质
CN118522296A (zh) * 2023-02-17 2024-08-20 华为技术有限公司 有损编解码器和无损编解码器之间的切换方法和装置

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR100908114B1 (ko) * 2002-03-09 2009-07-16 삼성전자주식회사 스케일러블 무손실 오디오 부호화/복호화 장치 및 그 방법
US7424434B2 (en) * 2002-09-04 2008-09-09 Microsoft Corporation Unified lossy and lossless audio compression
EP2524374B1 (fr) * 2010-01-13 2018-10-31 Voiceage Corporation Décodage audio avec annulation directe du repliement de spectre dans le domaine temporel par filtrage à prédiction linéaire

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
None *

Also Published As

Publication number Publication date
EP3451332A1 (fr) 2019-03-06

Similar Documents

Publication Publication Date Title
US10438597B2 (en) Decoder-provided time domain aliasing cancellation during lossy/lossless transitions
EP4105927B1 (fr) Correction sélective d'erreurs en aval pour des codecs audio spatiaux
RU2444071C2 (ru) Кодер, декодер и методы кодирования и декодирования сегментов данных, представляющих собой поток данных временной области
RU2625444C2 (ru) Система обработки аудио
EP2619758B1 (fr) Dispositifs pour la transformation et la transformation inverse de signaux audio, procédés pour l'analyse et la synthèse de signaux audio
JP5978227B2 (ja) 予測符号化と変換符号化を繰り返す低遅延音響符号化
US20140046670A1 (en) Audio encoding method and apparatus, audio decoding method and apparatus, and multimedia device employing the same
EP3553777B1 (fr) Dissimulation de perte de paquets à faible complexité pour des signaux audio transcodés
BR122020015614B1 (pt) Método e dispositivo para interpolar parâmetros de filtro de predição linear em um quadro de processamento de sinal sonoro atual seguindo um quadro de processamento de sinal sonoro anterior
JPWO2009081567A1 (ja) ステレオ信号変換装置、ステレオ信号逆変換装置およびこれらの方法
WO2013061584A1 (fr) Décodeur de son-signal hybride, codeur de son-signal hybride, procédé de décodage de son-signal et procédé de codage de son-signal
EP3451332B1 (fr) Annulation du repliement de domaine temporel fourni par décodeur lors de transitions sans perte ou avec perte
US20110087494A1 (en) Apparatus and method of encoding audio signal by switching frequency domain transformation scheme and time domain transformation scheme
US9734836B2 (en) Method and apparatus for decoding speech/audio bitstream
JP2017523471A (ja) Ｆｄ／ｌｐｄ遷移コンテキストにおけるフレーム喪失管理
JP6654236B2 (ja) オーディオ変換コーディングにおけるオーバーラップ率の信号適応スイッチングのための符号化器、復号器および方法
Helmrich et al. Low-delay transform coding using the MPEG-H 3D audio codec
KR101601906B1 (ko) 주파수 영역 변환 기법 및 시간 영역 변환 기법을 전환하며오디오 신호를 부호화하는 장치 및 방법
JP7420829B2 (ja) 予測コーディングにおける低コスト誤り回復のための方法および装置
KR101805631B1 (ko) 주파수 영역 변환 기법 및 시간 영역 변환 기법을 전환하며 오디오 신호를 부호화하는 장치 및 방법
KR101702565B1 (ko) 주파수 영역 변환 기법 및 시간 영역 변환 기법을 전환하며 오디오 신호를 부호화하는 장치 및 방법
JP7258135B2 (ja) 処理されたオーディオ信号表現を提供するための装置およびオーディオ信号プロセッサ、オーディオデコーダ、オーディオエンコーダ、方法、ならびにコンピュータプログラム
KR101178222B1 (ko) 오디오 부호화 및 복호화 방법과 그 장치
KR20210141655A (ko) 멀티 채널 오디오 프레임에서 예측적인 코딩에서 에러 복구를 위한 방법 및 장치
CN118522296A (zh) 有损编解码器和无损编解码器之间的切换方法和装置

Legal Events

Date Code Title Description
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: THE APPLICATION HAS BEEN PUBLISHED

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 MK MT NL NO PL PT RO RS SE SI SK SM TR

AX Request for extension of the european patent

Extension state: BA ME

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: 20190906

RBV Designated contracting states (corrected)

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 MK MT NL NO PL PT RO RS SE SI SK SM TR

GRAP Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOSNIGR1

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

Free format text: STATUS: GRANT OF PATENT IS INTENDED

RIC1 Information provided on ipc code assigned before grant

Ipc: G10L 19/24 20130101ALI20190925BHEP

Ipc: G10L 19/00 20130101AFI20190925BHEP

Ipc: G10L 19/02 20130101ALN20190925BHEP

INTG Intention to grant announced

Effective date: 20191023

RIN1 Information on inventor provided before grant (corrected)

Inventor name: BISWAS, ARIJIT

GRAS Grant fee paid

Free format text: ORIGINAL CODE: EPIDOSNIGR3

GRAA (expected) grant

Free format text: ORIGINAL CODE: 0009210

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

Free format text: STATUS: THE PATENT HAS BEEN GRANTED

AK Designated contracting states

Kind code of ref document: B1

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 MK MT NL NO PL PT RO RS SE SI SK SM TR

REG Reference to a national code

Ref country code: GB

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: AT

Ref legal event code: REF

Ref document number: 1249490

Country of ref document: AT

Kind code of ref document: T

Effective date: 20200415

Ref country code: IE

Ref legal event code: FG4D

REG Reference to a national code

Ref country code: DE

Ref legal event code: R096

Ref document number: 602018003260

Country of ref document: DE

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: FI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

Ref country code: RS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

Ref country code: NO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200625

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: BG

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200625

Ref country code: SE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

Ref country code: LV

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

Ref country code: HR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

Ref country code: GR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200626

REG Reference to a national code

Ref country code: NL

Ref legal event code: MP

Effective date: 20200325

REG Reference to a national code

Ref country code: LT

Ref legal event code: MG4D

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: NL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: EE

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

Ref country code: SM

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

Ref country code: RO

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

Ref country code: IS

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200725

Ref country code: SK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

Ref country code: CZ

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

Ref country code: PT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200818

Ref country code: LT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

REG Reference to a national code

Ref country code: AT

Ref legal event code: MK05

Ref document number: 1249490

Country of ref document: AT

Kind code of ref document: T

Effective date: 20200325

REG Reference to a national code

Ref country code: DE

Ref legal event code: R097

Ref document number: 602018003260

Country of ref document: DE

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: AT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

Ref country code: IT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

Ref country code: DK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

Ref country code: ES

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

PLBE No opposition filed within time limit

Free format text: ORIGINAL CODE: 0009261

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

Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: PL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

26N No opposition filed

Effective date: 20210112

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MC

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LU

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20200831

REG Reference to a national code

Ref country code: BE

Ref legal event code: MM

Effective date: 20200831

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: SI

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: IE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20200831

Ref country code: BE

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20200831

REG Reference to a national code

Ref country code: CH

Ref legal event code: PL

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: LI

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20210831

Ref country code: CH

Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES

Effective date: 20210831

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: TR

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

Ref country code: MT

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

Ref country code: CY

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

PG25 Lapsed in a contracting state [announced via postgrant information from national office to epo]

Ref country code: MK

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

Ref country code: AL

Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT

Effective date: 20200325

REG Reference to a national code

Ref country code: DE

Ref legal event code: R081

Ref document number: 602018003260

Country of ref document: DE

Owner name: DOLBY INTERNATIONAL AB, IE

Free format text: FORMER OWNER: DOLBY INTERNATIONAL AB, AMSTERDAM ZUIDOOST, NL

Ref country code: DE

Ref legal event code: R081

Ref document number: 602018003260

Country of ref document: DE

Owner name: DOLBY INTERNATIONAL AB, NL

Free format text: FORMER OWNER: DOLBY INTERNATIONAL AB, AMSTERDAM ZUIDOOST, NL

REG Reference to a national code

Ref country code: DE

Ref legal event code: R081

Ref document number: 602018003260

Country of ref document: DE

Owner name: DOLBY INTERNATIONAL AB, IE

Free format text: FORMER OWNER: DOLBY INTERNATIONAL AB, DP AMSTERDAM, NL

P01 Opt-out of the competence of the unified patent court (upc) registered

Effective date: 20230512

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: DE

Payment date: 20240723

Year of fee payment: 7

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: GB

Payment date: 20240723

Year of fee payment: 7

PGFP Annual fee paid to national office [announced via postgrant information from national office to epo]

Ref country code: FR

Payment date: 20240723

Year of fee payment: 7