DEVICE AND METHOD FOR COMPRESSING A DATA STREAM

Abstract

We provide a method of compressing a data stream for transmission, including: generating a data sequence representing a received data stream, generating a plurality of data substreams, each comprising a portion of the data sequence, identifying a formal concept defining a dependency between a first one of the data substreams and one or more further ones of the data sub streams that are dependent on the first data substream, removing those dependent data sub streams from the plurality of data sub streams, and transmitting the remaining data sub streams, and a method of reconstructing a data stream at a receiver, including: receiving a received data sequence representing a received data stream, identifying that a substream has been removed from the data stream prior to transmission, identifying a formal concept definition for regenerating the removed substream based on an identified substream of the received data sequence, regenerating a data substream using the formal concept definition and the identified sub stream of the received data sequence, and adding the regenerated data substream to the received data sequence.

Claims

1. A method of compressing a data stream for transmission, including: generating a data sequence representing a received data stream, generating a plurality of data sub streams, each comprising a portion of the data sequence, identifying a formal concept defining a dependency between a first one of the data sub streams and one or more further ones of the data sub streams that are dependent on the first data sub stream, removing those dependent data sub streams from the plurality of data sub streams, transmitting the remaining data sub streams.

2. A method according to claim 1, wherein the step of identifying a formal concept includes identifying a plurality of formal concepts, each defining a dependency between a first one of the data sub streams and one or more of the further ones of the data sub streams that are dependent on the first data sub stream.

3. A method according to claim 1, further including the step of transmitting data representative of the formal concept for use in reconstructing the removed data substreams at the receiver.

4. A method according to claim 1 wherein the data stream is an EEG data stream, comprising data from an electroencephalogram.

5. A method according to claim 1 further including transforming the data stream using a Fast Fourier Transform or its inverse to convert the data stream from the time domain to the frequency domain.

6. A method according to claim 5 further including applying a threshold to the data stream such that values less than 6 are rounded to zero.

7. A method according to claim 6 further including a step of further compressing the data stream by removing occurrences of sequential consecutive zero values in the data stream and replacing those removed sequences of zeros with data representing the length of the sequence of consecutive zeros removed.

8. A system including a transmitter and a processor, wherein the processor is configured to: generate a data sequence representing a received data stream, generate a plurality of data substreams, each comprising a portion of the data sequence, identify a formal concept defining a dependency between a first one of the data substreams and one or more further ones of the data substreams that are dependent on the first data substream, and remove those dependent data sub streams from the plurality of data sub streams, wherein the transmitter is configured to transmit the remaining data sub streams.

9. A method of reconstructing a data stream at a receiver, including: receiving a received data sequence representing a received data stream, identifying that a substream has been removed from the data stream prior to transmission, identifying a formal concept definition for regenerating the removed substream based on an identified substream of the received data sequence, regenerating a data substream using the formal concept definition and the identified substream of the received data sequence, and adding the regenerated data substream to the received data sequence.

10. A method according to claim 9, wherein the step of identifying a formal concept includes identifying a plurality of formal concepts, each defining a dependency between a first one of the data sub streams and one or more of the further ones of the data sub streams that are dependent on the first data sub stream.

11. A method according to claim 9, wherein identifying the formal concept includes receiving data representative of the formal concept.

12. A method according to claim 9, wherein identifying the formal concept includes accessing data stored at the receiver representative of the formal concept.

13. A method according to claim 9, further including transforming the data stream using a Fast Fourier Transform or its inverse to convert the data stream from the frequency domain to the time domain.

14. A method according to claim 9, further including identifying, in the received data sequence, data representing the length of a sequence of zeros removed from the data stream prior to transmission, and inserting a sequence of zeros of the identified length in the received data sequence.

15. A system including a receiver and a processor, wherein the receiver is configured to receive a data stream, and the processor is configured to: generate a data sequence representing the data stream, identify that a substream has been removed from the data stream prior to transmission, identify a formal concept definition associated with regenerating the removed substream based on an identified substream of the received data sequence, regenerate a data substream using the formal concept definition and the identified substream of the received data sequence, and add the regenerated data substream to the received data sequence.

Description

[0044] We now describe features of embodiments of the invention, by way of example only, with reference to the accompanying drawings of which

