IP Library Granted Patent US 7,224,700
Granted Patent B2
US 7,224,700 · App. 10/105,300 · Granted May 29, 2007

Multiplexing process and multiplexer optimizing management of digital transmission channel bandwidth

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 7,224,700
App. No.
10/105,300
Granted
May 29, 2007
Kind
B2
Abstract

The disclosure relates to a process for multiplexing M services (M is an integer >1) enabling transmission of data packets of predetermined size T p at a predetermined maximum output bit rate D Smax , characterized in that it includes storage of the incoming data of each of the M service in M associated buffers, extraction of data from the buffers, and constitution of output data packets formed from some or all of the data present in a buffer when its filling is equal to or exceeds the data packet size T p .

Claims (36)

1. Process for multiplexing M services (M is an integer >1) enabling transmission of data packets of predetermined size T p at a predetermined maximum output bit rate D Smax , comprising the steps of:

storing incoming data of each of the M services in M virtual buffers of the multiplexer, wherein the virtual buffers are tables,

determining, based on respective priorities of (a) the virtual buffers, (b) the M services, or (c) the type of data stored in the virtual buffers, the first virtual buffer from which at least some data will be extracted when several of said virtual buffers contain data equal to or exceeding the data packet size T p ,

extracting the data from the virtual buffers, and

forming output data packets from at least some of the data present in a virtual buffer when its filling is equal to or exceeds the data packet size T p .

2. The multiplexing process according to claim 1 , further comprising the step of presenting a padding packet at the output when one of the virtual buffers contains less data than the data packet size T p .

3. The multiplexing process according to claim 1 , wherein the storage step comprises the step of filling said virtual buffers using the following relation:

∀ i∈[ 1, M]B E [i ]( t N+1 )= B E [i ]( t N )+ D E [i ]( t N+1 )· t p

where B E [i](t) represents the filling of said virtual buffer of input i at time t, D E [i](t) represents the data bit rate for the input i at time t, and time t N =t N+t p , (with t p T p /D Smax ), the M virtual buffers being empty at time t=0, and in that, secondly, the output data transmission respects the following relation:

if ∃i/B E [i](t +1 )>T p , then a packet from input i is presented at the output, and B E [i](t N+1 )=B E [i](t N+1 )−T p .

4. The multiplexing process according to claim 1 , wherein the storing step further comprises the step of filling the virtual buffers, when the service on input i has a minimum bit rate D E min [i](t) and a maximum bit rate D E max [i](t), and if B E min [i](t) and B E max [i](t) represent respectively the minimal and maximal filling of said virtual buffer of input i at time t and at time t N+1 =t N +t p (with t p =T p /Dsmax), the filling being zero at time t=0, using the following relations:

∀ i∈[ 1, M]B Emin [i] ( t N+1 )= B Emin [i] ( t N )+ D Emin [i ]( t +1 )· t p

and

B Emax [i] ( t N+1 )= B Emax [i] ( t N )+ D Emax [i] ( t N+1 )· t p

and the output data transmission respects the following relations:

if ∃i/B Emin[i](t N+1 )>T p , then a packet from input i is presented at output, and B E min [i](t N+1 ) =B E min[i](t N+1 )−T P and B Emax[i](t N+1 )=B Elin [i](t N+1 ), otherwise, if ∃i/B Emax [i](t N+ )>T p , then a packet from input i is presented at the output, and B Emin [i](t N+ )=B Emin [i](t N+ )·T p and B Emax [i](t N+1 )=B EIax[i ](t N+1 )−T p ,

otherwise a padding packet is presented at the output.

5. The multiplexing process according to claim 1 , wherein at least some of said services are presented at the output with:

at least one of constant or variable bit rates, and

minimal or maximal set-point bit rates, minimal and maximal set-point bit rates, or no minimal and maximal set-point bit rates.

6. Multiplexer with M inputs (M is an integer >1) and one output enabling transmission of data packets of predetermined size T p at a predetermined maximal output bit rate D Smax , the multiplexer further comprising:

an election device;

M virtual buffers configured to store received data for each of M incoming services, wherein the virtual buffers are tables,

wherein each virtual buffer receives data via one of said M multiplexer inputs and is connected to said multiplexer output via the election device, and the election device extracts based on respective priorities of (a) the virtual buffers, (b) the M services, or (c) the type of data stored in the virtual buffers, the first virtual buffer from which at least some data will be extracted when several of said virtual buffers contain data equal to or exceeding the data packet size T p , and creates a data packet at said multiplexer output formed from at least some of the data present in the respective buffer when that buffer's filling is greater than the data packet size T p .

7. The multiplexer according to the claim 6 , wherein said election device is virtual.

8. A multiplexer with M inputs (M is an integer >1) and one output enabling transmission of data packets of predetermined size T p at a predetermined maximal output bit rate D Smax , the multiplexer further comprising:

an election device;

M virtual buffers configured to store received data for each of M incoming services, wherein the virtual buffers are tables,

wherein each virtual buffer receives data via one of said M multiplexer inputs and is connected to said multiplexer output via the election device, and the election device extracts based on respective priorities of (a) the virtual buffers, (b) the M inputs, or (c) the type of data stored in the virtual buffers, the first virtual buffer from which at least some data will be extracted when several of said virtual buffers contain data equal to or exceeding the data packet size T p , and creates a data packet at said multiplexer output formed from at least some of the data present in the respective buffer when that buffer's filling is greater than the data packet size T p ;

wherein the multiplexer is configured to implement the multiplexing process according to claims 3 or 4 .

9. Digital transmission chain for various types of services using at least one of synchronous or asynchronous data on networks of different types, comprising:

M inputs that acquire the data, then transform them into packets of fixed size adapted to the broadcasting protocol,

M buffers in which the M inputs store said data packets, and

the multiplexer, according to claim 6 , with M inputs connected to said M buffers, and J outputs,

J virtual buffers connected to said J outputs of said multiplexer enabling synchronous and asynchronous data to be managed, J outputs that acquire the data from said J virtual buffers, adapt them to the format of the transmission channel, then broadcast the data from said J virtual buffers.

10. Transmission system for various types of services using at least one of synchronous or asynchronous data on networks of different types, wherein the transmission chain includes a multiplexer according to claim 6 .

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 13, 2013
From: THALES
To: THOMSON LICENSING
Reel/Frame 031635/0761 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 18, 2013
From: THOMSON LICENSING
To: FRANCE BREVETS
Reel/Frame 031032/0462 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 17, 2007
From: L'HERMITE, RICHARD; GOURMELEN, ERIC
To: THALES
Reel/Frame 019172/0681 →