Abstract: There is provided a system and method for compression and decompression of a data stream used by machine learning networks. The method including: encoding each value in the data stream, including: determining a mapping to one of a plurality of non-overlapping ranges, each value encoded as a symbol representative of the range and a corresponding offset; and arithmetically coding the symbol using a probability count; storing a compressed data stream including the arithmetically coded symbols and the corresponding offsets; and decoding the compressed data stream with arithmetic decoding using the probability count, the arithmetic decoded symbols use the offset bits to arrive at a decoded data stream; and communicating the decoded data stream for use by the machine learning networks.

Abstract: A radio network sends downlink signaling to a user equipment (UE) that triggers an enhanced uplink beam selection protocol, based on quality of the UE's uplink signaling the network receives according to a basic uplink beam selection protocol. In response the UE transmits pre-defined signaling such as uplink beam references signals (U-BRS) with uplink beams according to the downlink signaling. The network measures and selects one or more of those uplink beams for the UE to use for sending uplink data, and notifies this selection to the UE. In various embodiments the basic uplink beam selection protocol is based on uplink-downlink reciprocity, the downlink triggering signaling is dynamic and further selects a subset of uplink beams, and multiple UEs can be triggered in common signaling where blind decoding by the UEs is enabled via a scrambling ID for this enhanced uplink beam selection protocol purpose.

Abstract: In a rule based header compression system such as a SCHC compressor/decompressor, a controller is provided which provides “hints” to the header compression processor, so as to direct its behaviour. These hints may define new rules, modify existing rules, set state values against which rules are tested during compression, prioritise rules or exclude rules from consideration to achieve optimum compression. The controller may dynamically generate rules on the basis of learned of detected flow characteristics to achieve optimum compression. The controller may operate as a state machine, which may define states corresponding to different degrees of compression for a given flow or flow type. The system comprises multiple compressors, some or all of which may be remote from the compression processor.

Abstract: A data compressor a zero-value remover, a zero bit mask generator, a non-zero values packer, and a row-pointer generator. The zero-value remover receives 2N bit streams of values and outputs 2N non-zero-value bit streams having zero values removed from each respective bit stream. The zero bit mask generator receives the 2N bit streams of values and generates a zero bit mask for a predetermined number of values of each bit stream in which each zero bit mask indicates a location of a zero value in the predetermined number of values corresponding to the zero bit mask. The non-zero values packer receives the 2N non-zero-value bit streams and forms a group of packed non-zero values. The row-pointer generator that generates a row-pointer for each group of packed non-zero values.

Abstract: Aspects of the present disclosure relate to wireless communications, and more particularly, handling header compression in scenarios with concurrent connections, such as make-before-break (MBB) handover or dual connectivity (DC) scenarios. A method of wireless communication performed by a user equipment (UE) can include concurrently communicating with a first base station (BS) on a connection with the first BS and with a second BS on a connection with the second BS during a handover procedure. The UE maintains a context for a header compression protocol for the connection with the first BS and the connection with the second BS. The concurrently communicating includes using the header compression protocol context for sending one or more packets, receiving one or more packets, or both.

Abstract: According to one embodiment, a computer-implemented method includes receiving an object to be stored within a storage library, computing a hash value, utilizing the object, determining a storage location within the storage library to store the hash value, and sending the hash value to the storage location and neighbor locations of the storage location within the storage library.

Abstract: The present invention relates to a computing device for executing a first cryptographic operation of a cryptographic process on useful input data, said computing device comprising a first processor, a second processor and a selection circuit wherein: —said selection circuit is configured: —for receiving, from an input bus, expanded input data obtained by interleaving dummy input data with said useful input data, —for determining positions of the dummy input data in said expanded input data, —and for extracting said dummy input data and said useful input data from the expanded input data based on said determined positions, —said first processor is configured for executing said first cryptographic operation of said cryptographic process on said extracted useful input data to obtain useful output data, —said second processor is configured for executing a second operation on said extracted dummy input data to obtain dummy output data, said computing device being configured for having said operations executed such