[0045] FIG. 1 is a diagram illustrating the method of the present invention, embodied by a transmitter and a receiver according to the invention,

[0046] FIG. 2 is a diagram of a transceiver architecture for IEEE802.11ah systems,

[0047] FIG. 3 is a diagram of the transceiver architecture of the present invention for use with EEG,

[0048] FIG. 4 is a table illustrating transformation of generated streams into a binary relation,

[0049] FIGS. 5 and 6 are graphs illustrating an example EEG signal in the time domain, and in the frequency domain, respectively,

[0050] FIG. 7 is a graph illustrating symbols after IFFT while considering 16-QAM modulation,

[0051] FIGS. 8 and 9 are graphs illustrating the original EEG signal and reconstructed signal, respectively,

[0052] FIG. 10 is a graph illustrating the generated symbols after IFFT while considering 256-QAM modulation, before compression (left) and after compression (right),

[0053] FIGS. 11 and 12 are graphs illustrating generated symbols' streams before modulation and after IFFT, respectively, while considering QPSK modulation,

[0054] FIG. 13 is a diagram showing the main steps of the SBC scheme of the present invention,

[0055] FIG. 14 is a graph illustrating the effect of varying C.sub.r on signal distortion and SER when the TBC scheme and 16-QAM modulation are used,

[0056] FIG. 15 is a graph showing the effects of varying the threshold on C.sub.r and signal distortion using TBC scheme and 256-QAM modulation, for different window size W,

[0057] FIG. 16 is a graph showing the effect of varying threshold 61 on the compression ratio, signal distortion, and sample error rate, when the QPSK modulation is used,

[0058] FIG. 17 is a graph showing the effect of knowledge discovery on enhancing compression ratio and signal distortion for QPSK modulation, and

[0059] FIG. 18 is a graph showing the distortion variation for different values of compression ratio, for the proposed SBC-KD technique, and the DWT-level thresholding scheme.

[0060] With reference to the drawings we describe the methods and devices involved.

[0061] The devices of the present invention are configured to operate broadly as outlined in FIG. 1 of the drawings, in line with the method described in detail below. The figure illustrates a system 10 incorporating a transmitter 12 and receiver 14. The figure illustrates the flow of data from EEG acquisition (performed using an EEG headset, for example, or by any other EEG acquisition device as is known in the art), via standard processing steps of sampling and quantization, to transmission. In this case, as shown in FIG. 1, the data is processed through a step of data decomposition, as described below, prior to transmission. The received signal is then reconstructed during a signal reconstruction step at the receiver 14 (or at a processing device receiving the signal from the receiver). The modules involved in this process are described below.

[0062] While the techniques described are suitable for EEG data, it should be appreciated that the techniques may be applied to other data sources and data types.

Sampling

[0063] Let the original continuous-time electroencephalography (EEG) waveform s(t) have a duration of T seconds. The waveform is sampled at a constant interval of T.sub.s seconds to yield Ns discrete-time consecutive samples. The sampling frequency is then given as F.sub.s=1/T.sub.sHz.

[0064] Hence,

s.sub.n=s(t)(tnT.sub.s)=s(nT.sub.s)(1)

[0065] for n{0, 1, . . . , N.sub.s1}, where () is the Dirac delta function. Our adopted notations are set out in Table II.

TABLE-US-00001 TABLE II SUMMARY OF USED NOTATIONS. Notation Definition T EEG waveform duration N.sub.s Number of samples F.sub.s = N.sub.s/T Hz Sampling Frequency T.sub.s Inter-sample duration L Number of bits per sample M Number of symbols per sample K = L/M Number of bits per symbol [0066] Quantization: The continuous amplitude of each sampled signal is quantized using an L-bit analog-to-digital converter (ADC) to one of 2.sup.L levels, yielding the quantized signal {tilde over (x)}.sub.n time index n. Each signal {tilde over (x)}.sub.n holds a signed integer value in range {2.sup.L-1, . . . , 2.sup.L-11}. We can express the quantized signal in vector form as

