Method of packeting continuous data information and packet data in frames

Claim 1

A method of packeting data into frames from sources of continuous data information together with information packets from sources of packet information, comprising the steps of: providing first fields for said continuous data information in predetermined positions in each frame, providing second fields for said information packets in predetermined positions in each frame, and providing pointer fields in each frame, each pointer field contains information either as to where an information packet ends in one of said second fields for said information packets or as to where an information packet begins in one of said second fields for said information packets, wherein dimensions of the pointers are determined by the number of bits of packet data for each quantization and the smallest number of bits of a packet and pause between packets, respectively.

Claim 2

A method of packeting data into frames from sources of continuous data information together with information packets from sources of packet information, comprising the steps of: providing first fields for said continuous data information in predetermined positions in each frame, providing second fields for said information packets in predetermined positions in each frame, and providing pointer fields in each frame, each pointer field contains information either as to where an information packet ends in one of said second fields for said information packets or as to where an information packet begins in one of said second fields for said information packets, wherein dimensions of the pointers are determined by the number of bits of packet data for each quantization and the smallest number of bits of a packet and pause between packets, respectively.

Claim 3

A method of packeting data into frames from sources of continuous data information together with information packets from sources of packet information, comprising the steps of: providing first fields for said continuous data information in predetermined positions in each frame, providing second fields for said information packets in predetermined positions in each frame, and providing pointer fields in each frame, each pointer field contains information either as to where an information packet ends in one of said second fields for said information packets or as to where an information packet begins in one of said second fields for said information packets, wherein a first type of pointer field is used for marking the staff of an empty space or packet and a second type of pointer field is used for marking the start of the next packet and empty space, wherein the distance between pointer fields of the first type is based on the length of the smallest packet and empty space, and the distance between pointer fields of the second type are based on the magnitude of the greatest empty space and packet.

Claim 4

A method of packeting data into frames from sources of continuous data information together with information packets from sources of packet information, comprising the steps of: providing first fields for said continuous data information in predetermined positions in each frame, providing second fields for said information packets in predetermined positions in each frame, and providing pointer fields in each frame, each pointer field contains information either as to where an information packet ends in one of said second fields for said information packets or as to where an information packet begins in one of said second fields for said information packets, wherein a first type of pointer field is used for marking the staff of an empty space or packet and a second type of pointer field is used for marking the start of the next packet and empty space, wherein the distance between pointer fields of the first type is based on the length of the smallest packet and empty space, and the distance between pointer fields of the second type are based on the magnitude of the greatest empty space and packet.

Claim 5

A method of packeting data into frames from sources of continuous data information together with information packets from sources of packet information, comprising the steps of: providing first fields for said continuous data information in predetermined positions in each frame, providing second fields for said information packets in predetermined positions in each frame, and providing pointer fields in each frame, each pointer field contains information either as to where an information packet ends in one of said second fields for said information packets or as to where an information packet begins in one of said second fields for said information packets, wherein empty spaces and packets are each provided with a pointer field for pointing out the start of the respective space or packet said pointer fields being dimensioned based on greatest empty space and greatest data contents of a packet field, respectively, and an additional pointer field is used for pointing out if the first bit is data or empty space.

Claim 6

A method of packeting data into frames from sources of continuous data information together with information packets from sources of packet information, comprising the steps of: providing first fields for said continuous data information in predetermined positions in each frame, providing second fields for said information packets in predetermined positions in each frame, and providing pointer fields in each frame, each pointer field contains information either as to where an information packet ends in one of said second fields for said information packets or as to where an information packet begins in one of said second fields for said information packets, wherein empty spaces and packets are each provided with a pointer field for pointing out the start of the respective space or packet said pointer fields being dimensioned based on greatest empty space and greatest data contents of a packet field, respectively, and an additional pointer field is used for pointing out if the first bit is data or empty space.

Claim 8

