The minimum squared euclidean distance of multi-h phase codes

The minimum squared Euclidean distance(MSED) of binary multi-h phase codes is presented. The signal segregation degree(SSD) has been put forward to determine MSED of multi-h phase codes. In order to maximize MSED, SSD should be as large as possible. The necessary and sufficient conditions of maximizing SSD are derived. Finally, SSD and the exact formulae for MSED of binary 2-h phase codes are also presented.     

Skeleton chain coding for Chinese characters

The compression of Chinese characters is very important for Chinese office automation and desktop publishing. In this paper, various methods are used to compress 13,051 Chinese characters losslessly by coding their skeleton points. The skeleton points are composed of isolated points and curves. To trace every point in a curve once and consecutively is a NP problem. Therefore, we use contour path following and revisiting algorithms to trace skeleton curves with chain codes. The remaining isolated skeleton points are encoded by an Elias code. Our coding method has a better compression rate than that of conventional skeleton coding.     

A Two-Level Spreading-despreading CDMA System and Its Performance Evaluation

1　IntroductionHowtosuppresstheinterferenceintheCDMAsystems,includingtheSelfInterference(SI) ,Mul tipleAccessInterference(MAI)andtheAdjacentCellInterference(ACI) ,isthekeypointinimprov ingthesystemperformanceandcapacity .Insteadofthecomplicatedspecializedsignalprocessingtech niquesusedbefore[1～ 4] ,spreadingsequenceswithgoodcorrelationpropertiescanimprovethesystemperformanceradically[5] .InRef.[6～ 9],theconceptofZeroCorrelationZone (ZCZ) ,whichisequivalenttothegeneralizedothogonal…     

Multi-User MIMO Mobile CDMA Uplink System Employing Turbo Coding and Joint Detection Through a Multipath Rayleigh Fading Channel

In this paper, a generalized multiple-input multiple-output (MIMO) antenna system that can be fitted to the uplink of a wireless communication system is considered for the general case of multi-user. At the transmitter, the information bits are Turbo coded, then interleaved and passed through a serial-to-parallel converter. The channel is assumed bad urban suffering from multipath Rayleigh fading resulting in inter-symbol and multiple access interferences (ISI and MAI). At the front-end of the receiver, a number of receiving antennas are used followed by a joint multi-user estimator based on the Minimum Mean Square Error Block Linear Equalizer (MMSE-BLE).Computer simulations demonstrate a significant performance improvement in both single user and multi-user cases.This paper depends in parts on that presented at the 11th European Wireless Conference, Cyprus, Nicosia, pp. 187–192, April 2005. Yasmine A. Fahmy was born in Guiza, Egypt, on June 4, 1976. She received the B.Sc., M.Sc. and Ph.D. degrees in Communication and Electronics engineering from Cairo University, Egypt on 1999, 2001 and 2005 respectively. She is presently an assistant professor at Cairo University, Egypt. Her current field of interest is wireless communication and channel estimation. Hebat-Allah M. Mourad received her B.Sc., M. Sc. and Ph.D. degrees in electrical communication engineering from Cairo University, Egypt, in 1983, 1987 and 1994 respectively. Since 1983, she has been with the Department of Electronics and Communications, Faculty of Engineering, Cairo University, and is currently associate professor there. Her research interests include optical fiber communications, mobile and satellite communications. Emad K. Al-Hussaini received his B.Sc degree in Electrical Communication Engineering from Ain-Shams University, Cairo, Egypt, in 1964 and his M.Sc and Ph.D. degrees from Cairo University, Giza, Egypt, in 1974 and 1977, respectively. From 1964 to 1970, he was with the General Egyptian Aeroorganization. Since 1970, he has been with the Department of Electronics and Communications, Faculty of Engineering, Cairo University, and is currently professor there. He was a research fellow at Imperial College, London, UK, and at the Moore School of Electrical Engineering, University of Pennsylvania, Philadelphia, PA, USA, in the academic years 1976/1977 and 1981/1982, respectively. In 1990, he received the Egyptian national encouragement award for outstanding engineering research. He has written several papers for technical international journals and conferences. His research interests include signal processing, fading channel communication, modulation, and cellular mobile radio systems. Dr Al-Hussaini is a senior member of IEEE. He is listed in Marquis Whos Who in the World and in the IBC (International Biographical Center, Cambridge) for outstanding people of the 20th century.     

