Abstract: A computer implemented method for designing electrical circuitry is disclosed which comprises: (a) determining types and number of parameters to be optimized and their respective upper boundaries (UB) and lower boundaries (LB) in binary and/or decimal formats for such electrical circuitry using a CAD/CAE/EDA module of a quantum emulator computer; and (b) optimizing the parameters in qubit formats using a quantum evolution optimization module constrained by the upper and lower boundaries; the quantum emulator computer includes the CAD/CAE/EDA program and the quantum evolution optimization module.

Abstract: A semiconductor device that updates a weight coefficient used for arithmetic operation by an artificial neural network is provided. Each of the first to third memory cells draws a current corresponding to data of its retention node and changes the data in accordance with the potentials of first and second wirings. When a weight coefficient and first and second reference data are held in the retention nodes of the first to third memory cells, the first circuit supplies, to a third wiring, a constant currents drawn by the second and third memory cells. When input data is input to the first wiring, a difference current between the constant current and a current drawn by the first memory cell is changed, and the second circuit outputs arithmetic result data corresponding to the change. The third circuit inputs update data corresponding to the arithmetic result data to the second wiring.

Abstract: A system and method for providing time-series geospatial data and a world-scale simulation platform used to generate simulated-world environments by rendering data-dense geographical regions corresponding to heterogenous sourced data and formats for highly scalable parallel simulations, and comprised of a multi-dimensional time-series database used for enabling query support across multiple simulations via individual simulation and entity swimlanes for cyber, physical and cyber-physical entities and regions.

Abstract: A system for web-rendering data-dense geographical regions that correspond to heterogenous sourced data and formats for highly scalable parallel simulations, comprising a multi-dimensional time-series database enabling single-query support over all simulations via individual simulation swimlanes.

Abstract: A substitution box, SBox, circuit that performs an SBox computational step when comprised in cryptographic circuitry. The SBox circuit comprises: a first circuit part comprising digital circuitry that generates a 4-bit first output signal (Y) from an 8-bit input signal (U); a second circuit part, configured to operate in parallel with the first circuit part and to generate a 32-bit second output signal (L) from the 8-bit input signal (U), wherein the 32-bit second output signal (L) consists of four 8-bit sub-results; and a third circuit part configured to produce four preliminary 8-bit results (K) by scalar multiplying each of the four 8-bit sub-results by a respective one bit of the 4-bit first output signal (Y), and to produce an 8-bit output signal (R) by summing the four preliminary 8-bit results (K).

Abstract: Adder circuits and associated methods for processing a set of at least three floating-point numbers to be added together include identifying, from among the at least three numbers, at least two numbers that have the same sign—that is, at least two numbers that are both positive or both negative. The identified at least two numbers are added together using one or more same-sign floating-point adders. A same-sign floating-point adder comprises circuitry configured to add together floating-point numbers having the same sign and does not include circuitry configured to add together numbers having different signs.

Abstract: Disclosed are a data decoding method and apparatus, and a computer storage medium. The data decoding method includes: after Polar code data to be decoded is acquired, transmitting the Polar code data to be decoded to at least two pre-configured independent U value calculation modules, the U value calculation modules being configured to calculate a U value required at a next iteration of a G node; controlling the at least two independent U value calculation modules to process the Polar code data to be decoded to obtain at least two sets of new decode data; and, processing the at least two sets of new decode data to obtain new Polar code data to be decoded.

Abstract: Aspects of the disclosure provide a method and device performing input bit allocation that includes receiving broadcasting information bits, generating timing related bits for the broadcasting information bits, and selecting a portion of the generated timing related bits. The method and device can further include allocating each of the selected timing related bits to selected input bits of an encoder, so that each of the selected timing related bits is allocated to an input bit of the encoder corresponding to an available bit channel of the encoder where the selected inputs bits of the encoder correspond to encoded bits that are located in a front portion of the encoded bits.

Abstract: An apparatus and method for performing multiply-accumulate operations.

Abstract: An operation method of a receiving node may include performing a decoding operation for calculating first and second output transform values corresponding to first and second unit output nodes in each of a plurality of operation units constituting the polar decoder, based on first and second input transform values corresponding to first and second unit input nodes, and the decoding operation may include setting initial values of first and second variables for calculating the first output transform value; performing an iterative loop operation for updating the first and second variables; and calculating the first output transform value based on values of the first and second variables updated until a time when the iterative loop operation is terminated, wherein the iterative loop operation is terminated without performing iterations in which the first and second variables are determined not to be updated among a plurality of iterations.

