← Back to Patent Explorer
US5504773A Expired / Lapsed US ⏱️ 0.0 years remaining

Method and apparatus for the formatting of data for transmission

Assignee: Qualcomm Inc
•
Filing: 1993-12-21
•
Granted: 1996-04-02
•
Expires: 2013-12-21
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract In a digital communication system in which digital data is transmitted in data frames of a preselected time duration, a method and apparatus for formatting digital data in each data frame. A set of data bits of a first data type having a bit count corresponding to one of a plurality of predetermined bit counts are provided. A set of parity check bits for the set of data bits of said first data type are generated when the bit count is a highest bit count or a next to highest bit count. A set of tail bits is generated in accordance with a predetermined frame termination format. In respective order the set of data bits of the first data type, the parity check bits, and the tail bits are porovided in a data frame if the bit count is of the highest bit count or of the next to highest bit count. Otherwise, the set of data bits of the first data type and the tail bits are provided in respective order in the data frame.

Inventors

  • 👤 Roberto Padovani
  • 👤 Edward G. Tiedemann, Jr.
  • 👤 Lindsay A. Weaver, Jr.
  • 👤 Brian K. Butler

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-26 22:05
CPC Classifications
H; H04; H04L; H04L1/00; H04L1/004; H04L1/0056; H04L1/0057; H04B; H04B1/00; H04B1/69; H04B1/707; H04B1/7073; H04B1/7075; H04B1/70757; H04B7/00; H04B7/24; H04B7/26; H04B7/2618; H04B7/2628; H04B7/2637; H04J; H04J13/00; H04J3/00; H04J3/16; H04J3/1682; H04J3/1688; H04J3/22; H04J3/24; H04L1/0059; H04L1/0064; H04L1/0065; H04L1/0067; H04L1/0068; H04L1/0071; H04L1/08; H04L23/00; H04L23/02; H04L5/00; H04L5/02; H04L5/12; H04L7/00; H04L7/04; H04L7/048; H04B1/7097; H04B1/711; H04B1/7115; H04B2201/00; H04B2201/69; H04B2201/707; H04B2201/70701; H04B2201/70703; H04J13/0007; H04J13/004; H04J13/0048; H04J13/16; H04J13/18; H04W; H04W52/00; H04W52/04; H04W52/18; H04W52/26

Claims Analysis

