Parallel concatenated spa ce time trellis code modulation, called Turbo STCM, can efficiently increase the coding gains of the space time codes. However, the complexity of the iterat iv e decoding restricts its ap...Parallel concatenated spa ce time trellis code modulation, called Turbo STCM, can efficiently increase the coding gains of the space time codes. However, the complexity of the iterat iv e decoding restricts its application. This paper introduces a lower complex deco ding algorithm based on soft output Viterbi algorithm (SOVA) for Turbo STCM. S imulational results show that the new SOVA algorithm for the Turbo STCM outperf orms the original space time trellis code (STTC) by 4~6 dB. At the same time, compared with the Max Log MAP (maximum a posteriori) algorithm, the new scheme requires a lower complexity and approaches the performance of Turbo STCM decod ing w ith Max Log MAP.展开更多
Use of compressed mesh in parallel rendering architecture is still an unexplored area, the main challenge of which is to partition and sort the encoded mesh in compression-domain. This paper presents a mesh compressio...Use of compressed mesh in parallel rendering architecture is still an unexplored area, the main challenge of which is to partition and sort the encoded mesh in compression-domain. This paper presents a mesh compression scheme PRMC (Parallel Rendering based Mesh Compression) supplying encoded meshes that can be partitioned and sorted in parallel rendering system even in encoded-domain. First, we segment the mesh into submeshes and clip the submeshes’ boundary into Runs, and then piecewise compress the submeshes and Runs respectively. With the help of several auxiliary index tables, compressed submeshes and Runs can serve as rendering primitives in parallel rendering system. Based on PRMC, we design and implement a parallel rendering architecture. Compared with uncompressed representation, experimental results showed that PRMC meshes applied in cluster parallel rendering system can dramatically reduce the communication requirement.展开更多
In this paper,we propose a novel iterative scheme for exploiting transmit diversity using parallel independent Inter-Symbol Interference (ISI) channels. In this adaptive iterative scheme,we use EXtrinsic Information T...In this paper,we propose a novel iterative scheme for exploiting transmit diversity using parallel independent Inter-Symbol Interference (ISI) channels. In this adaptive iterative scheme,we use EXtrinsic Information Transfer (EXIT) chart tool to choose appropriate iterative method from Itera-tive Combining (IC),used as parallel concatenation turbo-like scheme,and Turbo Equalization (TE),used as serial concatenation turbo-like scheme. It is show that the proposed iterative scheme provides excellent performance both analytically and through simulations without any compute complexity increase comparable to IC.展开更多
The decomposition method was successfully used in solving of 3D problems with complex geometry shape in electron optics for the FDM （Finite Difference Method） and FEM （Finite Element Method） mostly to implement fa...The decomposition method was successfully used in solving of 3D problems with complex geometry shape in electron optics for the FDM （Finite Difference Method） and FEM （Finite Element Method） mostly to implement fast and robust parallel algorithms and computer codes. We suggest a new version of similar approach for the BEM （Boundary Element Method） based on the alternating method by Schwartz. This approach substantially reduce the dimension of dense global matrix of algebraic system produced by BEM algorithm to solve a complex problem on as single CPU （Central Processor Unit） desktop computer. New algorithm is iterative one, but exponential convergence for the Schwatlz＇s algorithm creates the fast numerical procedures. We describe the results of numerical simulation for a multi electrode ion transport system. The algorithms were implemented in the computer code ＂POISSON-3＂.展开更多
文摘Parallel concatenated spa ce time trellis code modulation, called Turbo STCM, can efficiently increase the coding gains of the space time codes. However, the complexity of the iterat iv e decoding restricts its application. This paper introduces a lower complex deco ding algorithm based on soft output Viterbi algorithm (SOVA) for Turbo STCM. S imulational results show that the new SOVA algorithm for the Turbo STCM outperf orms the original space time trellis code (STTC) by 4~6 dB. At the same time, compared with the Max Log MAP (maximum a posteriori) algorithm, the new scheme requires a lower complexity and approaches the performance of Turbo STCM decod ing w ith Max Log MAP.
基金Project supported by the National Basic Research Program (973) of China (No. 2002CB312105), the National Natural Science Founda-tion of China (No. 60573074), the Natural Science Foundation of Shanxi Province, China (No. 20041040), Shanxi Foundation of Tackling Key Problem in Science and Technology (No. 051129), and Key NSFC Project of "Digital Olympic Museum" (No. 60533080), China
文摘Use of compressed mesh in parallel rendering architecture is still an unexplored area, the main challenge of which is to partition and sort the encoded mesh in compression-domain. This paper presents a mesh compression scheme PRMC (Parallel Rendering based Mesh Compression) supplying encoded meshes that can be partitioned and sorted in parallel rendering system even in encoded-domain. First, we segment the mesh into submeshes and clip the submeshes’ boundary into Runs, and then piecewise compress the submeshes and Runs respectively. With the help of several auxiliary index tables, compressed submeshes and Runs can serve as rendering primitives in parallel rendering system. Based on PRMC, we design and implement a parallel rendering architecture. Compared with uncompressed representation, experimental results showed that PRMC meshes applied in cluster parallel rendering system can dramatically reduce the communication requirement.
基金Supported by the National Natural Science Foundation of China (No.60372030)China Ministry of Education Foundation for Visiting Scholar (No.[2003]406)Key Project of Provincial Scientific Foundation of Shandong (No.Z2003G02).
文摘In this paper,we propose a novel iterative scheme for exploiting transmit diversity using parallel independent Inter-Symbol Interference (ISI) channels. In this adaptive iterative scheme,we use EXtrinsic Information Transfer (EXIT) chart tool to choose appropriate iterative method from Itera-tive Combining (IC),used as parallel concatenation turbo-like scheme,and Turbo Equalization (TE),used as serial concatenation turbo-like scheme. It is show that the proposed iterative scheme provides excellent performance both analytically and through simulations without any compute complexity increase comparable to IC.
文摘The decomposition method was successfully used in solving of 3D problems with complex geometry shape in electron optics for the FDM （Finite Difference Method） and FEM （Finite Element Method） mostly to implement fast and robust parallel algorithms and computer codes. We suggest a new version of similar approach for the BEM （Boundary Element Method） based on the alternating method by Schwartz. This approach substantially reduce the dimension of dense global matrix of algebraic system produced by BEM algorithm to solve a complex problem on as single CPU （Central Processor Unit） desktop computer. New algorithm is iterative one, but exponential convergence for the Schwatlz＇s algorithm creates the fast numerical procedures. We describe the results of numerical simulation for a multi electrode ion transport system. The algorithms were implemented in the computer code ＂POISSON-3＂.
