U.S. patents available from 1976 to present.
U.S. patent applications available from 2005 to present.

Coder-packetizer for random accessing in digital communication with multiple accessing

Patent 4761778 Issued on August 2, 1988. Estimated Expiration Date: Icon_subject August 2, 2005. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.

Patent References

Space communication system for compressed data with a concatenated Reed-Solomon-Viterbi coding channel
Patent #: 3988677
Issued on: 10/26/1976
Inventor: Fletcher ,   et al.

Error coding communication terminal interface
Patent #: 4063038
Issued on: 12/13/1977
Inventor: Kaul ,   et al.

Digital encoder-decoder
Patent #: 4312070
Issued on: 01/19/1982
Inventor: Coombes ,   et al.

Predictive signal coding with partitioned quantization
Patent #: 4354057
Issued on: 10/12/1982
Inventor: Atal

Digital audio satellite transmission system
Patent #: 4567591
Issued on: 01/28/1986
Inventor: Gray ,   et al.

Announced retransmission random access system Patent #: 4641304
Issued on: 02/03/1987
Inventor: Raychaudhuri

Inventor

Application

No. 06/722275 filed on 04/11/1985

US Classes:

370/441, Combining or distributing information via code word channels using multiple access techniques (e.g., CDMA)370/349, Using messages having an address field as header370/521, Time compression or expansion714/788Burst error

Examiners

Primary: Olms, Douglas W.
Assistant: Scutch, III, Frank M.

Attorney, Agent or Firm

International Classes

H04L 12/56 (20060101)
H04L 12/407 (20060101)

Abstract

A Coded Data Multiple Access (CDMA) communication system in which a bit stream of digitized data is convolutionally encoded, and interleaved, to provide time diversity for consecutive output bits of the encoder. The interleaved encoded message is packetized into blocks to which synchronization and user identity preambles are provided. Each packet is transmitted in time compressed bursts at random time intervals.

Other References

  • "Frequency Division and Time Division Multiplexing", Computer Networks, Andrew Tanenbaum, Prentice Hall, 1981
  • "The Network Layer II: Satellite and Packet Radio Networks", Computer Networks, Andrew Tanenbaum, Prentice Hall, 1981
  • "Tree Algorithms for Packet Broadcast Channels", IEEE Transactions on Information Theory, vol. IT-25, No. 5, Sep., 1979 John I. Capetanakis
  • "A Class of Efficient Contention Resolution Algorithms for Multiple Access Channels", IEEE Transactions on Communications vol. COM-33; No. 2, Feb. 1985, Jeannine Mosely and Pierre A. Humblet
  • "Multiple Accessing for the Collision Channel Without Feedback", IEEE Journal on Selected Areas in Communications, vol. SAC-2, No. 4 Jul. 1984, Joseph Y. N. Hui
  • "A New Coding Technique for Asynchronous Multiple Access Communication", IEEE Transactions on Communication Technology vol. COM-19, No. 5, Oct. 1971, Cohen, Heller and Viterbi
  • "Spread Spectrum Mobile Radio, 1977-1982", IEEE Transactions on Vehicular Technology, vol. VT-32, No. 1, Feb. 1983, On-Ching Yue
  • "Viterbi Decoding for Satellite and Space Communication", IEEE Transactions on Communication Technology, vol. COM-19, No. 5, Oct. 1971, Jerrold A. Heller and Irwin M. Jacobs
PatentsPlus Images
Enhanced PDF formats
loading...
PatentsPlus: add to cart
PatentsPlus: add to cartSearch-enhanced full patent PDF image
$9.95more info
PatentsPlus: add to cart
PatentsPlus: add to cartIntelligent turbocharged patent PDFs with marked up images
$18.95more info
 
Sign InRegister
Username  
Password   
forgot password?