Abstract: According to one embodiment, a calculating device includes a first memory, a second memory, a third memory, a first arithmetic module, a second arithmetic module, a first conductive line electrically connecting a first output terminal of the first memory and a first input terminal of the first arithmetic module, a second conductive line electrically connecting a second output terminal of the first memory and a first input terminal of the second arithmetic module, a third conductive line electrically connecting a first output terminal of the second memory and a second input terminal of the second arithmetic module, a fourth conductive line electrically connecting a first output terminal of the third memory and a third input terminal of the second arithmetic module, and a fifth conductive line electrically connecting a first output terminal of the second arithmetic module and a second input terminal of the first arithmetic module.

Abstract: Methods, systems, and devices for wireless communication are described for dynamic frozen bits of polar codes for early termination and performance improvement. A wireless device may receive a signal comprising a codeword encoded using a polar code. The wireless device may perform decoding of the codeword including at least: parity check of a first subset of decoding paths for making a decision on early termination of decoding of the codeword based on dynamic frozen bits, and generating path metrics for a second subset of the decoding paths that each pass the parity check based on the dynamic frozen bits, and performing error detection on a bit sequence corresponding to one of the second subset of the decoding paths based at part on error detection bits and the generated path metrics. The wireless device may process the information bits based on a result of the decoding.

Abstract: Herein described is a method of operating an accumulation process in a data processing apparatus. The accumulation process comprises a plurality of accumulations which output a respective plurality of accumulated values, each based on a stored value and a computed value generated by a data processing operation. The method comprises storing a first accumulated value, the first accumulated value being one of said plurality of accumulated values, into a first storage device comprising a plurality of single-bit storage elements; determining that a predetermined trigger has been satisfied with respect to the accumulation process; and in response to the determining, storing at least a portion of a second accumulated value, the second accumulated value being one of said plurality of accumulated values, into a second storage device.

Abstract: A switched mode power supply comprises a communication interface including an address terminal configured to couple to an external resistor for setting a communication address of the switched mode power supply. A control circuit is configured to determine the value of the external resistor a first time with a first technique and set the communication address of the switched mode power supply based on the value of the external resistor determined using the first technique if the value of the external resistor is greater than the threshold value. The control circuit is also configured to, if the value of the external resistor is less than the threshold value, determine the value of the external resistor a second time with a second technique and set the communication address of the switched mode power supply based on the value of the external resistor determined using the second technique.

Abstract: Methods and apparatus for piecewise addition into an accumulation register using one or more carry runway registers, where the accumulation register includes a first plurality of qubits with each qubit representing a respective bit of a first binary number and where each carry runway register includes multiple qubits representing a respective binary number. In one aspect, a method includes inserting the one or more carry runway registers into the accumulation register at respective predetermined qubit positions, respectively, of the accumulation register; initializing each qubit of each carry runway register in a plus state; applying one or more subtraction operations to the accumulation register, where each subtraction operation subtracts a state of a respective carry runway register from a corresponding portion of the accumulation register; and adding one or more input binary numbers into the accumulation register using piecewise addition.

Abstract: A spreadsheet application displays a spreadsheet of cells in tabular form. User input is received specifying an input range of cells of the spreadsheet, a destination range of cells of the spreadsheet and a local modification. A memory stores a representation of the spreadsheet indicating formatting, values and formulas. An update of the representation is computed by applying the local modifications to the representation. Values of cells of the input range of the spreadsheet are calculated by using the updated representation and the calculated values are displayed at the destination range.

Abstract: A codeword is generated based on a segmentation transform and a Polarization-Assisted Convolutional (PAC) code that includes an outer convolutional code and a polar code, and based on separate encoding of respective different segments of convolutionally encoded input bits according to the polar code. Each segment of the respective segments includes multiple bits of the convolutionally encoded input bits for which the separate encoding of the segment is independent of the separate encoding of other segments. Separate decoding may be applied to segments of such a codeword to decode convolutionally encoded input bits corresponding to the separately encoded segments of the convolutionally encoded input bits.

