Multiplex communications – Communication over free space – Combining or distributing information via time channels
Reexamination Certificate
1999-11-17
2001-08-14
Olms, Douglas (Department: 2661)
Multiplex communications
Communication over free space
Combining or distributing information via time channels
C370S345000
Reexamination Certificate
active
06275488
ABSTRACT:
REFERENCES TO RELATED APPLICATIONS
This application is related to applications filed on the same day having the same inventorship and assigned to a common assignee. The related applications having Ser. No. 09/442,367 filed Nov. 17, 1999 and Ser. No. 09/603,426 filed on Jun. 26, 2000 respectively, both pending, each of the referenced applications is incorporated by reference herein.
RELATED FIELD OF THE INVENTION
The invention relates to the filed of communications, and more particularly, to data communications.
BACKGROUND OF THE INVENTION
Automatic repeat request (ARQ) schemes are commonly used in data communication to provide a more efficient communication between a source user and a destination user. Several types of ARQ, such as hybrid ARQ, stop-and-wait ARQ, go-back-N (GBN) ARQ and selective repeat (SR) ARQ are available where each provides an efficient use of the communication resources between a source user and a destination user. However, each of the prior arts schemes suffers from at least one problem that makes the communication system more complex, more expensive or inefficient for data communication.
For example, in case of hybrid ARQ, the destination user stores soft versions of the previously sent copies of data packet for soft combining. The data packet with possibly additional incremental redundancy in the channel is sent which increases the coding rate and effectively lowering the communication data rate. The destination user may effectively soft-combine the soft copy stored in the memory with the newly arrived soft copy to decode the data in the data packet. The communication system resources may remain idle between the previous and the new transmission times. The complexity of the communication system as a result is increased due to requirements of additional control, code construction, decoder implementation, and memory requirements.
In case of selective repeat ARQ, source user transmits data packets with a sequence number to be decoded by the destination user. If a data packet arrives with error at the destination user, the destination user sends a message to the source user for retransmission of the packet of data while identifying the data packet sequence number. Depending on the length of delay of such feedback to the source user, the maximum sequence number is increased to allow for the length of the feedback delay. As such, the destination user, for example a mobile station, may be required to have a large memory segment to store transmission of packets of data until all data packets including the packet with the maximum sequence number have arrived without error. The number of data packets stored at the destination user may increase substantially which places a high burden on the memory requirements.
In case of stop-and-wait ARQ, the source user transmits only one packet of data and waits until it receives an indication of successful reception at the destination user, then the source user transmits another data packet. The communication channel remains idle while the source is waiting for the acknowledgment. As such, low usage of the available communication bandwidth resulting in an inefficient communication is a problem associated with stop-and-wait.
Hybrid ARQ may be coupled with stop and wait scheme, however, the result does not overcome the idle communication channel problem experience while waiting for the acknowledgment. Hybrid ARQ may also be coupled with selective repeat scheme; however, the result is not without the known problems. In fact, when hybrid ARQ is coupled with the selective repeat scheme, the requirement of the memory size is substantially increased because in addition to the storing at least one copy of the data packets, additional copies may need to be stored for soft combining operation of the hybrid ARQ portion.
Therefore, there is a need for a method and apparatus of ARQ which provides efficient use of the communication resources without the known complexity of the prior arts.
REFERENCES:
patent: 4718066 (1988-01-01), Rogard
patent: 5477550 (1995-12-01), Crisler
patent: 5657325 (1997-08-01), Lou
patent: 5754754 (1998-05-01), Dudley
patent: 5889790 (1999-03-01), Fukuda
patent: 5946320 (1999-08-01), Decker
patent: 6069886 (2000-05-01), Ayerst
patent: 6111892 (2000-08-01), Rittle
patent: 6134693 (2000-10-01), Fukuda
Shu Lin and Daniel J. Costello,Error Control Coding: Fundamentals and Applications, Prentice Hall, 1983, pp. 477-494.
David Chase, “Code Combining—A Maximum-Likelihood Decoding Approach for Combining an Arbitrary Number of Noisy Packets,”IEEE Trans. Commun. Technol., vol. COM-33, No. 5, May 1985.
Anwarul Hasan, Vijay K. Bhargava, Tho Le-Ngoc, “Algorithms and Architectures for the Design of a VLSI Reed-Solomon Codec,”Reed-Solomon Codes and Their Applications, IEEE Press, 1994.
Joachim Hagenauer, “Rate-Compatible Punctured Convolutional Codes (RCPC Codes) and their Applications,”IEEE Transactions on Communications, vol. 36, No. 4, Apr. 1998.
Samir Kallel, “Generalized Type II Hybrid ARQ Scheme Using Punctured Convolutional Coding,”IEEE Transactions on Communications, Vol. 38, No. 11, Nov. 1990.
Douglas N. Rowitch and Laurence B. Milstein, “Rate Compatible Punctured Turbo (RCPT) Codes in a Hybrid FEC/ARQ System,” ICC 1997.
Samir Kallel, “Complementary Punctured Convolution (CPC) Codes and Their Applications,”IEEE Transactions on Communications, vol. 43, No. 6, Jun. 1995.
Siemans AG, “Comparison of Hybrid ARQ Types I and II-II for TDD”, Contribution to number TSGR1#3(99)177to the 3rdGeneration Partnership Program (3GPP), Nynashamn, Sweden, Mar. 1999.
Xiaoxin, Justin Chuang, Kapil Chawla and Jim Whitehead, “Performance Comparison of Link Adaptation and Incremental Redundancy in Wireless Data Networks,” Wireless Communications and Networking Conference, New Orleans, Sep. 21-24, 1999.
Dimitri Bertsekas, Robert Gallager,Data Networks Second Edition, Prentice-Hall, 1992, pp. 64-85.
Samir Kallel, “Efficient Hybrid ARQ Protocols with Adaptive Forward Error Correction,”IEEE Transactions on Communications, vol. 42, No 2/3/4, Feb./Mar./Apr. 1994.
Siemans AG, “ARQ error control techniques”, Contribution to number TSGR1#3(99)178to the 3rdGeneration Partnership Program (3GPP), Nynashamn, Sweden, Mar. 1999.
C. Berrou et.al, “Near Shannon limit error-correcting coding and decoding:turbo codes,” Proc. ICC'93, pp. 1064-1070. D. Chase, IEEE Trans. Commun., 1985.
.-C. Chan and E. Geraniotis, “An adaptive hybrid FEC/ARQ protocol using turbo codes,” 1997 IEEE International Conference on Universal Personal Communications Record, 1997, pp. 541-545.
K. Narayanan, “A novel ARQ technique using the turbo coding principle,” IEEE Commun. Ltrs, p. 49-51, Mar. 1997.
Classon Brian K.
Cudak Mark C.
Ghosh Amitava
Jalloul Louay
Beladi Sayed H.
May Steven
Motorola Inc.
Olms Douglas
Pizarro Ricardo M.
LandOfFree
Variable rate spread spectrum communication method and... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Variable rate spread spectrum communication method and..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Variable rate spread spectrum communication method and... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-2455437