Abstract: A computer-implemented method is provided for reducing a measure time of a measure process in a multi-shot simulation performed by a quantum computing simulation system. The method includes calculating probabilities from probability amplitudes before the measure process. The method further includes creating, for each node of the quantum computing simulation system, an index of probability by incrementally summing respective different ones of the probabilities into respective sums. The method also includes generating a random number for each of the multi-shots, the random number for sampling a probability distribution of the probabilities. The method additionally includes selecting the index of probability which is larger than the random number by comparing the random number generated for a given one of the multi-shots to the index of probability created for the given one of the multi-shots.

Abstract: A wireless communication method and device are provided. The method includes: a compression device sending a first data packet or a second data packet according to a compression parameter of an Ethernet frame, the second data packet being a compressed data packet of the first data packet.

Abstract: A method of and system of efficient storage of data entries containing textual data is disclosed. The method may include accessing a plurality of data entries in a dataset, arranging the plurality of data entries in the dataset in a lexical order, placing a predetermined number of the plurality of data entries in each of a plurality of subblocks, performing data compression on the plurality of data entries in each of the plurality of subblocks to reduce redundancy in the plurality of data entries and create compressed data entries, placing one or more subblocks in each of a plurality of page blocks, and storing each of the plurality of page blocks in a storage device to provide efficient searching and improved functionality for the dataset.

Abstract: A wireless communication method and device are provided. The method includes: a compression device sending a first data packet or a second data packet according to a compression parameter of an Ethernet frame, the second data packet being a compressed data packet of the first data packet.

Abstract: Embodiments of the present disclosure provide a method, electronic device and a computer program product for processing data. The method comprises determining target data that are used for determining a target compression level for a user. The method also comprises compressing at least part of the target data using a plurality of compression levels of a compression algorithm, respectively, to obtain a plurality of compression ratios and a plurality of compression latencies corresponding to the plurality of compression levels. The method further comprises determining the target compression level for the user for compressing data of the user data based on the plurality of compression ratios and the plurality of compression latencies.

Abstract: A memory device or module selects between alternative command ports. Memory systems with memory modules incorporating such memory devices support point-to-point connectivity and efficient interconnect usage for different numbers of modules. The memory devices and modules can be of programmable data widths. Devices on the same module can be configured select different command ports to facilitate memory threading. Modules can likewise be configured to select different command ports for the same purpose.

Abstract: A processor includes a decode unit to decode an instruction that is to indicate a source packed data that is to include a plurality of adjoining data elements, a number of adjoining data elements, and a destination. The processor also includes an execution unit coupled with the decode unit. The execution unit, in response to the instruction, is to store a result packed data in the destination. The result packed data is to have a plurality of lanes that are each to store a different non-overlapping set of the indicated number of adjoining data elements aligned with a least significant end of the respective lane. The different non-overlapping sets of the indicated number of the adjoining data elements in adjoining lanes of the result packed data are to be separated from one another by at least one most significant data element position of the less significant lane of the adjoining lanes.

Abstract: Cascaded, boosted predictive models trained using distinct sets of exogenous and endogenous features are configured to predict component of performance ratings of entities. From the distinct predicted components, the second entity's rating factor can be determined. A second entity's rating factor represents the specific contribution a second entity makes to his average performance rating, as distinct from the rating that an arbitrary or hypothetical second entity would obtain.

Abstract: Quantum compression using quantum communication driver (QCD) computing devices employing superdense encoding of conventionally compressed files is disclosed. In one example, a first QCD computing device receives a compressed file that was compressed using conventional compression formats by a computing device. The first QCD computing device performs superdense encoding of the compressed file using one or more first qubits that are each in an entangled state with a corresponding one or more second qubits of a second QCD computing device. The first qubit(s) are then sent to the second QCD computing device. In some examples, the second QCD computing device generates a sequential qubit mapping that represents a sequence in which the one or more first qubits encode the compressed file, and stores the first qubit(s) in association with the sequential qubit mapping.

Abstract: Many computing systems process data organized in a matrix format. For example, artificial neural networks perform numerous computations on data organized into matrices using conventional matrix arithmetic operations. One such operation is the transpose operation. Techniques are introduced for storing a matrix in a compressed format that allows, for example, a transpose operation to be performed during decompression. Thus, by utilizing the introduced techniques, transformations of compressed matrices such transposition can be achieved in a more effective way. Parallel processing may also be used to more efficiently compress and/or decompress.