Abstract: Systems and methods for performing polar decoding using a transformation of the coded bits prior to polar decoding and an inverse transformation of the resulting data bits after polar decoding are disclosed. In some embodiments, a method of operation of a receiving node to perform polar decoding comprises transforming a received code bit vector yN in accordance with a transformation TN to thereby provide a transformed code bit vector Y?N=YNTN, performing polar decoding of the transformed code bit vector y?N to thereby provide a transformed data bit vector v?N, and inversely transforming the transformed data bit vector v?N in accordance with an inverse transformation TN?1 to thereby provide an estimated data bit vector vN=v?NTN?1. In some embodiments, the transformation TN re-orders coded bits in the coded bit vector yN such that some future frozen bit(s) are swapped in front of some information bit(s) prior to performing polar decoding.

Abstract: Some embodiments provide a method for a neural network inference circuit that executes a neural network including multiple nodes. The method loads a first set of weight values into a first set of weight value buffers, a second set of weight values into a second set of weight value buffers, a first set of input values into a first set of input value buffers, and a second set of input values into a second set of input value buffers. In a first clock cycle, the method computes a first dot product of the first set of weight values and the first set of input values. In a second clock cycle, the method computes a second dot product of the second set of weight values and the second set of input values. The method adds the first and second dot products to compute a dot product for the node.

Abstract: An apparatus and method for multiplying packed signed words. For example, one embodiment of a processor comprises: a decoder to decode a first instruction to generate a decoded instruction; a first source register to store a first plurality of packed signed words; a second source register to store a second plurality of packed signed words; execution circuitry to execute the decoded instruction, the execution circuitry comprising: multiplier circuitry to multiply each of a plurality of packed signed words from the first source register with corresponding packed signed words from the second source register to generate a plurality of products responsive to the decoded instruction, adder circuitry to add the products to generate a first result, and accumulation circuitry to combine the first result with an accumulated result to generate a final result comprising a third plurality of packed signed words, and to write the third plurality of packed signed words or a maximum value to a destination register.

Abstract: A mechanism is described for facilitating fast data operations and for facilitating a finite state machine for machine learning at autonomous machines. A method of embodiments, as described herein, includes detecting input data to be used in computational tasks by a computation component of a processor including a graphics processor. The method may further include determining one or more frequently-used data values (FDVs) from the data, and pushing the one or more frequent data values to bypass the computational tasks.

Abstract: Some embodiments provide a neural network inference circuit (NNIC) for implementing a neural network that includes multiple computation nodes at multiple layers. Each of a set of the computation nodes includes a dot product of input values and weight values. The NNIC includes multiple dot product core circuits for computing multiple partial dot products and a set of channel circuits connecting the core circuits. The set of channel circuits includes (i) a dot product bus for aggregating the partial dot products to compute dot products for computation nodes of the neural network, (ii) one or more post-processing circuits for performing additional computation operations on the dot products to compute outputs for the computation nodes, and (iii) an output bus for providing the computed outputs of the computation nodes to the core circuits for the core circuits to use as inputs for subsequent computation nodes.

Abstract: There is provided a method of recursive sequential list decoding of a codeword of a polar code comprising: obtaining an ordered sequence of constituent codes usable for the sequential decoding of the polar code, representable by a layered graph; generating a first candidate codeword (CCW) of a first constituent code, the first CCW being computed from an input model informative of a CCW of a second constituent code, the first constituent code and second constituent code being children of a third constituent code; using the first CCW and the second CCW to compute, by the decoder, a CCW of the third constituent code; using the CCW of the third constituent code to compute a group of symbol likelihoods indicating probabilities of symbols of a fourth (higher-layer) constituent code having been transmitted with a particular symbol value, and using the group of symbol likelihoods to decode the fourth constituent code.

Abstract: An integrated circuit including memory to store image data and filter weights, and a plurality of multiplier-accumulator execution pipelines, each multiplier-accumulator execution pipeline coupled to the memory to receive (i) image data and (ii) filter weights, wherein each multiplier-accumulator execution pipeline processes the image data, using associated filter weights, via a plurality of multiply and accumulate operations. In one embodiment, the multiplier-accumulator circuitry of each multiplier-accumulator execution pipeline, in operation, receives a different set of image data, each set including a plurality of image data, and, using filter weights associated with the received set of image data, processes the set of image data associated therewith, via performing a plurality of multiply and accumulate operations concurrently with the multiplier-accumulator circuitry of the other multiplier-accumulator execution pipelines, to generate output data.

