• Journal of Advanced Navigation Technology
• /
• v.6 no.2
• /
• pp.130-137
• /
• 2002

We present Space-Time Trellis Coded Code Division Multiple Access systems, which maintain the full diversity and coding gain of Space-Time Trellis Codes(STTC) and have the immunity to performance degradation caused by multipath fading. These STTC CDMA systems are constructed by adding the spreading and despreading processes of PN codes to STTC systems. In multipath fading channels, delay spreaded signals are detected and combined, then decoded. According to the combining and decoding methods, there are four decoding methods. There are optimum ML decoding without combining, adding multipath signals in each receive antenna before decoding, combining multi path signals in each antenna before decoding, and combining all received signals before decoding. Performance of these methods is proportional to complexity. Besides, all methods are shown to compensate the irreducible error rate which appears in multipath fading channels.

• Journal of Navigation and Port Research
• /
• v.36 no.10
• /
• pp.845-849
• /
• 2012

The next-generation wireless communication requires fast transmission speeds with various services and high reliability. In order to satisfy these needs we study MIMO system used layered space time coded system (LST) combining space time trellis codes (STTC) with turbo codes. In LST, two codes that are inner and outer codes are concatenated in the serial fashion. The inner codes are turbo Pi codes suggested in DVB-RCS NG system, and outer codes are STTC codes proposed by Blum. The interleaver technique is used to efficiently combine two codes. And we proposed and simulated that a full iteration method between turbo decoder and BCJR decoder to improve the performance instead of only processing inner-iteration turbo decoder. The simulation results of proposed effective layered method show improving BER performance about 1.3~1.5dB than conventional one.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.4C
• /
• pp.191-199
• /
• 2005

Space-time turbo codes have been studied extensively as a powerful and bandwidth efficient error correction code over the wireless communication environment. In this paper, the efficient algorithm for decoding space-time turbo codes is proposed. The proposed method reduces the computational complexity by approximating a prior information for a iterative decoder. The performance of space-time turbo codes is also analyzed by using the fixed point implementation and the efficient method for approximating the Log-MAP algorithm is proposed. It is shown that the BER performance of the proposed method is close to that of the Log-MAP algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.12C
• /
• pp.1222-1230
• /
• 2005

We aim at increasing the throughput of the hybrid automatic retransmission request (HARQ) protocol in Space-Time (ST) coded multi-antenna transmission systems. By utilizing reliability information at the decoder, we obtain an improved probability of successful decoding, which enhances the overall system throughput at low-complexity. Simulations and analytical results demonstrate the performance of our scheme in impulse noise environment as well as AWGN and fading multi-input multi-ouput (MIMO) channels.

• ETRI Journal
• /
• v.45 no.1
• /
• pp.7-17
• /
• 2023

The error-rate floor of low-density parity-check (LDPC) codes is attributed to the trapping sets of their Tanner graphs. Among them, fully absorbing sets dominantly affect the error-rate performance, especially for short blocklengths. Efficient methods to identify the dominant trapping sets of LDPC codes were thoroughly researched as exhaustively searching them is NP-hard. However, the existing methods are ineffective for Raptor-like LDPC codes, which have many types of trapping sets. An effective method to identify dominant fully absorbing sets of Raptor-like LDPC codes is proposed. The search space of the proposed algorithm is optimized into the Tanner subgraphs of the codes to afford time-efficiency and search-effectiveness. For 5G New Radio (NR) base graph (BG) 2 LDPC codes for short blocklengths, the proposed algorithm finds more dominant fully absorbing sets within one seventh of the computation time of the existing search algorithm, and its search-effectiveness is verified using importance sampling. The proposed method is also applied to 5G NR BG1 LDPC code and Advanced Television Systems Committee 3.0 type A LDPC code for large blocklengths.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.511-513
• /
• 2004

