ASYMPTOTIC BEHAVIOR OF ECKHOFF＇S METHOD FOR FOURIER SERIES CONVERGENCE ACCELERATION

The current paper considers the problem of recovering a function using a limited number of its Fourier coefficients. Specifically, a method based on Bernoulli-like polynomials suggested and developed by Krylov, Lanczos, Gottlieb and Eckhoff is examined. Asymptotic behavior of approximate calculation of the so-called ＂jumps＂ is studied and asymptotic L2 constants of the rate of convergence of the method are computed.     

Design of Amplitude and Phase Modulated Signals for Differential Space-Time Block Codes

A differential space-time block code (DSTBC) provides full diversity advantage and does not require any radio channel estimation in the receiver, which makes it an attractive alternative to the well-known coherent space-time block code (STBC). However the original design of DSTBC allows only pure phase shift keying (M-PSK) modulation scheme, which are not optimal for M > 4. In this paper a simultaneous amplitude and phase modulation scheme for DSTBC with 2 transmit and several receive antennas is introduced. The performance of the proposed scheme is investigated and compared with DSTBC techniques using pure M-PSK modulation. Alexandre Vanaev received B.Eng. degree in Electrical and Electronic engineering from the St. Petersburg State Polytechnic University, Russia in 1998, and M.Sc. degree in “Information and communication systems” from Technical University Hamburg-Harburg in 2002. He is currently pursuing his Ph.D. in the Technical University Hamburg-Harburg, Department of Telecommunications. His research interests include prospective OFDM-based wireless communication systems and MIMO technology. Prof. Hermann Rohling is with the Technical University Hamburg-Harburg, Germany where he has developed an international reputation for Mobile Communication (4G) and automotive radar systems. Previously Prof. Rohling was with the AEG Research Institute, Ulm as a researcher working in the area of digital signal processing for radar and communications applications. His research interests have includedWideband Mobile Communications especially based on Multicarrier Transmission Techniques (OFDM) for future broadband systems (4G), signal theory, digital radar signal processing, detection, estimation and differential GPS for high precision navigation. Prof. Rohling is a member of Informationstechnische Gesellschaft (ITG), German Institute of Navigation (DGON) and a Fellow of IEEE. He is a chairman of the September 2006 International OFDM Workshop (InOWo 2006) and the International Radar Symposium (IRS 2006) in Krakow, Poland. Prof. Rohling is theVice President of the Technical University Hamburg-Harburg.     

在VHF移动信道中不同条件下BCH码的纠错性能研究

本文在文献［７］基础上研究了采用分组ＢＣＨ码加交错技术抗衰落的性能。模拟了：ＢＣＨ（６３ ３９ ４）码、ＢＣＨ（１２７ ７８ ７）码和ＢＣＨ（１２７ ６４ １０）码在交错与非交错两种不同情况下，融载波调制方式分别为ＦＳＫ３００ｂｉｔｓ／ｓ、ＤＰＳＫ１２００ｂｉｔｓ／ｓ、ＱＰＳＫ２４００ｂｉｔｓ／ｓ和８ＰＳＫ ４８００ｂｉｔｓ／ｓ，不同车速分别为：４０ｋｍ／ｈ和１００ｋｍ／ｈ时的纠错性能。     

On universally decodable matrices for space–time coding

The notion of universally decodable matrices (UDMs) was recently introduced by Tavildar and Viswanath while studying slow-fading channels. It turns out that the problem of constructing UDMs is tightly connected to the problem of constructing maximum-distance separable codes. In this paper, we first study the properties of UDMs in general and then we discuss an explicit construction of a class of UDMs, a construction which can be seen as an extension of Reed–Solomon codes. In fact, we show that this extension is, in a sense to be made more precise later on, unique. Moreover, the structure of this class of UDMs allows us to answer some open conjectures by Tavildar, Viswanath, and Doshi in the positive, and it also allows us to formulate an efficient decoding algorithm for this class of UDMs. It turns out that our construction yields a coding scheme that is essentially equivalent to a class of codes that was proposed by Rosenbloom and Tsfasman. Moreover, we point out connections to so-called repeated-root cyclic codes.     

BILINEAR FORMS AND LINEAR CODES

Abraham Lempel et al^[1] made a connection between linear codes and systems of bilinear forms over finite fields. In this correspondence, a new simple proof of a theorem in [1] is presented; in addition, the encoding process and the decoding procedure of RS codes are simplified via circulant matrices. Finally, the results show that the correspondence between bilinear forms and linear codes is not unique.     

Recursive constructions for optimal (n,4,2)‐OOCs

In [ 3 ], a general recursive construction for optical orthogonal codes is presented, that guarantees to approach the optimum asymptotically if the original families are asymptotically optimal. A challenging problem on OOCs is to obtain optimal OOCs, in particular with λ > 1. Recently we developed an algorithmic scheme based on the maximal clique problem (MCP) to search for optimal (n, 4, 2)‐OOCs for orders up to n = 44. In this paper, we concentrate on recursive constructions for optimal (n, 4, 2)‐OOCs. While “most” of the codewords can be constructed by general recursive techniques, there remains a gap in general between this and the optimal OOC. In some cases, this gap can be closed, giving recursive constructions for optimal (n, 4, 2)‐OOCs. This is predicated on reducing a series of recursive constructions for optimal (n, 4, 2)‐OOCs to a single, finite maximal clique problem. By solving these finite MCP problems, we can extend the general recursive construction for OOCs in [ 3 ] to obtain new recursive constructions that give an optimal (n · 2^x, 4, 2)‐OOC with x ≥ 3, if there exists a CSQS(n). © 2004 Wiley Periodicals, Inc.     

Low complexity concatenated coding schemes for digital satellite communications

A study of reduced complexity concatenated coding schemes, for commercial digital satellite systems with low-cost earth terminals, is reported. The study explored trade-offs between coding gain, overall rate and decoder complexity, and compared concatenated schemes with single codes. It concentrated on short block and constraint length inner codes, with soft decision decoding, concatenated with a range of Reed-Solomon outer codes. The dimension of the inner code was matched to the outer code symbol size, and appropriate interleaving between the inner and outer codes was used. Very useful coding gains were achieved with relatively high-rate, low-complexity schemes. For example, concatenating the soft decision decoded (9,8) single parity check inner code with the CCSDS recommended standard Reed-Solomon outer code gives a coding gain of 4.8dB at a bit error probability of 10^?5, with an overall rate of 0-78.     

Turbo码的性能分析及其应用

纠错编码技术作为改善数字通信可靠性的一种有效手段,在数字通信的各个领域中获得极为广泛的应用,其主要分为卷积码、分组码。Turbo码是并行级联递归系统卷积码。他在接近Shannon限的低信噪比下能获得较低的误码率。因为其优越的性能,现在已经被许多通信系统所采用。就近年来的研究热点纠错编码Turbo码进行分析,旨在阐明Turbo码的基本原理和各参数对Turbo码纠错性能的影响以及在无线通信系统中的应用。     

On perfect binary codes

Some results on perfect codes obtained during the last 6 years are discussed. The main methods to construct perfect codes such as the method of -components and the concatenation approach and their implementations to solve some important problems are analyzed. The solution of the ranks and kernels problem, the lower and upper bounds of the automorphism group order of a perfect code, spectral properties, diameter perfect codes, isometries of perfect codes and codes close to them by close-packed properties are considered.     

Mass formula for self-dual codes over Z

We give a mass formula for self-dual codes over Z_p², where p is an odd prime. Using the mass formula, we classify such codes of lengths up to n=8 over the ring Z₉, n=7 over Z₂₅ and n=6 over Z₄₉.