• No results found

Tree generated by the sphere decoder algorithm

Device discovery for D2D communication in in band cellular networks using sphere decoder like (SDL) algorithm

Device discovery for D2D communication in in band cellular networks using sphere decoder like (SDL) algorithm

... The device discovery is performed under a visually impaired situation such as channel information, location, and the number of devices. In this paper, centralized device discovery is chosen due to power consumption and ...

7

Rapid Prototyping of a Fixed-Throughput Sphere Decoder for MIMO Systems

Rapid Prototyping of a Fixed-Throughput Sphere Decoder for MIMO Systems

... It can be seen that the MATLAB performance of the FSD practically matches that of the SD (the degradation is only of 0.06 dB at a BER = 10 −3 ). In the case of the FPGA performance, a difference only appears for high ...

6

A Tree based Decoder for Neural Machine Translation

A Tree based Decoder for Neural Machine Translation

... Second, Fig. 5 shows a histogram of translations by the length difference between the generated out- put and the reference. This provides an explanation of the difficulty of using parse trees. Ideally, this ...

6

A Sphere Decoding Algorithm for MIMO

A Sphere Decoding Algorithm for MIMO

... Decoding, Sphere Decoding, Genetic Algorithm based Decoder are reach the performance of ML detectors, and potentially a great deal of computational cost can be ...

5

An Iterative SISO Improved Complex Sphere Detection and Decoder for Turbo-MIMO Systems

An Iterative SISO Improved Complex Sphere Detection and Decoder for Turbo-MIMO Systems

... complex sphere detection and decoder algorithm is proposed for signal detection in Turbo-MIMO ...complex sphere detection is concatenated with a SISO Log maximum a posteriori Turbo ...

12

Adaptive medial axis approximation for sphere tree construction

Adaptive medial axis approximation for sphere tree construction

... Additional Key Words and Phrases: Animation, Collision Handling, Object Approximation, Me- dial Axis Approximation, Simulation Level-of-Detail 1. INTRODUCTION Collision handling is a major bottleneck in any interactive ...

28

Successive interference cancellation aided sphere decoder for multi-input multi-output systems

Successive interference cancellation aided sphere decoder for multi-input multi-output systems

... novel sphere decoding algorithms for MIMO detection and iterative detection and decoding have been ...statistical tree pruning technique and SIC, first reaches the bottom layer and eliminates the candidates ...

17

Successive interference cancellation aided sphere decoder for multi input multi output systems

Successive interference cancellation aided sphere decoder for multi input multi output systems

... novel sphere decoding algorithms for MIMO detection and iterative detection and decoding have been ...statistical tree pruning technique and SIC, first reaches the bottom layer and eliminates the candidates ...

16

Efficient VLSI Implementation of Soft-input Soft-output Fixed-complexity Sphere Decoder

Efficient VLSI Implementation of Soft-input Soft-output Fixed-complexity Sphere Decoder

... channel decoder; Figure 7: Performance comparison among SESD, K-best SD and ...the tree traversal strategy of the two ...FSD algorithm is more efficient than the K-best ...

26

Near-Capacity Sphere Decoder Based Detection Schemes for MIMO Wireless Communication Systems

Near-Capacity Sphere Decoder Based Detection Schemes for MIMO Wireless Communication Systems

... the tree search is fixed or upper ...(LLL) algorithm will be utilised to orthogonalise the channel matrix to a new near orthogonal channel matrix ...LLL algorithm will be significantly decreased by ...

175

Massively Parallel Tree Search for High-Dimensional Sphere Decoders

Massively Parallel Tree Search for High-Dimensional Sphere Decoders

... tain the one-node-per-cycle processing rate, we introduce two distinct modules of similar functionality, the Horizontal Node Replacement Processor and the Vertical Node Replacement Processor (HNRP and VNRP, Fig. 5). They ...

17

Sphere tree construction using dynamic medial axis approximation

Sphere tree construction using dynamic medial axis approximation

... as sphere-trees. This paper presents a novel algorithm for the construction of ...The algorithm presented approximates objects, both convex and non-convex, with a higher degree of fit than existing ...

8

Pipeline structure Schnorr Euchner Sphere Decoding Algorithm

Pipeline structure Schnorr Euchner Sphere Decoding Algorithm

... Schnorr-Euchner sphere decoding algorithm in this ...search tree of the original algorithm into blocks and executes the search from block to ...

5

A new modified viterbo-boutros sphere decoding algorithm

A new modified viterbo-boutros sphere decoding algorithm

... ML decoder (which uses comprehensive search) must examine 16 K = 16 15 points in a real lattice to find the transmit ...VB sphere decoding multiuser detector reduces this number to about 70 points and in ...

6

Tree Matrix Algorithm of LDPC Codes

Tree Matrix Algorithm of LDPC Codes

... sum-product algorithm from ...LDPC decoder, because they affect the independence of the extrinsic information ex- changed in the iterative ...cut-node tree graph of LDPC code, and depicts it with ...

8

Classification with an improved Decision Tree Algorithm

Classification with an improved Decision Tree Algorithm

... Here in the proposed system, feature selection is made with genetic search. 20 populations are generated and among them one subset is selected which is having minimum attributes. These attributes are most relevant ...

6

A Survey on Decision Tree Algorithm for Classification

A Survey on Decision Tree Algorithm for Classification

... Decision tree algorithms, ID3, ...has generated an urgent need for new techniques and tools that can intelligently automatically transform the processed data into useful information and ...

5

Comparison of FP tree and Apriori Algorithm

Comparison of FP tree and Apriori Algorithm

... Lower C.P.U time: In the previous algorithms the time taken by the central processing unit was very large. This includes loading the data, performing various scans on this data and also then generating new data with ...

5

An Efficient Low Power Viterbi Decoder Design using T algorithm

An Efficient Low Power Viterbi Decoder Design using T algorithm

... digits generated by encoder in a time unit that time unit but also on the preceding n-1 blocks of message ...is generated by combining the outputs of a K-state shift register through the employment of EX-OR ...

6

A Novel Algorithm to Improve the Performance of the Decoder Without Affecting the Compression Ratio

A Novel Algorithm to Improve the Performance of the Decoder Without Affecting the Compression Ratio

... Dictionary-based code-compression techniques are popular because they provide both good CR and fast decompression mechanism. The basic idea is to take advantage of commonly occurring instruction sequences by using a ...

7

Show all 10000 documents...

Related subjects