|Digital Signal Processing||
Frequency and timing synchronization algorithm for OFDM systems for communication over multipath channels
Several approaches have been proposed for estimating the time and frequency offset either jointly or individually. Most frequency and timing estimation methods exploit the periodic nature of the time-domain signal by using a cyclic prefix (CP) , or by designing the training symbol (TS) having repeated parts [2-5]. In CP based method, cyclic prefix is used to correlate with the last part of data symbol, while in TS based method, training symbols is used for symbol synchronization in the receiver. In contrast with CP, it involves overhead for transmitting training symbols, but it does not suffer from the effect of the multipath channel . This paper covers the TS based method for estimating the time and frequency offset.
For correct timing and frequency estimation of OFDM symbol, different TS based methods have been proposed. The well-known frequency and time synchronization technique is proposed by Schmidl and Cox . It uses a training symbol containing two same halves to estimate the symbol timing and, then, computes the phase difference between the two halves to estimate the fractional frequency offset. However, due to the existence of the CP, the metric has a plateau which makes the time synchronization fallible. To eliminate the plateau, Minn  has proposed identical preambles in time domain with opposite signs and Park  designed a new repeated-conjugated-symmetric sequence which makes the metric has a sharp peak for synchronization. However, due to CP and the special structure of the sequence, the metric has side lobes which can disturb the synchronization.
But on the other hand, it has been observed that peak of the timing metric (Park, Minn) degrades at low SNR and sometimes it reaches below the threshold value. Hence to rectify this problem we propose a preamble scheme that has pseudo noise (PN) sequence of values 1 and -1, which performs better at low SNR. An PN based preamble design is proposed by Wang , where four repeated CAZAC sequence weighted by a PN sequence are used.
In this paper, we propose a improved algorithm based on repeated CAZAC sequence weighted by a PN sequence for synchronization.
Firstly, it uses the CAZAC sequence weighted by a PN sequence to obtain a new timing metric, which eliminates the side lobes . The good self-correlation quality of the CAZAC and PN sequence introduces a sharp peak in timing metric, more accurate for time synchronization. Secondly, the fractional frequency offset can be estimated by computing the phase difference between the two same halves of the sequence. The fast Fourier transform of CAZAC sequence is still a CAZAC sequence. Based on this quality, we can get the integer frequency offset by computing the offset of the CAZAC sequence in frequency domain.
Computer simulation results show that the proposed algorithm has a larger frequency estimation range and achieves superior performance to the existing methods in both AWGN and multipath fading channel.
2. Schmidl T.M., Cox D.C. Robust Frequency and Timing Synchronization for OFDM. IEEE Trans. Communications, vol.45, no.l2, pp. 1613-1621, 1997.
3. Hlaing Minn, Vijay K. Bhargava, Khaled Ben Letaief. A Robust Timing and Frequency Synchronization for OFDM Systems, IEEE Transactions on Wireless communications, vol. 2, no. 4, pp. 822-838, 2003.
4. B. Park and H. Cheon , C. G. Kang, and D. S. Hong. A Novel Timing Estimation Method for OFDM systems, IEEE Commun. Lett., vol. 7, pp. 239 – 241, May 2003
5. Classen, F. and Myer, H. Frequency synchronization algorithm for OFDM systems suitable for communication over frequency selective fading channels. IEEE VTC’94, pp. 1655–1659, 1994.
6. J. J. van de Beek, M. Sandell, and P.O. Bojesson, ML estimation of time and frequency offset in OFDM systems, IEEE Transactions on Signal Processing, vol. 45, no. 7, pp. 1800-1805, 1997.
7. S. D. Choi, J. M. Choi, J. H. Lee. An initial timing offset estimation method for OFDM systems in Êayleigh fading channel, IEEE 64th Vehicular Technology Conference, pp. 1–5, September 2006.
8. D.C. Chu. Polyphase codes with good periodic correlation properties, IEEE Trans. Inform. Theory, vol. IT-18, pp. 531–532, July 1972.
9. H. Wang, L. Zhu, Y. Shi, T. Xing, and Y. Wang. A novel synchronization algorithm for OFDM systems with weighted CAZAC sequence. J. Comput. Inf. Syst. 8(6), pp. 2275–2283, 2012.
10. IEEE 802.20 Mobile Broadband Wireless Access Working Group, “Channel Models for IEEE 802.20 MBWA System Simulations”, Version 9, Revision 1, July 2005.
Using of multithreshold decoding for error correction in wireless channels
Keywords: : communication systems, error-correction coding, self-orthogonal codes, multithreshold decoding, coding gain, communication channel, precoding, MIMO, OFDM.
The lower bounds for multithreshold decoders bit error probability in uncorrelated Rayleigh and Rician channels are presented. These bounds are useful for BPSK or QPSK modulation and hard-decision demodulator. The simulation results presented in the article show these bounds are tight enough in field of suboptimal MTD's performance. Additionally the MTD's performance over correlated Rayleigh and Rician channels are investigated. The recommendations for improving the performance of MTD about several dB in such channels are given.
Improving reliability of data transmission over fading channels with intersymbol interference is able with using of OFDM and MIMO technologies. Known results for MTD application in such conditions show the MTD provides the performance comparable with other error-correction methods. In the article precoding is used for additional performance improvement. The precoding are used is based on using of good space-time channels for data transmission. These channels are selected with using of the channel state information known perfectly to the transmitter. The simulation results show the MTD with precoding provides significant performance improvement in such channels in comparison with using MTD without precoding.
Analysis of presented results shows the MTD provided near optimal performance over gaussian channels is able to correct errors effectively in much worse channel conditions. The provided coding gain is many times more than coding gain over gaussian channel.
2. Zolotarjov V.V., Zubarev Ju.B., Ovechkin G.V. Mnogoporogovye dekodery i optimizacionnaja teorija kodirovanija (Multithreshold decoding and optimizing coding theory). M.: Gorjachaja linija–Telekom, 2012. 238 p.
3. Zolotarjov V.V., Ovechkin G.V. Povyshenie nadezhnosti peredachi i hranenija dannyh s ispol'zovaniem mnogoporogovyh metodov dekodirovanija pomehoustojchivyh kodov (Improving data transmission and storage relaibility with multithreshold decoders for error-correction codes) // Cifrovaja obrabotka signalov (Digital signal processing), 2012, no. 1, pp. 16–21.
4. Zolotarjov V.V., Nazirov R.R., Chulkov I.V., Ovechkin G.V. Algoritmy MPD (MTD algorithms) // Rossijskij kosmos. 2009. no. 1. pp. 60–63.
5. Viswanathan M. Simulation of Digital Communication Systems Using Matlab [eBook] – Second Edition, 2013.
6. Ovechkin G.V., Shevljakov D.A. Jeffektivnost' mnogoporogovyh metodov korrekcii oshibok v kanalah svjazi s zamiranijami (Performance of multithreshold error-correction methods over fading channels) // Uspehi sovremennoj radiojelektroniki, M.: Radiotehnika, 2014. no. 6, pp. 37–43.
7. Giosic S. Advanced wireless communications. 4G technologies // S. Giosic Wiley & Sons. 2004. 878 p.
8. Ovechkin G.V., Shevljakov D.A. Jeffektivnost' primenenija mnogoporogovyh dekoderov s prostranstvenno-vremennym kodirovaniem (Performance of using multithreshold decoders with space-time coding) // Matematicheskoe i programmnoe obespechenie vychislitel'nyh sistem: Mezhvuzovskij sboknik nauchnyh trudov. Ryazan, RSREU, 2013. pp. 115–121.
9. Zolotarjov V.V., Ovechkin G.V., Shevljakov D.A. Issledovanie jeffektivnosti mnogoporogovyh dekoderov pri sovmestnom ispol'zovanii s prostranstvenno-vremennym kodirovaniem (Research of multithreshold decoders performance with space-time coding) // Proceedings of 17-th International conf. «Cifrovaja obrabotka signalov i ee primenenie». M., 2015. pp. 83–87.
10. Scaglione A., Stoica P., Barbarossa S., Giannakis G.B., Sampath H. Optimal designs for space-time linear precoders and decoders // IEEE Trans. Signal Process., vol. 50, no. 5, pp. 1051–1064, May 2002.
11. 3GPP TR 25.996. Spatial channel model for Multiple Input Multiple Output (MIMO) Simulations.
One problem with application of MIMO channels for communication with maneuvering objects is large channel matrix variability in time when object is moving. Previously performed an analysis of channel matrix measurement errors influence on MIMO communication channel capacity. It is established that movement of object causes additional dynamic channel matrix estimation error. It is therefore important to determine the behavior of MIMO data transmission system channel coefficients in a variety of typical conditions.
The purpose is to analyze of MIMO communication system channel coefficients correlation with maneuvering objects indispensable to development of optimal algorithms for channel matrix estimating for different models of maneuvering object motion.
To evaluate the correlation function of MIMO communication system channel coefficients performed computer simulations. The model is based on a one–ring geometric model of signal scattering, as well as various motion models.
Calculated correlation functions of channel coefficients for different motion models of object. If the movement of object is deterministic, for example, describes a Dubins model or more simple polynomial models and phase of from elementary scatterers can be assumed to be constant at predetermined time interval, then behavior of channel coefficients is also deterministic. Sources of channel coefficients random perturbations are the initial phase of the elementary scatterers, which change their value at each experiment. This model is valid if movement of object for relevant time is very small, and angle of sight of elementary scatterers varies so little that does not lead to significant change of scattering coefficient.
It is shown that channel coefficients correlation function is maintained at 90% for a sufficient period of time for evaluation and extrapolation of channel matrix.
2. Parshin Yu.N., Kudryashov V.I. Analysis of Information Transmission Channel Capacity from Unmanned Aerial Vehicle with Incorrect Channel Matrix // Journal of Ryazan State Radio Engineering University. 2015. – ¹ 52. – pp. 19–24.
3. Dubins L.E. On curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents // American Journal of Mathematics. – 1957. – V. 79. – ¹. 3– pp. 497–516.
4. Eriksson–Bique, S.D., Kirkpatrick, D.G., Polishchuk, V. Discrete Dubins paths. CoRR, abs/1211.2365 (2012).
5. Kondratiev V.S. Multiposition radio systems / V.S. Kondratyev, A.F. Kotov, L.N. Markov. – M.: Radio and Communications, 1986. – 264 p.
6. Kuzmin S.Z. Digital radiolocation. Introduction to the theory / S.Z. Kuzmin. – Kiev. Izdatelstvo, 2000. – 428 p.
7. Cook, M. V. Flight dynamics principles. London, Arnold; New York, Wiley, 1997. – 379 p.
8. M. Patzold, B. O. Hogstad. A Space–Time Channel Simulator for MIMO Channels Based on the Geometrical One–Ring Scattering Model // Wireless Communications and Mobile Computing. Special Issue on Multiple–Input Multiple–Output (MIMO) Communications. – Nov. 2004. – V4. – ¹. 7. – pp. 727–737.
The paper presents comparative characteristics of the effectiveness of codes with low-density parity-check in the channel with white noise. Study includes codes from standards 802.11n and 802.16e, and the number of codes obtained by known synthesis algorithms (Mak, PEG). The results of comparing their characteristics are as follows:
2. D. MacKay and M. S. Postol, “Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check codes,” Electronic Notes Theoretical Computer Science, vol. 74, 2003.
3. T. J. Richardson, “Error floors of LDPC codes,” in Proc. 41th Allerton Conf. Commun., Computing Control, Oct. 2003.
4. C. Di, D. Proietti, E. Telatar, T. Richardson, and R. Urbanke, “Finitelength analysis of low-density parity-check codes on the binary erasure channel,” IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1570–1579, Jun. 2002.
5. B. Vasic, S. Chilappagari, D. Nguyen, and S. Planjery, “Trapping set ontology,” Proc. 47th Annual Allerton Conf. on Commun., Control and Computing, Monticello, IL, Sept. 2009, pp. 1-7.
6. Harary F., Manvel B. On the Number of Cycles in a Graph. Mat. Ñasopis, 1971, vol. 21, no. 1,pp. 55–63.
7. Halford T.R., Chugg K.M. An Algorithm for Counting Short Cycles in Bipartite Graphs. IEEE Transactionson Information Theory, 2006, vol. 52, no. 1, pp. 287–292.
8. A.N.Voropaev, Uchet obkhvata pri podschete korotkikh ciklov v dvudol’nyh grafakh, Informatcionnye process (Girth counting for bipartite undirected graph), Tom 11, ¹2, 2011, pp. 225-252.
9. D. MacKay, “Good error-correcting codes based on very sparse matrices,” IEEE Trans. Inform. Theory, vol. 45, pp. 399-431, Mar. 1999.
10. X.-Y. Hu, E. Eleftheriou, and D.-M. Arnold, “Progressive edge-growth Tanner graphs,” in Proc. IEEE GlobeCom, Nov. 2001, vol. 2, pp. 995-1001.
11. D. Declercq, M. Fossorier, E. Biglieri, Channel Coding. Theory, Algorithms, and Applications. Academic Press Library in Mobile and Wireless Communications, 2014.
12. ÃÎÑÒ Ð 54309-2011. «Audiovizual’naja sistema real’nogo vremeni (RAVIS). Processy formirovanija kadrovoy struktury, kanal’nogo kodirovanija i modulatcii dlja sistemy cifrovogo nazemnogo radioveschanija v OVCH diapazone. Tekhnicheskije uslovija» (Realtime AudioVisual Information System (RAVIS). Framing structure, channel coding and modulation for digital terrestrial narrowband broadcasting system for VHF band. Technical specification)
Multirate digital signal processing was developing rapidly. Filter banks based signals analysis/synthesis systems started to be used in speech, sound and image coding.
As a new stage of evolution DBF banks are used in broadband data transmission multicarrier systems. This can be considered as an alternative to OFDM technology.
Broadband data transmission multicarrier system are exposed to fading, Doppler bias and frequency extension. A lot of attention is paid to searches for ways of spectral efficiency loss compensation in multicarrier systems. The use of DBF banks can be one of possible solutions for the problem.
Next approach is proposed in the article. The whole frequency range of the broadband channel is divided into separate sub-ranges. OFDM signal is formed inside every frequency sub-range. These signals are then composed into one group signal.
Advantages and disadvantages of the approach are discussed.
An alternative approach filter banks construction can be based on comb filters.
FBMC (filter banks multicarrier) technology and broadband data transmission multicarrier systems implementation provide the best solution in terms of spectral and energy efficiency.
2. Shoyermann H., Gekler H. Sistematizirovannyy obzor tsifrovyh metodov preobrazovaniya vida uplotneniya kanalov (Systematic review digital methods channel seal transform) // TIIEHR. 1981. T. 69. ¹ 11. S. 52—84
3. Crochiere R.E., Rabiner L. Multirate Digital Signal Processing. Prentice Hall. Englewood Cliffs.- NJ, 1983.
4. Vityazev V.V. TSifrovaya chastotnaya selektsiya signalov. (Digital frequency selection signals) // M.: Radio i svyaz', 1993. 240 s.
5. Vaidyanathan P.P. Multirate Systems and Filter Banks. Prentice Hall. Englewood Cliffs.- NJ, 1993.
6. Mitra S.K. Digital Signal Processing: a computer-based approach. McGraw-Hill. Comp. Inc., 1998.
7. Farhang-Boroujeny B. Signal Processing Techniques for Software Radios// Lulu publishing house, 2010.
8. Behrouz Farhang-Boroujeny. OFDM Versus Filter Bank Multicarrier // IEEE Signal Processing Magazine, -2011, -Vol. 28, ¹ 3, -P. 92-112.
9. Lin L. and Farhang-Boroujeny B. Cosine modulated multitone modulation for very high-speed digital subscriber lines // EURASIP J. Appl. Signal Processing, -2006, Aprticle ID 19329.
10. Ovinnikov A.A. Metody analiza/sinteza signalov v sistemah besprovodnoy svyazi so mnogimi nesushchimi (Signals analysis/synthesis methods of wireless multicarrier systems) // Elektrosvyaz'. 2013. ¹ 9 . – s. 28-32.
11. Volchkov V.P. Novye tekhnologii peredachi i obrabotki informatsii na osnove horosho lokalizovannyh signal'nyh bazisov (New transmit technology and processing information based on signaling bases) // Nauchnye vedomosti. 2009. ¹ 15. - s. 181-189.
12. Vityazev V.V., Goryushkin R.S. Analiz shumov kvantovaniya mnogoskorostnyh struktur uzkopolosnyh KIH-fil'trov (Analysis of qouantization noises in multirate structures of narrowband FIR-filters) // TSifrovaya obrabotka signalov. 2015. ¹ 4.- s. 35-39.
13. Vityazev V.V., Nikishkin P.B. // Metod analiza/sinteza signalov v sistemah peredachi dannyh s chastotnym uplotneniem kanalov (Method of analyzing/synthesizing signals in data transmission systems with frequency division multiplexing) // EHlektrosvyaz'. 2014. ¹ 12. – s. 4-9.
In order to confirm theoretical conclusions we modeled a noise model for single- and twostage structures of a narrowband FIR-filter.
In accordance with the conducted theoretical and experimental researches on decimation noises influence on multirate structures of narrowband FIR-filters decimation noises dispersion increases proportionally to the decimation coefficient and depends on the magnitude–frequency characteristics sidelobes level in the stopband and the narrowband coefficient. An increase in the transformation stages quantity in the narrowband system allows to decrease the decimation coefficient of the first-stage decimation filter and dispersion component of decimation noises outlet multistage realization. Considering that dispersion of decimation noises components outlet the system of all later stages is lower than at the first stage, we can make a general conclusion that decimation noises influence may be decreased by an increase in the transformation stages quantity.
2. Zubarev U.B., Vityazev V.V., Dvorkovich V.P. Cifrovaya obrabotka signalov - informatika real'nogo vremeni (Digital signal processing - real-time informatics) // Cifrovaya obrabotka signalov. 1999. ¹1. pp 5-17.
3. Crochiere R.E., Rabiner L. Multirate Digital Signal Processing. Prentice Hall. Engelwood Cliffs. - NJ, 1983.
4. Vityazev V.V. Cifrovaya chastotnaya selekciya signalov(Digital frequency selection signals). M.: Radio i svyaz'. 1993. 240 p.
5. Vadyanathan P.P. Multirate System and Filter Banks. Prentice Hall. Engelwood Cliffs. - NJ, 1983.
6. Mitra S.K. Digital Signal Processing: a computer-based approach. McGraw-Hill. Comp. Inc., 1998.
7. Afficher E.S., Dzhervis B.U. Cifrovaya obrabotka signalov: prakticheskij kurs (Digital Signal Processing: A Practical Approach ). per. s angl. M.: Izd. dom "Vil'yams", 2004. 992p.
8. Vityazev V.V. Mnogoskorostnaya adaptivnaya obrabotka signalov(Multirate adaptive signal processing). // Radiotekhnika. 2012. ¹3. pp. 17-29.
9. Vityazev V.V. Mnogoskorostnaya adaptivnaya obrabotka signalov v sistemah telekommunikacij(Multirate adaptive signal processing in telecommunication systems). // Elektrosvyaz'. 2013. ¹ 11. pp. 49-56.
10. Vityazev V.V., Demashov V.S., Stepashkin A.I. Shum kvantovaniya cifrovogo fil'tra s prorezhivaniem i interpolyaciej otschyotov vyhodnogo signala(Digital filter quantization noise decimation and interpolation of output signal) // Izvestiya vuzov - Priborostroenie. 1979. ¹5.p. 3-7.
11. Fred Mintzer, Bede Liu. Aliasing Error in Design of MultirateFilters // IEEE Trans. on Acoustic, Speech, and Signal Processing, vol. ASSP-26, ¹1, February – 1978, pp. 43-88.
At first, the applications of active noise control which require the high-performance multi-channel adaptive filters are revealed.
Then, the author compares the possible architectures of multi-channel adaptive FXLMS filter. These architectures can be based on one of two main approaches: pipelining the filter’s taps or creating the array of independent processing blocks. Within the scope of the first approach, the author analyses such filter architectures as systolic, transposed, and «adder tree». In spite of high performance potentially provided, pipelined filter architecture was recognized as unsuitable for FPGA implementation of multi-channel FXLMS filter. It is because of restricted quantity of sources inside of the FPGA DSP slices in which the filter’s taps would be realized.
Under the second approach, there are some possibilities to realize the processing blocks’ array and interaction between them. In the paper, KxJ (where K is the quantity of loudspeakers, J is the number of reference microphones) array of processing blocks is considered.
Each kj-th processing block consists of two DSP slices working in parallel, as well as two memory blocks containing the filters’ coefficients and partial results of calculations. During the sample interval, one of the DSP slices filters the reference signal; the other one recalculates the coefficients of kj-th adaptive filter.
For the proposed filter’s architecture, some details of its implementation are considered. The memory volume and DSP slices quantity requirements are substantiated. For a single processing block, the dependency of its performance on the sizes of memory blocks is analyzed.
2. Kuo S.M., Morgan D.R. Active noise control systems: algorithms and DSP implementations. John Wiley & Sons, Inc., 1995.
3. Snyder S.D. Active noise control primer. Springer, 2000.
4. Elliott S. Signal processing for active control. Academic Press, 2000.
5. B. Widrow, S. D. Stearns. Adaptive signal processing. Prentice-Hall, 1985.
6. Morgan, D.R., and D.A. Quinlan. "Local silencing of room acoustic noise using broadband active noise control." Applications of Signal Processing to Audio and Acoustics, 1993. Final Program and Paper Summaries., 1993 IEEE Workshop on. IEEE, 1993.
7. Roure, A. "Self-adaptive broadband active sound control system." Journal of Sound and Vibration 101.3 (1985): 429-441.
8. http://www.ti.com/lsds/ti/processors/dsp/overview.page (27.08.2015)
10. Hawkes, G.C. "DSP: Designing for Optimal Results. High-Performance DSP Using Virtex-4 FPGAs." (2005).
11. Mayer-Baese U. Digital Signal Processing with field programmable Gate Arrays. Springer, 2007.
Generally, calculating cluster is collection of calculating units, connected by some communication network. Each computing unit has the random access memory and works under control of the operating system. The most widespread is uniform clusters use where all units are absolutely identical on the architecture and productivity. Feature of a cluster is component application of serial production.
For problems of digital signal processing use as units of a cluster of specialized high-performance processors is represented perspective. As a rule, DSP processors have the built-in memory, and communications between processors in a cluster are provided with the built-in means of processors.
Development of a multiprocessor cluster on the basis of DSP processors is a private problem of the integrated DSP module design with possibility of productivity scaling.
The chosen option of the integrated module configuration in the form of basic (the bearing board) with the submodules (attics) installed on it assumes installation from one to five multiprocessor clusters that provides change of productivity over a wide range.
The submodule represents functionally and structurally finished four-processor cluster. Besides, the submodule has special signal distribution of high-speed LINK-ports on sockets for the purpose of trace simplification of a basic board.
The developed multiprocessor clusters are intended for use into integrated module in stationary and mobile systems of high-performance digital signal processing.
2. Myakochin Yu.Î. 32-bit super-scalar DSP processor with floating point // Components and technologies. 2013. ¹7.
3. ADSP-TS20x TigerSHARC® Processor Boot Loader Kernels Operation (EE-200). Revision 1.0, March 2004. Analog Devices, Inc.
4. Kuzin A.A., Pluzhnikov A.D., Pribludova E.N., Sidorov S.B. Analysis of time relation for signals in design digital modules and availability estimation // Digital signal processing, ¹ 2, 2014, pp. 70-77.
If you have any question please write: firstname.lastname@example.org