[00001]$\begin{array}{cc}\underset{N_{s}1}{\tilde{x}}={\left[x_0.Math..Math.x_1.Math..Math.\mathrm{.Math.}.Math..Math.x_{N_s-1}\right]}^T.& \left(2\right)\end{array}$ [0067] Data Decomposition: The collected EEG quantized samples are written as a sequence of symbols that depend on the adopted modulation. Such symbols are then divided into multiple streams, which are processed using Formal Concept Analysis in order to discover the correlation existing between the different streams. The streams that are found to be independent of each other, are compressed end transmitted, while others are discarded. Additionally, each steam is compressed separately, using a compression threshold that suits its characteristics, thus farther increasing the compression ratio. [0068] Threshold-Based Transceiver: To comply with the current and future trends, we start from the typical OFDM transceiver architecture (depicted in FIG. 2-(a)), and add two simple blocks: the Threshold-based Compression (TBC) and the FFT Vector Reconstruction, [0069] Nevertheless, our solution can be applied to other transceiver architectures such as the one adopted by the IEEE802.11ah and the IEEE802.15.4g standards. [0070] In the proposed transceiver architecture, it is assumed that the available quantized samples are encoded into an unsigned binary sequence via the L-bit ADC. We first turn the generated signed-inner samples into non-negative integers by a simple shift, i.e.,

x.sub.n={tilde over (x)}.sub.n+2.sup.L-1.(3) [0071] Then the symbols are forwarded to the modulation and IFFT modules. Details on am TBC and FFT vector reconstruction blocks are discussed in the following section.

[0072] FIG. 2 provides a block diagram of the transceiver architecture for IEEE802.11ah systems, and FIG. 3 shows the adopted EEG transceiver of the invention. It should be noted in those Figures that both the transmitter 12 and receiver 14 include a step involving insertion (and removal, respectively) of guard intervals, as is known in the art (a guard interval being a time gap inserted to avoid interference between distinct transmissions).

[0073] The physical layer's characteristics are leveraged to decompose quantized EEG samples into multiple streams of symbols, such that the dependency between different streams is reduced, and hence, compressibility is improved. In general terms, the signal is split (i.e. decomposed) into multiple streams. The streams are then analysed to discover dependencies and similarities between the stream content, and this information is then used to limit or reduce the data for transmission. In more detail, the steps involved are as follows.

[0074] In broad terms, the method involves generating a data sequence representing a received data stream. In other words, a stream of symbols is generated as a representation of the data stream that is received from a measuring device such as an EEG headset, for example, or from another data source. The method then involves generating a plurality of data substreams, each comprising a portion of the data sequence. These substreams can then be analysed to determine whether any formal concept exists, linking one or more of the substreams. One or more formal concepts are identifyied, each defining a dependency between a first one of the data substreams and one or more further ones of the data substreams that are dependent on the first data substream. To compress the data for transmission, the redundant dependent substreams can be removed, since they can be recreated at the receiver based on knowledge of the formal concept, and the substream to which they are linked by the formal concept.

[0075] To this end, once an applicable formal concept has been identified, the transmitter may include data representative of that formal concept. This may involve either describing the formal concept, or otherwise allowing the receiver to identify it (for example, by reference to a stored record of formal concepts).

[0076] At the receiver side, the receiver identifies that a substream has been removed from the data stream prior to transmission. This may occur based on identification of a symbol or token identifying the removal of a substream at a point in the data, or may identify a formal concept directly and/or provide a definition of that formal concept. This enables the receiver to identify a specific formal concept and a substream of the data to which the formal concept should be applied to recreate the removed substream. In response to identifying this information, the receiver may regenerate a data substream using the formal concept definition and the identified substream of the received data sequence, and add the regenerated data substream to the received data sequence. [0077] A. Data Decomposition [0078] We first decompose the EEG signal x.sub.n into multiple streams of symbols x.sup.m, for m{1, 2, . . . , M}. Let the binary encoded sequence of x.sub.n be denoted as b.sub.2.sub.L, with .sub.p being the Galois Field of order p. Hence, b is a sequence of L bits on the form

