• Title/Summary/Keyword: OFCDM

Search Result 6, Processing Time 0.017 seconds

Performance analysis on the nonlinear distortion in OFCDM downlink system using clipped multilevel-PSK (Clipped multilevel-PSK를 이용한 OFCDM 순방향 링크에서 비선형 왜곡에 대한 성능 분석)

  • 안치훈;최영관;장승훈;김동구
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.40 no.11
    • /
    • pp.17-26
    • /
    • 2003
  • To reduce the nonlinear distortion of high power amplifier(HPA) in down link OFCDM system to employ time domain spreading, we apply technology which transmits MPSK(Multilevel-PSK) signal after clipping on multilevel input signal of IFFT subcarrier. In case that the nonlinear distortion of HPA is considered in AWGN channel, performacne of clipping OFCDM system using extended m sequence is over 2.2㏈ better than that of OFCDM system using extended m sequence when the number of user is 8 and 16. In case that the nonlinear distortion of HPA is considered in quasi-static channel, performacne of clipping OFCDM system using extended m code is over 2㏈ better than that of OFCDM system using extended m sequence when the number of user is 8 and 16.

A Study on Clustered OFCDM with Transmit Antenna Diversity and Coding Associated with Frequency Spreading over Frequency Selective Fading Channel (주파수 선택적 페이딩 채널에서 주파수 확산과 결합된 코딩과 송신안테나 다이버시티를 가진 Clustered OFCDM 시스템에 관한 연구)

  • Ryu Kwan-Woong;Park Yong-Wan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.3A
    • /
    • pp.267-273
    • /
    • 2006
  • This paper improves the effects of clustered OFCDM scheme considering the frequency diversity effect over a frequency selective fading channel. In OFCDM with frequency domain spreading compared to OFDM, we can increase uncorrelated symbols by frequency allocation method of correspondent symbols over the same antenna and different antenna after spreading. The simulation results show that the performance of proposed system is improved by approximately 4 dB in ${\sigma}=0.02{\mu}sec$, the performance is improved by approximately 2.5dB in large delay spread in a 12-path Rayleigh fading channel with overall the root mean squared delay spread and the maximum Doppler frequency of 20 Hz. Also, the required average received Eb/No at the average BER of $10^{-3}$ by optimum method is improved by approximately 2.0 dB, compared to that of STA-OFCDM with frequency rearrange. The new method does not require any bandwidth expansion any feedback from the receiver to the transmitter and its computation complexity is similar to clustered OFCDM.

A Cell Search with Reduced Complexity in a Mobile Station of OFCDM Systems (OFCDM 시스템의 이동국에서의 복잡도 감소 셀 탐색)

  • Kim, Dae-Yong;Park, Yong-Wan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.1
    • /
    • pp.139-149
    • /
    • 2007
  • Asynchronous OFCDM(Orthogonal Frequency and Code Division Multiplexing) systems must have a cell search process necessarily unlike synch개nous systems. this process is hewn initial synchronization and a three-step cell search algorithm is performed for the initial synchronization in the following three steps: OFCDM symbol timing, i.e., Fast Fourier Transform(FFT) window timing is estimated employing guard interval (GI) correlation in the first step, then the frame timing and CSSC(Cell Specific Scrambling Code) group is detected by taking the correlation of the CPICH(Common Pilot Channel) based on the property yielded by shifting the CSSC phase in the frequency domain. Finally, the CSSC phase within the group is identified in the third step. This paper proposes a modification group code with two or three block of the conventional CPICH based cell search algorithm in the second step which offers MS(Mobile Station) complexity reductions. however, the effect of the reduction complexity leads to degradation of the performance therefore, look for combination to have the most minimum degradation. the proposed block type group code with suitable combinations is the nearly sane performance as conventional group code and has a complexity reduction that is to be compared and verified through the computer simulation.

A Suitable Cell Search Algorithm Using Separated I/Q Channel Cell Specific Scrambling Codes for Systems with Coexisting Cellular and Hot-Spot Cells in Broadband OFCDM Systems (광대역 OFCDM 시스템에서 셀룰러와 핫-스팟 셀들이 공존할 때 분리 I/Q채널 CSSC를 이용한 셀 탐색 알고리즘)

  • Kim Dae-Yong;Kwon Hyeog-Soong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.8
    • /
    • pp.1649-1655
    • /
    • 2005
  • For systems with coexisting cellular and hot-spot cells in broadband orhogonal frequency and code division multiplexing (OFCDM) systems, a suitable cell search algorithm is proposed fur the common pilot channel (CPICH) in the forward link using separated I/Q channel cell specific codes(CSSC), in which the cellular cell specific scrambling code (CCSSC) is assigned to the in-phase (Q) pilot channel of all cellular cells, and the exclusive hot-spot cell specific scrambling code (HSCSSC) group is assigned to the quadrature (Q) pilot channel of all hot-spot cells. Therefore, the proposed algorithm enables a mobile station (MS) to search quickly for the most desirable hot-spot cell due to reducing the effect of CCSSC, when a MS wants to use a mobile internet. The computer simulation results show that the proposed cell search algorithm can achieve faster cell search time performance, compared to conventional cell search methods.

A Study on a Cell search Using PCSSCG in Broadband OFCDM Systems (OFCDM시스템에서 PCSSCG를 이용한 셀 탐색에 관한 연구)

  • Kim Dae-Yong;Choi Kwon-Hue;Park Yong-Wan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.6 s.348
    • /
    • pp.1-8
    • /
    • 2006
  • In the asynchrous OFCDM(Orthogonal Frequency and Code Division Multiplexing) system, a three-step cell search algorithm is performed for the initial synchronization in the following three steps: OFCDM symbol timing, i.e., Fast Fourier Transform(FFT) window timing is estimated employing guard interval (GI) correlation in the first step, then the frame timing and CSSC (Cell Specific Scrambling Code) group is detected by taking the correlation of the CPICH(Common Pilot Channel) based on the property yeilded by shifting the CSSC phase in the frequency domain. Finally, the CSSC phase within the group is identified in the third step. This paper proposes a modification code(PCSSCG:Patial Cell Specific Scrambling Code Group) of the conventional CPICH based cell search algorithm in the second step which offers MS(Mobile Station) complexity reductions with the nearly same performance. The proposed method is to be compared and verified through the computer simulation.

Independent Turbo Coding and Common Interleaving Method among Transmitter Branches Achieving Peak Throughput of 1 Gbps in OFCDM MIMO Multiplexing

  • Kawamoto, Junichiro;Asai, Takahiro;Higuchi, Kenichi;Sawahashi, Mamoru
    • ETRI Journal
    • /
    • v.26 no.5
    • /
    • pp.375-383
    • /
    • 2004
  • This paper proposes a common interleaving method associated with independent channel-encoding among transmitter antenna branches in orthogonal frequency and code division multiplexing based on multiple-input multiple-output (MIMO) multiplexing to achieve an extremely high throughput such as 1 Gbps using a 100 MHz bandwidth. This paper also investigates the average packet error rate performance as a function of the average received signal energy per bit-to-background noise power spectrum density ratio $(E_b/N_0)$. We found that the loss in the required average received $E_b/N_0$ of the proposed method is only within approximately 0.3 dB in up to a 12-path Rayleigh fading channel, using 16QAM and Turbo coding with a coding rate of 5/6. We also clarify that even for a large fading correlation among antenna branches, 1 Gbps is still possible by increasing the transmission power. Therefore, the proposed method reduces the processing rate to 1/4 in the turbo decoder with only a slight loss in the required average received $E_b/N_0$.

  • PDF