• Title/Summary/Keyword: symbol mapping

Search Result 55, Processing Time 0.022 seconds

A Comparisons of TCM Schemes with OFDM in Mobile Communication Channel (이동통신 채널에서 OFDM을 적용한 TCM방식 비교분석)

  • 박성호;조범준
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2003.05b
    • /
    • pp.49-52
    • /
    • 2003
  • OFDM(Orthogonal Frequency Division Multiplexing) scheme can compensate for distortions caused by multipath delay spread and reduce the burst errors caused by the Doppler effect since OFDM signals have long symbol durations. However, OFDM is required to be improved for high speed data transmission and large capacity. Therefore, coding schemes should be combined with OFDM. In this paper, it was studied that the performance of OFDM transmission scheme was improved in mobile communication channel by applying TCM, which has advantages of error correction and bandwidth efficiency. Simulation was carried out for two TCM models with different code efficient length. By mapping two models to square 16QAM, the model with the code efficient length of 2 achieved 3dB better than the other for the BER of 10/sub -3/. In conclusion, if we want to achieve a better performance with TCNA in OFDM applications, we should select a TCM with larger code efficient length.

  • PDF

On ϑ-quasi-Geraghty Contractive Mappings and Application to Perturbed Volterra and Hypergeometric Operators

  • Olalekan Taofeek Wahab
    • Kyungpook Mathematical Journal
    • /
    • v.63 no.1
    • /
    • pp.45-60
    • /
    • 2023
  • In this paper we suggest an enhanced Geraghty-type contractive mapping for examining the existence properties of classical nonlinear operators with or without prior degenerates. The nonlinear operators are proved to exist with the imposition of the Geraghty-type condition in a non-empty closed subset of complete metric spaces. To showcase some efficacies of the Geraghty-type condition, convergent rate and stability are deduced. The results are used to study some asymptotic properties of perturbed integral and hypergeometric operators. The results also extend and generalize some existing Geraghty-type conditions.

Performance Analysis for Weaker Channel User in Non-Uniform Source SSC NOMA with Novel BTS

  • Chung, Kyuhyuk
    • International journal of advanced smart convergence
    • /
    • v.11 no.1
    • /
    • pp.36-41
    • /
    • 2022
  • Recently, to improve the performance of the strongest channel gain user in non-orthogonal multiple access (NOMA) with a non-uniform source and symmetric superposition coding (SSC), a novel bit-to-symbol (BTS) mapping have been proposed. However, only the performance of the user with the stronger channel gain was analyzed. Thus, we compare the bit-error rate (BER) of the new BTS scheme with that of uniform sources, especially for the user with weakest channel gain. First, we show that the performance of the novel BTS scheme for the user with weakest channel gain also improves, compared to that of the uniform sources. Furthermore, the signal-to-noise (SNR) gain of the new BTS scheme over the uniform sourcesis calculated. As a consequence, the novel BTS scheme would improve the performance of the user with weakest channel gain as well as that with the stronger channel gain for SSC NOMA with a non-uniform source.

The Entropy of Recursively-Indexed Geometric Distribution

  • Sangsin Na;Kim, Young-Kil;Lee, Haing-Sei
    • Journal of Electrical Engineering and information Science
    • /
    • v.1 no.1
    • /
    • pp.91-97
    • /
    • 1996
  • This paper proves by straightforward computation an interesting property of a recursive indexing: it preserves the entropy of a geometrically-distributes stationary memoryless source. This result is a pleasant surprise because the recursive indexing though one-to-one, is a symbol-to-string mapping and the entropy is measured in terms of the source symbols. This preservation of the entropy implies that the minimum average number of bits needed to represent a geometric memoryless source by the recursive indexing followed by a good binary encoder of a finite imput alphabet remains the same as that by a good encoder of an infinite input alphabet. Therefore, the recursive indexing theoretically keeps coding optimality intact. For this reason recursive indexing can provide an interface for a binary code with a finite code book that performs reasonably well for a source with an infinite alphabet.

  • PDF