IMT-2000 시스템에서 직교 STBC (Space-Time Block Code)와 같은 송신 다이버시티(diversity) 기법은 순방향 링크용량을 향상시킬 수 있다. 그러나 완벽한 다이버시티 (full diversity) 이득과 코드율 1 (full code rate)을 갖는 직교 STBC는 송신안테나 개수가 2개일 경우만 존재한다. 이 논문에서는 4개의 송신안테나와 1개의 수신안테나를 갖는 시스템에서 코드율 1 을 갖는 준직교 STBC를 사용할 경우 안테나 선택적 feedback 정보를 이용하여 완벽한 다이버시티 이득을 얻는 동시에 feedback 정보량은 줄일 수 있음을 보여 준다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2011.07a
• /
• pp.314-315
• /
• 2011

MIMO(multi-input multi-output) 시스템은 여러 개의 송 수신기를 이용하여 정보를 전송하여 주파수 대역폭의 확장 없이 채널 용량을 증가시킨다. 그러나 공간 다이버시티를 증가시키는 STBC(space time block code)를 제외한 공간 다중화 방식을 사용하는 LDC(linear dispersion code) 시스템은 변조 레벨이 증가할수록 수신기의 복잡도가 기하급수적으로 높아진다. 본 논문에서는 하이브리드 LDC-MIMO 시스템을 적용하여 낮은 변조 레벨에서도 전송량을 증가시키면서 수신기의 복잡도를 감소시킬 수 있는 시스템을 제안한다. 제안된 알고리듬은 컴퓨터 시뮬레이션을 통하여 검증하였다.

• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.117-120
• /
• 2001

In this paper, we propose a robust trellis coded modulation for a correlated Rayleigh fading channel. This method use only one transmit antenna, which can achieve superior performance compared to Space-Time Trellis Coded Modulation (STTC) over a wide channel correlation range among transmit antennas. The code is designed to have the largest Euclidean distance between faded signals at the receiver. Computer simulations are performed to evaluate the frame error rate (FER) performance and to compare the proposed code with the conventional one.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.9
• /
• pp.16-23
• /
• 2009

In this paper, we propose a new distributed Alamouti space-time block coding scheme using cooperative relay system composed of one source node, three relay nodes and one destination node. The source node is assumed to be equipped with two antennas which respectively use a 2-beam array to communicate with two nodes selected from the three relay nodes. During the first time slot, the two signals which respectively were transmitted by one antenna at the source, are selected by one relay node, added, amplified, and forwarded to the destination. During the second time slot, the other two relay nodes implement the conjugate and minusconjugate operations to the two received signals, respectively, each in turn is amplified and forwarded to the destination node. This transmission scheme represents a new distributed Alamouti space-time block code that can be constructed at the relay-destination channel. Through an equivalent matrix expression of symbols, we analyze the performance of this proposed space-time block code in terms of the chernoff upper bound pairwise error probability (PEP). In addition, we evaluate the effect of the coefficient $\alpha$ ($0{\leq}{\alpha}{\leq}1$) determined by power allocation between the two antennas at the source on the received signal performance. Through computer simulation, we show that the received signals at the three relays have same variance only when the value of $\alpha$ is equal to $\frac{2}{3}$, as a consequence, a better performance is obtained at the destination. These analysis results show that the proposed scheme outperforms conventional proposed schemes in terms of diversity gain, PEP and the complexity of relay nodes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.7
• /
• pp.2614-2632
• /
• 2015

A multiple symbol detection (MSD) algorithm is proposed relying on soft information for ultra-wideband systems, where differential space-time block code is employed. The proposed algorithm aims to calculate a posteriori probabilities (APP) of information symbols, where a forward and backward message passing mechanism is implemented based on the BCJR algorithm. Specifically, an MSD metric is analyzed and performed for serving the APP model. Furthermore, an autocorrelation sampling is employed to exploit signals dependencies among different symbols, where the observation window slides one symbol each time. With the aid of the bidirectional message passing mechanism and the proposed sampling approach, the proposed MSD algorithm achieves a better detection performance as compared with the existing MSD. In addition, when the proposed MSD is exploited in conjunction with channel decoding, an iterative soft-input soft-output MSD approach is obtained. Finally, simulations demonstrate that the proposed approaches improve detection performance significantly.