[00002]$\begin{array}{cc}b=\stackrel{\stackrel{L.Math..Math.\mathrm{bits}}{}}{\left[\underset{\underset{b^{\left(M-1\right)}}{}}{b_{K-1}^{\left(M-1\right)}.Math..Math.\mathrm{.Math.}.Math..Math.b_0^{\left(M-1\right)}}.Math..Math.\mathrm{.Math.}.Math..Math.\underset{\underset{b^{\left(0\right)}}{}}{b_{K-1}^{\left(0\right)}.Math..Math.\mathrm{.Math.}.Math..Math.b_0^{\left(0\right)}}\right]}& \left(4\right)\end{array}$ [0079] where b.sup.(m) is the group of K bits composing the m-th symbol, with m{1, . . . , M}, where K and M depend on the modulation type. More specifically, M is the number of symbols per sample, which depends, not only on the modulation order O, but also on the number of bits per sample L, as follows:

[00003]$\begin{array}{cc}M=\frac{L}{{\log }_2\left(O\right)}=\frac{L}{K}.& \left(5\right)\end{array}$ [0080] Then, x.sub.n can be rewritten as:

[00004]$\begin{array}{cc}{x}_n=\underset{m=0}{\overset{M-1}{.Math.}}.Math.\underset{k=0}{\overset{K-1}{.Math.}}.Math.2^{\mathrm{mK}+k}.Math.b_k^{\left(m\right)}=\underset{m=0}{\overset{M-1}{.Math.}}.Math.2^{\mathrm{mK}}.Math.x^m,& \left(6\right)\\ \mathrm{with}& \\ x^m=\underset{k=0}{\overset{K-1}{.Math.}}.Math.2^k.Math.b_k^{\left(m\right)}.& \left(7\right)\end{array}$ [0081] In conclusion, the bit stream block b.sup.(m) is simply the binary representation of x.sup.m, which implies x.sup.m{0, 1, . . . , 2.sup.K1}.

B. Knowledge Discovery

[0082] We leverage the symbol streams that are created, and the compression ratio can be further increased by discovering the correlation between different streams. In summary, using Formal Concept Analysis (FCA) for knowledge discovery, we select the minimal-representative streams so as to minimise the number of transmitted data streams without losing knowledge. [0083] We start by introducing the basic notions used to induce a binary relation between the generated streams. Let be the set of streams (i.e., objects). the set of symbols' values (i.e., attributes), and I the binary relation on the universe 6=A that defines which objects have which attributes. In order to transform our streams into formal context of (, A, I), we consider the attributes .sub.v of each symbol s to be all the possible values it may take, depending on the employed modulation, for v{0, 1, . . . , 2.sup.K1}, and .sub.v{0, 1}. Thus, the vector of attributes A for each stream x.sup.m is defined as

[00005]$\begin{array}{cc}A\left({\tilde{x}}^m\right)=\left[\underset{\underset{s_1}{}}{a_0.Math..Math.\mathrm{.Math.}.Math..Math.a_2.Math.{}_{-1}}.Math..Math.\mathrm{.Math.}.Math..Math.\underset{\underset{s_{N_s}}{}}{a_0.Math.\mathrm{.Math.}.Math..Math.a_2.Math.{}_{-1}}\right],& \left(8\right)\end{array}$ [0084] where A rte is the possible values of each symbol.

[0085] The aim is to obtain the dependency between different streams through finding the minimal set of formal concepts covering our relation. (O,A) is a formal concept if A is the set of all attributes shared by the objects O, and in the same time O is the set of all objects that have all attributes in A.

[0086] We refer to the implications as the minimal set of rules, by which we can infer some attributes from others. We can derive formal concepts from our formal context using the derivation operators or difunctional decomposition. Difunctional decomposition enables obtaining the isolated points of a binary relation through calculating the Fringe Relation. This fringe relation is, by definition, a difunctional relation, and all its elements are isolated points. Thus, the formal concepts can be easily obtained by finding such isolated points, since if (a; b) is an isolated point, by definition it is included in one concept only.

[0087] Once the formal concepts are derived, implications can be identified, hence transmitting only the minimal-representative number of streams. For the sake of clarity, we describe the adopted procedure by referring to a toy example where a data length of 20 samples with QPSK modulation is considered.

Step 1: Generation of Formal Context.

[0088] Consider the generated streams of symbols. We consider each stream as an object with attributes corresponding to its symbols' values. As an example, FIG. 4 illustrates the formal context of 6 streams with 20 symbols.

Step 2: Identifying Formal Concepts.

