IP Library Granted Patent US 8,462,027
Granted Patent B2
US 8,462,027 · App. 13/255,188 · Granted Jun 11, 2013

Selective data compression

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 8,462,027
App. No.
13/255,188
Granted
Jun 11, 2013
Kind
B2
Abstract

A method and apparatus are described for determining whether to convey a communication signal in a compressed form along a communication path. The method comprises the steps of: (i) providing the communication signal that should be conveyed along said communication path; (ii) determining whether at least part of the communication signal comprises data having a non-random distribution; (iii) if the at least part of the communication signal is determined to comprise data having at least partially a non-random distribution, applying a compression algorithm onto that at least part of the communication signal to form a compressed form of the communication signal provided; and (iv) conveying the communication signal in its compressed form along the communication path.

Claims (27)

1. A method for determining whether to convey a communication signal in a compressed form along a communication path extending in a communications network, which comprises the steps of:

providing said communication signal that should be conveyed along said communication path;

determining whether at least part of said communication signal comprises data having a non-random distribution;

if the at least part of the communication signal is determined to comprise data having at least partially a non-random distribution, applying a compression algorithm onto said at least part of the communication signal to form a compressed form of the communication signal provided; and

conveying the communication signal in its compressed form along said communication path.

2. The method according to claim 1 , wherein the step of determining whether the at least part of communication signal comprises data having a non-random distribution includes applying accumulative statistics onto said at least part of the communication signal.

3. The method according to claim 1 , wherein the step of determining whether at least part of said communication signal comprises data has a non-random distribution, is based upon comparing the number of bytes representing at least one character to a threshold.

4. The method according to claim 1 , wherein the step of determining whether the distribution of the data in the at least part of the communication signal has a non-random distribution, includes providing a plurality of thresholds of non-random distributions, determining which of these thresholds are exceeded by the distribution of the data in the at least part of the communication signal, and based upon the thresholds that are exceeded, establishing a compression algorithm to be used for compressing said at least part of the communication signal.

5. The method according to claim 3 or 4 , wherein said threshold is an adaptive threshold which depends upon available resources.

6. The method according to claim 1 , wherein the step of determining whether at least part of the communication signal comprises data having a non-random distribution, comprises:

counting number of instances that at least one symbol is within the at least part of the communication signal; and

if the total number of instances that said at least one symbol within the at least part of the communication signal matches a pre-defined criterion, determining that the at least part of the communication signal comprises data having a non-random distribution.

7. The method according to claim 6 , wherein the predefined criterion comprises exceeding a threshold ratio of the number of instances that said at least one symbol is in said at least one group, divided by the total number of symbols representing data contained in the at least part of the communication signal.

8. The method according to claim 6 , wherein said predefined criterion depends upon which compressing algorithm would be used to compress the at least part of the communication signal, in case the at least part of the communication signal comprises data having a non-random distribution.

9. The method according to claim 6 , wherein said compressing algorithm is selected from among a plurality of compressing algorithms, and wherein said selection is based upon the number of instances that said at least one symbol is within the at least part of the communication signal.

10. A communication apparatus comprising:

an input interface adapted to receive a communication signal;

a detector, coupled to said input interface, adapted to determine whether at least part of said received communication signal comprises data having a non-random distribution;

a switch coupled to said detector and said input interface and adapted to forward said received communication signal through at least one selectable output of a plurality of selectable outputs;

a compressor having an input coupled to at least one selectable output of said switch and adapted to compress a signal received thereon and provide, at an output, a compressed form of said signal received at said input; and

an output interface having a first input coupled to at least one selectable output of said switch and a second input coupled to said output of said compressor and adapted to forward a signal received at either of said first and second inputs from a first output,

wherein said detector is further adapted to instruct said switch to direct said received communication signal to said compressor when said detector determines that at least part of said received communication signal comprises data having a non-random distribution.

11. The communication apparatus according to claim 10 , wherein said detector is adapted to:

count the number of instances that at least one symbol is in the at least part of the communication signal; and

if the total number of counted instances that the at least one symbol matches a criterion, to determine that the at least part of the communication signal comprises data having a non-random distribution.

12. The communication apparatus according to claim 11 , wherein said detector is further adapted to determine whether a threshold ratio of the number of instances that said at least one symbol is in the at least part of the communication signal, divided by the total number of symbols representing data contained in the at least part of the communication signal, has been exceeded.

13. The communication apparatus according to claim 10 , wherein said compressor is adapted to select and apply a compressing algorithm based upon information retrieved from the detector.

Assignments (3)
RELEASE OF SECURITY INTEREST Recorded Nov 25, 2014
From: OBSIDIAN, LLC
To: DIALOGIC CORPORATION, F/K/A EICON NETWORKS CORPORATION; DIALOGIC INC.; DIALOGIC (US) INC., F/K/A DIALOGIC INC. AND F/K/A EICON NETWORKS INC.; DIALOGIC DISTRIBUTION LIMITED, F/K/A EICON NETWORKS DISTRIBUTION LIMITED; DIALOGIC MANUFACTURING LIMITED, F/K/A EICON NETWORKS MANUFACTURING LIMITED; DIALOGIC US HOLDINGS INC.; DIALOGIC RESEARCH INC., F/K/A EICON NETWORKS RESEARCH INC.; DIALOGIC JAPAN, INC., F/K/A CANTATA JAPAN, INC.; CANTATA TECHNOLOGY, INC.; EAS GROUP, INC.; SHIVA (US) NETWORK CORPORATION; EXCEL SWITCHING CORPORATION; EXCEL SECURITIES CORPORATION; CANTATA TECHNOLOGY INTERNATIONAL, INC.; BROOKTROUT NETWORKS GROUP, INC.; BROOKTROUT TECHNOLOGY, INC.; SNOWSHORE NETWORKS, INC.; BROOKTROUT SECURITIES CORPORATION
Reel/Frame 034468/0654 →
SUPPLEMENTAL INTELLECTUAL PROPERTY SECURITY AGREEMENT Recorded Mar 26, 2012
From: DIALOGIC INC.; DIALOGIC CORPORATION; DIALOGIC NETWORKS (ISRAEL) LTD.
To: OBSIDIAN, LLC, AS COLLATERAL AGENT
Reel/Frame 027931/0001 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 8, 2011
From: LITVAK, OLEG
To: DIALOGIC NETWORKS (ISRAEL) LTD.
Reel/Frame 026872/0322 →