Performance of a turbo‐coded CDMA system in a mobile satellite channel

The bit error rate (BER) performance of a turbo‐coded code‐division multiple‐access (CDMA) system operating in a satellite channel is analysed and simulated. The system performance is compared for various constituent decoders, including maximum a posteriori probability (MAP) and Max‐Log‐MAP algorithms, and the soft‐output Viterbi algorithm. The simulation results indicate that the Max‐Log‐MAP algorithm is the most promising among these three algorithms in overall terms of performance and complexity. It is also shown that, for fixed code rate, the BER performance is improved substantially by increasing the number of iterations in the turbo decoder, or by increasing the interleaver length in the turbo encoder. The results in this paper are of interest in CDMA‐based satellite communications applications. Copyright © 2005 John Wiley & Sons, Ltd.     

Degrevlex Gröbner bases of generic complete intersections

In this paper, we study the Hilbert–Samuel function of a generic standard graded K-algebra

K[X₁,…,X_n]/(g₁,…,g_m)

when refined by an (ℓ)-adic filtration, ℓ being a linear form. From this we obtain a structure theorem which describes the stairs of a generic complete intersection for the degree-reverse-lexicographic order. We show what this means for generic standard (or Gröbner) bases for this order; in particular, we consider an “orderly filling up” conjecture, and we propose a strategy for the standard basis algorithm which could be useful in generic-like cases.     

Constructing two-weight codes with prescribed groups of automorphisms

We construct new linear two-weight codes over the finite field with q elements. To do so we solve the equivalent problem of finding point sets in the projective geometry with certain intersection properties. These point sets are in bijection to solutions of a Diophantine linear system of equations. To reduce the size of the system of equations we restrict the search for solutions to solutions with special symmetries.Two-weight codes can be used to define strongly regular graphs. We give tables of the two-weight codes and the corresponding strongly regular graphs. In some cases we find new distance-optimal two-weight codes and also new strongly regular graphs.     

Shorts in self-checking circuits

It has been noted by several authors that the classical stuck-at logical fault model might not be an appropriate representation of certain real failures occurring in integrated circuits. Shorts are an important class of such faults. This article gives a detailed analysis of the effects of shorts in self-checking circuits and proposes techniques for dealing with them. More precisely, we show that, unlike other faults such as stuck-at, stuck-on, and stuck-open—which produce only single errors in the place they occur—shorts can produce double errors on the two shorted lines. In particular, feedback shorts can produce double errors on the two shorted lines. The double error is unidirectional for some feedback shorts and non-unidirectional for some others. Furthermore, in some technologies (e.g., CMOS), non-feedback shorts can also produce double non-unidirectional errors. We also show that unlike stuck-at, stuck-on, and stuck-open faults, redundant shorts can destroy the SFS property. Then we propose several techniques for coping with these problems and we illustrate the results by circuit implementation examples.The present study is given for NMOS and CMOS circuits but we show that it is valid for any other technology.     

关于循环阵列码

本文用代数观点来研究循环阵列码,证明了一般的阵列码是一些极小循环阵列码的直和,并且对极小循环阵列码给出了明确的刻画．当有限域的特征不整除群的阶时,给出了直接写出相应的多项式环的本原幂等元的方法,从而可以直接写出所有的极小循环码．     

Codes Over the p-adic Integers

We study codes over the p-adic integers and correct errors in the existing literature. We show that MDS codes exist over the p-adics for all lengths, ranks and p. We show that self-dual codes exist over the 2-adics if and only if the length is a multiple of 8 and that self-dual codes exist over the p-adics with p odd if and only if the length is 0 (mod 4) for p ≡ 3 (mod 4) and 0 (mod 2) for p ≡ 1 (mod 4).