Abstract: Performing network optimization using quantum communication driver (QCD) computing devices based on measured network attributes of a communications network is disclosed. In one example, an interceptor proxy computing device receives a message sent by a sending computing device and directed to a recipient computing device via a communications network. The interceptor proxy computing device determines, based on a network attribute of the communications network, whether to perform network optimization for the communications network. If so, the interceptor proxy computing device sends the message to a QCD computing device, which performs superdense encoding of the message using one or more first qubits that are each in an entangled state with a corresponding one or more second qubits of a QCD computing device coupled to the recipient computing device. The first qubit(s) are then sent to the QCD computing device coupled to the recipient computing device.

Abstract: A communication device is described comprising a media output unit, a receiver configured to receive a packet of a sequence of packets, the packet comprising a compressed header and media payload and a processor configured to detect whether decompression of the compressed header is prevented, and, if decompression of the compressed header is prevented, to determine a sequence number of the media payload, extract the media payload from the packet and forward the media payload and an indication of the sequence number to the media output unit.

Abstract: A computer system includes a hardware controller and an internal millicode storage area. The controller includes an accelerator that decompresses a data stream requested by an application. The internal millicode storage area can store a compression dictionary library including a plurality of different pre-defined compression dictionaries. A host system includes a dictionary manager that determines a compression dictionary from the plurality of different pre-defined compression dictionaries included in the dictionary library to decompress the data stream. The accelerator can access the internal millicode storage area to obtain the determined compression dictionary, and to decompress the data stream according to the determined compression dictionary.

Abstract: The subject disclosure relates to techniques for referencing a change in data utilizing a network resource locator. An interface component can receive one or more requests that are associated with a data set from a client, and send, based on the one or more requests, a network resource locator and at least one portion of the data set to the client. Further, a data service component can compute a parameter that is associated with a change of the data set, and include the parameter in the network resource locator. In other embodiments, the data service component can receive a request utilizing the network resource locator, determine the change of the data set based on the parameter, and send the change of the data set to the client.

Abstract: One embodiment relates to a method of communicating a data packet stream in which data is re-packed to reduce wasted bandwidth. Data bytes of the data packet stream are received from a first data path and mapped to a second data path that is divided into a plurality of data segments. At least one data byte is mapped to each data segment until an end of, or pause in, the data packet stream. Another embodiment relates to a method of communicating data packets from multiple channels. Multiple data packet flows, each flow corresponding to a channel, is received on a first data path. The data bytes from the first data path are mapped to a second data path that is divided into multiple data segments. At least one data byte is mapped to each data segment until an end of, or pause in, the multiple data packet flows. Other embodiments, aspects, and features of the invention are also disclosed.

Abstract: A subscriber record may include a plurality of references to a plurality of specific class of service records. Each class of service record may relate to a different type of customized applications service subscriber information.

Abstract: One embodiment relates a method of receiving data from a multi-lane data link. The data is encoded with an FEC code having a block length. The data is FEC encoded at a bus width which is specified within particular constraints. One constraint is that the FEC encoder bus width in bits is an exact multiple of a number of bits per symbol in the data. Another constraint may be that the FEC code block length is an exact multiple of the FEC encoder bus width. Another constraint may be that the FEC encoder bus width is an exact multiple of a number of serial lanes of the multi-lane interface. Other embodiments and features are also disclosed.

Abstract: The subject disclosure relates to techniques for referencing a change in data utilizing a network resource locator. An interface component can receive one or more requests that are associated with a data set from a client, and send, based on the one or more requests, a network resource locator and at least one portion of the data set to the client. Further, a data service component can compute a parameter that is associated with a change of the data set, and include the parameter in the network resource locator. In other embodiments, the data service component can receive a request utilizing the network resource locator, determine the change of the data set based on the parameter, and send the change of the data set to the client.

Abstract: There is provided a method for clock reference insertion during packetization of an encoded data stream, wherein said packetization is performed before buffering of the data stream. The method comprises storing the value of each bit rate applied during encoding, and the duration of time for which each bit rate is applied. A clock reference time interval is converted into a clock reference data interval using the value of each bit rate applied and the duration of time for which each bit rate is applied. The clock reference data interval is used to determine where to insert a clock reference into the data stream during packetization.

