Block-wise coding of a digital time-varying signal

Abstract

A decoder and an encoder for coding a digital time-varying signal from or into a data stream are presented. The decoder is configured to decode the digital time-varying signal from the data stream in non-overlapping temporal blocks by decoding each of transform-coded temporal blocks of the non-overlapping temporal blocks of the digital time-varying signal by decoding coefficients from the data stream, subjecting the coefficients to a predetermined re-transformation from a transform domain to time domain to obtain a time-domain signal, wherein the re-transformation is a non-overlapping transform, decoding one or more deblocking parameters from the datastream, performing deblocking post-processing by modifying the time-domain signal using the one or more deblocking parameters to obtain a modified time-domain signal.

Description

[0001] Block-wise coding of a digital time-varying signal Description Embodiments according to the invention are related to apparatuses and methods for encoding ordecoding a digital time-varying signal using transform-coded temporal blocks.Introduction and problem statement: Digital time-varying signals are commonly used for representation of various data such as biomedical signals or seismic measurements. With progressing digitization, signal accuracy, and remote data access, the amount of data with time-varying signals increases. There is a need for improving one or more of coding compression and coding accuracy of such digital time-varying signals. This is achieved by the subject matter of the independent claims of the present application. Further embodiments according to the invention are defined by the subject matter of the dependent claims of the present application. Summary of the invention According to an aspect of the invention, a decoder for decoding a digital time-varying signal froma data stream is provided. The decoder is configured to decode the digital time-varying signalfrom the data stream in non-overlapping temporal blocks by decoding each of transform-codedtemporal blocks of the non-overlapping temporal blocks of the digital time-varying signal bydecoding coefficients from the data stream, subjecting the coefficients to a predetermined re- transformation from a transform domain to time domain to obtain a time-domain signal, wherein the re-transformation is a non-overlapping transform, decoding one or more deblockingparameters from the data stream, performing deblocking post-processing by modifying the time-domain signal using the one or more deblocking parameters to obtain a modified time-domain signal. According to another aspect of the invention, an encoder for encoding a digital time-varying signalinto a data stream is provided. The encoder is configured to encode the digital time-varying signalFH250105PCT-2025007739.DOCXfe into the data stream in non-overlapping temporal blocks by encoding each of transform-coded temporal blocks of the non-overlapping temporal blocks of the digital time-varying signal byperforming a deblocking pre-processing by determining one or more deblocking parameters,modifying a time-domain signal of the respective transform-coded temporal block using the oneor more deblocking parameters to obtain a modified time-domain signal, subjecting the modifiedtime-domain signal to a predetermined transformation from a time domain to transform domain to obtain coefficients, wherein the transformation is a non-overlapping transform, encoding the coefficients into the data stream. Subjecting a time-domain signal (e.g., the modified time-domain signal) to the predetermine transformation at encoding and subjecting the coefficients to a predetermined re-transformation at decoding allows compressing information in the data stream into a more energy dense state. As a result, storage and transmission requirements can be reduced. Since the temporal blocks are non-overlapping and the transformations are non-overlapping, the time-domain signal at the decoder can be made available independent from a transformation of temporally adjacent temporal blocks. As a result, a time delay between encoding and decoding can be reduced. For example, the time-domain signal may be a reconstructed signal or a residual signal for reconstructing a signal, which may allow reconstructing the signal independent of a time-domainsignal of a following temporal block. For example, some coding techniques employ combiningtime-domain signals of adjacent blocks (e.g., combining a time-domain signal with half of a time- signal of a following temporal block, e.g., by using windowing across multiple temporal blocks), which means that reconstruction is delayed until said time-domain signal is actually available. By modifying the time-domain signal using the one or more deblocking parameters, a signalsmoothness can be improved. The deblocking synergizes with the non-overlapping transform, asthe non-overlapping transform may potentially lead to peaks (e.g., at boundaries between twonon-overlapping temporal blocks), which deviate from the original signal. However, deblocking can improve signal smoothness while supporting a low delay coding environment supported by non-overlapping transformation. According a further aspect, corresponding methods for decoding and encoding a digital time- varying signal into a data stream are provided. An embodiment is related to a data stream having a digital-time varying signal (e.g., an audiosignal, biometric signal, or seismic signal) encoded thereinto using a herein described method for

[0002] FH250105PCT-2025007739.DOCXfeencoding. The data stream may be stored on a storage medium (e.g., non-transitory storagemedium, e.g., any storage described herein).An embodiment is related to a computer program (e.g., stored on a storage medium, e.g., non-transitory storage medium, e.g., computer program product) having a program code forperforming, when running on a computer, a herein described method, when being executed on the computer. Introductory remarks:In the following, aspects of the invention will be described in general terms with reference to fig.1a and 1b. Afterwards, different inventive embodiments and aspects will be described, inter alia,in “Perceptual coding and decoding of biomedical, seismic, and related waveform signals”, in a chapter “Shortcoming of Traditional Transform Coding”, in a chapter “Conventional Solutions and Their Drawbacks”, in a chapter “Summary of the Inventive (De)coding Solution”, in a chapter “Detailed Description of Aspect 1: Architecture”, in a chapter “Detailed Description of Aspect 2: Deblocking”, and in a chapter “Detailed Description of Aspect 2: Deblocking”. Also, further embodiments will be defined by the enclosed claims.It should be noted that any embodiments as defined by the claims and / or a general description(e.g., with reference to fig. 1a to 3b and 8 to 12) can be supplemented by any of the details(features and functionalities) described in the above mentioned chapters and vice versa. Similarly,any embodiments as defined by the claims can be supplemented by the general description andvice versa. Also, the embodiments described in the above mentioned chapters can be used individually, andcan also be supplemented by any of the features in another chapter, or by any feature includedin the claims. Also, it should be noted that individual aspects described herein can be used individually or in combination. Thus, details can be added to each of said individual aspects without adding details to another one of said aspects.

[0003] FH250105PCT-2025007739.DOCXfe Moreover, features and functionalities disclosed herein relating to a method can also be used in an apparatus (configured to perform such functionality). Furthermore, any features andfunctionalities disclosed herein with respect to an apparatus can also be used in a correspondingmethod. In other words, the methods disclosed herein can be supplemented by any of the features and functionalities described with respect to the apparatuses. Also, any of the features and functionalities described herein can be implemented in hardware or in software, or using a combination of hardware and software, as will be described in the section “implementation alternatives”. Brief Description of the Drawings The drawings are not necessarily to scale, emphasis instead generally being placed upon illustrating the principles of the invention. In the following description, various embodiments of the invention are described with reference to the following drawings, in which:Fig. 1a shows of a schematic view of a decoder for decoding a digital time-varying signalfrom a data stream; Fig.1b shows a schematic view of an encoder for encoding a digital time-varying signal into a data stream;Fig. 2a shows a schematic view of samples of a time-domain signal before and aftermodification using one or more deblocking parameters;Fig. 2b shows a schematic view of samples of a time-domain signal having a cosine-likeshape before and after modification using one or more deblocking parameters;Fig. 3a shows a schematic view of samples of a time-domain signal before and aftermodification using a deblocking parameter derived from the data stream, and a further deblocking parameter derived from previously coded samples;Fig. 3b shows a schematic view of samples of a time-domain signal having a cosine-likeshape before and after modification using a deblocking parameter and a further deblocking parameter;

[0004] FH250105PCT-2025007739.DOCXfe Fig.4 shows a schematic example of a block diagram of a linear predictive coding based lossless audio encoder; Fig.5a shows a schematic view of an encoding procedure for encoding a digital time- varying signal; Fig.5b shows an example of a decoding procedure for decoding a digital time-varying signal; Fig.5c shows a schematic view of an example for a set of prediction modes and a selection therefrom; Fig.6 shows an example of an encoder and decoder using linear predictive coding prediction; Fig.7 shows an example of a decoded residual signal without deblocking and with deblocking;Fig. 8 shows an example of an encoder for encoding a multi-channel digital signal into adatastream as well as decoder for decoding the multi-channel digital signal from the datastream; Fig.9 shows a schematic coding scheme for decoding comprising modifying the time- domain prediction residual signal;Fig. 10 shows a schematic example of a decoder for decoding a multi-channel digitalsignal;Fig. 11 shows a schematic example of a current temporal block of a predetermined codedchannel that is predicted from one or more reference block portions of the samechannel; andFig. 12 shows a schematic examples of decoding a currently coded temporal block andtemporally adjacent temporal blocks.

[0005] FH250105PCT-2025007739.DOCXfe Detailed Description of the Embodiments Equal or equivalent elements or elements with equal or equivalent functionality are denoted in the following description by equal or equivalent reference numerals even if occurring in different figures. In the following description, a plurality of details is set forth to provide a more throughout explanation of embodiments of the present invention. However, it will be apparent to those skilled in the art that embodiments of the present invention may be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form rather than in detail in order to avoid obscuring embodiments of the present invention. In addition, features of the different embodiments described herein after may be combined with each other, unless specifically noted otherwise.Fig. 1a shows of a schematic view of a decoder 12 for decoding a digital time-varying signal 92from a data stream 16. The decoder 12 may be any decoder 12 disclosed herein and may beconfigured to decode the data stream 16 of any encoder 10 disclosed herein. Any feature disclosed with reference to fig. 1a may be used in any combination with any other decoder 12 disclosed herein.The decoder 12 is configured to decode the digital time-varying signal 92 from the data stream16 in non-overlapping temporal blocks 140 by decoding each of transform-coded temporal blocks140i of the non-overlapping temporal blocks 140 of the digital time-varying signal 92 by decoding304 coefficients 300ifrom the data stream 16, subjecting 306 the coefficients 300ito a predetermined re-transformation from a transform domain to time domain to obtain a time-domain signal 302i, wherein the re-transformation is a non-overlapping transform, decoding 402 one or more deblocking parameters 400 from the datastream 16, performing deblocking post-processing by modifying 404 the time-domain signal 302iusing the one or more deblocking parameters 400 to obtain a modified time-domain signal 302’i.Fig. 1b shows a schematic view of an encoder 10 for encoding a digital time-varying signal 92into a data stream 16. The encoder 10 may be any encoder 10 disclosed herein and may beconfigured to encode a data stream 16 decodable by any decoder 12 disclosed herein. Any

[0006] FH250105PCT-2025007739.DOCXfefeature disclosed with reference to fig.1b may be used in any combination with any other encoder10 disclosed herein.The encoder 10 is configured to encode the digital time-varying signal 92 into the data stream 16in non-overlapping temporal blocks 140 by encoding each of transform-coded temporal blocks 140iof the non-overlapping temporal blocks 140 of the digital time-varying signal 92 by performing a deblocking pre-processing by determining one or more deblocking parameters 400, modifying 404 a time-domain signal 302’i of the respective transform-coded temporal block 140i using the one or more deblocking parameters 400 to obtain a modified time-domain signal 302i, subjecting 306 the modified time-domain signal 302i to a predetermined transformation from a time domainto transform domain to obtain coefficients 300i, wherein the transformation is a non-overlappingtransform, encoding 304 the coefficients 300i into the data stream 16.The digital time-varying signal 92 may be (or comprise) one channel, for example, as a singlechannel signal or as part of a multi-channel signal. Alternatively, the digital time-varying signal 92 may comprise one or more channels. A channel may define a single parameter assuming values over time, e.g., wherein the parameter is sampled over temporally successive samples. The temporal block 140 may form a one dimensional array of samples, wherein a sample order defines a sequence order within the one dimensional array of samples. The digital time-varying signal 92 may comprise or be an audio signal (e.g., having one or more audio channels), a biomedical signal (e.g., an electrogram such as obtained by electroencephalography, electrocardiogram, or electrooculography), or a seismic signal. Any decoder 12 disclosed herein may be a decoder 12for decoding an audio signal, a biomedical signal, or a seismic signal. Any encoder 10 disclosedherein be an encoder for encoding an audio signal, a biomedical signal, or a seismic signal. Thedigital time-varying signal 92 may be a predetermined coded channel of coded channelsrepresenting a multi-channel digital signal. The multi-channel digital signal may be obtained by atleast one of Electrocardiography, Electroencephalography, Electromyography or seismicmeasurement, and / or the multi-channel digital signal may be a bio-physiological waveform datasuch as an electroencephalography (EEG) signal, an electrocardiogram (ECG), or an electromyography (EMG) signal, or seismic waveform data.The digital time-varying signal 92 may be or comprise one or more waveform signals. Anydisclosure related herein to examples with a single channel may also be applicable in anycombination to a digital time-varying signal 92 being one of multiple channels.

