Method and system of iterative coding/decoding of digital...

Pulse or digital communications – Systems using alternating or pulsating current – Plural channels for transmission of a single pulse train

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C375S265000, C375S341000, C375S347000

Reexamination Certificate

active

10075721

ABSTRACT:
The invention relates to a method of coding and of decoding a digital data stream coded by spatio-temporal combinations, in multiple transmission and reception.On transmission, the initial stream (IDS) is subjected to an outer coding (A), a blockwise interleaving (B), a demultiplexing (C) over a plurality of pathways, to an inner coding Ξmon each pathway, then transmitted on a plurality (ν) of distinct antennas forming a space-diversity array. On reception, the coded symbol streams transmitted are observed (F) by means of a number ν of reception antennas which is independent of the number of transmission antennas, the observed coded symbol streams{MSDSr}r=1r=ρare subjected to a process of turbo-detection by equalization and joint decoding (G), deinterleaving (H), outer decoding (I), interleaving (J), so as to generate an a priori information item (api) on the coded bits, which is reinjected (K) into the turbo-detection process.Application to the implementation of a universal radiofrequency interface, in particular for mobile radio telephony.

REFERENCES:
patent: 6128330 (2000-10-01), Schilling
patent: 6317411 (2001-11-01), Whinnett et al.
patent: 6353637 (2002-03-01), Mansour et al.
patent: 6483828 (2002-11-01), Balachandran et al.
patent: 6584593 (2003-06-01), Seshadri et al.
patent: 6678263 (2004-01-01), Hammons et al.
patent: 6891897 (2005-05-01), Bevan et al.
patent: 2003/0005388 (2003-01-01), Fukumasa
patent: 2003/0118122 (2003-06-01), Nefedov
L.R.Bahl et al. “Optimal decoding of linear codes for minimizing symbol error rate”, IEEE France. Inform. Theory, vol. IT-20, pp. 284-287, Mar. 1974.
Takeshi Hashimoto. “A list-type reduced-constraint generalization of the Viterbi algorithm”—IEEE Transactions on Information Theory. vol. IT-33, No. 6, Nov. 1987.
J.Hagenauer, P.Hoeher, “A Viterbi algorithm with soft decision outputs and its applications”, Proc. IEEE GLOBECOM'89, pp. 1680-1686, Dallas, USA, Nov. 1989.
C.Berrou et al. “Near Shannon limit error correcting coding and decoding: Turbo-codes”—IEEE ICC'93, pp. 1064-1073, Geneva, Switzerland, May 1993.
C.Douillart et al. “Interactive correction of intersymbol interference: Turbo-equalization”—Europ. Trans. on Telecommunication, vol. 6, pp. 507-511, Sep. 1995.
S. Benedetto et al. “Serial Concatenation of interleaved Codes: Performances analysis, design and iterative decoding”—TDA Progress Report 42-126, Aug. 1996.
G.J. Foschini. “Layered space-time architecture for wireless communication in a fading environment when using multi-element antennas”.. Bell Labs Journal. Autumn 1996.
ETSI.GSM Recommendations, 05.5 version 5.8.0—Dec. 1996.
V.Tarock et al. “Space time codes for high data rata wireless communication: performance criterion and code construction”, IEEE Trans. Inform. Theory vol. 44, No. 2, Mar. 1998.
G.Bauch, V.Franz. “A comparison of soft-in soft-out algorithm for turbo-detection” Proceedings of ITC, vol. 2, pp. 259-263, Portos-Carras, Greece, Jun. 1998.
Bauch G. “Concatenation of space-time block codes and turbo-TCM”-ICC'99- 1999 IEEE International Conference on Comm. Conference Record. Vancouver, CA, Jun. 6-10, 1999—IEEE International Conference on Comm—New-York-vol. 2, Jun. 6, 1999—pp. 1202-1206, XP 000898047—ISBN 0-7803-5285-8.
Bauch et al. “MAP equalization of space-time coded signals over frequency selective channels”—Proc. Wireless Comm. on Networking Conference (WCNC) Sep. 1999.
G.J.Foschini et al. “Simplified processing for high spectral efficiency wireless communication employing multi-element arrays”, IEEE JSAC, vol. 17, No. 11, pp. 1841-1852, Nov. 1999.
Stevanov et al. “Turbo coded modulation for systems with transmit and receive antenna diversity”—GLOBECOM'1999 IEEE Global Telecommunications Conference. Seamless interconnection for universal services. Rio de Janeiro, Brazil, Dec. 5-9, 1999 IEEE Global Telecommunications Conference N.Y.—vol. 5 (Dec. 5, 1999), pp. 2336-2340, XP000958539, ISBN 0-7803-5797-3.
R.Visoz et al. “Generalised Viterbi algorithm for trellis coded signals transmitted through broadband wireless channels”- Electronic Letters, pp. 227-228, Feb. 3, 2000, vol. 36, No. 3.
Bauch G. et Al-Dahir. “Iterative equalization and decoding with channel shortening filters for space-time coded modulation”. Vehicular Technology Conference Fall 2000. IEEE VTS Falls VTC2000, vol. 4, Sep. 24-28, 2000, pp. 1575-1582, XP002180247, Boston MA, USA.
Leung Hang Ching Jason. “Low complexity turbo space-time code for system with large number of antennas” Proc. of Global Telecomm. Conf. GLOBECOM'2000, vol. 2, Nov. 27, 2000-Dec. 1, 2000, pp. 990-994, XP002180248, San Francisco CA, USA.
A.O. Berthet et al. “A comparison of several strategies for iteratively decoding serially concatenated convolution codes in multipath Rayleigh fading environment”, Proc. IEEE GLOBECOM'2000,San Francisco, USA, Nov. 2000.
M.Pukkila “Turbo-Equalisation for the enhanced GPRS system”—Proc.IEEE Conf. PIMRCOO London UK, 2000.
French Search Report of Publication No. FR 0102343, report dated Oct. 16, 2001.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Method and system of iterative coding/decoding of digital... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Method and system of iterative coding/decoding of digital..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Method and system of iterative coding/decoding of digital... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3744531

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.