Abstract: A coding method, a decoding method, an apparatus, and a device are provided. The method includes: coding, by a sending device, an information bit sequence to obtain a coded bit sequence, where the coded bit sequence includes an information bit, a frozen bit, a CRC check bit, and a frozen check bit; and a value of the frozen check bit and a value of the CRC check bit are obtained by using a same cyclic shift register; performing, by the sending device, polar coding and rate matching on the coded bit sequence to obtain a to-be-sent rate-matched sequence; and sending, by the sending device, the rate-matched sequence. According to the method, time and space for coding calculation and decoding calculation can be effectively reduced, and calculation complexity is reduced.

Abstract: In some embodiments, packed data elements of first and second packed data source operands are of a first, different size than a second size of packed data elements of a third packed data operand. Execution circuitry executes decoded single instruction to perform, for each packed data element position of a destination operand, a multiplication of a M N-sized packed data elements from the first and second packed data sources that correspond to a packed data element position of the third packed data source, add of results from these multiplications to a full-sized packed data element of a packed data element position of the third packed data source, and storage of the addition result in a packed data element position destination corresponding to the packed data element position of the third packed data source, wherein M is equal to the full-sized packed data element divided by N.

Abstract: Various embodiments provide for encoding and decoding control link information with polar codes where the frozen bits of the information block can be set to the device identification number instead of being set to null. The frozen bits can be identified based on the type of polar code being used, and while the non-frozen bits can be coded with the channel state information, the frozen bits can be coded with the device ID. In an example where there are more frozen bits than bits in the device ID, the most reliable of the frozen bits can be coded with the device ID. In another example, the frozen bits can be set to the CRC bits, which can then be masked by the device ID.

Abstract: A multi-addend adder circuit used for multi-addend addition in a polar representation in stochastic computing. The multi-addend adder circuit includes a buffer circuit and a computing circuit, where the buffer circuit is configured to store to-be-buffered data for at least one cycle and output buffer data, and the computing circuit is configured to process a plurality of pieces of bitstream data and the buffer data and output one piece of bitstream data and the to-be-buffered data, where the piece of output bitstream data is a quotient of dividing a sum of summation data and the buffer data by a scale-down coefficient, the output to-be-buffered data is a remainder of dividing a sum of all summation data until a current cycle by the scale-down coefficient, and the summation data is a quantity of bits whose values are 1 in the plurality of pieces of first bitstream data.

Abstract: A system and method to augment model-to-model coupling include obtaining an output signal fs from an upstream model. The method also includes obtaining an observation signal gob from a region of interest, extracting a high-frequency signal g from the observation signal gob using a linear operator, and providing to a downstream model the high-frequency signal g in addition to information based on the output signal fs from the upstream model. The downstream model is implemented to obtain a prediction or estimation of one or more parameters of interest or drive a mechanical process.

Abstract: An apparatus and method for performing dual concurrent multiplications, subtraction/addition, and accumulation of packed data elements.

Abstract: A programmable logic device (“PLD”) contains programmable digital signal processing (“DSP”) blocks operable to be selectively programmed to perform one or more logic functions. The PLD, in one embodiment, includes configurable logic blocks (“LBs”), an input and output (“I/O”) block, and programmable DSP blocks. The configurable LBs are able to be selectively programmed to perform one or more logic functions. The I/O block includes I/O ports for facilitating data transfer. The programmable DSP blocks are configured to perform various predefined logic functions. Each of the programmable DSP blocks, in one aspect, includes at least one configurable DSP which, in one embodiment, includes a 27×18 multiplier and a 12×12 multiplier.

Abstract: Embodiments of the present invention disclose a data processing method. The method includes: receiving, by an encoder, a to-be-encoded information block; encoding, by the encoder, the information block in a PC-Polar encoding when a channel coding parameter is in one value range, and/or encoding, by the encoder, the information block in a CA-Polar encoding when the channel coding parameter is in another value range; and outputting, by the encoder, a result of the encoding the information block.

Abstract: A high speed decoding algorithm that can decode all the information bits simultaneously at the same time, i.e., in parallel. The method of high speed decoding of polar codes includes the steps of transmitting data bits through a second part of communication channels, wherein a receiver is provided to set frozen bits as 0, apply Sc algorithm, and decode remaining bits in parallel.

Abstract: This disclosure describes techniques for processing data bits using pseudo-random deterministic bit-streams. In some examples, a device includes a pseudo-random bit-stream generator configured to generate bit combinations encoding first and second numerical values based on a proportion of the data bits in the sequence that are high relative to the total data bits in the sequence. The device also includes a stochastic computational unit configured to perform a computational operation on the bit combinations and produce an output bit-stream having a set of data bits indicating a result of the computational operation, wherein the data bits of the output bit-stream represent the result based on a probability that any data bit in the set of data bits of the output bit-stream is high.