Total Claims: 30
Claim 1
Independent Claim 189 words
In a digital communication system in which digital data is transmitted in data frames of a preselected time duration, a method for formatting digital data in each data frame comprising the steps of: providing a set of data bits of a first data type, said set of data bits of said first data type having a bit count corresponding to one of a plurality of predetermined bit counts; generating a set of parity check bits for said set of data bits of said first data type when said bit count is a highest bit count or a next to highest bit count of said plurality of predetermined bit counts; generating a set of tail bits in accordance with a predetermined frame termination format; and providing in respective order said set of data bits of said first data type, said parity check bits, and said tail bits in a data frame if said bit count is said highest bit count or said next to highest bit count; otherwise, providing in respective order said set of data bits of said first data type and said tail bits in said data frame.
Claim 2
Dependent Claim 189 words
In a digital communication system in which digital data is transmitted in data frames of a preselected time duration, a method for formatting digital data in each data frame comprising the steps of: providing a set of data bits of a first data type, said set of data bits of said first data type having a bit count corresponding to one of a plurality of predetermined bit counts; generating a set of parity check bits for said set of data bits of said first data type when said bit count is a highest bit count or a next to highest bit count of said plurality of predetermined bit counts; generating a set of tail bits in accordance with a predetermined frame termination format; and providing in respective order said set of data bits of said first data type, said parity check bits, and said tail bits in a data frame if said bit count is said highest bit count or said next to highest bit count; otherwise, providing in respective order said set of data bits of said first data type and said tail bits in said data frame.
Claim 3
Dependent Claim 34 words
The method of claim 1 further comprising the steps of: generating a mode bit; and providing said mode bit in said data frame preceding said set of data bits of said first data type.
Claim 4
Dependent Claim 156 words
The method of claim 2 further comprising the steps of: providing a set of data bits of a second data type, wherein said set of data bits of said first data type are of a bit count less than said highest bit count; wherein said mode bit is of a first bit value when only said set of data of said first data type are provided and of a second bit value when said set of data bits of said second data type are provided; wherein when said set of parity check bits are generated, said set of parity bits are generated from said set of data bits of said second data type and said mode bit along with said set of data bits of said first data type; providing in said data frame said set of data bits of said second data type immediately following said set of data bits of said first data type.
Claim 5
Dependent Claim 104 words
The method of claim 1 further comprising the step of: providing a set of data bits of a second data type, wherein said set of data bits of said first data type are of said next to highest bit count; wherein said set of parity check bits are generated from said set of data bits of said second data type along with said set of data bits of said first data type; and providing in said data frame said set of data bits of said second data type between said set of data bits of said first data type and said parity check bits.
Claim 6
Dependent Claim 173 words
A communication system for transmitting information in the form of a plurality of digital data types, comprising: formatting means responsive to at least a first type of digital data and a second type of digital data for producing a data frame including a set of data bits; generator means connected to the formatting means for: generating parity check bits for the set of data bits in response to a particular bit count of data bits of a first data type in the set of data bits; generating tail bits in accordance with a predetermined frame termination format; providing in respective order in the data frame the set of data bits, the parity check bits when the set of data bits includes the particular bit count of data bits or the first data type, and the tail bits; modulation means connected to the generator means for producing a modulated data frame by modulating the data frame according to a modulation procedure; and means connected to the modulation means for transmitting the modulated data frame.
Claim 7
Dependent Claim 173 words
A communication system for transmitting information in the form of a plurality of digital data types, comprising: formatting means responsive to at least a first type of digital data and a second type of digital data for producing a data frame including a set of data bits; generator means connected to the formatting means for: generating parity check bits for the set of data bits in response to a particular bit count of data bits of a first data type in the set of data bits; generating tail bits in accordance with a predetermined frame termination format; providing in respective order in the data frame the set of data bits, the parity check bits when the set of data bits includes the particular bit count of data bits or the first data type, and the tail bits; modulation means connected to the generator means for producing a modulated data frame by modulating the data frame according to a modulation procedure; and means connected to the modulation means for transmitting the modulated data frame.
Claim 8
Dependent Claim 21 words
The communication system of claim 5, wherein: the particular bit count is a highest bit count or a next-to-highest bit count.
Claim 9
Dependent Claim 78 words
The communication system of claim 5, wherein: the bit generator means is further for: generating a mode bit in response to the particular bit count, the mode bit indicating a type of data bits in the set of data bits; and providing in respective order, the mode bit, the data bits, the parity check bits when the set of data bits includes the particular bit count of data bits of the first data type, and the tail bits.
Claim 10
Dependent Claim 37 words
The communication system of claim 7, wherein the bit generator means is further for setting the mode bit to a first state when the set of data bits includes only data bits of the first data type.
Claim 11
Dependent Claim 36 words
The communication system of claim 8, wherein the bit generator means is further for setting the mode bit to a second state when the set of data bits includes data bits of a second data type.
Claim 12
Dependent Claim 43 words
The communication system of claim 9, wherein the bit generator means is for setting the mode bit to the second state when the set of data bits includes data bits of the first data type and data bits of the second data type.
Claim 13
Dependent Claim 36 words
The communication system of claim 9, wherein the bit generator means is for setting the mode bit to the second state when the set of data bats includes only data bits of the second data type.
Claim 14
Dependent Claim 43 words
The communication system of claim 9, wherein the bit generator means is for setting the mode bit to the second state when the set of data bits includes data bits of the second data type and data bits of a third data type.
Claim 15
Dependent Claim 30 words
The communication system of claim 9, wherein the data bits of the first data type represent voice information and the data bits of the second data type represent signaling information.
Claim 16
Dependent Claim 30 words
The communication system of claim 9, wherein the data bits of the first data type represent voice information and the data bits of the second data type represent user data.
Claim 17
Dependent Claim 38 words
The communication system of claim 5, further including a vocoder means connected to the formatting means for generating the first type of digital data, the first type of digital data including data bits of the first data type.
Claim 18
Dependent Claim 14 words
The communication system of claim 5, wherein the modulation procedure is a CDMA procedure.
Claim 19
Dependent Claim 192 words
In a cellular communication system which modulates and transmits data flames on forward and reverse channels, a combination for producing data frames, the combination comprising: means for generating data frames in which each data frame includes a set of traffic bits, each set of traffic bits, each set of traffic data bits including data bits of one or more data types; and bit generator means connected to the means for generating data frames, the bit generator means for: generating a mode bit indicating types of data bits for each data frame having a particular frame bit rate; generating parity check bits for traffic for each data frame having a highest bit count or a next-to-highest bit count of data bits of a first data type; generating tail bits in accordance with a predetermined frame termination format; and providing in respective order: said mode bit, said set of traffic data bits, said parity check bits and said tail bits for each frame having the particular frame bit rate and the highest bit count or next-to-highest bit count; and said set of traffic data bits and said tail bits for all other data frames.
Claim 20
Dependent Claim 192 words
In a cellular communication system which modulates and transmits data flames on forward and reverse channels, a combination for producing data frames, the combination comprising: means for generating data frames in which each data frame includes a set of traffic bits, each set of traffic bits, each set of traffic data bits including data bits of one or more data types; and bit generator means connected to the means for generating data frames, the bit generator means for: generating a mode bit indicating types of data bits for each data frame having a particular frame bit rate; generating parity check bits for traffic for each data frame having a highest bit count or a next-to-highest bit count of data bits of a first data type; generating tail bits in accordance with a predetermined frame termination format; and providing in respective order: said mode bit, said set of traffic data bits, said parity check bits and said tail bits for each frame having the particular frame bit rate and the highest bit count or next-to-highest bit count; and said set of traffic data bits and said tail bits for all other data frames.
Claim 21
Dependent Claim 19 words
The combination of claim 17, wherein the data bits of the first data type are primary traffic data bits.
Claim 22
Dependent Claim 72 words
The combination of claim 17, wherein the mode bit indicates the set of traffic bits: only data bits of the first data type; only data bits of a second data type; only data bits of a third data type; only data bits of the first data type and data bits of the second data type; or only data bits of the first data type and data bits of the third data type.
Claim 23
Dependent Claim 40 words
The combination of claim 19, wherein: the data bits of the first data type represent voice data; the data bits of the second data type represent signaling data; and the data bits of the third data type represent user data.
Claim 24
Independent Claim 82 words
A method for formatting data in a data frame, comprising the steps of: receiving a first data packet; generating a set of parity check bits in accordance with said first data packet when a bit count of said first data packet is a predetermined highest bit count; generating a set of tail bits in accordance with a predetermined frame termination format; and providing in respective order said first data packet, said parity check bits, and said tail bits in said data frame.
Claim 25
Independent Claim 82 words
A method for formatting data in a data frame, comprising the steps of: receiving a first data packet; generating a set of parity check bits in accordance with said first data packet when a bit count of said first data packet is a predetermined highest bit count; generating a set of tail bits in accordance with a predetermined frame termination format; and providing in respective order said first data packet, said parity check bits, and said tail bits in said data frame.
Claim 26
Dependent Claim 34 words
The method claim 21 further comprising the step of generating at least one indicator bit and wherein in said data frame said at least one indicator bit is provided preceding said first data packet.
Claim 27
Dependent Claim 27 words
The method claim 22 wherein said parity check bits are generated in accordance with said at least one indicator bit in addition to said first data packet.
Claim 28
Dependent Claim 75 words
The method of claim 21 further comprising the steps of: receiving a second data packet; generating said set of parity check bits in accordance with said second data packet in addition to said first data packet when a bit count of said first data packet is a predetermined second highest bit count; and wherein said predetermined bit count data of said second data packet is provided in said data frame following said first data packet.
Claim 29
Dependent Claim 34 words
The method claim 24 further comprising the step of generating at least one indicator bit and wherein in said data frame said at least one indicator bit is provided preceding said first data packet.
Claim 30
Dependent Claim 32 words
The method claim 25 wherein said parity check bits are generated in accordance with said at least one indicator bit in addition to said first data packet and said second data packet.

References Cited (Backward Citations)

GB2022365A Cited
US4291409A Cited
GB2182528A Cited
EP0412583A2 Cited
US5003533A Cited
US4980897A Cited
US5068849A Cited
US5212684A Cited
EP0418865A2 Cited
WO1991007030A1 Cited
EP0444592A2 Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1999-04-02 1999-10-02 2000-04-02 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2003-04-02 2003-10-02 2004-04-02 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2007-04-02 2007-10-02 2008-04-02 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag