Loading

Error: Cannot Load Popup Box

Hit List

Title:

Distance-Gains By Multiple-Duplex Transmission, Coding, And Shaping For HDSL

Description:

The maximum distance over which reliable high rate digital transmission over twisted pair lines is possible, can substantially be increased by multiple-duplex transmission, channel coding, and signal shaping. Simple equations are derived to transform SNR-gains into distance gains. Numerical examples are given for a transmission of 2.048 Mbit/s o...

The maximum distance over which reliable high rate digital transmission over twisted pair lines is possible, can substantially be increased by multiple-duplex transmission, channel coding, and signal shaping. Simple equations are derived to transform SNR-gains into distance gains. Numerical examples are given for a transmission of 2.048 Mbit/s over twisted pairs with lines diameters 0.4 mm and 0.6 mm (AWG 26 and AWG 22). A new signal shaping method without scrambling of data bits is proposed, by which a SNR-loss due to error multiplication in the descrambling procedure is avoided. 1. INTRODUCTION High-rate digital subscriber-lines (HDSL) are proposed to establish a "copper brigde" to a future optical broadband communication network, [?]. This technique offers a fast and cost efficient introduction of high rate digital communication services by the use of old simple twisted pair lines. System proposals with single-, dual- (1.544 Mbit/s) and even tripleduplex transmission ( 2.048 Mbit/. Minimize

Contributors:

The Pennsylvania State University CiteSeerX Archives

Year of Publication:

2009-04-11

Source:

http://www.LNT.de/LIT/papers/icc93.ps.gz

http://www.LNT.de/LIT/papers/icc93.ps.gz Minimize

Document Type:

text

Language:

en

DDC:

003 Systems *(computed)*

Rights:

Metadata may be used without restrictions as long as the oai identifier remains attached to it.

Metadata may be used without restrictions as long as the oai identifier remains attached to it. Minimize

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

MMSE-Based Iterative Equalization with Soft Feedback for Transmission with General Square QAM Constellations

Description:

In this paper, an equalization algorithm employing soft--decision feedback, designed for transmission with general square QAM constellations is introduced like e.g. 16QAM or 64QAM allowing high data rates. It is derived from [1] where it was originally developed for 4QAM transmission. The algorithm employs a minimum mean--squared error (MMSE) fi...

In this paper, an equalization algorithm employing soft--decision feedback, designed for transmission with general square QAM constellations is introduced like e.g. 16QAM or 64QAM allowing high data rates. It is derived from [1] where it was originally developed for 4QAM transmission. The algorithm employs a minimum mean--squared error (MMSE) filter in each iteration in order to refine the data estimates. The rule for generating soft decisions is adapted continuously to the current state of the algorithm. It can be shown by simulations for a 16QAM transmission, that a linear finite length MMSE channel equalizer according to [2] is clearly outperformed. In addition to [1], we compare our new generalized scheme for different MMSE filter lengths and show the achievable extra gain. Minimize

Contributors:

The Pennsylvania State University CiteSeerX Archives

Year of Publication:

2009-04-17

Source:

http://www.lnt.de/~roessler/icc03_roessler.ps.gz

http://www.lnt.de/~roessler/icc03_roessler.ps.gz Minimize

Document Type:

text

Language:

en

Rights:

Metadata may be used without restrictions as long as the oai identifier remains attached to it.

Metadata may be used without restrictions as long as the oai identifier remains attached to it. Minimize

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Combinatorial Analysis of the Minimum Distance of Turbo Codes

Description:

In this paper, new upper bounds on the maximum attainable minimum Hamming distance of Turbo codes with arbitrary | including the best | interleavers are established using a combinatorial approach. These upper bounds depend on the interleaver length, on the code rate and on the scramblers employed in the encoder. Examples of the new bounds for pa...

In this paper, new upper bounds on the maximum attainable minimum Hamming distance of Turbo codes with arbitrary | including the best | interleavers are established using a combinatorial approach. These upper bounds depend on the interleaver length, on the code rate and on the scramblers employed in the encoder. Examples of the new bounds for particular Turbo codes are given and discussed. The new bounds are tighter than all existing ones and prove that the minimum Hamming distance of Turbo codes cannot asymptotically grow at a rate more than the third root of the codeword length. Keywords: Turbo code, minimum Hamming distance bounds, interleaver design The authors would like to thank the Fraunhofer Gesellschaft { Institut fur Integrierte Schaltungen, Erlangen, for supporting this work. June 25, 2001 DRAFT BREILING, HUBER: COMBINATORIAL ANALYSIS .; SUBMITTED TO THE IEEE TRANS. ON IT 06/03/2000 2 I. Minimize

Contributors:

The Pennsylvania State University CiteSeerX Archives

Year of Publication:

2009-04-16

Source:

http://www.LNT.de/LIT/papers/bre00h.ps.gz

http://www.LNT.de/LIT/papers/bre00h.ps.gz Minimize

Document Type:

text

Language:

en

Subjects:

The authors would like to thank the Fraunhofer Gesellschaft { Institut fur Integrierte Schaltungen ; Erlangen

The authors would like to thank the Fraunhofer Gesellschaft { Institut fur Integrierte Schaltungen ; Erlangen Minimize

DDC:

005 Computer programming, programs & data *(computed)*

Rights:

Metadata may be used without restrictions as long as the oai identifier remains attached to it.

Metadata may be used without restrictions as long as the oai identifier remains attached to it. Minimize

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Design of "Multiple-Turbo-Codes" with Transfer Characteristics of Component Codes

Description:

For the construction of low rate turbo-codes, the concept of multiple parallel concatenated codes, i.e. the "multiple-turbo-code" has been successfully employed e.g. in [13, 16]. Analysis of this structure has been done via simulations [16] or the analysis of equivalent coding schemes [13].

For the construction of low rate turbo-codes, the concept of multiple parallel concatenated codes, i.e. the "multiple-turbo-code" has been successfully employed e.g. in [13, 16]. Analysis of this structure has been done via simulations [16] or the analysis of equivalent coding schemes [13]. Minimize

Contributors:

The Pennsylvania State University CiteSeerX Archives

Year of Publication:

2009-04-16

Source:

http://www.LNT.de/LIT/papers/Ciss02_simon_huettinger.ps.gz

http://www.LNT.de/LIT/papers/Ciss02_simon_huettinger.ps.gz Minimize

Document Type:

text

Language:

en

Subjects:

Turbo--Codes ; Convergence Analysis

Turbo--Codes ; Convergence Analysis Minimize

Rights:

Metadata may be used without restrictions as long as the oai identifier remains attached to it.

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Performance estimation for concatenated coding schemes

Description:

Abstract — Asymptotical analysis of concatenated codes with EXIT charts [tB99] or the AMCA [HH02b] is proven to be a powerful tool for the design of power–efficient communication systems. But, usually the result of the asymptotical analysis is a binary decision, whether convergence of iterative decoding is possible at the chosen signal–to– noise...

Abstract — Asymptotical analysis of concatenated codes with EXIT charts [tB99] or the AMCA [HH02b] is proven to be a powerful tool for the design of power–efficient communication systems. But, usually the result of the asymptotical analysis is a binary decision, whether convergence of iterative decoding is possible at the chosen signal–to– noise ratio, or not. In this paper it is shown how to obtain the Information Processing Characteristic (IPC) introduced in [HHJF01] for concatenated coding schemes. If asymptotical analysis is performed under the assumption of infinite interleaving and infinitely many iterations, this IPC will be a lower bound. Furthermore, it also is possible to estimate the performance of realistic coding schemes by restricting the number of iterations. Finally, the IPC can be used to estimate the resulting bit error ratio for the concatenated coding scheme. As an upper and a lower bound on the bit error ratio for a given IPC exist, we are able to lower bound the performance of any concatenated coding scheme and give an achievability bound, i.e. it is possible to determine a performance that can surely be achieved if sufficiently many iterations are performed and a large interleaver is used. I. SYSTEM MODEL In the following we analyze the properties of a digital communications system consisting of a binary Bernoulli source, a channel coder, a channel, a decoder and a sink. Without loss of generality we assume, that the source emits a block of K binary information symbols U[i], i �1, 2,,K�. The encoder maps the information vector U to a codeword X which consists of N symbols X[n], n �1, 2,,N�. The rate of the code, which is supposed to be time–invariant, is R = K/N measured in bit per channel symbol. The codeword X is transmitted over a memoryless channel that corrupts the message by substitution errors, e.g., the binary symmetric channel (BSC) or the additive white Gaussian noise channel (AWGN Channel). Modulator and demodulator are considered as being part of the channel. Additionally we introduce an (theoretically infinite) interleaver π before encoding that converts the end–to–end channel between U and V to a memoryless channel. Minimize

Contributors:

The Pennsylvania State University CiteSeerX Archives

Year of Publication:

2013-08-08

Source:

http://www.lit.lnt.de/papers/itw03_116.pdf

http://www.lit.lnt.de/papers/itw03_116.pdf Minimize

Document Type:

text

Language:

en

DDC:

003 Systems *(computed)*

Rights:

Metadata may be used without restrictions as long as the oai identifier remains attached to it.

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Improved Decoding Of Woven Convolutional Codes Via Hierarchical Near-Eep Code Structure

Description:

A hierarchically designed channel coding scheme protects a few number of input data streams so--called layers with decreasing amount of redundancy from layer 0 to layer L. Such a code design clearly leads to unequal error protection, but as shown in [9] it can be superior in the average bit error rate compared to an equal error protection (EEP) ...

A hierarchically designed channel coding scheme protects a few number of input data streams so--called layers with decreasing amount of redundancy from layer 0 to layer L. Such a code design clearly leads to unequal error protection, but as shown in [9] it can be superior in the average bit error rate compared to an equal error protection (EEP) design, if the protection of layers is not too di#erent. This is due to the fact, that a near--EEP hierarchical design can match the properties of the iterative decoder. Minimize

Contributors:

The Pennsylvania State University CiteSeerX Archives

Year of Publication:

2009-04-16

Source:

http://www.LNT.de/LIT/papers/Globecom01_simon_huettinger.ps.gz

http://www.LNT.de/LIT/papers/Globecom01_simon_huettinger.ps.gz Minimize

Document Type:

text

Language:

en

Rights:

Metadata may be used without restrictions as long as the oai identifier remains attached to it.

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Published online in Wiley InterScience (www.interscience.wiley.com). DOI: 10.1002/ett.1037 Information Theory

Description:

Information processing characteristics and BER-bounds

Information processing characteristics and BER-bounds Minimize

Contributors:

The Pennsylvania State University CiteSeerX Archives

Year of Publication:

2008-07-01

Source:

http://www.lnt.de/LIT/papers/ett_05_ipc_paper.pdf

http://www.lnt.de/LIT/papers/ett_05_ipc_paper.pdf Minimize

Document Type:

text

Language:

en

Rights:

Metadata may be used without restrictions as long as the oai identifier remains attached to it.

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

A Method for Determining the Distance Profile of Turbo Codes

Description:

| This contribution proposes a new algorithm for determining the low distance terms in the distance profile of Turbo codes by analyzing their interleaver. The method is applied to several interleavers and the results are displayed and discussed. I.

| This contribution proposes a new algorithm for determining the low distance terms in the distance profile of Turbo codes by analyzing their interleaver. The method is applied to several interleavers and the results are displayed and discussed. I. Minimize

Contributors:

The Pennsylvania State University CiteSeerX Archives

Year of Publication:

2009-04-15

Source:

http://www-nt.e-technik.uni-erlangen.de/~dcg/papers/itg00_breihu.ps.gz

http://www-nt.e-technik.uni-erlangen.de/~dcg/papers/itg00_breihu.ps.gz Minimize

Document Type:

text

Language:

en

Rights:

Metadata may be used without restrictions as long as the oai identifier remains attached to it.

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Construction Of Low-Rate Power-Efficient Coding Schemes And Their Application To CDMA

Description:

In this paper we propose a novel design method, which is an extension to the EXIT charts introduced in [5], for low-rate power-efficient codes. An exemplary design of a rate-1/4 code shows more than 1 dB more coding gain than the original turbo-code [2] of rate-1/2. Using this code in a CDMA scheme while reducing the spreading by a factor of 2 h...

In this paper we propose a novel design method, which is an extension to the EXIT charts introduced in [5], for low-rate power-efficient codes. An exemplary design of a rate-1/4 code shows more than 1 dB more coding gain than the original turbo-code [2] of rate-1/2. Using this code in a CDMA scheme while reducing the spreading by a factor of 2 helps improving the overall performance of the multi-user scheme significantly. Minimize

Contributors:

The Pennsylvania State University CiteSeerX Archives

Year of Publication:

2009-04-17

Source:

http://www.LNT.de/LIT/papers/globecom02.ps.gz

http://www.LNT.de/LIT/papers/globecom02.ps.gz Minimize

Document Type:

text

Language:

en

Rights:

Metadata may be used without restrictions as long as the oai identifier remains attached to it.

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Upper Bound on the Minimum Distance of Turbo Codes Using a Combinatorial Approach

Description:

By using combinatorial considerations, we derive new upper bounds on the minimum Hamming distance, which Turbo codes can maximally attain with arbitrary -- including the best -- interleavers. The new bounds prove that by contrast to general linear binary channel codes, the minimum Hamming distance of Turbo codes cannot asymptotically grow strong...

By using combinatorial considerations, we derive new upper bounds on the minimum Hamming distance, which Turbo codes can maximally attain with arbitrary -- including the best -- interleavers. The new bounds prove that by contrast to general linear binary channel codes, the minimum Hamming distance of Turbo codes cannot asymptotically grow stronger than the third root of the codeword length. Minimize

Contributors:

The Pennsylvania State University CiteSeerX Archives

Year of Publication:

2009-04-15

Source:

http://www.LNT.de/LNT2/papers/bre00d.ps.gz

http://www.LNT.de/LNT2/papers/bre00d.ps.gz Minimize

Document Type:

text

Language:

en

Subjects:

Turbo code ; minimum Hamming distance bounds ; interleaver

Turbo code ; minimum Hamming distance bounds ; interleaver Minimize

Rights:

Metadata may be used without restrictions as long as the oai identifier remains attached to it.

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Currently in BASE: 68,072,316 Documents of 3,307 Content Sources

http://www.base-search.net