Abstract: An integrated state vector management system for control systems includes a plurality of co-processors configured to generate and utilize state vector data. The integrated state vector management system further includes state vector module communicatively connected to each of the plurality of co-processors. The state vector module includes a state vector memory containing at least three memory buffers for storing three datasets of state vector data. The state vector module further includes a state vector memory control logic communicatively coupled to the state vector memory. The state vector control logic is configured to provide read and write control to the state vector memory. The state vector memory control logic includes at least a write pointer controller and a read pointer controller.

Abstract: To compress headers efficiently, headers may be differentially encoded. In one embodiment, a difference between a current field and a reference field can be used in a reduced header. In another embodiment, the least significant bits of the current field can be used to represent the current field. When such a field is received, the most significant bits of a reference field are needed to de compress the field. In addition, the present principles determine the typical usage scenarios that may benefit from header compression and further determine that some fields can be removed in a reduced header or be represented by fewer bits. Header compression may impose constraints on the representation of the current field. The present principles recognize constraints on using reduced headers and provide rules and guidelines on applying header compression.

Abstract: A data communication system compresses packet headers. A transmitter executes state machines to process a data packet and determine if a transmitter state machine is transferring Interdependent Machine Output (IMO) data. The transmitter generates an IMO vector that indicates if any IMO data is in the data packet. If IMO is present, then the transmitter augments the IMO vector to indicate the individual transmitter state machines that transferred the IMO data. The transmitter transfers the data packet with the IMO vector to a receiver. The receiver processes the IMO vector to determine if any IMO data is transferred in the data packet. If IMO data is transferred, then the receiver processes the augmented IMO vector to transfer the IMO data to individual receiver state machine that correspond to the transmitter state machines that transferred the IMO data.

Abstract: The present invention relates to a physical layer signalling in a digital broadcast network. In particular, for a digital broadcast network supporting a configuration with a plurality of physical layer pipes, a type indicator is signalled on physical layer for a pipe, the type indicator indicates the format of the input stream which may specify a transport stream, a generic stream or an IP stream. In addition, per physical layer pipe application of header and/or content compression to the user packet headers of the input stream is signalled. Another physical layer parameters are advantageously provided or extended in order to increase the flexibility and efficiency of the layer 1 signalling.

Abstract: The present invention provides an apparatus of transmitting broadcast signals, the apparatus including, an encoder for encoding service data, a frame builder for building at least one signal frame by mapping the encoded service data, a modulator for modulating data in the built at least one signal frame by an Orthogonal Frequency Division Multiplexing, OFDM, scheme and a transmitter for transmitting the broadcast signals having the modulated data.

Abstract: A computing system includes: a context module configured to determine a transfer context for invoking a state transfer between a source device and a target device; a modulation module, coupled to the context module, configured to generate a transfer modulation based on the transfer context for adjusting to a modulation scheme suited for the transfer context; and a transmission module, coupled to the modulation module, configured to send a communication packet based on the transfer modulation for detecting the source device and the target device.

Abstract: The power consumption in a client terminal is one of the important aspects of wireless communication systems. The power consumed when a client terminal is in standby mode when it is periodically monitoring the paging messages has a significant impact of the battery life. A method and apparatus are disclosed that enable reduction of the power consumption in standby mode and extend battery life of a client terminal.

Abstract: A transmitter device includes a processing unit and a compression unit. The processing unit obtains a branch of data and partitions the branch of data into a plurality of snippets. Each snippet includes a group of data. The compression unit compresses each snippet into a plurality of packets according to value of each datum included in the corresponding snippet. The compression unit compares the value of each datum with a first threshold value to generate a first packet. The first packet includes first information indicating which data included in the corresponding snippet has the corresponding value not equal to the first threshold value. The compression unit further generates the remaining packets according to the first information.