Abstract: Embodiments of this application provide a polar code rate matching method and apparatus, and a communications apparatus. The rate matching method includes: determining N to-be-encoded bits, where the N to-be-encoded bits include N1 information bits, and both N1 and N are positive integers; encoding the N to-be-encoded bits to obtain N encoded bits; obtaining a first puncturing sequence based on an information bit length N1, the quantity N of the encoded bits, and a quantity Q of to-be-punctured bits; and performing a puncturing operation on the N encoded bits based on the first puncturing sequence to implement a rate matching. To-be-punctured bits indicated in the first puncturing sequence are obtained based on the information bit length N1, the quantity N of the encoded bits, and the quantity Q of the to-be-punctured bits, and are not generated randomly.

Abstract: A computer program product for implementing a received add program counter immediate shift (ADDPCIS) instruction using a micro-coded or cracked sequence is provided. The computer program product includes a computer readable storage medium having program instructions embodied therewith. The program instructions are readable and executable by a processing circuit to cause the processing circuit to recognize register operand and integer terms associated with the ADDPCIS instruction, set a value of a target register associated with the ADDPCIS instruction in accordance with the integer term summed with another term by obtaining a next instruction address (NIA), moving an architecturally defined register file from a first temporary register to a general purpose register and adding a shifted immediate constant to a value stored in a second temporary register.

Abstract: The disclosure relates to devices and methods implementing polar codes. For instance, the disclosure relates to an an encoder for encoding data, wherein the encoder comprises a processor configured to encode the data using a (n, k, d) parent polar code C into codewords c0n-1=u0n-1A subject to the constraints u0n-1VT=0, wherein u0n-1 denotes the data, wherein A = ( 1 0 1 1 ) ? m , wherein F?m denotes the m-times Kronecker product of the matrix F with itself and wherein the constraint matrix V comprises in addition to the constraint matrix V0 of the parent polar code the constraint matrix V1 of a first helper code C1 and the constraint matrix V2 of a second helper code C2.

Abstract: A computer program product for implementing a received add program counter immediate shift (ADDPCIS) instruction using a micro-coded or cracked sequence is provided. The computer program product includes a computer readable storage medium having program instructions embodied therewith. The program instructions are readable and executable by a processing circuit to cause the processing circuit to recognize register operand and integer terms associated with the ADDPCIS instruction, set a value of a target register associated with the ADDPCIS instruction in accordance with the integer term summed with another term by obtaining a next instruction address (NIA), moving an architecturally defined register file from a first temporary register to a general purpose register and adding a shifted immediate constant to a value stored in a second temporary register.

Abstract: A broadcast signal receiving apparatus comprises a tuner configured to be tuned to a locking frequency selected corresponding to a broadcast signal and receive the broadcast signal at the selected locking frequency; a communicator configured to perform wireless communication with an external apparatus through a plurality of channels different in a frequency band from each other; and a processor configured to control the communicator to perform the wireless communication through a channel having less interference between the selected locking frequency and the frequency band among the plurality of channels. According to an exemplary embodiment, the frequency interference with the wireless communication can be avoided in advance in terms of receiving the broadcast signal. Further, image quality can be guaranteed even when the wireless communication is used, in terms of receiving the broadcast signal.

Abstract: A processor includes: a plurality of processor cores; and an internal memory configured to be accessed from the plurality of processor cores, wherein an arithmetic circuit provided in any of the plurality of processor cores includes: a plurality of first registers provided in a first stage of the arithmetic circuit, a regular addition circuit including a first adder and a second register, the first adder being configured to add a plurality of outputs of the plurality of first registers, the second register being configured to be provided in a second stage and latch an output of the first adder, an overtaking addition circuit including a second adder, the second adder being configured to add a plurality of outputs of the plurality of first registers, and a synthesis circuit including a third adder and a third register.

Abstract: An apparatus and method for performing FIR filtering and blending operations.

Abstract: An arithmetic logic unit (ALU) including a first routing grid connected to multiple data lanes to drive first data to the data lanes. A second routing grid is connected to the data lanes to drive second data to the data lanes. Each of the data lanes include multiple, e.g. N, functional units with first inputs from the first routing grid and second inputs from the second routing grid. The functional units compute pairwise a function of the respective first data on the respective first inputs and the respective second data on the respective second inputs. Each of the data lanes include a reduction unit with inputs adapted to receive K? bits per word from the functional units. The reduction unit is configured to perform a reduction operation configured to output an output result having a reduced number J? bits per word, wherein J? is less than N multiplied by K?.