[0089] The generated binary relation are then decomposed into a set of concepts, using the algorithm presented by R. Khcherif, M. M. Gammoudi, and A. Jaoua, Using difunctional relations in information organization, Information Sciences 125, pp. 153-166, 2000, for example. However, in order to identify the dependency between different streams, we leverage a concept referred to as shadow concept: considering not only the attributes for which the relation I is equal to 1, but also the negation of the attributes, i.e., the attributes values for which the relation is equal to 0. In this case, both the attributes and the negation of the attributes form the identified concept.

Step 3: From Concepts to Implications.

[0090] Based on the identified concepts, we derive the implications that can be used to effectively eliminate the streams that can be retrieved at the receiver using their implications with other received streams. For instance, looking at FIG. 4, we can easily identify from the obtained concept that O.sub.2.fwdarw.O.sub.1, where .fwdarw. stands for the implications, since O.sub.2=|O.sub.1+2|.sub.4 for O.sub.2, O.sub.1[0, . . . , 3].

Step 4: Elimination.

[0091] For each obtained concept, we transmit only one stream and eliminate other streams that belong to the same concept. Then, the retrieval process is carried out at the receiver using the identified implications.

A. EEG Signal Characteristics

[0092] We first visualize and analyze the EEG signal in the time and frequency domains in order to understand its properties and obtain the best approach of processing and transmission. A normal continuous EEG signal in the time domain is shown in FIG. 5. Using frequency domain analysis, we can significantly reduce the amount of data to be transmitted. This can be done through transforming the collected EEG data into the frequency domain using FFT, which is a classic frequency analysis method with complexity O(N log N).

[0093] Looking at the generated spectrum shown in FIG. 6, we observe that it is to some extent sparse, or compressible. Here compressible means that the generated spectrum f has a large number of frequencies whose entries (i.e., Fourier coefficients) have magnitudes that are small compared to the norm off (i.e., the energy of f). Thus, we can efficiently reduce transmission energy consumption for such Fourier sparse signals through transmitting only energetic Fourier coefficients, while retrieving original signal at the receiver side.

B. Threshold-Based Compression

[0094] Motivated by the EEG signal characteristics in the frequency domain, we update the OFDM transceiver architecture at the physical layer to support our compression scheme. Unlike the prior art compression techniques that are applied at the higher layers, we convey our compression scheme into the physical layer exploiting the existing OFDM transceiver's components in order to perform efficient compression without adding much complexity.

[0095] As mentioned, given the basic OFDM transceiver architecture in FIG. 2, we have added two blocks in order to implement our TBC scheme, namely, the TBC and the FFT Vector Reconstruction, as set out in FIG. 3. In the TBC block, leveraging the fact that several Fourier coefficients x.sub.f of the EEG signal x have negligible magnitude (see FIG. 7), we consider as Os all symbols with magnitude lower than a predefined threshold (see FIG. 10). The threshold is set according to the channel characteristics and the maximum distortion that can be tolerated at the receiver side. Clearly, the higher the value of , the larger the compression ratio and the resulting distortion. Then, whenever we have a number of consecutive zeros greater than two, the transmitter does not send them, but it notifies the receiver about the length of this sequence and its position in the stream of transferred data. We note that efficient techniques like run-length encoding can be leveraged to perform such tasks.

[0096] So, in general terms, the compression method involves transforming the data stream using a Fast Fourier Transform or its inverse to convert the data stream from the time domain to the frequency domain. In the frequency domain, as discussed above, a large part of the data stream is likely to consist of low valuesapproaching zero. Therefore, it is possible to apply a threshold to the data stream such that values less than are rounded to zero, without losing a significant portion of the data content.

[0097] Subsequently, the stream may be further compressed by removing occurrences of sequential consecutive zero values in the data stream and replacing those removed sequences of zeros with data representing the length of the sequence of consecutive zeros removed.

[0098] At the receiver side, the FFT vector reconstruction block is responsible for adding zeros in the received vector at the positions of the ignored symbols before forwarding it to the FFT block. The latter will then demodulate the received symbols and reconstruct the EEG signal.

C. Error Correction

[0099] In order to quantify the achieved compression gain compared to the consequent signal distortion due to our compression scheme, we define the compression ratio as