Pilot Assignment Method for the PAPR Reduction and Effective Channel Estimation in the SC-FDMA Communication System (PAPR 감소와 효과적 채널 추정을 위한 SC-FDMA 통신 시스템의 파이럿 배치 방법)

  • An, Dong-Geon;Ryu, Heung-Gyoon
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.21 no.1
    • /
    • pp.1-7
    • /
    • 2010
  • PAPR of the pilot symbols can be reduced down by the CAZAC sequence in the SC-FDMA communication system. However, it is very complicated and takes quite a long time to compute the interpolation between the OFDM information symbols for the channel estimation because the pilot data are trasmitted in the block type. Furthermore, situation will be much more serious in the severe fading channel. Actually the pilot insertion of the comb type is much efficient and convenient for the channel estimation since the calculation of the interpolation can be made in the frequency domain symbol by symbol. But, the PAPR will be regrown when the pilot data are inserted with the information data in the comb type. So, in this paper, we like to study the PAPR reduction and comb type pilot assignment for the efficient channel estimation. Unlike the conventional SLM(selected mapping) method requiring the side information, our improved SLM method is to use the phase rotation sequence into information data without rotating phase of pilot. We use different pilot data according to the different phase rotation sequence. From the simulation result, it can be confirmed that when SLM method of 4 phase rotation sequence is used, PAPR is almost same to the block type method without pilot.

DFT-spread OFDM Communication System for the Power Efficiency and Nonlinear Distortion in Underwater Communication (수중통신에서 비선형 왜곡과 전력효율을 위한 DFT-spread OFDM 통신 시스템)

  • Lee, Woo-Min;Ryn, Heung-Gyoon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.8A
    • /
    • pp.777-784
    • /
    • 2010
  • Recently, the necessity of underwater communication and demand for transmitting and receiving various data such as voice or high resolution image data are increasing as well. The performance of underwater acoustic communication system is influenced by characteristics of the underwater communication channels. Especially, ISI(inter symbol interference) occurs because of delay spread according to multi-path and communication performance is degraded. In this paper, we study the OFDM technique to overcome the delay spread in underwater channel and by using CP, we compensate for delay spread. But PAPR which OFDM system has problem is very high. Therefore, we use DFT-spread OFDM method to avoid nonlinear distortion by high PAPR and to improve efficiency of amplifier. DFT-spread OFDM technique obtains high PAPR reduction effect because of each parallel data loads to all subcarrier by DFT spread processing before IFFT. In this paper, we show performance about delay spread through OFDM system and verify method that DFT spread OFDM is more suitable than OFDM for underwater communication. And we analyze performance according to two subcarrier mapping methods(Interleaved, Localized). Through the simulation results, performance of DFT spread OFDM is better about 5~6dB at $10^{-4}$ than OFDM. When compared to BER according to subcarrier mapping, Interleaved method is better about 3.5dB at $10^{-4}$ than Localized method.

A deisgn of VHDL compiler front-end for the VHDL-to-C mapping (VHDL-to-C 사상을 위한 VHDL 컴파일러 전반부의 설계)

  • 공진흥;고형일
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.12
    • /
    • pp.2834-2851
    • /
    • 1997
  • In this paper, a design and implementation of VHDL compiler front-end, aims at supporting the full-set of VHDL '87 & '93 LRM and carring out the preprocessing of VHDL-to-C, is described. The VHDL compiler front-end includes 1)the symbol tree of analyzed data to represent the hierarchy, the scope and visibility, the overloading and homograph, the concurrent multiple stacks in VHDL, 2)the data structure and supportig routies to deal with the objects, the type and subtype, the attribute and operation in VHDL, 3)the analysis of the concurrent/sequential statements, the behavior/structural descriptions, of semantic token and the propagation of symbol & type to improve the registration and retrieval procedure of analyzed data. In the experiments with Validation Suite, the VHDL compiler front-end could support the full-set specification of VHDL LRM '87 & '93; and in the experiments to asses the performance of symantic token for the VHDL hierachy/visibility/concurrency/semantic checking, the improvement of about 20-30% could be achieved.

  • PDF