Abstract: An apparatus and method for performing a vector bit reversal and crossing. For example, one embodiment of a processor comprises: a first source vector register to store a first plurality of source bit groups, wherein a size for the bit groups is to be specified in an immediate of an instruction; a second source vector to store a second plurality of source bit groups; vector bit reversal and crossing logic to determine a bit group size from the immediate and to responsively reverse positions of contiguous bit groups within the first source vector register to generate a set of reversed bit groups, wherein the vector bit reversal and crossing logic is to additionally interleave the set of reversed bit groups with the second plurality of bit groups; and a destination vector register to store the reversed bit groups interleaved with the first plurality of bit groups.

Abstract: Method and apparatus for performing a shift and XOR operation. In one embodiment, an apparatus includes execution resources to execute a first instruction. In response to the first instruction, said execution resources perform a shift and XOR on at least one value.

Abstract: Aspects of the disclosure relate to polar coding. A polar codeword may be generated by sorting a plurality of synthetic channels utilized for transmission of the polar codeword over an air interface in order of reliability utilizing a convex combination of the mutual information calculated for each synthetic channel based on an Additive White Gaussian Noise (AWGN) channel and the mutual information calculated for each synthetic channel based on a binary erasure channel. A polar codeword may further be generated by sorting the plurality of synthetic channels in order of reliability utilizing cumulative sums calculated for each synthetic channel. Each cumulative sum may be calculated from a binary representation of a position of the synthetic channel within the plurality of synthetic channels.

Abstract: An integrated circuit including a data architecture including N adders and N multipliers configured to receive operands. The data architecture receives instructions for selecting a data flow between the N multipliers and the N adders of the data architecture. The selected data flow includes the options: (1) a first data flow using the N multipliers and the N adders to provide a multiply-accumulate mode and (2) a second data flow to provide a multiply-reduce mode.

Abstract: A system monitors a batch process performed locally or remotely by reading output logs of the batch process during and after execution of the batch process. The system determines a baseline execution duration for the batch process based on previous runs of the batch process on a set of data. Subsequent runs of the batch process are monitored by reading an output log file while the batch process is executing. A buffer time, corresponding to a time range, is added to the baseline execution duration to produce an alert threshold. The system generates alerts and sends the alerts to a messaging system in response to the current execution duration exceeding the alert time.

Abstract: Methods, systems, and devices that support an efficient sequence-based polar code description are described. In some cases, a wireless device (e.g., a user equipment (UE) or a base station) may transmit a codeword including a set of information bits encoded using a polar code or receive a codeword including a set of information bits encoded using a polar code. As described herein, the wireless device may determine the bit locations of the information bits in the polar code based on a partition assignment vector. Specifically, the wireless device may partition bit-channels for one or more stages of polarization and assign information bits to partitions based on the partition assignment vector. Once the bit locations of the information bits are determined, the wireless device may decode a received codeword or transmit an encoded codeword based on the determined bit locations of the information bits.

Abstract: A specialized processing block on an integrated circuit includes a first and second arithmetic operator stage, an output coupled to another specialized processing block, and configurable interconnect circuitry which may be configured to route signals throughout the specialized processing block, including in and out of the first and second arithmetic operator stages. The configurable interconnect circuitry may further include multiplexer circuitry to route selected signals. The output of the specialized processing block that is coupled to another specialized processing block together with the configurable interconnect circuitry reduces the need to use resources outside the specialized processing block when implementing mathematical functions that require the use of more than one specialized processing block. An example for such mathematical functions include the implementation of scaled product sum operations and the implementation of Horner's rule.

Abstract: An automatic environment provisioning system receives a user request for auto provisioning of a development environment and automatically creates an environment per the user's request on a cloud platform. The user's request includes a selection of a technology platform on which to create the environment in addition to other system requirements. The user's input for generating the environment including the selection of a technology platform is employed for generating a template. The template can reference individual identifiers of various images corresponding to the software resources associated with the user's selected technology platform. The template enables instantiating the images with identifiers associated with the user-selected technology platform in order to enable creating the auto-provisioned environment. One or more users can be provided access to the auto-provisioned environment to of develop, test and/or implement the solution.