[00006]$\begin{array}{cc}{C}_r=\left(1-\frac{}{}\right)100& \left(9\right)\end{array}$ [0100] where is the number of data symbols to be transmitted, and is the number of the generated data symbols after modulation. While the signal distortion is quantified using Percent Root man square Difference (PRD), which is given by

[00007]$\begin{array}{cc}\mathrm{PRD}=\sqrt{\frac{\underset{i=1}{\overset{N}{.Math.}}.Math.{\left[x\left(i\right)-x_r\left(i\right)\right]}^2}{\underset{i=1}{\overset{N}{.Math.}}.Math.{\left[x\left(i\right)-\stackrel{\_}{x}\right]}^2}}100,& \left(10\right)\end{array}$ [0101] where {tilde over (x)} is the average value of the original quantized signal, and x.sub.r is the reconstructed one.

[0102] Interestingly, using our EEG compression transceiver we can easily define some of the wrong reconstructed samples at the receiver side. As shown in FIGS. 8 and 9, some of the wrong samples have very large amplitude compared to the correct samples. This advantage can be used as an Error Correction (EC) scheme in order to decrease Sample Error Rate (SER) and signal distortion at the receiver through:

(i) identifying received samples with relatively large amplitude (samples with error), (ii) retransmitting the reconstructed samples with error.

[0103] Despite the achieved compression ratio using TBC, it has been found that it is of prominent importance to further analyse the effect of symbol mapping and modulation on EEG signal characteristics in order to enhance the compression ratio. As noted from FIG. 6 and FIG. 7, the EEG signal characteristics after modulation and IFFT modules have been changed and turned to be less compressible.

[0104] This is mainly due to the effect of symbol mapping and modulation, since representing each data sample with multiple symbols turns the generated symbols after IFFT to be less compressible, i.e., most of the generated symbols after IFFT will have large magnitudes and therefore cannot be neglected.

D. Higher-Order Modulation

[0105] To tackle the problem of symbol mapping effect on EEG sparsity and increase compression efficiency of our transceiver, we study the characteristics of generated symbols after Fourier transform with and without symbol mapping and modulation (see FIG. 6 and FIG. 7). Exploiting higher-order modulation can help in increasing compression ratio of the transceiver through representing each EEG sample in one symbol, which relieves the effect of symbols mapping.

[0106] However, as shown in FIG. 10 (left-hand graph), magnitudes of the generated symbols after IFFT |x.sub.f| are still less compressible compared to the original case without modulation, i.e., in FIG. 6 (even after considering the higher-order modulation). As a result, when applying our threshold-based compression, some of the important symbols may be also neglected. To avoid this, we apply Symbols Masking before compression.

[0107] This masking is based on our prior knowledge about the EEG characteristics in the frequency domain. We define a window size W which is the percentage of compressible symbols relative to the total number of symbols. Using this masking, we define the less important symbols of x.sub.f to be passed by the TBC scheme, while isolating more important symbols from compression (see FIG. 10, right-hand graph). Using such masking with higher-order modulation can significantly mitigate the effect of symbols mapping and modulation on EEG characteristics. By doing so, we could obtain higher compression ratio compared to initial TBC scheme with lower order modulation, as will be shown in simulation results.

[0108] For the hardware implementation complexity, we remark that the proposed threshold-based compression results in adding few numbers of real valued operations compared to multicarrier modulations techniques considered for 5G (e.g., filtered orthogonal frequency division multiplexing (fOFDM), filter bank multicarrier (FBMC), and cyclic convolution based FBMC). These adopted modulations techniques result in increasing the computational complexity compared to conventional OFDM.

E. Stream-Based Compression

[0109] Due to the quality of wireless channel, hardware design, or standards limitations, leveraging higher-order modulation may not be recommended in all cases. Thus, in order to make our transceiver adaptive for different channel conditions and modulation schemes, we propose a Stream-Based Compression (SBC) scheme. Leveraging the generated symbol streams in Section IV, the compression ratio can be further increased as follows. The independent streams of symbols are forwarded to the modulation and IFFT blocks, thus at TBC block, we can deal with each stream separately using different values of the threshold. This, as also shown in the simulation results section, yields a greater overall compression ratio.