Design and Implementation of a Mapping Middleware for Wireless Internet Map Service (무선인터넷 지도서비스를 위한 매핑 미들웨어의 설계와 구현)

  • 이양원;박기호
    • Spatial Information Research
    • /
    • v.12 no.2
    • /
    • pp.165-179
    • /
    • 2004
  • With the spread of wireless internet, the interest in mobile applications and services is increasing. Korea Wireless Internet Standardization Forum has been establishing the standards for mobile platform and map service in the wireless internet environment. This study aims to present a paragon of mapping middleware that plays the role of broker for wireless internet map service: in particular, it focuses on the interoperability with generic map servers. In this study, we developed a method for applying current map servers to the wireless internet map service, and analyzed the request/response structure of the map servers which have different operation characteristics in order to allow our middleware to fully utilize the functionalities of the map servers. The middleware we developed is composed of .NET-based XML Web Services: it has a lightweight module for image map and a map representation module for choropleth map, symbol map, chart map, etc. This mapping middleware is a broker between mobile client and generic map server, and supports .NET clients and Java clients as well. Its component-based interoperability grants the extensibility for the wireless internet dedicated map servers of the future in addition to the current generic map servers.

  • PDF

A Study on the Depiction of ENC Features to Apply S-52 Standards Under the 3D Visualization Environment (3차원 가시화 환경에서 S-52 표준을 적용하기 위한 전자해도 객체의 표현방법에 관한 연구)

  • Lee, Hee-Yong
    • Journal of Navigation and Port Research
    • /
    • v.40 no.6
    • /
    • pp.369-374
    • /
    • 2016
  • Recently, due to the rapid development of smart computing technology, there have been a lot of studies on 3D navigation, and consequently the advanced commercial 3D navigation system and 3D VTS system are on the market. Even the 3D technology is well known and wide spreaded, unfortunately, the secret of code behind is still unleashed. The purpose of this paper is to show the basic methodologies to display ENC features under 3D display environment to meet the requirement of S-52 standards. The OpenGL ES is used to develop 3D ENC Viewer for further use on mobile platforms and web based vessel monitoring system. P articularly, area object triangulation, complex line drawing, polygon pattern filling and symbol drawing by texture mapping are explained in detail. The result of performance test is shown as table for correlation of SENC file size to display speed.

A study on the connected-digit recognition using MLP-VQ and Weighted DHMM (MLP-VQ와 가중 DHMM을 이용한 연결 숫자음 인식에 관한 연구)

  • Chung, Kwang-Woo;Hong, Kwang-Seok
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.8
    • /
    • pp.96-105
    • /
    • 1998
  • The aim of this paper is to propose the method of WDHMM(Weighted DHMM), using the MLP-VQ for the improvement of speaker-independent connect-digit recognition system. MLP neural-network output distribution shows a probability distribution that presents the degree of similarity between each pattern by the non-linear mapping among the input patterns and learning patterns. MLP-VQ is proposed in this paper. It generates codewords by using the output node index which can reach the highest level within MLP neural-network output distribution. Different from the old VQ, the true characteristics of this new MLP-VQ lie in that the degree of similarity between present input patterns and each learned class pattern could be reflected for the recognition model. WDHMM is also proposed. It can use the MLP neural-network output distribution as the way of weighing the symbol generation probability of DHMMs. This newly-suggested method could shorten the time of HMM parameter estimation and recognition. The reason is that it is not necessary to regard symbol generation probability as multi-dimensional normal distribution, as opposed to the old SCHMM. This could also improve the recognition ability by 14.7% higher than DHMM, owing to the increase of small caculation amount. Because it can reflect phone class relations to the recognition model. The result of my research shows that speaker-independent connected-digit recognition, using MLP-VQ and WDHMM, is 84.22%.

  • PDF