A method of packeting data into frames from sources of continuous data information together with information packets from sources of packet information, comprising the steps of: providing first fields for said continuous data information, providing second fields for said information packets, wherein the fields for continuous data information and fields for information packets are mixed with each other over the whole frame, and providing pointer fields in each frame, each pointer field contains information either as to where an information packet ends in one of said second fields for said information packets or as to where an information packet begins in one of said second fields for said information packets, wherein dimensions of the pointers are determined by the number of bits of packet data for each quantization and the smallest number of bits of a packet and pause between packets, respectively.

Claim 9

A method of packeting data into frames from sources of continuous data information together with information packets from sources of packet information, comprising the steps of: providing first fields for said continuous data information, providing second fields for said information packets, wherein the fields for continuous data information and fields for information packets are mixed with each other over the whole frame, and providing pointer fields in each frame, each pointer field contains information either as to where an information packet ends in one of said second fields for said information packets or as to where an information packet begins in one of said second fields for said information packets, wherein dimensions of the pointers are determined by the number of bits of packet data for each quantization and the smallest number of bits of a packet and pause between packets, respectively.

Claim 10

A method of packeting data into frames from sources of continuous data information together with information packets from sources of packet information, comprising the steps of: providing first fields for said continuous data information, providing second fields for said information packets, wherein the fields for continuous data information and fields for information packets are mixed with each other over the whole frame, and providing pointer fields in each frame, each pointer field contains information either as to where an information packet ends in one of said second fields for said information packets or as to where an information packet begins in one of said second fields for said information packets, wherein a first type of pointer field is used for marking the start of an empty space or packet and a second type of pointer field is used for marking the start of the next packet and empty space, wherein the distance between pointer field of the first type is based on the length of the smallest packet and empty space, and the distance between pointer field of the second type is based on the magnitude of the greatest empty space and packet.

Claim 11

A method of packeting data into frames from sources of continuous data information together with information packets from sources of packet information, comprising the steps of: providing first fields for said continuous data information, providing second fields for said information packets, wherein the fields for continuous data information and fields for information packets are mixed with each other over the whole frame, and providing pointer fields in each frame, each pointer field contains information either as to where an information packet ends in one of said second fields for said information packets or as to where an information packet begins in one of said second fields for said information packets, wherein a first type of pointer field is used for marking the start of an empty space or packet and a second type of pointer field is used for marking the start of the next packet and empty space, wherein the distance between pointer field of the first type is based on the length of the smallest packet and empty space, and the distance between pointer field of the second type is based on the magnitude of the greatest empty space and packet.

Claim 12

A method of packeting data into frames from sources of continuous data information together with information packets from sources of packet information, comprising the steps of: providing first fields for said continuous data information, providing second fields for said information packets, wherein the fields for continuous data information and fields for information packets are mixed with each other over the whole frame, and providing pointer fields in each frame, each pointer field contains information either as to where an information packet ends in one of said second fields for said information packets or as to where an information packet begins in one of said second fields for said information packets, wherein empty spaces and packets are each provided with a pointer field for pointing out the start of the respective space or packet, said pointer fields being dimensioned based on the greatest empty space and greatest data contents of a packet field, respectively, an additional pointer field is used for pointing out if the first bit is data or empty space.

Claim 13

A method of packeting data into frames from sources of continuous data information together with information packets from sources of packet information, comprising the steps of: providing first fields for said continuous data information, providing second fields for said information packets, wherein the fields for continuous data information and fields for information packets are mixed with each other over the whole frame, and providing pointer fields in each frame, each pointer field contains information either as to where an information packet ends in one of said second fields for said information packets or as to where an information packet begins in one of said second fields for said information packets, wherein empty spaces and packets are each provided with a pointer field for pointing out the start of the respective space or packet, said pointer fields being dimensioned based on the greatest empty space and greatest data contents of a packet field, respectively, an additional pointer field is used for pointing out if the first bit is data or empty space.