[0110] For instance, using QPSK modulation and L=12 bits, we will generate 6 streams of symbols. The symbols in each stream will have different values before modulation (see FIG. 11) and after IFFT (see FIG. 12). Thus, we can set per-stream thresholds so that each stream will be compressed as much as possible while still meeting the requirement on the maximum allowed distortion.

[0111] We note that discovering the dependency between different streams and selecting only the independent streams is performed before IFFT (i.e., it pertains to the higher layers of the transceiver architecture, while only the threshold-based compression is done after IFFT, i.e., in the physical layers of the transceiver. Thus, to summarize, the main steps of the SBC scheme are as follows (see FIG. 13): [0112] Higher-layers steps, which include stream creation, knowledge discovery, and defining the threshold , for individual streams. [0113] Physical-layer step, which includes TBC.

[0114] While at the receiver side, the inverse process is adopted through: (i) using FFT vector reconstruction, which is responsible for adding zeros in the received vector at the positions of the compressed symbols before forwarding it to the FFT, and (ii) leveraging obtained dependency between different streams to retrieve discarded streams from transmission.

Simulation Results

[0115] In order to derive simulation results, the system model shown in FIG. 1 was implemented for use with the EEG dataset as used in R. Andrzejak, K. Lehnertz, C. Rieke, F. Mormann, P. David, and C. Elger, Indications of nonlinear deterministic and finite dimensional structures in time series of brain electrical activity: Dependence on recording region and brain state, Physical Review E, 64, 061907, 2001. To quantify the performance gain provided by the present invention, both the compression ratio and the consequent signal distortion were investigated, while considering high signal-to-noise ratio (SNR) for the wireless channel. The simulation parameters used are set out in Table III.

TABLE-US-00002 TABLE III SIMULATION PARAMETERS Parameter T N.sub.s T.sub.s L M Value 23.6 sec 4096 0.0058 12 bits {2, 3, 4, 6}

[0116] First, the performance of the proposed TBC transceiver, described above, was assessed without performing the signal decomposition into different symbol streams. FIG. 14 shows the performance gain of the transceiver when the 16-QAM modulation (i.e., M=3 symbols per sample) is used. Herein, we gradually increase the compression ratio C.sub.r by increasing the threshold furthermore, both the cases with and without our Error Correction (EC) scheme are considered. As expected, with increasing 6, the Sample Error Rate (SER) and signal distortion (PRD) increase as well (see FIG. 14).

[0117] However, when EC is applied, SER and PRD reduce significantly thanks to the retransmission of the erroneous samples. On the contrary, the actual or effective Cr decreases due to the higher retransmission overhead. Importantly, these results show that, using the well-known OFDM transceiver architecture with slight modifications, we can obtain about 25% compression ratio while keeping SER and distortion below 10%, which is acceptable by many applications.

[0118] FIG. 15 highlights the increase in C.sub.r that we can obtain by leveraging higher-order modulation and symbols masking. We can achieve about 60% C.sub.r while keeping distortion around 10%. Also, with larger window size W, the compression ratio grows at the expense of an increased signal distortion. We note that, depending on the quality of the wireless channel, the modulation order can be increased (i.e., enabling high-order modulations for low channel errors), hence the compression ratio, while still meeting the application requirements.

[0119] Next, we assess the performance of the proposed SBC scheme in Section IV, i.e., we also account for the benefits brought by the decomposition of the signal into streams of symbols and their processing. Interestingly, our SBC transceiver can support both lossless and lossy compression. As depicted in FIG. 16, we can achieve about 45% compression ratio at 0% SER and distortion, or about 55% compression ratio at less than 10% SER and distortion. Herein, we used the QPSK modulation with two compression thresholds .sub.1 and .sub.2, where .sub.2 is fixed to 0.011 while .sub.1 varies. In particular, .sub.2 was used for stream 3, since its values have high variability before modulation and low amplitude after IFFT (see FIG. 11 and FIG. 12), while 61 was adopted for the other streams. Interestingly, such results show that, thanks to the signal decomposition into streams, we can significantly increase the compression ratio while applying low-order modulation schemes.

[0120] The transceiver performance further improves if the SBC-KD scheme is used. Indeed, by applying knowledge discovery and transmitting only the minimal-representation streams, we can considerably reduce the amount of transferred data while still accurately reconstructing the signal at the receiver side. The results in FIG. 17 demonstrate that in this case we can obtain, roughly, 50% compression ratio at 0% SER and distortion, or 67% compression ratio with less than 20% distortion.

[0121] Finally, in FIG. 18 we compare the performance of the proposed SBC-KD scheme with the DWT technique. Wavelet-based compression techniques consist of transmitting the most significant wavelet coefficients. Comparing to DWT-Level thresholding, we obtain 13% reduction in the PRD for compression ratios up to 50%, while achieving 5% reduction in the PRD for higher values, namely, up to 80%, of the compression ratio. Furthermore, we can use the proposed scheme for lossless compression for compression ratios up to 50%, which shows significant gains over DWT in applications requiring zero distortion and high quality analysis of the vital signs.

[0122] This achieved increase in compression ratio also reflects on the transmission energy consumption (see Table IV, below). Thus, a significant amount of energy consumption can be saved using the proposed compression scheme. Also, as energy consumption decreases with increasing compression ratio and distortion, our scheme can be adapted to maintain the best tradeoff between energy consumption and signal distortion, based on application requirements and energy availability.

TABLE-US-00003 TABLE IV TRANSMISSION ENERGY CONSUMPTION VS. COMPRESSION RATIO Transmission Energy (mJ) C.sub.r % 163.84 0 147.46 10 114.69 30 65.54 60 49.15 70 24.58 85

[0123] In general terms, the transmitter 10 of the present invention includes a sensing or acquisition deviceeither a device suitable to detect and record a signal, for example, or an input for receiving a detected or recorded signal. In embodiments this is an EEG acquisition device or an input for receiving an encoded EEG signal.

[0124] The transmitter 12 includes a processor and/or other hardware (such as memory and storage hardware) suitable for performing sampling of the data signal and a quantization step, in which the signal is converted to a stream of data with discrete values/magnitudes.

[0125] As shown in FIG. 3, the transmitter 12 of embodiments is operable to perform IFFT to convert the frequency domain signal to a time domain signal. In embodiments, the transmitter 12 carries out threshold-based compression to remove sequences of Os (or low values that have been converted, using a threshold, to 0 value) from the signal.

[0126] The transmitter 12 than carries out data decomposition and thresholding steps, as described above, before transmission. Of course the transmitter includes suitable equipment for transmitting a radio frequency signal (or other wireless signal) such as those known generally in the art.

[0127] As shown in FIG. 13 of the attached drawings, a first layer involves data acquisition, sampling and quantization of the signal as is generally known in the art. A second layer of further computation according to embodiments of the invention involves data decomposition, knowledge discovery and defining suitable thresholds for processing the data, as described above. A physical layer (i.e. a circuit-based component of the transmitter) provides threshold-based compression prior to transmission of the signal.

[0128] The receiver 14 includes a suitable wireless signal receiving device preferably a threshold-based receiver as described. The receiver 14 according to embodiments of the invention, and as shown in FIG. 3, provides circuitry, and/or a processor and/or memory and other storage devices, operable to remove guard intervals that were inserted prior to transmission. The receiver 14 is further configured to perform FFT vector reconstruction in the case where strings of Os have been removed prior to transmission to expand the signal to include those Os, prior to FFT, to convert from the time domain back to the frequency domain.

[0129] Finally, symbol demapping/demodulation takes place prior to outputting the received and processed data (encoded EEG data, for example).

[0130] Representative features are set out in the following clauses, which stand alone or may be combined, in any combination, with one or more features disclosed in the text and/or drawings of the specification.

[0131] When used in this specification and claims, the terms comprises and comprising and variations thereof mean that the specified features, steps or integers are included. The terms are not to be interpreted to exclude the presence of other features, steps or components.

[0132] The features disclosed in the foregoing description, or the following claims, or the accompanying drawings, expressed in their specific forms or in terms of a means for performing the disclosed function, or a method or process for attaining the disclosed result, as appropriate, may, separately, or in any combination of such features, be used for realising the invention in diverse forms thereof.

[0133] Although certain example embodiments of the invention have been described, the scope of the appended claims is not intended to be limited solely to these embodiments. The claims are to be construed literally, purposively, and/or to encompass equivalents.