[0007] FH250105PCT-2025007739.DOCXfe The time-domain signal 302i may be (or may comprise) a time-domain residual prediction signal (e.g., for correcting a prediction signal, e.g., by linear combination). The time-domain residual prediction signal may be the result of any prediction mode disclosed herein. The time-domain signal 302imay be (or may comprise) a reconstructed signal (e.g., without requiring a predictionsignal). Prediction allows removal of redundancies and therefore improves coding efficiency.Two temporal blocks 140 may be considered non-overlapping, if they do not comprise a commonsample (e.g., if a last sample of a first temporal block is also a first sample of a second temporal block the corresponding temporal blocks 140 may be considered overlapping). Furthermore, two non-overlapping temporal blocks 140 may adjoin each other immediately, e.g., along a temporal axis (e.g., wherein a last sample of a first temporal block immediately precedes a last sample of a second temporal block). A reconstruction of a first non-overlapping temporal block may be completed independent of an immediately subsequent non-overlapping temporal block. For example, no super-position or addition of overlapping samples (or sample predictions) of two adjacent non-overlapping temporal blocks 140 may be required for reconstructing a preceding one of the two adjacent non-overlapping temporal blocks 140. For example, coding may be performed windowless or without windowing or without overlapping windows.The transform-coded temporal blocks 140 may relate to a data type, wherein at least a portion(e.g., a prediction residual signal) of data, e.g., payload, of temporal blocks that are originally in an original domain (e.g., time domain temporal blocks) are transformed to a transform domain (e.g., frequency domain) and encoded into the data stream 16, e.g., to be decoded by and re- transformed to the original domain (e.g., time domain). The transformation may result in more information dense (or energy dense) data, resulting in better coding efficiency. The predetermined re-transformation may be configured to output a set of a samples, whereinthe set of samples has a number of samples that is equal to (or different, e.g., less than) a numberof samples of currently decoded temporal block 140 (or all temporal blocks, e.g., in case all temporal blocks 140 have the same size or number of samples, e.g., within a temporal block 30or the entire digital time-varying signal 92. The predetermined re-transformation may result in asequence of samples (e.g., residual samples) that does not extend to (e.g., overlap) adjacent temporal blocks 140i-1, 140i+1. The predetermined re-transformation may result in a sequence of samples (e.g., residual samples) that is restricted (e.g., entirely fits into) the currently codedtemporal block 140 (e.g., by having a number of samples that does not exceed a number ofsamples of the temporal block 140). The predetermined re-transformation may be configured to

[0008] FH250105PCT-2025007739.DOCXfeoutput such a set of a samples when the transform-coded temporal block 140i is subjected to thepredetermined re-transformation, e.g., for a predetermined number (or range of numbers) of coefficients 300i in the transform-coded temporal block 140i, independent of a number of coefficients 300iin the transform-coded temporal block 140i-1. The predetermined re-transformation may comprise an algorithm that prevents the number of output samples to exceedthe number of samples of the temporal block 140 and / or a cropping step for cropping samples that exceed the number of samples of the temporal block 140. The one or more deblocking parameters 400 may define correction values (e.g., based on a function defined by the one or more deblocking parameters 400, e.g., wherein the correction values are values of the function at sample positions of the samples of the time-domain signal 302i). The modifying 404 the time-domain signal 302i (e.g., time-domain prediction residual signal) may comprise a linear combination (e.g., subtraction, sum, or weighted sum / subtraction) between the time-domain signal 302i and the correction values (e.g., the function). The function may map correction values to samples (or sample positions or sample ranks). One, two, three, four, or more deblocking parameters 400 may be encoded into the data stream 16. The function may be definedby one, two, three, four, or more deblocking parameters 400 and may optionally be define by oneor more further deblocking parameters (or derivable blocking parameter) derivable from previously coded temporal blocks. For example, the function may defined by one deblocking parameter 400 and one further deblocking parameter.The one or more deblocking parameters 400 may define a linear function. For example, thedeblocking parameters 400 may define an offset α and slope ^ (e.g., or only the slope ^, e.g.,wherein offset α is a further deblocking parameter derivable from previously decoded samples,as will be described further below), wherein the offset α and slope ^ define the linear function. Forexample, the offset α may define a vertical offset of the linear function, e.g., at a first sample position of the temporal block to be decoded, or at a second sample position immediately preceding said first sample, or a position between the first and second sample (e.g., not necessarily on a grid of sample positions, but at a finer granularity, such as sub-pel positions).The encoder 10 may be configured to determine offset α and slope ^ based on a mean µix of anumber of samples (e.g., N) of the temporal block 140iand a mean µresof sample values of the time-domain signal 302i using the following equation:^ = sumi[(i – µix) · (resi – µres)] / sumi[(i – µix)2], α = µres – ^ · µix with index 0 ≤ i < N.

[0009] FH250105PCT-2025007739.DOCXfeThe one or more deblocking parameters 400 may define a trigonometric half-wave functionparametrized by a half-wave offset and a half-wave amplitude. For example, the trigonometrichalf-wave function may be (or comprise) a cosine function ranging from 0 to ^ (e.g., from a valueof +1 o -1), e.g., wherein the cosine function is parametrized (e.g., in an argument of the cosine function) to extend the half-wave thereof along the length of the temporal block 140 to be coded (e.g., having its maximum at a first sample and its minimum at a last sample, optionally shifted by a sub-pel position). The deblocking parameter for the half-wave amplitude (e.g., ^) may subsequently modify an amplitude of the cosine half-wave function (e.g., instead of covering a vertical range of two). The deblocking parameter for the half-wave offset (e.g., α) may define avertical offset of the half-wave cosine function. Alternatively or additionally, the trigonometric half-wave function may be (or comprise) a sine function, e.g., ranging either from 0 to ^ (e.g., with avalue range between 0 and 1) or, e.g., from ^ to 2^ (e.g., with a value range between 0 and –1).This sine function – or, more precisely, half-sine function – may be more suitable than a half-cosine function if, e.g., the trans-formation applied to the given block signal already employs cosine functions as its basis functions.The one or more deblocking parameters 400 (and optionally further deblocking paramters) maydefine a blocking-and-ringing-artefact-reducing function (e.g., any linear function or thetrigonometric half-wave function as described herein, e.g., a function defining correction valuesdependent on sample positions) and the decoder 12 may be configured to modify 404 the time-domain signal 302i (e.g., time-domain prediction residual signal) using the one or more deblocking parameters 400 to obtain the modified time-domain signal 302’i(e.g., a modified time-domain prediction residual signal) by linearly combining (e.g. adding and / or e.g. subtracting) the blocking-and-ringing-artefact-reducing function and the time-domain signal 302’i. For example, in case ofthe blocking-and-ringing-artefact-reducing function being a linear function that is defined (at least)by the one or more deblocking parameters, wherein each sample of the time-domain signal 302’imay be reduced by a corresponding correction value, which may be determined as a value of thefunction at a sample position of the corresponding sample of the time-domain signal 302’i. Forexample, the blocking-and-ringing-artefact-reducing function may be selected (e.g., by selectionof deblocking parameters) to reduce (e.g., by linear combination such as substraction) values of the time-domain signal, e.g., at one or both ends thereof. Such a reduction can remove unwanted peaks and may smoothen the signal.The one or more deblocking parameters 400 may comprise a gating flag which, if set, may indicatethat the deblocking post-processing is active (e.g., if the gating flag has a value of one) and thatFH250105PCT-2025007739.DOCXfe the one or more deblocking parameters 400 comprise one or more function parameters defining a blocking-and-ringing-artefact-reducing function ought to be linearly combined (e.g. subjecting to an addition and / or e.g. subjecting to a subtraction) with the time-domain signal 302i (e.g., time-domain prediction residual signal) to obtain the modified time-domain signal 302’i. If not set (e.g.,if the gating flag has a value of zero), the gating flag may indicate that the deblocking post-processing is inactive, wherein the one or more deblocking parameters 400 may only comprisethe gating flag, and the modified time-domain signal 302’i may equal to the time-domain signal302i (e.g., time-domain prediction residual signal). The gating flag may be signalled for eachtemporal block 140 or (e.g., once) for each set of temporal blocks 140 (e.g., for temporal block30). A gating flag provides the encoder with further coding flexibility, enabling a deactivation oractivation of deblocking, for example, based on whether deblocking is useful (e.g., based on a criteria for one or more of smoothness, ringing, and blocking, e.g., based on variance of a high- pass filtered version of the time-domain signal). Figs.2a to 3b show different examples for modifying a time-domain signal 302i(e.g., time-domain prediction residual signal). Any encoder 10 and / or decoder 12 disclosed herein may be configured to perform a modification as described with reference to fig. 2a to 3b. The decoder 12 may be configured to decode 402 one or more deblocking parameters 400 from the datastream 16, perform deblocking post-processing by modifying the time-domain signal 302i(e.g., time-domain prediction residual signal) using the one or more deblocking parameters 400 to obtain a modifiedtime-domain (prediction residual) signal 302’i, and perform the correcting 308 the prediction signal64i using the modified time-domain (prediction residual) signal 302’i. Similarly, any encoder 10disclosed herein may be configured to determine and encode the one or more deblockingparameters 400 into the datastream 16.Fig. 2a shows a schematic view of samples 310 of a time-domain (prediction residual) signal 302i(e.g., for a temporal channel block 140i, e.g., any temporal block 140 described herein) before and after modification using one or more deblocking parameters α, ^. In the example shown infig. 2a, a total of two deblocking parameters α, ^ are used, wherein both deblocking parametersα, ^ are derived from the data stream 16 (e.g., explicitly signaled or indirectly derivable fromsignaled information pertaining to the deblocking parameters α, ^ such as an index for a look-uptable in which the deblocking parameters can be identified using the index). However, any othernumber of deblocking parameters may be used. Furthermore, one or more deblocking parameters(e.g., in form of a further deblocking parameter) may be derivable from previously coded samplesFH250105PCT-2025007739.DOCXfe310 (e.g., instead of being derived directly from the data stream 16) as will be described furtherbelow (e.g., with reference to fig. 3a, b).In fig. 2a, a horizontal axis t corresponds to a time axis and vertical axis A corresponds to an amplitude of samples values 314 of samples 310. Furthermore, an exemplary time-domain(prediction residual) signal 302i with 16 samples 310 is used. However, the time-domain(prediction residual) signal 302i may have any other number of samples 310. In the followingexamples, it is assumed that a sample value 314 is arranged in a middle (or center) of a timespan of the corresponding sample 310. However, any other temporal position of sample values 314 (e.g., at the beginning, end, or anywhere in between) within the time span of corresponding samples 310 may be used instead.The deblocking parameters α, ^ (see also reference sign 400) define a linear function 320a,wherein α defines a vertical offset (e.g., for example a function value for t = 0) and ^ defines aslope. The linear function 320a may be determined (e.g., by the encoder 10) based on a simplelinear regression of the 16 samples 310 of the time-domain (prediction residual) signal 302i (e.g.,based on a mean µix of a number of samples (e.g., N) of the temporal block 140i and a mean µres of sample values of the time-domain signal 302i). However, any other linear regression and number of samples 310 may be used instead. The linear function 320a may form (or form a basis for) a blocking-and-ringing-artefact-reducing function 322, which allows modifying the time-domain (prediction residual) signal 302i.In the example shown in fig. 2a, a modified time-domain (prediction residual) signal 302’i, isobtained by subtracting the blocking-and-ringing-artefact-reducing function 322 from the time-domain signal 302’i (or any other combination or linear combination). For example, thesubstratction may be performed sample-wise between a sample 310 and a correction value ofthe blocking-and-ringing-artefact-reducing function 322 at a sample position of the correspondingsample 310. Since the blocking-and-ringing-artefact-reducing function 322 can be defined by thedeblocking parameters α, ^, the the deblocking parameters α, ^ may need to be signaled in orderto obtain the modified time-domain (prediction residual) signal 302’i. Due to the modification, themodified time-domain (prediction residual) signal 302’i may have reduces sample values at theend and the beginning, which may reduce blocking and ringing artefacts. Values of the blocking-and-ringing-artefact-reducing function 322 at a (e.g., temporally) first and last sample 310 of thetime-domain (prediction residual) signal 302i may be referred to as anchor values or anchorparameters (e.g., starting anchor value for a left-most sample (e.g., sample index i = 0) and ending FH250105PCT-2025007739.DOCXfe anchor value for a right-most sample (e.g., sample index i = N-1) of the time-domain (predictionresidual) signal 302i.Fig. 2b shows a schematic view of samples 310 of a time-domain (prediction residual) signal 302ihaving a cosine-like shape before and after modification using one or more deblockingparameters α, ^. One or both deblocking parameters α, ^ may be derived from the data stream16, and the deblocking parameters α, ^may be used to define a half-cosine angular function 320b (e.g., a cosine function extending half a period, e.g., or any other trigonometric half-wave function). Generally, the one or more deblocking parameters 400 may define a trigonometric half-wave function parametrized by a half-wave offset (e.g., α) and an half-wave amplitude (e.g., ^).The half-cosine angular function 320b may be defined as α +^cos(i*^ / N). For example, α maydefine a half-wave offset (e.g., defining a vertical offset) and ^ may define a half-wave amplitude(e.g., a scalar to be multiplied with a cosine function). However, any other number of deblocking parameters and any other way to parametrize a trigonometric function may be used instead. The half-cosine angular function 320b may form (or form a basis for) a blocking-and-ringing-artefact-reducing function 322, which allows modifying the time-domain (prediction residual) signal 302i.Similarly as described above, a modified time-domain (prediction residual) signal 302’i, may beobtained by subtracting the blocking-and-ringing-artefact-reducing function 322 from the time- domain signal 302’i(or any other combination of linear combination). The encoder 10 and decoder 12 may be configured to determine only one type of blocking-and-ringing-artefact-reducing function 322 (e.g., only a linear function 320a or only a trigonometrichalf-wave function 320b), in which case, a signalling of a type of a blocking-and-ringing-artefact-reducing function 322 may not be required. Alternatively, the encoder 10 and decoder 12 may beconfigured to determine more than one type of blocking-and-ringing-artefact-reducing function 322, in which case, the encoder 10 may be configured to decoder an indicator (e.g., an index orflag), for indicating the type of the blocking-and-ringing-artefact-reducing function 322 to be used.For example, the encoder 10 may be configured to test (or simulate) more than one (e.g., all)types of blocking-and-ringing-artefact-reducing function 322 for a time-domain (predictionresidual) signal 302i, select one type (e.g., based on one or more of detection of ringing artefacts,distortion, and a variance measure of the modified time-domain signal 302’i). The encoder 10 maysubsequently encode an identifier of the type of blocking-and-ringing-artefact-reducing function322 and one or more deblocking parameters 400.FH250105PCT-2025007739.DOCXfeAs has been shown exemplarily above, both deblocking parameters 400 may be derived orobtained from the data stream 16. However, at least one further deblocking parameter may be derived from previously coded samples. The decoder 12 may be configured to derive a further deblocking parameter based on already coded samples of the digital time-varying signal (e.g., based on one, two, three, or more samples that immediately precede the respective transform- coded temporal block 140i, e.g., within the same channel). Fig. 3a, b show examples a schematic view of sample modification using a further deblocking parameter 400b, α derived from previously coded samples 310. The decoder 12 may be configured to determine a further deblocking parameter based on the prediction signal 64i (e.g., a left-most or temporally earliest sample thereof) of the respective transform-coded temporal block 140iand one or more already coded samples of the digital time- varying signal (e.g., based on one, two, three, or more already coded samples that immediately precede the respective transform-coded temporal block 140i, e.g., within the same channel, e.g., without decoding the futher deblocking parameter 400b from the data stream 16), and performthe deblocking post-processing by modifying 404 the time-domain (prediction residual) signal 302iusing the one or more deblocking parameters 400a (e.g., exactly one deblocking parameter) and the further deblocking parameter 400b (e.g., exactly one further deblocking parameter) to obtainthe modified time-domain signal 302’i).The decoder 12 may be configured to determine an extension of the prediction signal 64i (e.g., ina direction towards the one or more already coded samples, e.g., towards earlier samples within the time-domain) of the digital time-varying signal (e.g., a linear extrapolation, e.g., an extension or expansion of the prediction signal 64i by additional samples temporally preceding the original prediction signal 64i). The decoder 12 may further be configured to combine (e.g., linearly combine, e.g., perform a subtraction between) the extension of the prediction signal 64i and the one or more already coded samples of the digital time-varying signal in order to obtain a modifiedversion of the one or more already coded samples, and to determine the further deblockingparameter 400b based on an extrapolation (e.g., a linear extrapolation) of the modified version of the one or more already coded samples (e.g., determine the further deblocking parameter 400bbased on a value of the extrapolation at a temporally first sample of the prediction signal 64i). Forexample, the modified version of the one or more already coded samples may be or may be basedon the one or more already coded samples of the digital time-varying signal, from which, sample- wise, the extension of the prediction signal 64i has been subtracted. FH250105PCT-2025007739.DOCXfeThe decoder 12 may be configured to determine an extrapolation of a plurality (e.g., three, four,five, or more) of already coded samples that (e.g., immediately, e.g., temporally) precede therespective transform coded temporal block 140i (e.g., a linear extrapolation), and determine thefurther deblocking parameter 400b based on the extrapolation of the plurality of already codedsamples and the prediction signal 64i (e.g., a temporally first sample of the prediction signal 64 i,e.g., based on a difference between the extrapolation and a value of the temporally first sample). In other words, the prediction signal may be extended towards the previously coded samples and modified based on said previously coded samples or may extend the previously coded samples towards the prediction signal and modify the extension based on the prediction signal. However, other approaches may be used in order to determine a modified extension or extrapolation (e.g., using a combination of both approaches). The further deblocking parameter 400b may be determined as (or based on) a value of the modified extension or extrapolation at a temporally first (or leftmost) sample of the temporal block 140 (or of the prediction signal 64i), e.g., at a center position of the sample or at a sub-pel offset (e.g., half or quarter sample) in a temporal forward or backwards direction.The blocking-and-ringing-artefact-reducing function may be defined by the one or moredeblocking parameters 400a (e.g., by exactly one deblocking parameter, e.g., ^) and by the further deblocking parameter 400b (e.g., by exactly one further deblocking parameter, e.g., α).The further deblocking parameter 400b and the one or more deblocking parameters 400a maydefine a linear function 320a (e.g., wherein the further deblocking parameter 400b defines a vertical offset of the linear function 320a, e.g., wherein the linear function 320a is also defined by the one or more deblocking parameters 400a).Fig. 3a shows a schematic view of samples 310 of a time-domain (prediction residual) signal 302ibefore and after modification using a deblocking parameter 400a, ^ derived from the data stream16, and a further deblocking parameter 400b, α derived from previously coded samples 310 and the prediction signal 64i. In one embodiment, the decoder 12 is configured to determine an extension 65i of the prediction signal 64i (e.g., in a direction towards the one or more already coded samples, e.g., towards earlier samples within the time-domain) of the digital time-varying signal. The extension 65imaybe formed by (or on a basis of) a linear extrapolation of the prediction signal 64i (e.g., a regressiveFH250105PCT-2025007739.DOCXfe linear extrapolation). Alternatively, the extension 65i may be formed by (or on a basis of) adding further already coded samples temporally preceding the original prediction signal 64i(e.g., increasing the length of the prediction signal 64i from 16 samples to 20 samples). The decoder 12 may further be configured to combine (e.g., linearly combine, e.g., perform a sample-wise subtraction between) the extension of the prediction signal 64i and the one or more already coded samples (e.g., four samples in the example shown in fig.3a) of the digital time-varying signal in order to obtain a modified version 67i of the one or more already coded samples (e.g., by sample- wise subtracting four samples of the extension 65i from four immediately preceding already coded samples). The decoder 12 may further be configured to perform the deblocking post-processing by modifying 404 the time-domain signal 302i using the one or more deblocking parameters 400a (e.g., exactly one deblocking parameter as shown in fig.3a) and the further deblocking parameter 400b (e.g., exactly one further deblocking parameter as shown in fig. 3a) to obtain the modifiedtime-domain (prediction residual) signal 302’i. For example, the encoder 12 may be configured toperform an extrapolation of the (e.g., four) samples of the modified version 67i of the one or more already coded samples. The extrapolation can subsequently be used to determine the further deblocking parameter 400b, for example, in form of a left anchor parameter, by determining a value of the extrapolation the beginning of the respective transform-coded temporal block 140i. The beginning may depend on a coordinate system for the linear function 320a. For example, if the linear function 320a is defined according to α+^t, then α may be determined (or approximated) by using the time t = 0 of the coordinate system of said linear equation in the extrapolation of the modified version 67i. The approach described above is one of many ways to determine (or estimate) the further deblocking parameter 400b. In a simpler version, the further deblocking parameter α may be determined based on a difference between a sample value of a sample 310 immediately preceding a first (e.g., temporally first) sample 310 of the temporal block 140 to be decoded and a first sample of the prediction signal 64i (e.g., if the temporal block 140 to be decoded has N samples indexed by sample index i = 0 to N-1, a difference between already decoded sample atsample index i = -1 and a sample of the prediction signal 64i at i = 0). In another example, thefurther deblocking parameter α may be derived using an extrapolation (e.g., linear regressiveextrapolation) of samples of a plurality (e.g., two, three, four, five, or more) samples 310 thatimmediately precede (e.g., with sample index i = -4 to -1) the respective transform coded temporalblock (140i), wherein the further deblocking parameter ^ is determined based on a differencebetween a value of the extrapolation at a temporal position of the a first sample of the prediction signal 64i on the one hand and a sample value of the first sample of the prediction signal 64i on FH250105PCT-2025007739.DOCXfe the other hand. In a different example, the deblocking parameter α may be determined based ona central tendency (e.g., an average, weighted average, or median) of a plurality of previouslycoded samples 310 (e.g., immediately preceding samples 310). The further deblocking parameter400b may be determined to minimize an (e.g., absolute) value of a (e.g., temporally) first sampleof the modified time-domain (prediction residual) signal 302’i (e.g., reduce the value to zero orclose to zero, e.g., reduce an absolute value by more than 75%, 90% or 95%). Samples valuesof zero may be assumed for the already coded samples of the digital time-varying signal, if noalready coded samples of the digital time-varying signal are available (e.g., at the start of a coding procedure, e.g., due to restriction in coding dependencies, for example, when coding in a randomaccess manner independent from previous temporal blocks 30).Since deblocking can be realized by reducing the residual signal (or rather the modified version 302’ithereof) to zero or close to zero, which can effectively be obtained by removing a value of the residual, which, in turn, can be estimated based on previously decoded samples. In other words, the similarity in sample values in the vicinity of already decoded samples can be exploitedfor determining the further deblocking parameter. Therefore, transmission of the furtherdeblocking parameter α may be omitted, which may improve coding efficiency. For example, onlythe deblocking parameter ^ may be (e.g., directly or indirectly) transmitted in the data stream 16,whereas the deblocking parameter α may not be transmitted and instead be derived based on previously coded samples 130. It is noted that any other number of previously decoded samples 130 (e.g., two, three, five, six, or more) may be used to derive the further deblocking parameter α. The further deblocking parameter 400b and the one or more deblocking parameters 400a maydefine a trigonometric half-wave function 320b (e.g., cosine or sine half-wave function)parametrized by a half-wave offset and an half-wave amplitude (e.g., wherein the further deblocking parameter 400b defines a scaling factor for an amplitude of the trigonometric half-wave function 320b, e.g., wherein the trigonometric half-wave function 320b is also defined bythe one or more deblocking parameters 400a).Fig. 3b shows a schematic view of samples 310 of a time-domain (prediction residual) signal 302ihaving a cosine-like shape before and after modification using a deblocking parameter α derivedfrom the data stream 16, and a further deblocking parameter ^ derived from previously codedsamples 310. The deblocking parameter ^ may be determined based on the prediction signal 64iand one or more immediately preceding (e.g., temporally, e.g., in the same channel) decoded FH250105PCT-2025007739.DOCXfesamples 310. For example, the deblocking parameter ^ may be determined based on anextrapolation of a modified version 67iof already coded samples or any other approach as described herein. For example, a received deblocking parameter α may vertically offset the half- cosine angular function 320b, which can be scaled so as to match at a leftmost sample (e.g., the first of the 16 samples of the time-domain signal 302i shown in fig.3b) a value derived from an extrapolation of a modified version 67iof already coded samples. The bitstream 16 may comprise one or more syntax elements (e.g., one or more flags) that indicate whether the deblocking parameters (and optionally the further deblocking parameters) define a linear function or a trigonometric function (e.g., half-cosine angular function). The bitstream 16 may comprise one or more syntax elements (e.g., one or more flags) that indicate whether a further syntax element is to be derived based on previously coded samples 40.Alternatively, the type of function and / or use of a further syntax element may be pre-configured.The decoder 12 may be configured to predict the respective transform-coded temporal block 140iusing a selected prediction mode out of a set of prediction modes to obtain a prediction signal 64i,wherein the modified time-domain signal 302’i may be a time-domain (prediction residual) signal.The decoder 12 may further be configured to use the time-domain (prediction residual) signal302’i, 302i-1 to correct 308 the prediction signal 64i-1 to reconstruct the transform-coded temporalblock 140i.The predetermined re-transformation (e.g. ^^^^^^ , see reference sign 306 in fig. 12) may be (orcomprises) an inverse discrete cosine transform or an inverse discrete sine transform.The predetermined re-transformation may be representable by a matrix multiplication between atransform matrix and a first vector whose components are formed by the coefficients 300i-1 (e.g.,wherein the first vector has a length corresponding to a number of coefficients 300-1), wherein anoutput vector resulting from the matrix multiplication may have as many components as samples310 comprised by the time-domain (prediction residual) signal 302i-1. For example, the transformmatrix may comprise a number of rows that is equal to (or smaller) than a number of samples of the temporal block 140 to be decoded. The transform matrix may comprise a number of columnsthat is equal to a number of coefficients 300i-1 of the transform-coded temporal block 140i-1. Thedifferent transform matrix may be provided, for example, for DCT or DST. The matrix may optionally depend on block length and / or quantization step size. FH250105PCT-2025007739.DOCXfe The transform domain may result from the time domain according to a predeterminedtransformation (e.g., ^^^^, e.g., performed by the encoder 10), wherein the decoder 12 may beconfigured to select the predetermined transformation out of a set of transformations (e.g. to select the predetermined re-transformation out of a set of re-transformations, e.g., select the transformation matrix), wherein the re-transformation reverses the predetermined transformation (e.g.,= 1). One or more of the predetermined transformation, the predetermined re-transformation, and a prediction mode (e.g., indicative of the predetermined transformation and / or predetermined re-transformation, e.g., or at least indicative of a subset of said (re-) transformation).The decoder 12 may be configured to select the set of transformations out of a superset oftransformations (e.g. to select the set of re-transformations out of a superset of re- transformations, e.g., select a set of transformation matrices out of a superset of transformationmatrices) depending on one or more of a length of the respective transform-coded temporal block140i, 140i-1 (e.g., a number of total transform coefficients 300i-1, e.g., a number of total non-zerotransform coefficients 300i-1), a length of the time domain temporal block 140 (e.g., N, e.g., numberof samples of the temporal block), and the selected prediction mode for the respective transform-coded temporal block 140i, 140i-1 (e.g., a DC prediction mode, a linear prediction mode, or anyother prediction mode disclosed herein). For example, a superset of prediction mode, maycomprise a DC prediction mode, a block-copy prediction mode, a cross-channel prediction mode, a bypass prediction mode, and one or more linear prediction modes. The decoder 12 may be configured to select for a length of the transform-coded temporal block exceeding a threshold (e.g., more than 64 samples or more than 64 transform coefficients, e.g., or any other number) aset of prediction modes comprising the DC prediction mode, a block-copy prediction mode, across-channel prediction mode, and a bypass prediction mode, but not the one or more linear prediction modes. In other words, the decoder 12 may be configured to select a set of only four prediction modes for a block size exceeding a pre-determined threshold.The set of transformations may comprise one or more of one or more discrete cosine transforms,one or more discrete sine transforms, and an identity transform. For example, the set oftransformations may comprise a first matrix that realizes a discrete cosine transforms, a second matrix that realizes a discrete sine transform, and a third matrix that realizes an identity transform (e.g., with a value of one on its diagonal, e.g., with values of zero at non-diagonal positions). FH250105PCT-2025007739.DOCXfeThe decoder 12 may be configured to skip the subjecting 306 the coefficients to the predeterminedre-transformation if the predetermined transformation is the identity transform. For example,transform coefficients 300i-1 may be used by as samples of the temporal block 140i-1, e.g., with optional padding with zeroes. The transform domain may result from the time domain according to a predeterminedtransformation (e.g., performed on the encoder side), wherein the predetermined transformationand the predetermined re-transformation are windowing free. For example, predeterminedtransformation and the predetermined re-transformation may not employ a window that extendsbeyond the samples of the temporal block 140i-1 or the transform coefficients 300i-1 of the transform-coded temporal block 140i-1. The predetermined transformation and the predeterminedre-transformation may employ a rectangular window that does not extend beyond the respectiveblock and employs no weighting against each other (e.g., a constant weight of one for every sample or transform coefficient).The transform domain (e.g., frequency domain) may result from the time domain according to apredetermined transformation, wherein the predetermined transformation may be a spectrallydecomposing transformation. For example, the predetermined transformation (e.g., and / or aninversion thereof in form of the re-transformation) may be or comprise one or more of a fouriertransform, a discrete fourier transform, a fast fourier transform, a short-time fourier transform, a wavelet transform, and a discrete cosine (or sine) transform.A sample rate of the digital time-varying signal 92 may be above, or equal to, a Nyquist rate ofthe transform domain. For each transform-coded temporal block, a number of the coefficients 300i-1may coincide with anumber of samples 312 of the respective transform-coded temporal block. For example, if atransform-coded temporal block as eight coefficients 300i-1, the temporal block (e.g., in the time domain) may also have eight samples (e.g., or the number of coefficients may be equal to or smaller than the number of samples).The time-domain signal 302’i, 302i-1 (e.g., time-domain prediction residual signal) may result fromthe subjecting 306 the coefficients 300i, 300i-1 of the respective transform-coded temporal block 140i-1to the predetermined re-transformation in a manner independent from a prediction residual signal 80 of temporally adjacent temporal blocks 140i, 140i-2, preceding and following the FH250105PCT-2025007739.DOCXfe respective transform-coded temporal block 140i-1. For example, some overlapping methods employ a transformation of coefficients of the currently coded temporal block with some (e.g., half) of the prediction residual 80 of a previously coded (e.g., 140i-2). However, the decoder 12 may be configured to subject 306 exclusively the coefficients 300i-1of the currently decoded transform-coded temporal block 140i-1 to the predetermined re-transformation.Transform domain may be a critically sampled transform domain. For example, the transformdomain may be sampled at a Nyquist rate, e.g., at twice a highest frequency of sample (e.g., within a temporal block or a more general set of samples such as temporal block 30).Basis functions of the predetermined re-transformation may be of a length coinciding with a lengthof the respective transform-coded temporal block 140i-1. For example, basis functions maycomprise a trigonometric function such as cosine or sine functions, wherein the length of the transform-coded temporal block may coincide with an integer multiple of half (or full) period ofsuch a cosine or sine function (e.g., cos( ^^· i), with a length N of coefficients and an index i forcosine functions that may form a basis for the basis functions).The set of prediction modes may comprise one or more of a DC prediction mode, one or morelinear prediction modes, a block-copy prediction mode, a cross-channel prediction mode, and a bypass prediction mode. According to the DC prediction mode, the prediction signal of the respective transform-codedtemporal block may be determined to be (and / or, for example, determined by) a constant functionwith a determination of a constant of the constant function based on predetermined alreadydecoded samples preceding the respective transform-coded temporal block. For example, the constant may be determined based on one or more of an average, sum, and weighted sum of the already decoded samples (and optionally a bias, e.g., for adapting to a rounding shift), e.g., immediately preceding samples, e.g., of K samples, wherein K is an integer number smaller than a number of already decoded samples (e.g., with K being pre-determined, e.g., with K being a power of two).According to the one or more linear prediction modes, the prediction signal of the respectivetransform-coded temporal block may be determined to be (and / or, for example, determined by) alinear function with a determination of at least one of a slope and an offset of the linear function based on predetermined already decoded samples preceding the respective transform-coded FH250105PCT-2025007739.DOCXfe temporal block. The offset may be determined based on one or more immediately precedingdecoded samples, e.g., based on an average or weighted sum. The offset may be determined asor based on a sample immediately preceding the temporal block to be decoded. The slope may be determined based on an extrapolation of immediately preceding samples (e.g., two already decoded samples immediately preceding the temporal block to be decoded). The slope determined from two or more preceding samples may be further modified, for example, reduced (e.g., by a factor of two or four). The one or more linear prediction modes may include one or more of a half-slope prediction and a quarters-lope prediction.According to the block-copy prediction mode, the prediction signal of the respective transform-coded temporal block may be predicted based on one or more reference block portions of alreadydecoded samples preceding the respective transform-coded temporal block offset relative to the respective transform-coded temporal block at a position signalled for the respective transform-coded temporal block in the data stream. The block-copy prediction mode may be restricted toreferencing only the same channel as the temporal block to be predicted (e.g., obtaining only one or more than one reference block portion). The block-copy prediction mode may reference (e.g.,perform a prediction based on a referenced block portion, e.g., obtain a reference block portion)more than one channel, e.g., wherein each of the more than one channels may be reference once (or more than once). The block-copy prediction may reference all available channels (e.g., within a set of channels between two random access coded channels). In case of referencing a single reference block portion, samples of the block portion may be copied (or referenced) with a weight of one (e.g., and / or smaller than one). In case of referencing more than one reference block portion, the reference block portions may (e.g., sample-wise) be subjected to a weighted sum (e.g., with equal weights or non-equal weights, e.g., with signalled weights).According to the cross-channel prediction mode, the prediction signal of the respective transform-coded temporal block may be predicted based on one or more reference coded channels out ofcoded channels which represent a multi-channel signal 14 coded into the data stream and to bedecoded from the data stream by the decoder 12, and one of which is represented by the digitaltime-varying signal 92.According to the bypass prediction mode, the prediction signal of the respective transform-codedtemporal block is set to zero. FH250105PCT-2025007739.DOCXfe The decoder 12 may be configured to select a prediction mode out of a set of prediction modes, wherein the set of prediction modes depends on a size of (or length or amount of or samples in)the temporal block to be decoded. For example, a first set of prediction modes may be providedfor a block size up to (or equal to) a size threshold and a second set of prediction modes may be provided for a block size larger than the size threshold. For example, a first set of predictionmodes may include the one or more linear prediction modes (e.g., include a half-slope predictionand a quarters-lope prediction modes) and a second set of prediction modes may not include theone or more linear prediction modes (e.g., not include the half-slope prediction and a quarters-lope prediction modes), wherein, for example the first set of prediction modes may be provided (or used) for blocks with a block size smaller than and equal to 64 samples and the second set of prediction modes may be provided for blocks with a size greater than 64 samples.The digital time-varying signal 92 may be obtained by at least one of Electrocardiography,Electroencephalography, Electromyography or seismic measurement, and / or wherein the digitaltime-varying signal 92 may be a bio-physiological waveform data such as anelectroencephalography (EEG) signal, an electrocardiogram (ECG), or an electromyography(EMG) signal, or is a seismic waveform signal. The digital time-varying signal 92 may be (orcomprise) a signal (e.g., electrogram) repetitive of (or based on a measurement of) electrophysiological activity, e.g., of a heart, brain, muscles, eyes, or cochlea. The digital time- varying signal 92 may be (or comprise) a signal (e.g., seismogram) repetitive of (or based on a measurement of) vibrations, shaking, or quaking of the ground.The decoder 12 may be configured to support different lengths (e.g., number of transformcoefficients 300, after which the transform coefficients 300 are only zero, e.g., a rank of a lastnon-zero coefficient of the transform-coded temporal block) of the transform-coded temporalblocks 140 and set a length of the transform-coded temporal blocks 140 according to a lengthparameter in the data stream 16. The length of the transform-coded temporal blocks 140 may becoded for every transform-coded temporal block 140, a set of transform-coded temporal blocks140 (e.g., every temporal block 30) or at the start of the digital time-varying signal 92. The decoder12 may be configured to assume a pre-determined length in case no length is signalled and / or to assume a first length (e.g., pre-determined or previously signalled) is to be used for temporal blocks 140 until a (new) second length is signalled. The decoder 12 may be configured to support different lengths of the transform-coded temporal blocks and switch between the different lengths of the transform-coded temporal blocks at FH250105PCT-2025007739.DOCXfe predetermined borders between consecutive temporal blocks according to a length parameter inthe data stream. For example, predetermined borders may be arranged (e.g., signalled) betweeneach temporal block or between sets of temporal blocks (e.g., after each temporal block 30, e.g., before a temporal block that is coded in a random access manner). The following section may be titled “Perceptual coding and decoding of biomedical, seismic, and related waveform signals”Two-dimensional (e.g., with time as one dimension and amplitude as second dimension)waveform signals such as those recorded in, e. g., seismic, biomedical or sonar contexts areusually, when stored or transmitted in a digital representation, coded losslessly. However, lossycoding may be desirable as well in some situations, especially when an objective is to reduce thebit-rate required for the single- or multi-channel waveform signals in question. Such lossy codingmay typically involve the use of time-frequency transforms (on encoder side, e.g., transformation)and frequency-time (i. e., inverse) transforms (on decoder side, e.g., re-transformation), appliedon a block level (e.g., for one, or more, or each temporal block 140), to maximize the coding gainand / or to allow for perceptually optimized encoding. Shortcoming of Traditional Transform Coding One drawback of the usage of forward and inverse block transforms in lossy waveform coding isthe occurrence of blocking or ringing artefacts, e.g., after relatively coarse requantization of thetransform coefficients, related to Gibbs’ phenomenon (a detailed explanation of which is given athttps: / / en.wikipedia.org / wiki / Gibbs_phenomenon). Such artefacts may be perceived in somesignals, e.g., even when a waveform block-signal subjected to a transformation is a residual of aprediction operation (e.g., residual signal), e.g., a sample-wise difference signal between anoriginal waveform block and a prediction block (e.g., usually constructed from previously decodedand reconstructed waveform parts), wherein, for example, the prediction block may be of the samesize as the original waveform block. Conventional Solutions and Their DrawbacksThere are, for example two frequently employed algorithms (or approaches) to address the issueof blocking and ringing in lossy media coding. For the first algorithm, an application of lappedFH250105PCT-2025007739.DOCXfe transforms such as the type-IV modified discrete cosine transform (MDCT) and its inversecounterpart (IMDCT), results in overlap among the frame signals and, thereby, for example,increased encoder / decoder (codec) delay and waveform reconstruction complexity, e.g., especially at the beginning of a waveform and / or between two successive but independently coded waveforms (see also https: / / en.wikipedia.org / wiki / Gapless_playback). In addition, thecombination of lapped transforms and predictive coding (i. e., lapped transformation of predictionresidual block-signals) may be complicated and, e.g., only feasible in restricted form: theprediction signal must be extended in time (size) to also cover the transform overlap range. The second algorithm to reduce blocking artefacts, employed in many image and video codecs,is a deblocking post-filter, e.g., applied after inverse transformation (e.g., re-transformation) andpicture reconstruction. This solution may work well on multi-dimensional (time-space-amplitude)natural image and video data, e.g., captured by digital cameras but may exhibit two keyshortcomings which may reduce its effectiveness on the abovementioned two-dimensionalwaveform data as well as possibly on music or speech signals:^ Deblocking may not scale well towards lossless or, in some cases, even perceptually transparent (e.g., near-lossless) coding since it generally operates “blindly” on the decoded and reconstructed signal samples and may be unable to distinguish between blocking artefacts and actual input data, hence potentially altering–and distorting– a near-lossless decoding.^ Deblocking may not work well on waveform input with highly variant sample statistics, e.g.,signals which are more fluctuating, or non-stationary, than still images or video sequences. On such signals, there may be either too little deblocking being applied, or the deblockingitself may result in additional reconstruction artefacts. Evidently, both situations areundesirable. Summary of the Inventive (De)coding Solution In the following, a method and an apparatus are described which allow for transform encoding and corresponding decoding with optional predictive coding techniques but without transform overlap, allowing for a straightforward codec architecture and minimal risk of gapless playbackissues, i. e., of wrong reconstructions especially in the first and last frames in a coded bitstream.The invention comprises two aspects, which may be used individually or in combination. The first FH250105PCT-2025007739.DOCXfeaspect is the use of a specific non-overlapping block transform (in the encoder) andcorresponding non-overlapping block inverse transform (in the decoder), for example, appliedonto the residual (e.g., sample-wise result) of at least one predictive coding operation (or anyother temporal signal, e.g., without prediction), in the encoding and decoding, e.g., of abiomedical, seismic, or acoustic signal. In other words, due to said absence of inter-transformoverlap, no temporal windowing and time-domain aliasing (TDA) (e.g., another frequently usedterm for the TDA operation is “folding” or “folding-in”; analogously, the TDAC operation may also be called “folding-out”) operations, as commonly utilized in audio codecs, may need to beperformed. Said specific non-overlapping block transform may be, for example, a discrete cosineor sine transform, preferably a type-II DCT (also called DCT-2) or DST (also called DST-2) orresp. inverse counterpart thereof. It is noted that such DCTs and DSTs may be used in the AC-2audio coding standard, but with transform overlap and no predictor (see https: / / ccrma.stanford.edu / ~jos / Compression / Compression.pdf).The second aspect is the utilization of a guided deblocking operation (e.g., perform deblockingpost-processing) in said encoding and / or decoding, e.g., of a biomedical, seismic, or acousticsignal, applied, e.g., in a “forward” fashion before, e.g., forming a to-be-quantized residual blocktransform coefficients (in the encoder), e.g., according to aspect 1 (e.g., non-overlappingtransform), and in a corresponding “inverse” fashion during transform coefficient reconstruction(in the decoder). A guided deblocking operation comprises, for example, the transmission (e.g.,signaling) of one or two deblocking parameters (or more deblocking parmaters) per transformblock, for example, preferably in a quantized form. Said one or more deblocking parameters maybe, for example, converted into an offset and a slope (e.g., for a linear function) or curvature value(e.g., for a trigonometric function), from which, for example, a sample-wise monotonicallyincreasing or decreasing corrective function may be determined and, subsequently, forexample, applied equally to the initial residual block samples in the encoder (e.g., via sub-traction)as well as the reconstructed residual block samples in the decoder (e. g., via addition).Detailed Description of Aspect 1: ArchitectureFig. 4 depicts a block diagram of a typical linear predictive coding (LPC) based lossless audioencoder [1]. Here, the block-wise prediction residual is, for example, not time-frequencytransformed or re- quantized so as to achieve lossless compression, e.g., perfect signalreconstruction during the decoding process. It is noted that the 'Predictor' (e.g., short-term & long-term predictor(s)) block may represent one or more (e.g., in the latter case cascaded or combined)FH250105PCT-2025007739.DOCXfeshort-term, long-term, or cross-channel prediction signal generators. To be specific, such apredictor may be, e.g., a short-term predictor (also called LPC predictor) utilizing (previous)samples in the near past; or, e.g., a long-term predictor (also called LTP) or, equivalently in videocoding, motion compensation, e.g., utilizing a block of (previous) samples in a more distant past;or, e.g., in case of multi-channel signals, a cross-channel or cross-component predictor, using(current or previous) samples in at least one other channel or component of the encoded signal.Fig. 5a shows a schematic view of an encoding procedure for encoding a digital time-varyingsignal. Fig. 5a illustrates how, according to the present description, the block diagram of Fig.4may be inventively extended, e.g., to enable lossy and, optionally, perceptually optimizedcompression. In the encoder shown in Fig. 5a, three further operational blocks may be present inthe residual signal path: ^a deblocking pre-process altering the to-be-transformed region of the residual signal ina way that, when reverting the alteration at the decoder side (e.g., by performingdeblocking post-processing), may minimize subsequent blocking or ringing artefacts, e.g.,caused by a following transform-domain quantization operation (see below); details of thisinventive deblocking procedure are described in the next section (as well as above). It isnoted that this deblocking procedure may employ one or more parameters (e.g.,deblocking parameters), e.g., two parameters which, as will be discussed in the nextsection, may be signaled in different but, e.g., equivalent mathematical representations.Exemplarily signaled parameters of this coding step: 2 deblocking parameters (offset, slope / curvature) (e.g., or any other amount of deblocking parameters).^ a forward transform (e.g., a predetermined transformation) applying, e.g., time-to-frequency (T-F) transformation using, as introduced earlier, a non-overlapping, e.g., non-windowed transform such as, preferably, e.g., a DCT-2 or DST-2. More specifically, thenon-overlapping condition means that the transformed region of a residual signal (e.g., theresidual block, e.g., a time-domain signal 302i) may not overlap with a past or a future transformed region (e.g., not overlap with a preceding or subsequent temporal block 140i-1, 140i+1) of, e.g., a residual signal (e.g., time-domain signal 302i) within the same channelor component. The (optional) non-windowed condition, on the other hand, means that nowindow function may need to be applied (e. g., multiplied) to the residual block data (e.g.,time-domain signal), e.g., before the transformation or after an inverse transformation,e.g., an implicit rectangular window may be assumed during both forward and inversetransformation. Exemplarily signaled parameters of this coding step: 1 transform typeFH250105PCT-2025007739.DOCXfe parameter (DCT-2 / 4 or DST-2 / 7). ^a (e.g., optional) quantization process, enabling re-quantization of the transformedresidual samples, e.g., remapping of the transform coefficient values to a smaller set ofquantization indices, e.g., so as to achieve a bit-rate reduction during, e.g., entropy coding(or any other coding) and transmission. This quantizer may be, for example, a scalar linearor nonlinear quantizer, for example, with a quantization step-size, or a vector quantizer.Moreover, additive (e.g., encoder-only) or subtractive dithering may be used in thequantization. Exemplarily signaled parameter of this coding step: block-wise quantizationparameter (QP or delta-QP).Fig.5b shows an example of a decoding procedure for decoding a digital time-varying signal, e.g., a digital time-varying signal encoded by the encoding procedure shown in fig. 5a. The corresponding decoder, illustrated in Fig.5b, contains three equivalent operational blocks in reversesignal processing order. Specifically, the (e.g., optional) quantization block may be complementedby a reconstructive scaling (e.g., also called “inverse quantization”) block, e.g., controlled by thesignaled block QP, the time-frequency (T-F) transform on the encoder side may be undone by afrequency-time (F-T) transform (also referred to as “inverse transform”, e.g., predetermined re-transformation), e.g., parameterized by a signaled transform type indicator, and, e.g., a deblockingpost-processor may revert the encoder-side deblocking pre-processing operation.Regarding the choice of short-term, long-term, or cross-channel predictor applied on the channelbefore (in the encoder) resp. after (in the decoder) the deblocking processing, it is noted that, in thepresent invention, the encoder may obtain, e.g., depending on e. g. rate-distortion (RD) optimizedsearch(es), a “most suitable“ prediction signal to be applied in the coding of a given channel signalblock of length, or size, N. In order to be able to obtain and apply the same prediction signal on thedecoder side, the choice of prediction type may be signaled, e.g., on a block basis (e.g., for eachtemporal block 140 or a group of such temporal block 140, e.g., temporal block 30), in the bitstream via a, e. g., a 2-bit or 3-bit predictor index (e.g., depending on N, see below). For example, such anindex may convey that, e.g., in addition to (e.g., cascaded with) the LPC based short-term predictorknown from, e. g., the lossless codec of [1], exactly one out of a set of predictors supported for N(e.g., a set of allowed predictors may vary between different block sizes) is to be applied for thegiven block in both encoder and decoder. The inventive codec may provide, for example, in additionto said LPC predictor (or without an LPC predictor), the following predictors, implementational andmathematical details of each of which are provided on the following pages: FH250105PCT-2025007739.DOCXfe^ a direct current (DC) predictor, called “mean predictor” hereafter, e.g., calculating in fixed-point arithmetic the average of the last K samples (e.g., with a pre-determined value of K,a signaled value of K, or a value of K derivable from already decoded samples) beforethe start (1st sample) of the current block. Exemplarily signaled parameter of this predictor(optional): k used in averaging (e.g., 0,1.., 7, or larger), or k is fixed (e.g., predetermined)^ a bypass (i. e., disabled) predictor, e.g., which effectively turns off prediction, e.g., byzeroing the prediction signal; clearly, this predictor type may not need further parameters tobe signaled. ^a half-slope (straight-line) predictor, e.g., calculating as prediction signal a constantlyincreasing or decreasing straight line, e.g., whose slope may be determined from the lastfew samples (e.g., previously decoded samples that immediately precede the currentlycoded temporal block, e.g., a pre-determined amount and / or signaled amount of samples) before the start of the current block (e.g., and / or based on signaling). The half term meansthat the calculated slope is weighted by ½ (however, different weight values or weightingmay be possible, e.g., 3 / 4, 2 / 3, 1 / 2 or 1 / 3). Exemplarily signaled parameter of this predictor: e.g., none, the slope may be derived from past decoded samples^ a quarter-slope (straight-line)predictor, e.g., calculating a straight line, e.g., from the lastfew samples (e.g., previously decoded samples that immediately precede the currentlycoded temporal block, e.g., a pre-determined amount and / or signaled amount of samples) before the current block, as above. Unlike the half-slope predictor, the slope may be scaledby ¼. Exemplarily signaled parameter of this predictor: e.g., none, the slope may bederived from past decoded samples ^a block-copy (e.g., long-term) predictor, e.g., creating the prediction signal by copying asize-N part of past decoded signal parts, e.g., of the given channel and, optionally, scalingand / or filtering it. Exemplarily signaled parameters of this predictor: copy offset, (optional) weight and / or filtering parameters^ a cross-channel linear model predictor, e.g., calculating a least-squares optimized linearfit (e.g., or any other approach for determining similar already decoded temporal blocks) ofthe current block signal, e.g., from collocated samples of at least one other signal channel(e.g., possibly including, in both current and other channel(s), e.g., past samples before thecurrent block). Exemplarily signaled parameters of this predictor: one or more quantized linear model parameters, e.g., including offset parameter.Preferably, for one or more predictors (or prediction modes) such as the half-slope and quarter-slope predictors may not be allowed, e.g., in large blocks, e.g., when N > 64, e.g., for certain blockFH250105PCT-2025007739.DOCXfesizes or size ranges. In that case, for example, only four predictors (or any other set or combinationof predictors or prediction modes) may be supported (or enabled), and their choice can be signaledusing 2 instead of 3 bit (e.g., or only 1 bit in case of only two predictors being enabled). Fig.5csummarizes this aspect and the encoder-side prediction selection process. Fig. 5c shows a schematic view of an example for a set of prediction modes and a selection therefrom. In the example shown in fig 3c, six prediction modes (or predictors) are available in form of bypass prediction, DC prediction, half-slope prediction, quarter-slope prediction, block- copy prediction, and linear-model prediction, wherein, optionally, half-slope prediction, quarter- slope prediction may be restricted to properties of the current block to be decoded (e.g., a size ofthe block and / or a position of the block relative to random access points). The encoder 10 maybe configured to perform simulations or tests with one or more (e.g., all) prediction modes (e.g., which may be restricted depending on the currently coded block, e.g., by the block size) and perform a selection on which mode to use for the actual encoding based on a measure (e.g., cost) such as a rate-distortion measure (e.g., select the mode with the best or most optimized rate-distortion). The encoder 10 may subsequently signal a type indicator (e.g., indicating the selectedprediction modes, e.g., using one, two, or three bits, depending on an optional restriction for the prediction modes) and an encoded version of the residual signal (e.g., residual signal 80).For example, let ^[^ + 1], … , ^[^ + ^] denote the samples to be coded on the current block (e.g.,with samples x having each a value an original domain 26 or time domain, e.g., with N denoting a length or sample amount of the current block, e.g., temporal block 140, e.g., with M indicating an amount of previously decoded samples, e.g., of the sample channel, e.g., of the entire time-varying signal 92 or a subset thereof). Let ^[1], … , ^[^] denote the already reconstructed samples(e.g., in the original domain 26), which are located before the current samples in a temporal way (e.g., previously coded samples). In one embodiment of this invention, the following set ofprediction modes (but any other set of prediction modes may be used instead and the predictionmodes themselves may be realized differently), meaning methods to generate a prediction signal^^^^[1], … , ^^^^[^] for the samples ^[^ + 1], … , ^[^ + ^] out of some of the samples of^[1], … , ^[^] may be supported (e.g., based on a linear combination such as a subtraction, e.g.,sample-wise). •A DC- or mean-prediction mode. Here, for example, for a fixed integer ^ ≤ ^, e.g., with^ being an integral power of 2, ^ = 2^, one may put^^^^^^[^] FH250105PCT-2025007739.DOCXfe= (^[^]+... +^[^ − ^ + 1] + (1 << (^ − 1)) >> ^, 1 ≤ ^ ≤ ^.The operators „<<“ and „>>“ may indicate a logical bit shift to the left or right, e.g., wherein one shift of bits to the left (“<<”) functionally equates to a multiplication of two and one shift of bits to the right (“>>”) functionally equates to (an approximation of) a division by two. The number ^ (e.g., or K) may, for example, be signalled per block, e.g., per channel, persequence or per other temporal unit, or may be fixed to for example ^ = 0, ^ = 1, ^ = 2or to ^ = 4 (e.g., or any other integer). In one case, a maximum number for the value ^may exist and be taken into account in the binarization and entropy coding of ^. Forexample, this maximum number (e.g., a maximum number for k or K) may depend, forexample, on the blocksize ^ where an increase of ^ corresponds to a non-decrease (e.g.,the value staying constant or increasing with N, e.g., according to a step function) of themaximum number. In another case, the number ^ may be fixed to a specific value perblock-size ^ (e.g., a predetermined value, e.g. according to a pre-determined table orfunction). Here, in one case, the fixed numbers may be such that an increase of ^corresponds to a non-decrease of the maximum numbers (e.g., a maximum value for k orK).• A half-slope prediction mode (e.g., a linear prediction mode) generating the predictionsamples ^^^^^^[^], 1 ≤ ^ ≤ ^. Here, first, the slope ^ between ^^ and ^^^^ may becomputed as ^= ^[^] − ^[^ − 1]. (1)However, it is found that a straight-line prediction with slope ^ to generate a predictionsignal may typically yield prediction signals with too large input values, e.g., in particularat sample locations ^ far away from sample position 1. Thus, it is proposed optionally toscale down the slope, e.g., ^ by the factor 0.5 and to thus put^^^: = (^ + 1) >> 1and then define ^^^^^^[^]: = ^[^] + ^ ⋅ ^^^, 1 ≤ ^ ≤ ^.The half-slope may further define an offset or bias.• A quarter-slope prediction mode (e.g., a linear prediction mode) may generate theprediction samples ^^^^^^[^], 1 ≤ ^ ≤ ^ in a similar way as for the half-slope mode, e.g.,again with the reasoning of optionally scaling down the full slope. Thus, if the slope ^ maybe defined as in (1) above, one may putFH250105PCT-2025007739.DOCXfe and ^^^^^^[^]: = ^[^] + ^ ⋅ ^^^ , 1 ≤ ^ ≤ ^.• A prediction mode which bypasses the prediction (e.g., a bypass prediction mode), andgenerates the zero-prediction signal may be defined as follows:^^^^^^^^[^]: = 0, 1 ≤ ^ ≤ ^.• A prediction method (e.g., cross-channel prediction mode) by which, for example, basedon one or more temporal offsets ^^ , … , ^^ (e.g., with k indicating an amount of predictors orblocks to be used to generat prediction signal, e.g., k = 2 for generating a prediction signal using two previously coded temporal blocks, e.g., temporal offsets 2481 and / or 2482) that may be signalled in the data-stream, a temporal-offset prediction signal ^^^^^^ may begenerated out of the reconstructed samples ⋮ [^[^ − ^ − ^^ + 1], ^[^ − ^ − ^^ + 2], … , ^[^ − ^ − ^^ + ^]],possibly by applying multiple signal processing operations to these sets of reconstructed samples, for example a filtering operation. In one possible case, only one offset ^^(e.g., k =1) is signalled and the prediction is generated as In another possible case, two offsets (e.g., k = 2) are signalled and the prediction isgenerated as ^^^^^^[^] = (^[^ − ^ − ^^ + ^] + ^[^ − ^ − ^^ + ^] + 1) >> 2, 1 ≤ ^ ≤ ^.In possible cases, the temporal offsets may also have non-integral values, for example avalue-range in a half-pel resolution (or other fractions of a sample length). Here, for atemporal offset ^ + 1 / 2, interpolation filtering operations may be applied in order togenerate interpolated reconstructed samples ^[^ − ^ − ^ + 1 / 2 + ^].• For the case that the whole signal contains multiple channels (e.g., the sample shown infig. 8 has 32 channels), where the samples ^[^] (e.g., samples to be coded of a firstchannel) and ^[^] (e.g., samples already coded of the first channel) belong to one of thesechannels and where by ^^[^], sample values shall be denoted that belong to a channel ^ which is different (e.g., samples of a second channel that is different from a first channel)from the channel to which the samples ^[^], ^[^] belong:FH250105PCT-2025007739.DOCXfeA prediction method my be used by which, based on one or more channel indices ^^, … , ^^and temporal offsets ^^, … , which, optionally together with the (e.g., predetermined orsignaled) value ^, may be signalled in the data-stream, and based on values … , ^^, ^which might, for example, be signalled in the data stream or derived out of alreadyreconstructed samples, the prediction signal may be generated as Here ^^^[^ − ^^ + ^] denotes a reconstructed sample value of channel ^^ at position ^ −^^ + ^. For this prediction mode, it may be required that the reconstructed sample valuesin the channels ^^have already been coded respectively decoded up to the time instance ^− ^^ + ^.In one embodyment, it might be the case that the prediction methods to generate the predictionsignals ^^^^^^ and ^^^^^^ are not supported (e.g., not enabled) for large block-sizes. This is dueto the fact, for example, that generating a prediction signal that arises by generating a line withsome slope might yield extremely large or small sample values very far away from the block boundary where the line started and might thus not yield a suitable prediction. In anotherembodyment, a slope ^ shall be explicitly signalled, for example, as one option out of somepredefined set ^ of allowed slope values (e.g., as an index in a look-up table) or in a specifiedbinarization. Then, a prediction of the form ^^^^^[^]: = ^[^] + ^ ⋅ ^, 1 ≤ ^ ≤ ^.shall be supported. However, a slope may also be determined based on already coded samples for large blocks, wherein, as an option, a parameter may be signaled to modify (e.g., decrease) the determined slope. It shall be emphasized that the particular type of predictor chosen from the inventive set of six (or,for some N, four) types, as in Fig.5c, may be applied in addition to the prior- art sample-by-sampleLPC (linear predictive coding, e.g., in case of audio coding) based short-term predictor, whoseparameters (filter order and quantized coefficients) may be determined independently. In otherwords, the short- term LPC predictor may be, preferably, applied on the block residual signal ofsaid predictor which is chosen out of the inventive set, e.g., after the latter prediction has beenconducted in the encoder. This implies that, in the decoder, e.g., a LPC “synthesis” prediction maybe performed, e.g., before adding said prediction signal chosen out of the inventive set. Forexample. in the case of lossless coding of the given block, e. g., as signaled via QP = 0, theprocess may be straightforward since one or more steps of the quantization, transform, andFH250105PCT-2025007739.DOCXfedeblocking steps may be typically bypassed and disallowed. For example, during lossy coding, e.g., as indicated by QP > 0, a short-term LPC “synthesis” prediction may operate on quantized,and possibly transformed and deblocked, sample values and, thereby, e.g., may enable spectralnoise shaping (SNS), e.g., by filtering the reconstructed residual samples and the quantizationerror included therein. Fig. 6 illustrates an example of the detailed operation of this codingscenario in a block diagram. Of course, the LPC prediction may be a bypass prediction, e.g., itsfilter order may be 0.Fig. 6 shows an example of an encoder and decoder using LPC prediction. Any encoder anddecoder disclosed herein may comprise any feature disclosed with reference to fig.6. Regarding the choice of the transform type applied for a given (residual) signal block, the followingaspects shall be noted. First, not all four transform types mentioned (i. e. DCT-2, DCT-4, DST-2,DST-7) may necessarily be allowed at all block sizes. Specifically, e.g., the DST-7 transformationmay be disabled for large block sizes N and, for example, either the signalling of a transform typeindex (e.g., for a look-up table of transform types or transform functions) may be adjustedaccordingly for said N or, for example, the DST-7 may be replaced by a DST-4 kernel (or otherkernels) during transformation. Second, as with (optional) prediction, the different transformationvariants may, for example, be evaluated, e.g. in an RD optimization framework, during blockencoding, and the “best” transform type selected, and signalled with a sufficient number of bits (here, 2 bit for 3–4 choices) according to the results of this RD evaluation.It is noted that the identity transform (e.g., a factual absence of any forward or inverse transform)may be included as an option in a set of allowed transform type parameters that can be signaled.In that case, the (optional) coefficient quantizer may operate in the time instead of frequencydomain. Analogously, it may be beneficial to support, for example, the signaling of both “zero”offset and / or “zero” slope or curvature as deblocking parameters, as a means to disable or bypassthe deblocking feature. To conclude this section, it is noted that an additional, optional frequency-domain prediction(FDP) filtering may be used, for example, between the quantization and (forward or inverse)transform steps in order to allow for sophisticated perceptual optimization of the waveform compression process [2], as indicated in Fig. 5a (see between quantization and T-F transform) and 3b (see between reconstruc. Scaling and F-T transform). Such frequency-domain prediction, FH250105PCT-2025007739.DOCXfewhich may be typically realized through pre- and post-filtering, may be used, for example, in audiocoding. For example, such frequency-domain prediction may operate in an open- loop fashion(with FIR, finite impulse response, filtering prior to quantization on the encoder side andcorresponding IIR, infinite impulse response, filtering after quantization on the decoder side) and,as such, may allow for temporal shaping of the quantization distortion. For this reason, the processis also called temporal noise shaping (TNS), in analogy to the spectral noise shaping (SNS) whichmay be realized, for example, by way of the LPC based time-domain prediction filtering. Due toan input signal dependence (e.g., in the TNS filter coefficients) of the frequency domain predictor,a combination of time-frequency transformation and TNS is sometimes referred to as a temporallysignal adaptive transform, and, for example, by realizing that LPC based SNS is inputdependent (in the LPC coefficients) as well, one can argue that TNS enhanced time-frequency transformation with LPC based SNS may represent a spectro-temporally signal adaptive transform. Such enhanced transforms are perfectly suited for perceptual coding. Detailed Description of Aspect 2: Deblocking It is noted that the aspect 1 (“architecture”) described above is not an alternative of the aspect (“deblocking”) described herein. Instead, both aspects can be applied in isolation as well as in any combination.Fig. 6 illustrates an example of the encoder- and decoder-side operation of the inventiveparameter guided deblocking pre- and post-processing. A “forward” (e.g., transformation fromtime domain to frequency domain) pre-processor may modify the input block or, in a preferredembodiment, residual block signal resi (e.g., residual signal 80) by, preferably, subtracting a resultof a so-called corrective function cori, for example, evaluated at the individual sample locations iof said residual block signal res. The intention (or a target to approach) here is to, among severalpossible objectives, reach zero crossing (e.g., reduce a chance of a value to cross a level of zero)of a resulting corrected residual block signal res’, e.g., at both the starting and the ending samplesof the block region. Such “tapering” of the corrected residual waveform towards zero at both blockboundaries may reduce spectral leakage during a following time-frequency transformation (or, inother words, increases spectral compaction) and, thus, may significantly reduce blocking andringing artefacts when, for example, the transform coefficients (e.g., frequency samples) arerequantized. Depending on block sample characteristics, an alternative (or additional) intention ofsaid correction may be to minimize, instead of the above-noted discontinuities at the block FH250105PCT-2025007739.DOCXfeboundaries, an overall tilt (e.g., a bias or increase towards higher frequencies) in res, where saidtilt can, e. g., be determined by linear regression (linear-model) analysis [3].At the decoder side, an “inverse” (e.g., transformation from frequency domain to time domain) ofa deblocking pre-processor, e.g.,, the corresponding post- processor, undoes the above-described modification by, preferably, adding the (identical) result of the corrective function cori,e.g., again evaluated at the same sample locations i, e.g., to the quantized and reconstructed,previously corrected residual block signal res’Q. To be specific, the cor signal used at the encoderside to obtain res’ may be identical to the cor signal used during decoding to recover, from res’Q,the reconstructed uncorrected residual block signal resQ, which can now, for example, besubjected to inverse transformation (and optionally inverse TNS filtering) and inverse prediction.In order for this requirement to be feasible, the parameters of the corrective function cor may needto be signaled (e.g., coded and transmitted) from the encoder to the decoder,preferably as follows(but not limited thereto). The decoder may be configured to decode one or more deblocking parameters from the datastream, perform deblocking post-processing (e.g., using a deblocking function) by modifying thetime-domain (e.g., prediction residual) signal using the one or more deblocking parameters toobtain a modified time-domain (e.g., prediction residual) signal, perform the correcting theprediction signal using the modified time-domain (e.g., prediction residual) signal. The deblockingmay be performed using a (e.g., corrective) deblocking function (e.g., a blocking-and-ringing- artefact-reducing function), which may have different shapes and parametrizations.Let cor, for a block b (e.g., temporal block), be fully described by one of the following functionswith two parameters: ^a linear function, for example, with offset parameter ^ and slope parameter ^ as in thediscussion in [3]. In other words, the underlying model of such deblocking function may be (or be based on) a simple linear model, characterized by a linearly increasing or decreasing value progression, e.g., between its boundary indices at i = 0 and i = N (withN being the block size, e.g., number of samples in the temporal block): cori = ^ + ^ · 2 · iwith 0 ≤ i < N^ a trigonometric function, for example, with offset parameter ^ and curvature parameter^, where said ^ may control a maximum amplitude of, for example, a half-cosine angularfunction, e.g., between 0 and ^. In this variant, the underlying model isn’t linear but, forFH250105PCT-2025007739.DOCXfeexample, sinusoidal, characterized by a progression of its values between i = 0 and i = Nwhich is smoother and which may exhibit less pronounced slopes (1st-order derivative) at the block boundaries: cori = ^ + ^ · cos(^ ^· i) · N with 0 ≤ i < N.Four aspects regarding the above corrective functions are worth noting. First, in both variants ofthe function (e.g., linear and trigonometric functions), the multiplication-by-i term, · i, (e.g., sampleposition as functional parameter) may be replaced by a temporally shifted version thereof, e. g., ·(i + 0.5) (or any other integer or rational number or a number, e.g., between -1 and 1), for example,to obtain a temporally symmetric function within the processed block b. Second, both functionsmay be parametrized in different ways such as by the parameters described herein and / or by theirstart and end values in b, e.g., by their boundary anchor values which are the result of evaluatingthe respective function at i = 0 and i = N (or N – 1). In other words, signaling, for each block b,said two anchor values to the decoder instead of ^ and ^ or ^ and ^ may be, in the absence ofquantization or precision differences, mathematically equivalent since the latter two parameterscan be determined from the anchor values (e.g., ^ and ^ may be determined based on values ofthe residual signal at a first and last sample of the block, i.e., for i = 0 and i = N-1). Third, to limit the number of bits that may be required for transmission of the deblocking parameters within thebitstream, especially when b is of small size (e.g., having a lower number N of samples), the oneor more function parameters such as ^ and ^ or ^ and ^ (or, equivalently as noted, anchor valuesor similar parameters that allow defining the deblocking function) may be quantized as well.Preferably, for example, they may be quantized more finely than the transform coefficients, e.g.,using a smaller step size or QP (e.g., compared to a step size used for the transform coefficients),and / or with a scalar linear quantizer. In general, a good trade-off between bit consumption of thequantized deblocking parameters and effectivity of the deblocking pre / post-processing – e.g., alow deblocking cost – may be desirable. In consequence, this implies that, given high-cost cases,it may be useful to signal deblocking one or more parameters only, for example, when a furtherbitstream element, e. g., a 1-bit flag, indicates that such parameters are present for block b.Fig. 7 shows an example of a decoded residual signal without deblocking (upper plot) and withdeblocking (lower plot). The residual signal was re-transformed using as transform DST-II and with a block size of 640. As can be seen in the upper plot, the signal shows occasional deviation (e.g., spikes) from its original shape of a wave function. However, after deblocking, as can beseen in the lower plot, the signal exhibits a smooth waveform shape. Fig. 7 illustrates the effectof the guided deblocking on an audio signal. FH250105PCT-2025007739.DOCXfe Fourth, when parametrizing the corrective deblocking function (e.g., a blocking-and-ringing- artefact-reducing function) by said two boundary anchor values (e.g., deblocking parameters), it may not be necessary to explicitly signal (e.g., transmit) the starting (e.g., left) anchor parameter (e.g., it may be sufficient to transmit the ending anchor parameter, but not the starting anchor parameter). Instead, it often suffices to implicitly signal (e.g., derive) said starting anchor value (e.g., a further deblocking parameter, e.g., a derived deblocking parameter) via previously decoded signal information (e.g., wherein a decoder is configured to determine the starting anchor value based on one or more already decoded sample values, e.g., by default and / or based on anindicator in the bit stream, e.g., an indicator at the start of the bit stream or portion thereof suchas a start of a temporal block 30) at i < 0 (e.g., previously decoded samples, e.g., immediatelypreceding samples, e.g., of the same channel) since the starting anchor value (e.g., deblockingparameter) evaluates the corrective deblocking function at i = 0 (e.g., a first sample of a temporalblock 140 being indexed by a sample index i = 0), i.e., in the direct vicinity of the ending part of the already decoded signal region (e.g., based on sample values of one or more samples immediately preceding a currently coded block, e.g., of the same channel). Specifically, said starting anchor value at i = 0 can be derived using, preferably, linear regressive extrapolation (or any other form of extrapolation, e.g., using other statistical values such as an average) from the four locations -5 < i < 0 (e.g., or any other number such as two, three, five, or more locations or samples) and on a "virtual residual boundary signal" at these four locations, which can be constructed, on both encoder and decoder side, as a difference (e.g., sample-wise difference) between the reconstructed signal samples at (e.g., the four locations at sample indexes -5 < i < 0), and an extension (e.g., based on an extrapolation or extension of the prediction signal to extend more samples) of the prediction signal for the current block towards, -5 < i < 0, assuming that i < 0 points to available signal samples (otherwise, the starting anchor value may be set to 0). In other words, only the ending (e.g., right) anchor parameter must (or can) be signaled,preferably, for example, in a quantized form (e.g., quantized as described herein for two anchorpoints, e.g., with smaller quantization steps than the transform coefficients), while the starting(e.g., left) anchor value may be derived from other information in the bitstream (e.g., based onalready coded samples), thereby saving side-information bits required for the deblocking procedure.In the following, embodiments related to “Preferred Deblocking-En / Decoder Embodiment” aredisclosed. Preferred Deblocking-Encoder Embodiment FH250105PCT-2025007739.DOCXfeIn each residual transform block b (e.g., in the data stream 16, e.g., a portion of the data stream16 related to the temporal block 140 to be decoded, e.g., a portion of the data stream related to the transform-coded block) of each channel in the biomedical, seismic, or acoustic signal (where the term acoustic may include both human generated speech or music material as well as non-human input such as sonar recordings), the encoder may determine and quantize the one or twodeblocking parameters (however, the following example will be described with two parameters),using the residual block signal res, prior to transforming res', as follows:1 (optional). When res is not low-pass enough – which can be determined, for example, by high-pass filtering res, calculating a variance varhp of the high-pass block signal, and comparing theratio of varhp and varres (the variance of res itself) against a threshold T – the two deblockingparameters shall exemplarily represent offset α and slope ^. The α and ^ parameters, as outlinedpreviously, can be obtained, for example, via simple linear regression [3], with µix and µres denotingthe mean of i and res, respectively, in block b:^ = sumi[(i – µix) · (resi – µres)] / sumi[(i – µix)2], α = µres – ^ · µix with index 0 ≤ i < N. (1)It is noted that term i – can be known a priori, as it only depends on a block size N. Such linefitting derived parameters may minimize the overall DC offset and temporal tilt in res inside blockb, thereby reducing, for example, the magnitudes of the lowest-frequency transform coefficientsresulting from transformation of res'.2. When res is low-pass enough (e.g., step 1 has not been executed or the comparison againsta threshold in step 1 failed, e. g. by having evaluated to false), the two deblocking parametersmay represent two anchor points of res at the boundaries of block b. The values resL and resRof these two points are, preferably, for example, determined by averaging two consecutive valuesof res at each boundary (e.g., wherein the index indicates a position of a sample, wherein anindex of zero indicates a first or leftmost position of block b):resL = 0.5 · (res–1 + res0), resR = 0.5 · (resN–1 + resN). (2)It is noted that in the example above, the values res–1 and resN are actually located outside of b,thus, any block prediction signal used in the determination of res may need to be extended by anextra sample on each side of b in order for res (e.g., a difference between input signal andFH250105PCT-2025007739.DOCXfe prediction signal) to include index –1 and index N. In cases where this is not feasible or desirableor the employed transform is not a DST-II, a simpler assignment resL = res0, resR = resN–1 maybe utilized instead (e.g., for one or both anchor points). From resL and resR, the offset and slopeor, alternatively, curvature parameters can then be obtained, for example, as follows:linear function (line fit): ^ = 0.5 · (resR – resL) / {N when eqn. (2) is used, else N – 1}, α = resLtrigonometric function: ^ = 0.5 · (resL – resR) / {N when (2) is used, else N – 1}, α = resL – ^NIt is noted that more accurate calculations of α may be devised especially in case of the abovesimple assignment resL= res0, resR= resN–1.3. On very noisy residual block signals, deblocking via function cor may not provide merit. Forexample, such cases can be identified by measuring a zero-crossing rate [4] of corrected residualblock signal using, for example, the following expression for res'i or res''i:res'i = resi – cori (or, alternatively, res"i = resi – µres which can be calculated faster) for 0 ≤ i < N.If said zero-crossing rate [4] (or similar measures) lies above some further (e.g., pre-determined)threshold, α = ^ (or ^) = 0 may be assumed and deblocking may, for example, be disabled, orbypassed, for example, by signaling “deblocking off” in a 1-bit flag for b.4. When “deblocking off” is not signaled in step 3, but the values of α and ^ (or ^) are near-zero,deblocking may optionally also be disabled, or bypassed, by signaling “deblocking off” in a 1-bitflag for b.5. Otherwise (e.g., neither is res very noisy, nor are the deblocking parameters of b near-zero inmagnitude), the two deblocking parameters α and ^ (or ^) obtained in steps 1 – 2 may optionallybe quantized,α Q = round(α / (2 · ∆)), xQ = round(x · N / ∆) with ∆: step-size, x: placeholder for ^ or ^, (3)and “deblocking on” may be signaled in the 1-bit flag for b, for example, followed by the twoquantized parameter values α Q and ^Q (or ^Q), using, for example, a lower bit depth per parameterthan the input signal’s bit depth. FH250105PCT-2025007739.DOCXfe6. The two deblocking parameters α and ^ (or ^) may be now used to construct (e.g., modify), for0 ≤ i < N, the cor function using which the subtractive deblocking pre-processing introduced earlieris performed, yielding corrected residual block signal res’ which is time-frequency transformedand quantized. Preferred Deblocking-Decoder EmbodimentIn the decoder, the (e.g., quantized) frequency-domain coefficients may be reconstructed andsubjected to frequency-time (e.g., inverse) transformation, resulting in (e.g., quantized) previouslycorrected residual block signal res’Q. Further, reconstructions of α and ^ (or ^) may be calculatedfrom α Q and ^Q (or ^Q), for example, using the following equations:α’ = α Q · 2 · ∆, x’ = xQ · ∆ / N with ∆: step-size, x: placeholder for ^ or ^, (4)from which may be derived, again for 0 ≤ i < N, the cor function using which the additive deblockingpost-processing described earlier may be performed. Said deblocking post-processing mayrepresent the inverse of the encoder-side deblocking pre-processing. It is noted that, byemploying the quantized α Q and ^Q (or ^Q) parameters also in the encoder-side construction ofcor, used in the subtractive pre-processing step, the pre-processing and post-processingoperations may cancel out perfectly. Hence, when deriving cor in the encoder, α, ^, and ^ may bereplaced by α’, ^’, and ^’, respectively. The above description is extended in the following by the presentation of further embodiments. Before this, however, the description proceeds with a presentation of a possible framework or codec into which the embodiments described above as well as the embodiments described further below may be built into. Many details described in this framework are, however, optional when being combined with any of the above or subsequently described embodiments. To be moreprecise, the framework is described with respect to Fig. 8 which shows an encoder for encodinga multi-channel digital signal 14 into a datastream 16 as well as decoder 12 for decoding the multi-channel digital signal 14 from datastream 16. This description of Fig. 8 shall be seen as apresentation of new embodiments of the present application which result when combining any of the embodiments described above or any of the embodiments described subsequently iscombined with the decoder 12 or encoder 10 of Fig. 8 either by adopting all details / functionalitiesdescribed with respect to Fig. 8 or with leaving-out some of the details / functionalities describedFH250105PCT-2025007739.DOCXfewith respect to Fig. 8. Sometimes such “optional” features of Fig. 8 are explicitly identified asbeing optional with respect to the combination of the herein described embodiments, but the just-mentioned possible combinations of the previously / subsequently explained embodiments with thedescription, e.g., of Fig. 1a to 8 shall not be restricted to the these explicitly identified variationsof Fig. 8 in terms of leaving-out certain features.In Fig.8, the multi-channel digital signal 14 is illustrated by way of an array of samples with thesamples (e.g., wherein each sample defines a single value) being illustrated as small squares 18.Each line / row corresponds to a certain channel (e.g., 32 channels in fig. 1, but a single channelor any other of channels may be used) of the multi-channel digital signal 14. Each channel ofsignal 14 may have associated therewith a respective channel ID and Fig.8 shows these channelsas being ordered according to their channel ID along vertical axis 20 which, thus, corresponds toa “source” channel axis 20. The horizontal axis 22 corresponds to time (e.g., in absolute time unitssuch as µs or in units of samples, which may optionally all have the same duration, e.g.,determined by a sampling rate) so that samples 18 forming one column, or being horizontallyaligned, are samples belonging to one common time instant. Such set / column of temporally co-located samples 18 is exemplarily illustrated in Fig. 8 at 24.Each channel, thus, forms a digital time-varying signal or time / amplitude or time-to-amplitudesignal. The multi-channel digital signal 14 might have been obtained by at least one ofElectrocardiography, Electroencephalography, Electromyography or seismic measurement. Differently speaking, the multi-channel digital signal might be a bio-physiological waveform data(e.g., a signal representative of a heart, brain, or eye activity) such as an electroencephalography(EEG) signal, an electrocardiogram (ECG), or an electromyography (EMG) signal, or seismicwaveform data. However, each channel / signal might alternatively be another sort of waveform signal data such as scalar media data such as an audio signal and the signal 14 might be a multi- channel audio signal.Fig. 8 illustrates the option according to which signal 14 is not coded directly, i.e., in the originaldomain 26, but in a so-called “coded domain” 28 (e.g., frequency domain) which might differ fromthe original domain 26 (e.g., time domain) by one or more of 1) channel transformation, 2) channelpermutation and 3) temporal mutual channel alignment. The channel transformation, if applied, transforms, per sample time instant, a set or column 24 of samples from domain 26 to domain 28.Thus, in domain 28, the sample pitch and the time axis is the same as in domain 26, but themeaning of the channels is different, i.e., the “source” channels of domain 26 become transformed FH250105PCT-2025007739.DOCXfechannels in domain 28. Accordingly, the vertical axis in Fig. 8 for domain 28 is denoted as 32.Note that the channel transformation might leave the number of channels unchanged so that thereis the same number of channels in domain 26 as well as domain 28 (e.g., 32 channels in bothdomains 26, 28), but different approaches are also possible. Generally, the channel transformation would aim at reducing redundancy and trying to condense the channels’ energy onto a fewer number of channels in domain 28. As said, the channel transformation is optional. Accordingly, in general terms, the channels in domain 28 are called “coded channels” in order to distinguish them from the “original” or “source” channels of digital signal 14 in domain 26. The permutation is also optional and may be used in combination with, or without, the channel transformation. If used in combination with the channel transformation, the permutation may be performed prior to and / or or subsequent to the channel transformation in order to permute / sortthe source channels prior to transformation and the coded channels subsequent to the channeltransformation. The channel transformation might be a DCT (discrete cosine transform), DST(discrete sine transform), FFT (fast fourier transform) or any other transformation. The temporalmutual alignment is also optional and might be seen as a constant temporal alignment betweenthe source channels or the coded channels. The module in encoder 10 performing the one or more of channel transformation, channelpermutation and temporal mutual alignment is indicated in Fig.8 as block 34. Side information 36might be used in order to signal information on one or more of the following: 1) The channel transformation used, 2) information on the permutation(s) among the source channels and / or coded channels and 3) information on the mutual temporal alignment / delays between the source channels or coded channels wherein the temporal mutual alignment might be restricted to full sample precision. A corresponding block 38 in decoder 12 performs the reverse step, i.e., performs one or more of: 1) a channel retransformation, 2) a re-permutation of the source channels and / or coded channels and 3) a temporal re-alignment of the source channels or coded channels. Note, that if no channel transformation takes place, the coded channels are, in fact, equal to the source channels except for being temporally mutually aligned or being differently sorted due to permutation. Block 38 might be controlled by the before-mentioned side information 36. Thus, the “actual coding” relates to the coded channels in domain 28. In the coded domain 28,the coded channels are depicted in Fig. 8 as lines or rows of samples 40, each extending alongtime axis 22, the coded channels being depicted one on top of the other along coded channel axis32 – potentially ordered according to a coded channel ID the have associated therewith - so asFH250105PCT-2025007739.DOCXfeto result into an array of samples 40. Again, although Fig. 8 depicts the case that the number ofsource channels equals the number of coded channels, the number might be different. Further, if channel transformation is used, while there is no longer a clear association between source channels on the one hand and coded channels on the other hand, the temporal association remains: For each temporally co-located samples 24, there is a corresponding temporally co- located set 42 of samples 40 of the coded channels, wherein the set 42 in domain 28 is a column and might be a set of horizontally mutually offset samples in case of, and according to, the mutual temporal alignment, if applied. In case of Fig. 8, it has been assumed that no such temporal alignment took place so that both sets 42 and 24 are pure columns in the time / channel representation. The actual coding is done in units of so-called temporal blocks 30. The term “temporal block” 30 is used so as to denote both a temporal portion of the multi-channel signal in domain 28, i.e., the set of coded channels, as well as a temporal portion of a certain coded channel. That is, for eachtemporal block 30, each coded channel has a temporal block such as block 140 (e.g., temporalchannel block) depicted for some temporal block 30c and same are mutually co-located. Thecoding is done sequentially along these blocks 140, by following a coding / decoding order, which traverses the blocks 140 temporal block 30 by temporal block 30 with traversing temporally co-located blocks of the coded channels along a channel order corresponding to the order of thecoded channels along axis 32. This coding / decoding order is illustrated in Fig. 8 at 60. That is, incase of temporal block 140 being the block currently to be coded / decoded, the previously decoded / encoded temporal blocks include all preceding temporal blocks of all coded channels as well as the temporally co-located temporal blocks of coded channels preceding the coded channel92 of temporal block 140 in channel order. These previously coded / decoded temporal blocks andtheir samples are illustrated in Fig. 8 by way of shading. In this regard, note that in Fig. 8, merelyone temporal block 140 has been illustrated explicitly in order to reduce the complexity of Fig. 8. Thus, in the specification herein, reference sign 140 is sometimes used to indicate the currently encoded / decoded temporal block or to stand representatively for all temporal blocks. Further, as depicted in Fig.8, the partitioning of signal 14 into temporal blocks 30 and 140, respectively, might be done in a manner so that these blocks 30 and 140, respectively, are non-overlapping. The actual coding in units of the temporal blocks 140 is performed predictively. That is, the encoder 10 comprises a block predictor 62 which predicts the samples of the currently coded temporal block 140, thereby yielding a prediction signal 64, and the prediction residual 66 formed by a subtraction between the actual sample values of temporal block 140 and the predicted FH250105PCT-2025007739.DOCXfe samples of prediction signal 64 formed at a subtractor 68 is coded into the datastream 16 by residual coder 70. The residual coding in residual coder 70 may, or may not, involve a coding error by means of quantization. In any case, block predictor 62 uses the reconstructable version as being available by previously coded temporal blocks in order to obtain the prediction signal 64. This reconstructable version 72 might be derived at encoder 10 by means of a residual decoder 74 which reverses potential coding loss, such as quantization by means of dequantization, manifesting itself in the residual signal 76 coded into datastream 16, and an adder 78 which sums- up prediction signal 64 and the reconstructable residual signal 80 as obtained by residual decoder 74. The decoder 12 decodes the coded channels from data stream 16 in a corresponding manner, i.e., in units of the temporal blocks 30 or in temporal blocks 140, respectively, and using predictive decoding. To this end, the decoder 12 comprises a residual decoder 82, an adder 84 and a block predictor 86 which correspond to, and are mutually connected in the same manner as, elements 74, 78 and 62 of encoder 10. That is, the residual decoder 82 derives from the residual signal 76 in data stream 16 the reconstructable residual signal 80 for a currently decoded temporal block 140 which is then subject to addition with prediction signal 64 derived by block predictor 86 for temporal block 140 on the basis of the reconstructed version 72 of previously decoded temporal blocks at adder 84. The output of adder 84, thus, yields the reconstructed version 72 of the currently decoded temporal block 140 and becomes part of the pool of already decoded samples of previously decoded temporal blocks when the temporal blocks of the coded channels are, in this manner, traversed along coding / decoding order 60 so as to reconstruct the coded channels in the coded domain 28. In order to enable a high degree of random access capability, some of the temporal blocks 30 may be coded in a random access manner meaning that the coded channels therein are coded independent from previous temporal blocks 30. Imagine, for instance, that temporal blocks 30b and 30e are random access temporal blocks. Then, none of the temporal channel blocks 140 in temporal block 30b as well as 30e would depend on any preceding temporal block 140 such as none temporal block within temporal block 30a forming a coding dependency basis for any temporal channel block 140 in temporal block 30b and none of the temporal channel blocks 140 within temporal blocks 30a to 30d forming a coding dependency basis for any of the temporal channel blocks 140 within temporal block 30e. Thus, in other words, coding dependencies are restricted so as to not reach-out beyond the border of a random access temporal block 30b and 30e towards any preceding temporal block 30. Such restriction might also hold for intermediate FH250105PCT-2025007739.DOCXfe temporal blocks 30c to 30d between random access temporal blocks 30b and 30e in that same may not depend on any temporal block preceding the leading one among the random access temporal blocks 30b and 30e, here block 30b. Accordingly, leading temporal borders of the random access temporal blocks 30b and 30e are indicated by bold lines in Fig.8. Further, it might be that the coding of the coded channels also interrupts or restricts inter-channel dependencies by coding one or more of the coded channels as random access coded channels so that coding dependencies of these random access coded channels, or even these random access coded channels and the intermediate coded channels therebetween, are restricted so as to not reach-out beyond such a random access coded channel toward any coded channel preceding that random access coded channel in channel order along axis 32. Two such random access coded channels 88a and 88b and their associated inter-channel dependency borders are illustrated in Fig.8. The block predictor 62 and 86 of encoder 10 and decoder 12, respectively, operate synchronously, i.e., they generate the same prediction signal 64 based on the previously encoded / decoded samples of previously encoded / decoded temporal blocks 140. On encoder side 10, the prediction for a certain temporal block 140 may be accompanied or determined by one or more prediction parameters. Same might be determined on encoder side based on a rate / distortion optimization. These prediction parameters 90 are coded into data stream 16 and they are decoded from data stream 16 and used by block predictor 86 so as to perform the same prediction. It might be that encoder 10 and decoder 12 support more than one prediction mode. For instance, encoder 10 and decoder 12 may support an intra prediction mode (which mode may also be called block-copy mode) according to which the currently encoded / decoded temporal block 140 is predicted based on the reconstructable sample values of previously encoded / decoded temporal blocks of the same coded channel to which the currently encoded / decoded temporal block 140 belongs, which is coded channel 92 in the example of Fig.8. Additionally or alternatively, encoder 10 and decoder 12 may support an inter-prediction mode (which mode may also be called cross- channel prediction mode) according to which the currently encoded / decoded temporal block 140 is predicted based on the reconstructable sample values of previously encoded / decoded temporalblocks of coded channels preceding – in coding order 32 - the coded channel 92 to which thecurrently encoded / decoded temporal block 140 belongs. Additionally or alternatively, there may be a mixed prediction mode according to which the prediction signal 64 is obtained by both, FH250105PCT-2025007739.DOCXfe reconstructed / reconstructable sample values of previously encoded / decoded temporal blocks of coded channel 92 itself as well as reconstructed / reconstructable sample values of coded channels preceding coded channel 92 in channel order along axis 32. Beyond this, there may be temporal blocks 140 which are coded without any prediction at encoder 10 and decoded withoutany prediction at decoder 12 such as the first temporal blocks in the tiles 94 resulting from mutuallyseparating the temporal blocks by means of the random access borders 96 on the one hand and the random access channel borders 98 on the other hand. This corresponds to the prediction signal 64 being set to zero and this may form an additional mode which could be called bypass mode. Additionally, or alternatively, there may be other modes such as ones deriving a DC predictor or linear function predictor for block 64 based on immediately preceding samples of block 140. The prediction parameters 90 may, thus, contain for a currently encoded / decoded temporal block 140 a prediction mode flag or prediction mode indicator indicating the prediction mode to be used for this currently encoded / decoded temporal block 140 and, optionally, one or more parameters parameterizing the prediction mode to be used for this currently encoded / decoded temporal block 140. The aforementioned coding dependencies ought not to cross any of the borders 96 and 98 not only result from the just-described sample prediction capabilities of block predictor 62 and 86, respectively, but may optionally also result from other mechanisms such as parameter predictionaccording to which parameters such as the aforementioned prediction parameters 90 for a certaintemporal block 140 are predicted based on coding parameters conveyed in the data stream 16 for any previous temporal block, or context derivation for context-adaptive entropy coding / decoding any coding parameter such as the prediction parameters 90 or any other side information such as side information 76 and 36 for temporal block 140 based on any coding parameter conveyed in the data stream 16 for any preceding temporal block. That is, summarizing, the encoder 10 encodes the multi-channel signal 14 by transferring it into the coded domain 28 and then coding the coded channels into data stream 16 in the just- described block-wise and predictive manner, wherein decoder 12 decodes the coded channels of coded domain 28 from data stream 16 and the corresponding block-wise and predictive manner with then gaining the multi-channel signal 14 in its original form 26 based on the coded channels in coded domain 28 by means of segment 38. As said, the channel transformation is optional and if not used, each sample 40 in the coded domain 28 really corresponds to one sample 18 in the original domain 26. If, further, the temporal mutual alignment is not used, each sample 40 exactly corresponds to a sample 18 in the original domain 26 at exactly the same time instant or, FH250105PCT-2025007739.DOCXfe differently speaking, all temporally co-located samples 40 in coded domain 28 remain mutually temporally co-located in the original domain 26.As mentioned before, Fig. 8 only represents a possible “framework” into which the previouslydescribed embodiments and the embodiments described subsequently may be built into. Many modifications may be performed with respect to Fig.8, and some of these modifications might be mentioned in the subsequent description with respect to certain ones of the subsequently described embodiments, but these modifications shall then be treated as being also applicable with respect to other ones of the subsequently described embodiments. Further, as a final note, and without being treated as forming an exclusive list of further possible amendments of the description of Fig. 8, it shall be noted that the temporal blocks 30 might, other than illustrated inFig. 8, vary in block length rather than being of a constant length as depicted in Fig. 8. Forinstance, encoder 10 may decide on the length of blocks 30 and signal the block length of blocks 30 (and the corresponding temporal blocks 140 of the coded channels) within data stream 16. Further, although not described before, it might be that residual coder and residual decoder 70 and 82 may use transform coding / decoding in order to convey the residual signal 76 in data stream 16. That is, the residual signal 80 may be conveyed in data stream 16 in transform domain by way of transform coefficients in residual signal 76. The transform domain might be a DCT, DST or an FFT. The transform may be non-overlapping, i.e. it may only transform residual signal 80 and its re-transform may only cover residual signal 76 within block 140, and / or may be non- windowed, i.e. the residual signal might be transformed without any transform window used to temporally shape the residual signal 80 before the transform. The transform domain, i.e. the transformation leading from time domain to transform domain which is used by the encoder to transform the prediction residual signal 80 to be coded und the corresponding re-transformation leading from transform domain to time domain which is used by the decoder to derive the prediction residual signal 80, or the transformation, might be selected from a set of available transforms including, for instance, one or more of 1) one or more DCTs, 2) one or more DSTs and 3) an identity transform according to which the prediction residual signal 80 is coded into the data stream 14 in time domain directly. Some deblocking processing might be used to avoid blocking artifacts. If, alternatively, an overlapped transform is used, an overlap-add processing with re-transforms of immediately preceding / succeeding temporal blocks of the same coded channel might be used in order to completely reconstruct the current temporal block’s 140 residualsignal 76. Besides such transform-(residual)-coded blocks there might be temporal blocks 140which, additionally or alternatively, are coded using, besides the block prediction by blockpredictor 62 / 86 – which could be called a primary prediction – a secondary sample-wise predictionFH250105PCT-2025007739.DOCXfe of the residual samples in residual block 66 such as by predicting a current sample’s residualsample by means of already decoded values of preceding – in sample coding order – residualsamples in block 66 or 80, with then correcting same by means of a secondary-prediction-residual sample decoded from the data stream 16. The secondary-prediction-residual samples for such a block may coded into the data stream en block in a transform domain or sample-wise in time domain. Fig.9 shows a schematic coding scheme for decoding comprising modifying 404 the time-domain prediction residual signal 302i. Any decoder 12 disclosed herein may be configured to performone or more features disclosed herein with reference to fig.9. The same features may be providedfor a corresponding encoder 10 (e.g., any encoder disclosed herein). It is note that fig.9 uses an index i for the currently coded temporal block, for easier readability. However, the currently coded temporal block 300iin fig.9 may correspond to the currently coded temporal block 300i-1shown in fig.12 (e.g., with the index shifted by one).The decoder 12 is configured to decode 402 one or more deblocking parameters 400 (e.g., oneor two or more of α, ^, and ^ described herein, e.g., with reference to fig. 2a to 3b, e.g., withreference to section “Preferred Deblocking-Encoder Embodiment”) from the datastream 16,perform deblocking post-processing by modifying 404 the time-domain signal 302i(e.g.,time- domain prediction residual signal) using the one or more deblocking parameters 400 to obtain a modified time-domain signal 302’i(e.g., modified time-domain prediction residual signal). Thedecoder 12 may be configured to perform the correcting 308 the prediction signal 64i-1 using themodified time-domain (prediction residual) signal 302’i.The one or more deblocking parameters 400 may define correction values (e.g., based on a function defined by the one or more deblocking parameters 400, e.g., wherein the correction values are values of the function at sample positions of the samples of the time-domain prediction residual signal 302i), wherein the modifying 404 the time-domain prediction residual signal 302i may comprise a linear combination (e.g., subtraction, sum, or weighted sum / subtraction) between the time-domain prediction residual signal 302i and the correction values (e.g., the function). The description is now resumed with respect to the announced subsequently described embodiments, here namely embodiments relating to inter-channel prediction. As described with respect to Fig.8, the embodiments with respect to decoder and encoder described in the following may relate to such decoders and encoders which comprise the inter-channel prediction as one FH250105PCT-2025007739.DOCXfe mode among one or more others, but the inter-channel prediction mode may alternatively be theonly available prediction mode. That is, generally, Fig. 10 relates to a decoder for decoding amulti-channel digital signal 14 from a data stream 16, which is configured to decode coded channels representing the multi-channel digital signal 14, namely those in domain 28, from the data stream 16 in temporal blocks 140, namely temporal coded channel blocks, with sequentially decoding from the data stream 16 a predetermined temporal block 140 of each of the coded channels before decoding a subsequent temporal block of any of the coded channels, and to an encoder for encoding a multi-channel digital signal 14 into a data stream 16, which is configured to encode coded channels representing the multi-channel digital signal 14, namely those in domain 28, into the data stream 16 in temporal blocks 140, namely temporal coded channel blocks, with sequentially decoding from the data stream 16 a predetermined temporal block 140 of each of the coded channels before decoding a subsequent temporal block of any of the coded channels.In order to describe the inter-channel prediction mode, reference is made to Fig. 10. Inencoding / decoding a currently encoded / decoded temporal block 140, one or more prediction parameters for predicting the current temporal block 140 are determined first. The one or moreprediction parameters are for, or control, the prediction of the current temporal block 140 of apredetermined coded channel 92 based on a reference block portion 142 of a set of one or morereference channels 92a. In Fig. 10, merely one such reference channel 92a is illustrated to beused for the prediction of temporal block 140 for illustration purposes and ease of explanation, but the number may be larger than one. As became clear from the description above, reference channels such as reference channel 92a need to precede the predetermined coded channel 92 in channel coding order 32 and might have, for instance, a lower channel index associated therewith than compared to predetermined coded channel 92 comprising the currentlyencoded / decoded temporal block 140. A further note shall be made with respect to the term“reference block portion”. Reference block portions such as reference block portion 142 are portions of immediately consecutive samples 40 of the reference channel 92a, with a number of comprised immediately consecutive samples 40 being equal to the number of samples within temporal block 140, but they are not necessarily restricted to be registered or to be temporally located to temporal block 140 or to any other temporal block 30, i.e. they might be placed freely expect for the fact that reference block portions need to comprise or cover previously decoded / encoded samples only, and except for an optional maximum temporal distance to block 140. That is, the reference block portions such as reference block portion 142 might be temporally shifted relative to temporal block 140 as described in more detail below. FH250105PCT-2025007739.DOCXfe The one or more prediction parameters determined for temporal block 140 are for defining as to how, computationally, the prediction signal 64 for predicting temporal block 140 is derived from the reference block portion(s) 142 or to be more precise, the reconstructed / reconstructable samples in reference block portion(s) 142. As will be described in more detail below, the one or more prediction parameters may, for instance, define scale and offset such as a scale for each reference block portion 142 by means of which the reference block portion 142 is scaled (by multiplying it or, to be more precise, its reconstructed / reconstructable samples, by multiplication with the scale), with then adding the offset to the scaled reference block portion or, in case of more than one reference block portion 142, forming a sum over all scaled reference block portions and the offset.The determination of the one or more prediction parameters is done based on temporal segments144 and 146 of channels 92 and 92a, each consisting of immediately consecutive samples 40 of the respective channel, and each of which temporally preceding the corresponding block, i.e. block 140 in coded channel 92, and reference block portion 142 in channel 92a, respectively. For instance, segments 144 and 146 might be defined to be located immediately preceding the corresponding block 140 and 142, respectively, as illustrated in Fig.10, but it might alternatively be that the temporal positioning of segments 144 and 146 is defined in a different manner such as in a manner so that the segments 144 and 146 are mutually temporally co-located such that, for instance, all segments 144 and 146 contain the samples 40 immediately preceding, temporally, the block among block 140 and block 142 which is the earliest in time. As can be seen in Fig. 10, segments 144 and 146 mutually coincide in the number of samples 40 contained therein, wherein this number L may be equal to or different from the number N of samples in blocks 140 and 142, respectively. For instance, L might be chosen to be smaller than N as illustrated in Fig.10. The advantage of determining the one or more prediction parameters using which temporal block 140 is predicted from the reference block portion 142 of the one or more reference channels 92a based on an evaluation of the temporal segments 144 and 146, is the fact that this determination may be done by both encoder 10 and decoder 12 because the temporal segments 144 and 146 are both comprised by the reservoir or pool of already encoded / decoded samples so that the determination of the one or more prediction parameters may be done inherently without any explicit signaling in data stream 16, thereby reducing the side information signaling overhead. FH250105PCT-2025007739.DOCXfe The determination itself is done in the following manner: in particular, it is a pretty good assumption that a relationship of the currently encoded / decoded temporal block 140 to the reference block portion 142 of the one or more reference channels 92a is the same as, or is at least pretty close to, the relationship of temporal segment 144 of coded channel 92 relative to the temporal reference segment 146 in each reference channel 92a. Thus, if the one or more prediction parameters are determined so that their application onto the temporal reference segment 146 of the one or more reference channels 92a results into a “prediction” for temporal segment 144 which minimizes the prediction residual towards the temporal segment 144, this one or more prediction parameter should, if the assumption holds true, also minimize the deviation of the prediction signal 64 obtained by applying the one or more prediction parameters thusdetermined onto the reference block portion 142 of the one or more reference channels 92a fromthe block 140 to be coded / decoded. As a result, the prediction residual 80 coded into data stream 16 may be coded with fewer bits due to the preciseness in having derived prediction signal 64.If the one or more prediction parameters consist of a scale for the, in case of only one referenceblock portion, reference block portion 142 or for each reference block portion 142 in case of having more than one reference block portion, and an offset, as just-described, then the determination of this scale and offset may be performed as follows with here assuming that x1, …, xN denote the reconstructed / reconstructable samples in segment 144, while yi,jdenotes the jthsample insegment 146 of the ith reference block portion with i ∈ {1, …, K}, and j ∈ {1, …, L} and ^i denotingthe scale for the ithreference block portion and b denoting the offset. Then, the minimization of the deviation when applying the prediction parameters onto yi,j from samples xj in terms of sum of squares, i.e. is achieved by the solution of the following equation and, thus, decoder and encoder solve this linear equation and in doing so, decoder and encoder may use a lookup table in order to avoid the computation of the scale and offset involving a division. The equation is: with FH250105PCT-2025007739.DOCXfe Thus, as described, the inter-prediction according to Fig. 10 may involve one or more referenceblock portions 142 and the computation of the one or more prediction parameters may be performed in a manner avoiding a division which is approximated by way of a table lookup instead. It is further noted that, in case of more than one reference block portion 142 being used for the currently encoded / decoded temporal block 140, each one of same is, according to an embodiment, contained in a separate one of the reference channels. That is, each reference channel would have exactly one reference block portion. However, as an alternative, it might be that the reference block portions partially, or all of same, belong to a common reference channel such as reference channel 92a. As already mentioned above, the reference block portion(s) 142 might be located temporally offset relative to temporal block 140. For instance, datastream 16 may have, for each of a set of one or more inter-channel predicted channels out of the coded channels, for each of the one or more reference channels, a temporal offset 148 encoded thereinto at which 1) the reference block portion 142 of the respective reference channel 92a is temporally offset, such as delayed as depicted in Fig.10, relative to the current temporal block 140 of the predetermined coded channel, and 2) the preceding temporal reference block portion 146 of the respective reference channel FH250105PCT-2025007739.DOCXfe 92a is temporally offset, such as delayed as depicted in Fig.10, relative to the preceding temporal block portion 144 of the predetermined coded channel 92. The decoder 12 decodes the temporal offset 48 from the datastream 16 accordingly. The granularity at which this temporal offset 48 is coded in the data stream 16 may be designed in one of the following options: for instance, thetemporal offset 48 for each reference channel for a certain inter-channel predicted coded channelmight be coded into datastream 16 at a scope valid for the whole datastream, or may be codedfor each sequence of temporal blocks 30 from a random access temporal block such as 30b untilthe temporal block 30d immediately preceding the next random access temporal block 30e, or may be conveyed in datastream 16 temporal block individually, i.e. for each inter-predicted temporal block such as segment 140, individually. The set of one or more inter-channel predicted coded channels may include all channels except for the random access coded channels 88a and88b (wherein in Fig. 8 the coded channel corresponding to the uppermost sample line might alsobe a random access coded channel, as it might be the first channel in channel order 32). The number of reference channels might also be coded in the datastream 16 in any of the just- mentioned granularities and even at a granularity which differs from the granularity at which the temporal offset signaling is done. The number of reference channels might be chosen to be equal for all inter-channel predicted coded channels, or might be signaled in the datastream 16 in a manner so that the number of reference channels differs among the inter-channel predicted channels. In case of allowing two reference block portions to belong to the same reference channel, for each reference channel, it might additionally be signaled as to how many reference block portions are contained in the respective reference channel for a certain inter-channel predicted coded channel. In any case, the decoder uses the temporal offset 48 coded in the datastream in order to cut-out out of the respective reference channel, or derive, the reference block portion 142 and the preceding temporal reference block portion 146 from the respective reference channel 92a using the temporal offset 148 signaled for the respective reference channel. Further, the datastream 16 may have, for each of the set of one or more referencechannels, a channel index coded thereinto, which identifies the respective reference channels outof the coded channels which precede the coded channel 92 in channel order 32. Alternatively, the set of one more reference channels of a certain inter-channel predicted coded channel might, by default, include all those coded channels preceding in channel order 32, which immediately precede the current channels 92 in channel order. As described before, for each inter-channel predicted coded channel, the number of coded channels which may form one of the set of one or more reference channels, is restricted as same are merely allowed to be recruited from the coded channels preceding the respective inter-channel predicted coded channel up to the nearest preceding random access channel such as channel 88a in case of channel 92 in Fig. 8. FH250105PCT-2025007739.DOCXfe Accordingly, a channel index conveyed in the datastream 16 may be coded into datastream 16, and may be decoded therefrom, using a parametrized binarization, such as a truncated unary code, parametrized using a binarization parameter, such as the truncation parameter, which might be set by encoder and decoder in such a manner so that the number of binary strings formed bythe parametrized binarization becomes closest to - with becoming equal or greater than – thisnumber of coded channels preceding the respective inter-channel predicted coded channel inchannel order 32 up to the nearest – in channel order – preceding random access channel. Withrespect to the temporal offset 148 and the derivation of the temporal reference block portion 46 and the reference block portion 142 from the reference channel 92a, the following is noted. In particular, according to an embodiment, the temporal offset 148 is restricted to full-sample offsets, meaning that the temporal reference block portion 146 as well as the reference block portion are respectively formed by consecutive samples 40 of the corresponding reference channel, the consecutive samples being shifted relative to the samples of block portion 144 and segment 140, respectively, by a number of samples indicated by offset 148. The derivation of reference block portion 146 and reference block portion 142 is, thus, merely a cutting-out of the corresponding samples out of the samples of reference channel 92a. However, alternatively, the temporal offset 148 may also allow for sub-sample offsets so that the derivation might include a sub-sampling of the reference channel to result into reference block portion 146 and reference block portion 142, respectively. A further note shall be made with respect to the freedom for encoder 10 to choose the temporal offset 148, the number of reference channels and the selection of the number of reference channels out of the available preceding coded channels for a certain coded channel 92, or for a subset of these settings. For instance, the encoder 10 may determine these parameters or settings as optimization variables in a rate / distortion optimization scheme, or may select same in a different manner such as by inspecting certain similarity measures or the like. In the following, the announced subsequent embodiments dealing with intra prediction are presented. As outlined above, these details describe an encoder and a decoder for encoding / decoding a multi-channel digital signal 14, wherein these embodiments may be combined with a teaching of a possible framework presented above with respect to Fig.8, bothwith adopting all details presented with respect to Fig. 8 as well as combining subsequentembodiments merely with a subset of these details. Generally, Fig. 11 presents embodiments fora decoder configured to decode coded channels representing a multi-channel digital signal 14 from the data stream 16 in temporal blocks 140, and an encoder configured to encoder coded FH250105PCT-2025007739.DOCXfe channels representing a multi-channel digital signal 14 into the data stream 16 in temporal blocks 140. According to Fig.11, a current temporal block 140 of a predetermined coded channel is predicted from one or more reference block portions 2421 and 2422 of the same channel, i.e. the predetermined coded channel 92. The “reference block portions” equal the currently encoded / decoded temporal block 140 in the number of samples, but same are not restricted to be registered to any of the temporal blocks 30 and beyond this, in accordance with the embodiments described herein below, they might be positioned at, and be derived from, sub- sample positions of channel 92. In Fig.11, the number of reference block portions is two but this number may also be one or belarger than two. In particular, the number of reference block portions might be determined by theencoder 10 and signaled in the datastream. The number might be determined for each intra- predicted temporal block 140 individually and signaled in the datastream for that segment 140 individually. Alternatively, the number is signaled in the datastream 16 at a coarser time / channel grid. For instance, the number might be signaled in the datastream channel-globally, i.e. for all coded channels, with being updated intermittently such as for each temporal block 30 or for each sequence of temporal blocks 30 from a random access temporal block such as segment 30b up to the temporal block 30d immediately preceding the next random access temporal block 30e. Even alternatively, the number of reference block portions might be signaled in the datastream 16 channel-individually but for a period comprising more than just one temporal block 140 of that channel such as channel 92. The datastream 16 might have, for each of the one or more reference block portions 2421 and 2422, a position 2441, 2442of the respective reference block portion coded thereinto. In particular, this position might be the starting position of the respective reference block portion as depicted in Fig. 11. As the starting position needs to be distanced from the beginning 250 of the intra- predicted temporal block 140 by at least a temporal distance 252 equaling the temporal length 254 of temporal block 140 itself, the starting position 1441 / 2might be coded into the datastream as a temporal offset 2481 and 2482 relative to a temporal reference position 246 lying at the temporal distance 252 ahead beginning 250. The position may be coded into the datastream 16 at sample accuracy or at sub-sample accuracy. According to an embodiment, it is signaled in the datastream whether the position is coded into FH250105PCT-2025007739.DOCXfe the datastream at sample accuracy or sub-sample accuracy and, in case of more than one sub- sample accuracy being available, at which sub-sample accuracy. The signaling of this accuracy may, again, be done individually for the intra-predicted temporal block 140, or be done at a coarser temporal and / or channel grid. For instance, the accuracy may be signaled channel-globally, i.e. for all coded channels commonly, and in temporal terms, it may be signaled in the datastream for the whole datastream or for each sequence of temporal blocks 30 from a random access temporal block onwards up to the temporal block immediately preceding the next random access temporal block, or for each temporal block 30. Even alternatively, the accuracy may be signaled channel- individually but for periods encompassing more than just one temporal block 140. If the position of a predetermined reference block portion 2421 / 2falls onto a sub-sample position, the predetermined reference block portion 2421 / 2 is derived from channel 92 by sampling this channel 92 using an interpolation filter at a grid of sub-sample positions which grid has a temporal length of temporal block 142, i.e. has the same number of samples, and is placed at the sub- sample position 2441 / 2. If the number of reference block portions 1421 / 2is larger than one, as it is the case in Fig.11, the prediction signal 64 of temporal block 140 may be derived based on a sum 260 of the reference block portions 2421and 2422. The sum may be a weighted sum so that reference block portion 2421 is weighted using a factor 2621 before being subject to addition 260, while reference block portion 2422might be weighted by a factor 2622before being subject to addition 260. Again, thesame statements on granularity of signalization as done above with respect to the positionsignaling holds true with respect to a signalization of one, a subset of, or all of the weights / factors 2621 / 2in datastream 16, wherein the granularity may be equal to the one of the signalization of the position or different thereto. However, the weights might be set be default and, optionally, they might be equal to each other, such as the inverse of the number of reference block partitions. Fig. 12 shows a schematic example of decoding a currently coded temporal block 140i-1and temporally adjacent temporal blocks 140i, 140i-2. The time-domain (e.g., prediction residual) signal 302i-1 may result from the subjecting 306 the coefficients 300i-1of the respective transform-coded temporal block 140i-1to the predetermined re-transformation in a manner independent from a prediction residual signal 80 of temporally adjacent temporal blocks 140i, 140i-2, preceding and following the respective transform-coded temporal block 140i-1. FH250105PCT-2025007739.DOCXfe The temporally temporally adjacent temporal blocks 140i, 140i-2may temporally immediately precede and follow the currently coded temporal block 140i-1 (e.g. may border the temporal block 140i-1).For example, the time-domain signal 302i-1 may be a time-domain prediction residual signal 302i-1, which does not require (e.g., is formed independently) a combination (e.g., linear combination, e.g., sample-wise sum, e.g., of a partial overlap) with a time-domain prediction signal of the adjacent temporally adjacent temporal blocks 140i, 140i-2. A dependent formation may, for example, comprise a re-transformation of a coefficients of the current temporal block and re- transformation (e.g., a portion, e.g., a second half of) the previous temporal block 140i-2and a sample wise addition of the samples obtained form said re-transformations in order to obtain the time-domain prediction residual signal 302i-1. The time-domain (e.g., prediction residual) signal 302i-1 may be, for example, obtained independent from a prediction residual signal 80 oftemporally adjacent temporal blocks 140i, 140i-2, by using no windowing or using windowing witha window that does not extend beyond the currently coded temporal block. It is noted that the time-domain (e.g., prediction residual) signal 302i-1 resulting from the in a manner independent from a prediction residual signal 80 of temporally adjacent temporal blocks 140i, 140i-2 may relate to the subjecting 306 the coefficients 300i-1 of the respective transform-coded temporal block 140i-1 to the predetermined re-transformation and not necessarily toobtaining a prediction signal. In other words, the independence described above may relate to a re-transformation, but not necessarily to an entire decoding process (e.g., a random access decoding that does not reference other temporal blocks), but may still allow forming a prediction signal that references other temporal blocks. Further, adaptive filtering with signaled filter coefficients might be used to filter either the weighted sum of individual weighted reference block portions, or one or more of the reference block portions before being used to form the prediction signal in combination with the other reference block portion(s). As already mentioned above, any teachings disclosed herein related to a decoder may be applicable to an encoder 10 (e.g., encoder 10 shown in fig.1b). FH250105PCT-2025007739.DOCXfe For example, the one or more deblocking parameters 400 may define a blocking-and-ringing- artefact-reducing function (e.g., any function described herein), and the encoder 10 may be configured to modify 404 the time-domain signal 302’i using the one or more deblockingparameters 400 by linearly combining (e.g. subjecting to a subtraction) the blocking-and-ringing-artefact-reducing function and the time-domain signal 302’i and determine the one or more deblocking parameters so that the linearly combining (e.g. subjecting to a subtraction) the blocking-and-ringing-artefact-reducing function and the time-domain signal 302’i results -in the modified time-domain signal 302i getting zero at a leading and trailing end of therespective transform-coded temporal block 140i, or getting closer to zero than a predetermined maximum distance, or -in the modified time-domain signal 302i getting a zero mean slope within respectivetransform-coded temporal block 140Ii, or in a mean slope of the modified time-domain signal 302i getting closer to zero than a predetermined maximum deviation.The one or more deblocking parameters 400 may define a blocking-and-ringing-artefact-reducingfunction and wherein the encoder 10 may be configured to modify 404 the time-domain signal302’i using the one or more deblocking parameters 400 by linearly combining (e.g. subjecting to a subtraction) the blocking-and-ringing-artefact-reducing function and the time-domain signal 302’i.The encoder 10 may be configured to determine a statistical dispersion value of the time-domainsignal 302’i, if the statistical dispersion value falls into a value range being indicative of a smoothsignal, determine the one or more deblocking parameters so that the linearly combining (e.g.subjecting to a subtraction) the blocking-and-ringing-artefact-reducing function and the time-domain signal 302’i results in the modified time-domain signal 302i getting zero at a leading andtrailing end of the respective transform-coded temporal block 140i, or getting closer to zero thana predetermined maximum distance. The encoder 10 may be configured to, if the statisticaldispersion value falls into a value range being indicative of a non-smooth signal, determine theone or more deblocking parameters so that the linearly combining (e.g. subjecting to a subtraction) the blocking-and-ringing-artefact-reducing function and the time-domain signal 302’iresults in the modified time-domain signal 302i getting a zero mean slope within respectivetransform-coded temporal block 140i, or in a mean slope of the modified time-domain signal 302igetting closer to zero than a predetermined maximum deviation.The encoder 10 may be configured to determine a noisiness measure (e.g. zero-crossing-rate) ofthe time-domain signal 302’i, If the noisiness measure falls into a value range being indicative ofFH250105PCT-2025007739.DOCXfea noisy signal, not set a gating flag comprised by the one or more deblocking parameters 400 soas to indicate that the deblocking pre-processing is inactive so that the one or more deblocking parameters 400 only comprise the gating flag, and the modified time-domain signal 302i equalsthe time-domain signal 302’i, or set one or more function parameters which define a blocking-and-ringing-artefact-reducing function ought to be linearly combined (e.g. subjecting to a subtraction) with the time-domain signal 302’i to obtain the modified time-domain signal 302i and are comprised by the one or more deblocking parameters so that the blocking-and-ringing-artefact- reducing function is zero so that that a deblocking is effectively disabled The encoder 10 may be configured to, if the noisiness measure does not fall into the value rangebeing indicative of a noisy signal, determine the one or more function parameters so that so thatthe linearly combining (e.g. subjecting to a subtraction) the blocking-and-ringing-artefact-reducingfunction and the time-domain signal 302’i results in the modified time-domain signal 302i gettingzero at a leading and trailing end of the respective transform-coded temporal block 140i, or gettingcloser to zero than a predetermined maximum distance, or in the modified time-domain signal302i getting a zero mean slope within respective transform-coded temporal block 140i, or in amean slope of the modified time-domain signal 302igetting closer to zero than a predetermined maximum deviation.The encoder 10 may be configured to predict the respective transform-coded temporal block 140iusing a selected prediction mode out of a set of prediction modes to obtain a prediction signal 64i, determine the time-domain signal 302’i to be a time-domain prediction residual signal forcorrection 308 of the prediction signal 64i-1 to reconstruct the transform-coded temporal block140i.The encoder 10 may be configured to encode the one or more deblocking parameters 400 intothe data stream 16.The encoder 10 may be configured to configured to support different lengths of the transform-coded temporal blocks and to selectively set a length of the transform-coded temporal blocks inthe data stream 16. The encoder 10 may be configured to support different lengths of the transform-coded temporalblocks, and select and encode a length parameter in the data stream 16, wherein a switchingbetween different lengths of the transform-coded temporal blocks is performed at predeterminedborders between consecutive temporal blocks.FH250105PCT-2025007739.DOCXfe Generally, and using a pseudo-code like writing, the following options for transmitting the reference block portions’ offsets and the filter decision shall explicitly be mentioned (with steps in parenthesis being optional): A) (decode / encode number of reference block portions) (NOTE: for this temporal block individually or at a larger temporal scope) For each reference block portion decode / encode offset unit indicator (NOTE: one of full-sample, half-sample units or the like) decode / encode number of offset units (NOTE: so that offset is this number times offset unit) if there is no reference block portion with sub-sample offset, (NOTE: that is, no reference block portion which requires interpolation filter) decode / encode filter flag if there is a reference block portion with sub-sample offset, infer that the filter flag indicates no filtering if filter flag indicates filtering, decode / encode filter information (NOTE: this filter might be applied to weightedsum to yield final prediction signal 64) B) (decode / encode number of reference block portions) (NOTE: for this temporal block individually or at a larger temporal scope) decode / encode offset unit indicator (NOTE: one of full-sample, half-sample units or the like) For each reference block portion decode / encode number of offset units (NOTE: so that offset is this number times offset unit) if there is no reference block portion with sub-sample offset, (NOTE: that is, no reference block portion which requires interpolation filter) FH250105PCT-2025007739.DOCXfedecode / encode filter flag (NOTE: otherwise it may deemed to be none-indicative of filtering) if filter flag indicates filtering, decode / encode filter information (NOTE: this filter might be applied to weightedsum to yield final prediction signal 64) C) (decode / encode number of reference block portions) (NOTE: for this temporal block individually or at a larger temporal scope) decode / encode filter flag if filter flag indicates filtering, decode / encode filter information (NOTE: this filter might be applied to weightedsum to yield final prediction signal 64) infer that offset unit indicator of each temporal block portion indicates full-sample offset unit if filter flag not indicates filtering, For each reference block portion if filter flag not indicates filtering, decode / encode offset unit indicator (NOTE: one of full-sample, half-sample units or the like) decode / encode number of offset units (NOTE: so that offset is this number times offset unit) D) (decode / encode number of reference block portions) (NOTE: for this temporal block individually or at a larger temporal scope) For each reference block portion decode / encode offset unit indicator (NOTE: one of full-sample, half-sample units or the like) decode / encode number of offset units (NOTE: so that offset is this number times offset unit) FH250105PCT-2025007739.DOCXfe if respective block portion has no sub-sample offset, (NOTE: that is, this reference block portion does not require interpolation filter) decode / encode filter flag if filter flag indicates filtering, decode / encode filter information (NOTE: otherwise no filtering (exceptinterpolation filtering) takes place) E) (decode / encode number of reference block portions) (NOTE: for this temporal block individually or at a larger temporal scope) For each reference block portion decode / encode offset unit indicator (NOTE: one of full-sample, half-sample units or the like) decode / encode number of offset units (NOTE: so that offset is this number times offset unit) decode / encode filter flag if filter flag indicates filtering, decode / encode filter information (NOTE: this filter might be applied to weightedsum to yield final prediction signal 64) F) (decode / encode number of reference block portions) (NOTE: for this temporal block individually or at a larger temporal scope) decode / encode offset unit indicator (NOTE: one of full-sample, half-sample units or the like) For each reference block portion decode / encode number of offset units (NOTE: so that offset is this number times offset unit) decode / encode filter flag if filter flag indicates filtering, decode / encode filter information (NOTE: this filter might be applied to weightedsum to yield final prediction signal 64) FH250105PCT-2025007739.DOCXfe (decode / encode number of reference block portions) (NOTE: for this temporal block individually or at a larger temporal scope) For each reference block portion decode / encode offset unit indicator (NOTE: one of full-sample, half-sample units or the like) decode / encode number of offset units (NOTE: so that offset is this number times offset unit) decode / encode filter flag if filter flag indicates filtering, decode / encode filter information (NOTE: otherwise no filtering (except,potentially, interpolation filtering) takes place) As described in Fig.6, the datastream 16 has a prediction residual 80 encoded thereinto which forms the prediction residual of prediction signal 64 and might be used to correct prediction signal 64, such as by addition, to yield the reconstruction of temporal block 140. Implementation alternatives: Although some aspects have been described in the context of an apparatus, it is clear that these aspects also represent a description of the corresponding method, where a block or device corresponds to a method step or a feature of a method step. Analogously, aspects described in the context of a method step also represent a description of a corresponding block or item or feature of a corresponding apparatus. Some or all of the method steps may be executed by (or using) a hardware apparatus, like for example, a microprocessor, a programmable computer or an electronic circuit. In some embodiments, one or more of the most important method steps may be executed by such an apparatus. Depending on certain implementation requirements, embodiments of the invention can be implemented in hardware or in software. The implementation can be performed using a digital storage medium, for example a floppy disk, a DVD, a Blu-Ray, a CD, a ROM, a PROM, an FH250105PCT-2025007739.DOCXfe EPROM, an EEPROM or a FLASH memory, having electronically readable control signals stored thereon, which cooperate (or are capable of cooperating) with a programmable computer system such that the respective method is performed. Therefore, the digital storage medium may be computer readable. Some embodiments according to the invention comprise a data carrier having electronically readable control signals, which are capable of cooperating with a programmable computer system, such that one of the methods described herein is performed. Generally, embodiments of the present invention can be implemented as a computer program product with a program code, the program code being operative for performing one of the methods when the computer program product runs on a computer. The program code may for example be stored on a machine readable carrier. Other embodiments comprise the computer program for performing one of the methods described herein, stored on a machine readable carrier. In other words, an embodiment of the inventive method is, therefore, a computer program having a program code for performing one of the methods described herein, when the computer program runs on a computer. A further embodiment of the inventive methods is, therefore, a data carrier (or a digital storage medium, or a computer-readable medium) comprising, recorded thereon, the computer program for performing one of the methods described herein. The data carrier, the digital storage medium or the recorded medium are typically tangible and / or non–transitionary. A further embodiment of the inventive method is, therefore, a data stream or a sequence of signals representing the computer program for performing one of the methods described herein. The data stream or the sequence of signals may for example be configured to be transferred via a data communication connection, for example via the Internet. A further embodiment comprises a processing means, for example a computer, or a programmable logic device, configured to or adapted to perform one of the methods described herein. FH250105PCT-2025007739.DOCXfe A further embodiment comprises a computer having installed thereon the computer program for performing one of the methods described herein. A further embodiment according to the invention comprises an apparatus or a system configured to transfer (for example, electronically or optically) a computer program for performing one of the methods described herein to a receiver. The receiver may, for example, be a computer, a mobile device, a memory device or the like. The apparatus or system may, for example, comprise a file server for transferring the computer program to the receiver. In some embodiments, a programmable logic device (for example a field programmable gate array) may be used to perform some or all of the functionalities of the methods described herein. In some embodiments, a field programmable gate array may cooperate with a microprocessor in order to perform one of the methods described herein. Generally, the methods are preferably performed by any hardware apparatus. The apparatus described herein may be implemented using a hardware apparatus, or using a computer, or using a combination of a hardware apparatus and a computer. The apparatus described herein, or any components of the apparatus described herein, may be implemented at least partially in hardware and / or in software. The methods described herein may be performed using a hardware apparatus, or using a computer, or using a combination of a hardware apparatus and a computer. The methods described herein, or any components of the apparatus described herein, may be performed at least partially by hardware and / or by software. The above described embodiments are merely illustrative for the principles of the present invention. It is understood that modifications and variations of the arrangements and the details described herein will be apparent to others skilled in the art. It is the intent, therefore, to be limited only by the scope of the impending patent claims and not by the specific details presented by way of description and explanation of the embodiments herein. References FH250105PCT-2025007739.DOCXfe [1] Y. Reznik, “Coding of Prediction Residual in MPEG-4 Standard for Lossless Audio Coding,” in Proc. IEEE Int. Conf. Acoustics, Speech, Signal Process. (ICASSP), Montreal, CA, May 2004.[2] J. Herre, “Temporal Noise Shaping, Quantization and Coding Methods in Perceptual AudioCoding: A Tutorial Introduction,” Proc. AES 17th Int. Conf. High Quality Audio Coding, 1998.[3] Wikipedia, “Simple linear regression,” https: / / en.wikipedia.org / wiki / Simple_linear_regression [4] Wikipedia, “Zero-crossing rate,” https: / / en.wikipedia.org / wiki / Zero-crossing_rate, Dec.2023. FH250105PCT-2025007739.DOCXfe

Claims

Claims1. Decoder for decoding a digital time-varying signal (92) from a data stream (16), configuredto decode the digital time-varying signal (92) from the data stream (16) in non-overlapping temporalblocks (140) by decoding each of transform-coded temporal blocks (140i) of the non-overlappingtemporal blocks (140) of the digital time-varying signal (92) by decoding (304) coefficients (300i) from the data stream (16),subjecting (306) the coefficients (300i) to a predetermined re-transformation from atransform domain to time domain to obtain a time-domain signal (302i), wherein the re-transformation is a non-overlapping transform, decoding (402) one or more deblocking parameters (400) from the datastream (16),performing deblocking post-processing by modifying (404) the time-domain signal (302i)using the one or more deblocking parameters (400) to obtain a modified time-domain signal(302’i).

2. Decoder of claim 1, wherein the one or more deblocking parameters (400) define a linearfunction.

3. Decoder of claim 1, wherein the one or more deblocking parameters (400) define atrigonometric half-wave function parametrized by a half-wave offset and a half-wave amplitude.

4. Decoder of any of claims 1 or 2, wherein the one or more deblocking parameters (400)define a blocking-and-ringing-artefact-reducing function and the decoder is configured to modify (404) the time-domain signal (302i) using the one or more deblocking parameters (400) to obtain the modified time-domain signal by linearly combining the blocking-and-ringing-artefact-reducing function and the time-domain signal (302’i).

5. Decoder of any of the previous claims, wherein the one or more deblocking parameters(400) comprise a gating flag which, if set, indicates that the deblocking post-processing is active and that the one or more deblocking parameters (400) comprise one or more function parametersdefining a blocking-and-ringing-artefact-reducing function ought to be linearly combined with thetime-domain signal (302i) to obtain the modified time-domain signal (302’i), and, if not set, indicates that the deblocking post-processing is inactive, the one or more deblocking parameters FH250105PCT-2025007739.DOCXfe(400) only comprise the gating flag, and the modified time-domain signal (302’i) equals the time- domain signal (302i).

6. Decoder of any of the previous claims, configured todetermine a further deblocking parameter (400b) based on the prediction signal (64i) of the respective transform-coded temporal block (140i) and one or more already coded samples of the digital time-varying signal, perform the deblocking post-processing by modifying (404) the time-domain prediction residual signal (302i) using the one or more deblocking parameters (400a) and the further deblockingparameter (400b) to obtain the modified time-domain prediction residual signal (302’i).

7. Decoder of claim 6, configured todetermine an extension of the prediction signal (64i) of the digital time-varying signal, combine the extension of the prediction signal (64i) and the one or more already coded samples of the digital time-varying signal in order to obtain a modified version of the one or more already coded samples, and determine the further deblocking parameter (400b) based on an extrapolation of the modified version of the one or more already coded samples.

8. Decoder of claim 6, configured todetermine an extrapolation of a plurality of already coded samples that precede the respective transform coded temporal block (140i), determine the further deblocking parameter (400b) based on the extrapolation of the plurality of already coded samples and the prediction signal (64i), e.g., based on a difference between the extrapolation and a value of the temporally first sample).

9. Decoder of any of claims 6 to 8,FH250105PCT-2025007739.DOCXfewherein the further deblocking parameter (400b) and the one or more deblocking parameters (400a) define a linear function (320a).

10. Decoder of any of claims 6 to 8,wherein the further deblocking parameter (400b) and the one or more deblocking parameters (400a) define a trigonometric half-wave function (320b) parametrized by a half-wave offset and an half-wave amplitude.

11. Decoder of any of claims 6 to 10 when dependent on claim 4,wherein the blocking-and-ringing-artefact-reducing function is defined by the one or more deblocking parameters (400a) and by the further deblocking parameter (400b).

12. Decoder of any of claims 6 to 11, wherein the further deblocking parameter (400b) isdetermined to minimize a value of a first sample of the modified time-domain prediction residualsignal (302’i).

13. Decoder of any of the previous claims, configured topredicting the respective transform-coded temporal block (140i) using a selectedprediction mode out of a set of prediction modes to obtain a prediction signal (64 i),wherein the modified time-domain signal (302’i) is a time-domain prediction residual signal; using the time-domain prediction residual signal (302’i, 302i-1) to correct (308) theprediction signal (64i-1) to reconstruct the transform-coded temporal block (140i).

14. Decoder of any previous claim, wherein the predetermined re-transformation is an inversediscrete cosine transform or an inverse discrete sine transform.

15. Decoder of any previous claim, wherein the predetermined re-transformation isrepresentable by a matrix multiplication between a transform matrix and a first vector whose components are formed by the coefficients (300i, 300i-1), wherein an output vector resulting from the matrix multiplication has as many components as samples (310) comprised by the time-domain prediction residual signal (302’i, 302i-1).FH250105PCT-2025007739.DOCXfe16. Decoder of any previous claim, wherein the transform domain results from the time domainaccording to a predetermined transformation, wherein the decoder is configured to select the predetermined transformation out of a set of transformations, wherein the re-transformation reverses the predetermined transformation.

17. Decoder of claim 16, configured to select the set of transformations out of a superset oftransformations depending on one or more of- a length of the respective transform-coded temporal block (140i, 140i-1),- the selected prediction mode for the respective transform-coded temporal block (140i,140i-1).

18. Decoder of claim 16 or 17, wherein the set of transformations comprises one or more ofone or more discrete cosine transforms, one or more discrete sine transforms, and an identity transform.

19. Decoder of claim 18, configured to skip the subjecting (306) the coefficients to thepredetermined re-transformation if the predetermined transformation is the identity transform.

20. Decoder of any previous claim, wherein the transform domain results from the time domainaccording to a predetermined transformation, wherein the predetermined transformation and the predetermined re-transformation are windowing free.

21. Decoder of any previous claim, wherein the transform domain results from the time domainaccording to a predetermined transformation, wherein the predetermined transformation is a spectrally decomposing transformation.

22. Decoder of any previous claim, wherein a sample rate of the digital time-varying signal(92) is above, or equal to, a Nyquist rate of the transform domain.

23. Decoder of any previous claim, wherein, for each transform-coded temporal block, anumber of the coefficients (300i, 300i-1) coincides with a number of samples (312) of the respective transform-coded temporal block. FH250105PCT-2025007739.DOCXfe24. Decoder of any previous claim, wherein the time-domain prediction residual signal (302’i,302i-1) results from the subjecting (306) the coefficients (300i, 300i-1) of the respective transform- coded temporal block (140i-1) to the predetermined re-transformation in a manner independent from a prediction residual signal (80) of temporally adjacent temporal blocks (140i, 140i-2), preceding and following the respective transform-coded temporal block (140i-1).

25. Decoder of any previous claim, wherein the transform domain is a critically sampledtransform domain.

26. Decoder of any previous claim, wherein basis functions of the predetermined re-transformation are of a length coinciding with a length of the respective transform-coded temporal block (140i, 140i-1).

27. Decoder of any previous claim, wherein the set of prediction modes comprises one ormore of a DC prediction mode according to which the prediction signal of the respective transform-coded temporal block is determined to be a constant function with a determination of a constant of the constant function based on predetermined already decoded samples preceding the respective transform-coded temporal block, one or more linear prediction modes according to which the prediction signal of the respective transform-coded temporal block is determined to be a linear function with a determination of at least one of a slope and an offset of the linear function based on predetermined already decodedsamples preceding the respective transform-coded temporal block,a block-copy prediction mode according to which the prediction signal of the respective transform- coded temporal block is predicted based on one or more reference block portions of already decoded samples preceding the respective transform-coded temporal block offset relative to the respective transform-coded temporal block at a position signalled for the respective transform- coded temporal block in the data stream, a cross-channel prediction mode according to which the prediction signal of the respective transform-coded temporal block is predicted based on one or more reference coded channels out of coded channels which represent a multi-channel signal (14) coded into the data stream and to FH250105PCT-2025007739.DOCXfebe decoded from the data stream by the decoder, and one of which is represented by the digitaltime-varying signal (92), and a bypass prediction mode according to which the prediction signal of the respective transform- coded temporal block is set to zero.

28. Decoder of any of claims,wherein the digital time-varying signal (92) is obtained by at least one of Electrocardiography,Electroencephalography, Electromyography or seismic measurement, and / orwherein the digital time-varying signal (92) is a bio-physiological waveform data such as anelectroencephalography, EEG, signal, an electrocardiogram, ECG, or an electromyography ,EMG, signal, or is a seismic waveform signal.

29. Decoder of any previous claim, configured toconfigured to support different lengths of the transform-coded temporal blocks and set a length ofthe transform-coded temporal blocks according to a length parameter in the data stream.

30. Decoder of any previous claim,configured to support different lengths of the transform-coded temporal blocks and switch between the different lengths of the transform-coded temporal blocks at predetermined bordersbetween consecutive temporal blocks according to a length parameter in the data stream.

31. Encoder for encoding a digital time-varying signal (92) into a data stream (16), configuredtoencode the digital time-varying signal (92) into the data stream (16) in non-overlapping temporalblocks (140) by encoding each of transform-coded temporal blocks (140i) of the non-overlapping temporal blocks (140) of the digital time-varying signal (92) by performing a deblocking pre-processing by determining one or more deblocking parameters (400), FH250105PCT-2025007739.DOCXfemodifying (404) a time-domain signal (302’i) of the respective transform-coded temporal block (140i) using the one or more deblocking parameters (400) to obtain a modified time-domain signal (302i),subjecting (306) the modified time-domain signal (302i) to a predetermined transformationfrom a time domain to transform domain to obtain coefficients (300i), wherein the transformation is a non-overlapping transform, encoding (304) the coefficients (300i) into the data stream (16).

32. Encoder of claim 31, wherein the one or more deblocking parameters (400) define a linearfunction.

33. Encoder of claim 31, wherein the one or more deblocking parameters (400) define atrigonometric half-wave function by way of a half-wave offset and an half-wave amplitude.

34. Encoder of any of claims 31 to 33, wherein the one or more deblocking parameters (400)define a blocking-and-ringing-artefact-reducing function and the encoder is configured to modify (404) the time-domain signal (302’i) using the one or more deblocking parameters (400) by linearly combining the blocking-and-ringing-artefact-reducing function and the time-domain signal (302’i).

35. Encoder of any of claims 31 to 34, wherein the one or more deblocking parameters (400)comprise a gating flag which, if set, indicates that the deblocking pre-processing is active and that the one or more deblocking parameters (400) comprise one or more function parameters defininga blocking-and-ringing-artefact-reducing function ought to be linearly combined with the time-domain signal (302’i) to yield the modified time-domain signal (302i), and, if not set, indicates that the deblocking pre-processing is inactive, the one or more deblocking parameters (400) only comprise the gating flag, and the modified time-domain signal (302i) equals the time-domain signal (302’i).

36. Encoder of any of claims 31 to 35, configured todetermine a further deblocking parameter (400b) based on the prediction signal (64i) of the respective transform-coded temporal block (140i) and one or more already coded samples of the digital time-varying signal, FH250105PCT-2025007739.DOCXfeperform the deblocking post-processing by modifying (404) the time-domain prediction residual signal (302i) using the one or more deblocking parameters (400a) and the further deblockingparameter (400b) to obtain the modified time-domain prediction residual signal (302’i).

37. Encoder of claim 36, configured todetermine an extension of the prediction signal (64i) of the digital time-varying signal, combine the extension of the prediction signal (64i) and the one or more already coded samples of the digital time-varying signal in order to obtain a modified version of the one or more already coded samples, and determine the further deblocking parameter (400b) based on an extrapolation of the modified version of the one or more already coded samples.

38. Encoder of claim 36, configured todetermine an extrapolation of a plurality of already coded samples that precede the respective transform coded temporal block (140i), determine the further deblocking parameter (400b) based on the extrapolation of the plurality of already coded samples and the prediction signal (64i).

39. Encoder of any of claims 36 to 38,wherein the further deblocking parameter (400b) and the one or more deblocking parameters (400a) define a linear function (320a).

40. Encoder of any of claims 36 to 38,wherein the further deblocking parameter (400b) and the one or more deblocking parameters (400a) define a trigonometric half-wave function (320b) parametrized by a half-wave offset and an half-wave amplitude.

41. Encoder of any of claims 36 to 40 when dependent on claim 34,FH250105PCT-2025007739.DOCXfewherein the blocking-and-ringing-artefact-reducing function is defined by the one or more deblocking parameters (400a) and by the further deblocking parameter (400b).

42. Encoder of any of claims 36 to 41, wherein the further deblocking parameter (400b) isdetermined to minimize a value of a first sample of the modified time-domain prediction residualsignal (302’i).

43. Encoder of any of claims 31 to 42, wherein the one or more deblocking parameters (400)define a blocking-and-ringing-artefact-reducing function, and the encoder is configured to modify(404) the time-domain signal (302’i) using the one or more deblocking parameters (400) by linearlycombining the blocking-and-ringing-artefact-reducing function and the time-domain signal (302’i) and determine the one or more deblocking parameters so that the linearly combining the blocking- and-ringing-artefact-reducing function and the time-domain signal (302’i) results -in the modified time-domain signal (302i) getting zero at a leading and trailing endof the respective transform-coded temporal block (140I), or getting closer to zero than a predetermined maximum distance, or -in the modified time-domain signal (302i) getting a zero mean slope withinrespective transform-coded temporal block (140I), or in a mean slope of themodified time-domain signal (302i) getting closer to zero than a predetermined maximum deviation.

44. Encoder of any of claims 31 to 42, wherein the one or more deblocking parameters (400)define a blocking-and-ringing-artefact-reducing function and wherein the encoder is configured to modify (404) the time-domain signal (302’i) using the one or more deblocking parameters (400) by linearly combining the blocking-and-ringing-artefact-reducing function and the time-domainsignal (302’i), and wherein the encoder is configured todetermine a statistical dispersion value of the time-domain signal (302’i), if the statistical dispersion value falls into a value range being indicative of a smooth signal, determine the one or more deblocking parameters so that the linearly combining the blocking-and-ringing-artefact-reducing function and the time-domain signal (302’i) results -in the modified time-domain signal (302i) getting zero at a leading and trailing endof the respective transform-coded temporal block (140I), or getting closer to zero than a predetermined maximum distance, FH250105PCT-2025007739.DOCXfeIf the statistical dispersion value falls into a value range being indicative of a non-smooth signal, determine the one or more deblocking parameters so that the linearly combining the blocking-and-ringing-artefact-reducing function and the time-domain signal (302’i) results -in the modified time-domain signal (302i) getting a zero mean slope withinrespective transform-coded temporal block (140I), or in a mean slope of themodified time-domain signal (302i) getting closer to zero than a predetermined maximum deviation.

45. Encoder of any of claims 31 to 44, configured todetermine a noisiness measure of the time-domain signal (302’i), if the noisiness measure falls into a value range being indicative of a noisy signal, not set a gating flag comprised by the one or more deblocking parameters (400) so as to indicate that the deblocking pre-processing is inactive so that the one ormore deblocking parameters (400) only comprise the gating flag, and the modified time-domain signal (302i) equals the time-domain signal (302’i), or set one or more function parameters which define a blocking-and-ringing-artefact- reducing function ought to be linearly combined with the time-domain signal (302’i) to obtain the modified time-domain signal (302i) and are comprised by the one or more deblocking parameters so that the blocking-and-ringing-artefact-reducing function is zero so that that a deblocking is effectively disabled and if the noisiness measure does not fall into the value range being indicative of a noisy signal, determine the one or more function parameters so that so that the linearly combining the blocking-and-ringing-artefact-reducing function and the time-domain signal (302’i) results -in the modified time-domain signal (302i) getting zero at a leading and trailing endof the respective transform-coded temporal block (140I), or getting closer to zero than a predetermined maximum distance, or -in the modified time-domain signal (302i) getting a zero mean slope withinrespective transform-coded temporal block (140I), or in a mean slope of themodified time-domain signal (302i) getting closer to zero than a predetermined maximum deviation. FH250105PCT-2025007739.DOCXfe46. Encoder of any of claims 31 to 45, configured topredict the respective transform-coded temporal block (140i) using a selected prediction mode out of a set of prediction modes to obtain a prediction signal (64i), determine the time-domain signal (302’i) to be a time-domain prediction residual signal for correction (308) of the prediction signal (64i-1) to reconstruct the transform-coded temporal block (140i).

47. Encoder of any of claims 31 to 46, configured to encode the one or more deblockingparameters (400) into the data stream (16).

48. Encoder of any of claims 31 to 47, wherein the predetermined transformation is a discretecosine transform or a discrete sine transform.

49. Encoder of any of claims 31 to 48, wherein the predetermined transformation isrepresentable by a matrix multiplication between a transform matrix and a first vector whose components are formed by samples (310) comprised by the time-domain prediction residual signal (302i-1), wherein an output vector resulting from the matrix multiplication has a many components as the coefficients (300i-1).

50. Encoder of any previous claim 31 to 49, wherein the encoder is configured to select thepredetermined transformation out of a set of transformations.

51. Encoder of claim 50, configured to select the set of transformations out of a superset oftransformations depending on one or more of -a length of the respective transform-coded temporal block (140i-1),- the selected prediction mode for the respective transform-coded temporal block (140i-1).

52. Encoder of claim 50 or 51, wherein the set of transformations comprises one or more ofone or more discrete cosine transforms, one or more discrete sine transforms, and an identity transform. FH250105PCT-2025007739.DOCXfe53. Encoder of claim 52, configured to skip the subjecting (306) the time-domain predictionresidual signal (302i-1) to the predetermined transformation if the predetermined transformation isthe identity transform.

54. Encoder of any previous claim 31 to 53, wherein the predetermined transformation iswindowing free.

55. Encoder of any previous claim 31 to 54, wherein the predetermined transformation is aspectrally decomposing transformation.

56. Encoder of any previous claim 31 to 55, wherein a sample rate of the digital time-varyingsignal (92) is above, or equal to, a Nyquist rate of the transform domain.

57. Encoder of any previous claim 31 to 56, wherein, for each transform-coded temporal block,a number of the coefficients (300i-1) coincides with a number of samples (312) of the respective transform-coded temporal block.

58. Encoder of any previous claim 31 to 57, configured to subject the time-domain predictionresidual signal (302i-1) to the predetermined transformation in a manner independent from aprediction residual signal (80) of temporally adjacent temporal blocks (140i, 140i-2), preceding and following the respective transform-coded temporal block (140i-1)59. Encoder of any previous claim 31 to 58, wherein the transform domain is a criticallysampled transform domain.

60. Encoder of any previous claim 31 to 59, wherein basis functions of the predeterminedtransformation are of a length coinciding with a length of the respective transform-coded temporal block (140i-1).

61. Encoder of any previous claim 31 to 60, wherein the set of prediction modes comprisesone or more of a DC prediction mode according to which the prediction signal of the respective transform-coded temporal block is determined to be a constant function with a determination of a constant of the FH250105PCT-2025007739.DOCXfeconstant function based on predetermined already encoded samples preceding the respective transform-coded temporal block, one or more linear prediction modes according to which the prediction signal of the respective transform-coded temporal block is determined to be a linear function with a determination of at least one of a slope and an offset of the linear function based on predetermined already encodedsamples preceding the respective transform-coded temporal block,a block-copy prediction mode according to which the prediction signal of the respective transform- coded temporal block is predicted based on one or more reference block portions of already encoded samples preceding the respective transform-coded temporal block offset relative to the respective transform-coded temporal block at a position signalled for the respective transform- coded temporal block in the data stream, a cross-channel prediction mode according to which the prediction signal of the respective transform-coded temporal block is predicted based on one or more reference coded channels outof coded channels which represent a multi-channel signal (14) to be coded into the data stream,and one of which is represented by the digital time-varying signal (92), anda bypass prediction mode according to which the prediction signal of the respective transform- coded temporal block is set to zero.

62. Encoder of any of claims 31 to 61,wherein the digital time-varying signal (92) is obtained by at least one of Electrocardiography,Electroencephalography, Electromyography or seismic measurement, and / orwherein the digital time-varying signal (92) is a bio-physiological waveform data such as anelectroencephalography, EEG, signal, an electrocardiogram, ECG, or an electromyography,EMG, signal, or is a seismic waveform signal.

63. Encoder of any previous claim 31 to 62, configured toconfigured to support different lengths of the transform-coded temporal blocks and to selectivelyset a length of the transform-coded temporal blocks in the data stream.FH250105PCT-2025007739.DOCXfe64. Encoder of any previous claim 31 to 63, configured tosupport different lengths of the transform-coded temporal blocks,select and encode a length parameter in the data stream, wherein a switching between differentlengths of the transform-coded temporal blocks is performed at predetermined borders betweenconsecutive temporal blocks.

65. Method for decoding a digital time-varying signal (92) from a data stream (16), the methodcomprisingdecoding the digital time-varying signal (92) from the data stream (16) in non-overlappingtemporal blocks (140) by decoding each of transform-coded temporal blocks (140i) of the non- overlapping temporal blocks (140) of the digital time-varying signal (92) by decoding (304) coefficients (300i) from the data stream (16), subjecting (306) the coefficients (300i) to a predetermined re-transformation from a transform domain to time domain to obtain a time-domain signal (302i), wherein the re- transformation is a non-overlapping transform, decoding (402) one or more deblocking parameters (400) from the datastream (16), performing deblocking post-processing by modifying (404) the time-domain signal (302i) using the one or more deblocking parameters (400) to obtain a modified time-domain signal (302’i).

66. Method for encoding a digital time-varying signal (92) into a data stream (16), the methodcomprisingencoding the digital time-varying signal (92) into the data stream (16) in non-overlapping temporalblocks (140) by encoding each of transform-coded temporal blocks (140i) of the non-overlapping temporal blocks (140) of the digital time-varying signal (92) by performing a deblocking pre-processing by determining one or more deblocking parameters (400), modifying (404) a time-domain signal (302’i) of the respective transform-coded temporal block (140i) using the one or more deblocking parameters (400) to obtain a modified time-domain signal (302i), FH250105PCT-2025007739.DOCXfesubjecting (306) the modified time-domain signal (302i) to a predetermined transformation from a time domain to transform domain to obtain coefficients (300i), wherein the transformation is a non-overlapping transform, encoding (304) the coefficients (300i) into the data stream (16).

67. Data stream encoded using the method according to claim 66.

68. A computer program for implementing the method of one of claims 65 and 66 when beingexecuted on a computer or signal processor. FH250105PCT-2025007739.DOCXfe

Images