Abstract: The present invention concerns a method and a device of transmitting uncompressed video streams. In particular, the method concerns the adaptation of a wireless transmission to bandwidth reduction and packet loss. There is provided a computer implemented method for sending uncompressed video data, wherein the video data comprises binary video components, the method comprising generating a plurality of SB packets from a group of video components, each SB packet being constituted by bits of the video components grouped according to their significance; determining available bandwidth for transmission and sending the most SB packets to fit the available bandwidth, beginning by the most significant ones, meaning containing the most significant bits of the video components. Accordingly, the best possible quality is obtained according to the available bandwidth.

Abstract: The present invention relates to a physical layer signalling in a digital broadcast network. In particular, for a digital broadcast network supporting a configuration with a plurality of physical layer pipes, a type indicator is signalled on physical layer for a pipe, the type indicator indicates the format of the input stream which may specify a transport stream, a generic stream or an IP stream. In addition, per physical layer pipe application of header and/or content compression to the user packet headers of the input stream is signalled. Another physical layer parameters are advantageously provided or extended in order to increase the flexibility and efficiency of the layer 1 signalling.

Abstract: Systems and methods are disclosed for optimizing Robust Header Compression (RoHC) to protect against context desynchronization resulting from a burst of lost packets. In one embodiment, a method of operation of a radio node to adapt a RoHC compressor of a radio node based on a transmit channel quality metric is provided. In another embodiment, systems and methods relating to improved RoHC SN decoding are disclosed. In one embodiment, a method of operation of a radio node includes determining a size of a Packet Data Convergence Protocol (PDCP) Sequence Number (SN) gap for a radio link between the radio node and a second radio node, and performing RoHC SN decoding based on the size of the PDCP SN gap.

Abstract: The subject disclosure relates to techniques for referencing a change in data utilizing a network resource locator. An interface component can receive one or more requests that are associated with a data set from a client, and send, based on the one or more requests, a network resource locator and at least one portion of the data set to the client. Further, a data service component can compute a parameter that is associated with a change of the data set, and include the parameter in the network resource locator. In other embodiments, the data service component can receive a request utilizing the network resource locator, determine the change of the data set based on the parameter, and send the change of the data set to the client.

Abstract: The present invention concerns a method for optimizing ROHC RTP (Robust Header Compression Real Time Protocol) compression applied to IP header of data packets stream so as to use more compact formats enable to remain in a steady state, to never discard received packet, and serve radio resources without requiring to modify ROHC specification. In the method, when handover or mobility procedure is stated, new reference values are normally added to a sliding compression window, but no reference value is removed from the window as long as the handover or mobility procedure is ongoing. After the handover or mobility procedure is complete, when the number of values transmitted on the new radio link are appropriate to cope against the error properties on the new link, all older values can be removed at once from the compression window, thereby reverting to normal window operation.

Abstract: A data processing device includes a compression circuit and a padding circuit. The compression circuit is configured to compare pairs of two contiguous bits within data composed of 2n bits (where n is a natural number), and compress the data based on a result of the comparison. The padding circuit is configured to generate transmission data of 2n bits by padding the compressed data with a dummy pad.

Abstract: Embodiments relate to a method for transmitting a message in a data path of a network, the method includes transmitting a message onto an input bus of an input interface module, the message being received in flits of a size corresponding to the width of the input bus and generating a validity indicator for each elementary flit constituting each flit received. The message is transmitted onto an output bus of the input interface module towards a receiving interface module in flits of a size corresponding to the width of the output bus along with each validity indicator generated in association with the corresponding elementary flit. The receiving interface module receives flits constituting the message and the associated validity indicators and rejects a received flit if an elementary flit of the received flit is associated with a validity indicator in the invalid state.

Abstract: A data storage system stores at least one dataset including a plurality of records. A data processing system, coupled to the data storage system, processes the plurality of records to produce codes representing data patterns in the records, the processing including: for each of multiple records in the plurality of records, associating with the record a code encoding one or more elements, wherein each element represents a state or property of a corresponding field or combination of fields as one of a set of element values, and, for at least one element of at least a first code, the number of element values in the set is smaller than the total number of data values that occur in the corresponding field or combination of fields over all of the plurality of records in the dataset.

Abstract: Techniques for improving data compression of a deduplicated storage system are described herein. According to one embodiment, the similarity of a plurality of data chunks stored in one or more first storage areas of the storage system is determined based on a plurality of sketches, each describing characteristics of one of the data chunks. The data chunks are grouped into a plurality of groups of similar data chunks based on the similarity of the data chunks. The groups of similar data chunks are compressed, such that similar data chunks are compressed close to each other.

Abstract: A sample rate converter and a method of converting a sample rate are disclosed herein. The sample rate converter includes a data delay unit, a clock rate conversion unit, a Lagrange polynomial filter unit, a resample position calculation unit, and a resample position compensation unit. The data delay unit delays signals in response to an input clock signal. The clock rate conversion unit converts the sample rate of the signals. The Lagrange polynomial filter unit performs a filtering function on the signals whose rate has been converted. The resample position calculation unit outputs the value (Dint, dfrac) of the resample position of the signals based on a set resample ratio value. The resample position compensation unit corrects the error value of the signals by applying the value (Dint, dfrac) to the signals, and outputs a final signal.

Abstract: Methods and apparatus are described for reordering a header of a transmission data packet. The methods and apparatus include identifying one or more static fields and one or more dynamic fields within a header of the transmission data packet. Moreover, these aspects include reordering the one or more static fields and the one or more dynamic fields within the header of the transmission data packet. Additionally, these aspects include compressing the header of the transmission data packet to form a compressed transmission data packet in response to reordering the one or more static fields and the one or more dynamic fields. The aspects also may include transmitting the compressed transmission data packet.

Abstract: A memory device according to an embodiment includes a first memory cell array; a second memory cell array; and a multiplexer arranged between the first memory cell array and the second memory cell array, the multiplexer controlling the first memory cell array and the second memory cell array.

Abstract: The present invention includes devices, systems, and methods of Voice-over-Internet Protocol (VoIP) communication. For example, a method includes: receiving a data stream comprising a set of VoIP packets; and modifying a Real Time Protocol (RTP) header of at least one of said VoIP packets to modify a jitter buffer delay of said data stream. Optionally, the method includes decreasing the jitter buffer delay by: dropping at least one packet from said data stream; and decreasing a sequence number and a timestamp value in an RTP header of at least one additional packet subsequent to said at least one packet. Optionally, the method includes increasing the jitter buffer delay by: identifying a pair of consecutive packets in the incoming data stream, the pair of consecutive packets having consecutive sequence numbers; and increasing a sequence number in an RTP header of at least a latter packet in said pair of consecutive packets.

Abstract: A data storage system stores at least one dataset including a plurality of records. A data processing system, coupled to the data storage system, processes the plurality of records to produce codes representing data patterns in the records, the processing including: for each of multiple records in the plurality of records, associating with the record a code encoding one or more elements, wherein each element represents a state or property of a corresponding field or combination of fields as one of a set of element values, and, for at least one element of at least a first code, the number of element values in the set is smaller than the total number of data values that occur in the corresponding field or combination of fields over all of the plurality of records in the dataset.

Abstract: A system, method, and apparatus for compressing binary code comprising at least a processor, memory, storage, and an encoding device or decoding device or both. The methods include comparing a given binary code string having a certain size to be compressed or decompressed with a table comprising all possible combinations of zeroes and ones for any binary data of size x. The given binary code string and all possible combinations are partitioned in packets of size y and each packet assigned a value. A second value representing an assembly of all the values into a second value is performed. The assembly may be performed n times to obtain an nth value. The second or nth value is transmitted or received or both by the encoding and decoding devices, respectively, in place of the given binary code. Table comparison may be performed using pattern recognition.

Abstract: A computer-implemented method for generating side information for grammar-based data compression systems, such as YK compression systems, is described. An admissible grammar (G) for an input sequence (A(S0)) having a finite set of terminal symbols is obtained. A graph representation of the admissible grammar (G) is then constructed. An edge having a lowest weight (expansion frequency), or one not possessing the shortest distance and or shortest expanded sequence length, is then pruned from the graph representation to generate a pruned graph representation. A pruned grammar (G?) is then derived by removing the occurrence corresponding to the pruned edge from the grammar G and the starting variable (S0,i) of the pruned grammar (Gi) is then expanded to generate the side information.